2001•Electronic Notes in Theoretical Computer ScienceOpen access

Combinator Parsers: From Toys to Tools

S. Doaitse Swierstra

Abstract

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.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 37 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Combinatory logic, Computer science, Parsing, LR parser, Programming language, Compiler, Parser combinator, Grammar