Lecture 29: Monadic Parser Combinators.

We give an introduction to parsing in general, and to monadic parser combinators in particular. We study how to build quickly, and efficiently elegant parsers in Haskell.

As example, we present a small parser for expressions. For the source code, see parser.hs.

Further Reading:

Previous lecture: Lecture 28
Next lecture: Lecture 30