{'fraction_non_alphanumeric': 0.025380710659898477, 'fraction_numerical': 0.028764805414551606, 'mean_word_length': 5.231578947368421, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Efficient and Comfortable Error Recovery in Recursive Descent Parsers

This paper describes the interesting features of the recursive descent parser generator Ell from the user’s point of view. Some of the interesting implementation aspects are discussed. The generated parsers are extremely fast and run at speed of 55,000 tokens per second or 900,000 lines per minute on a MC 68020 processor. The outstanding features of Ell are the L-attribution mechanism, its ability to handle non LL(1) grammars, and its comfortable error handling, which includes error reporting, recovery, and repair.