Abstract
In an informal way the 'list of successes' method for writing parsers using a lazy functional language (Gofer) is described. The library of higher-order functions (known as 'parser combinators') that is developed is used for writing parsers for nested parentheses and operator expressions with an arbitrary number of priorities. The method is applied on itself to write a parser for grammars, that yields a parser for the language of the grammar. In the text exercises are provided, the solutions of which are given at the end of the article.
Cite
CITATION STYLE
Fokker, J. (1995). Functional parsers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 925, pp. 1–23). Springer Verlag. https://doi.org/10.1007/3-540-59451-5_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
