Monadic Parser Combinators

In this talk I'll explain how to build a Monadic Parser Combinator library (like Haskell's Parsec http://www.haskell.org/haskellwiki/Parsec) for defining recursive descent parsers declaratively. We'll see how can we make parsers first-class citizens of the language and use higher-order combinators for building new parsers out of existing ones.

We'll end up with an embedded DSL for defining parsers and see how can we use monads to tackle real programming problems.

I'd like to give the talk in English.