Work

Monadic parser combinators

Year: 1996
Type: book
Abstract: In functional programming, a popular approach to building recursive descent parsers is to model parsers as functions, and to define higher-order functions (or combinators) that implement grammar constructions such as sequencing, choice, and repetition. Such parsers form an instance of a monad, an algebraic structure from mathematics that has proved useful for addressing a number of computational problems. The purpose of this article is to provide a step-by-step tutorial on the monadic approach to building functional parsers, and to explain some of the benefits that result from exploiting monads. No prior knowledge of parser combinators or of monads is assumed. Indeed, this article can also be viewed as a first introduction to the use of monads in programming.
Language: English
Subfield: Software
Open Access status: green
OpenAlex ID: W1490215723
FWCI: 2.253
Cites: 22
Cited by: 122
Related to: 10