2001/08/01 by S. Doaitse Swierstra · 1 citation
Computer Science · #Logic, programming, and type systems #Formal Methods in Verification #Natural Language Processing Techniques #Combinatory logic #Computer science #Parsing #LR parser #Programming language #Compiler #Parser combinator #Grammar #Set (abstract data type) #Top-down parsing #Natural language processing #Linguistics
paper · pdf · doi:10.1016/s1571-0661(05)80545-6
openalex publication_date 2001/08/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/02
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.