|
| Text.ParserCombinators.Poly.StateLazy |
|
|
|
|
|
| Synopsis |
|
|
|
|
| The Parser datatype
|
|
|
| This Parser datatype is a fairly generic parsing monad with error
reporting. It can be used for arbitrary token types, not just
String input. (If you require a running state, use module PolyState
instead)
| | Constructors | | P (s -> [t] -> Result [t] s a) | |
| Instances | |
|
|
|
| A return type like Either, that distinguishes not only between
right and wrong answers, but also has gradations of wrongness.
This should only be used for writing very primitive
parsers - really it is an internal detail of the library.
| | Constructors | | Success z s a | | | Failure z s String | | | Committed (Result z s a) | |
| Instances | |
|
|
|
| Apply a parser to an input token sequence.
|
|
| basic parsers
|
|
|
|
|
|
|
|
| State-handling
|
|
|
| Update the internal state.
|
|
|
| Query the internal state.
|
|
|
| Deliver the entire internal state.
|
|
| re-parsing
|
|
|
| Push some tokens back onto the front of the input stream and reparse.
This is useful e.g. for recursively expanding macros. When the
user-parser recognises a macro use, it can lookup the macro
expansion from the parse state, lex it, and then stuff the
lexed expansion back down into the parser.
|
|
| Re-export all more general combinators
|
|
| module Text.ParserCombinators.Poly.Base |
|
| Produced by Haddock version 0.8 |