Combinator Parsers: From Toys to Tools
S. Doaitse Swierstra · Electronic Notes in Theoretical Computer Science · 2001
We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left recursive. Extensive use is made of lazy evaluation, and the parsers constructed “analyze themselves”. Our new combinators may be used for the construction of large parsers to be used in compilers in practical use.