Monadic parser combinators
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 al...
| Main Authors: | , |
|---|---|
| Format: | Monograph |
| Language: | English |
| Published: |
School of Computer Science and IT
1996
|
| Online Access: | http://eprints.nottingham.ac.uk/237/ http://eprints.nottingham.ac.uk/237/ http://eprints.nottingham.ac.uk/237/1/monparsing.pdf |