Haskell/Monadic parser combinators

Monadic parser combinators (Solutions)

Monads

Prologue: IO, an applicative functor
Understanding monads
Maybe
List
do notation
IO
State
Alternative and MonadPlus
Monad transformers

edit this chapter

Monads provide a clean means of embedding a domain specific parsing language directly into Haskell without the need for external tools or code generators.

To do:
write the page! In the meantime, here is a paper to read and a practical chapter on Parsing Monads in Haskell from this wikibook to get you started.

Functional Pearls: Monadic Parsing in Haskell

Practical Monads: Parsing Monads which shows an example using Parsec, a popular, efficient monadic recursive descent parser library

Monadic parser combinators

Solutions to exercises

Monads

Prologue: IO, an applicative functor >> Understanding monads >> Maybe >> List >> do notation >> IO >> State >> Alternative and MonadPlus >> Monad transformers

edit this chapter

Haskell

Haskell Basics >> Elementary Haskell >> Intermediate Haskell >> Monads
Advanced Haskell >> Fun with Types >> Wider Theory >> Haskell Performance

Libraries Reference >> General Practices >> Specialised Tasks

edit book structure