|
Text.ParserCombinators.HuttonMeijer | Portability | All
A LIBRARY OF MONADIC PARSER COMBINATORS
29th July 1996
Graham Hutton Erik Meijer
University of Nottingham University of Utrecht | Stability | Stable | Maintainer | Malcolm Wallace <Malcolm.Wallace@cs.york.ac.uk> |
|
|
|
Description |
This Haskell script defines a library of parser combinators, and is
taken from sections 1-6 of our article Monadic Parser Combinators.
Some changes to the library have been made in the move from Gofer
to Haskell:
- Do notation is used in place of monad comprehension notation;
- The parser datatype is defined using newtype, to avoid the overhead
of tagging and untagging parsers with the P constructor.
|
|
Synopsis |
|
|
|
Documentation |
|
|
The parser monad
| Constructors | P ([Token] -> [(a, [Token])]) | |
| Instances | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Produced by Haddock version 2.4.2 |