|
Text.ParserCombinators.Parsec.Prim | Portability | portable | Stability | provisional | Maintainer | daan@cs.uu.nl |
|
|
|
Description |
The primitive parser combinators.
|
|
Synopsis |
|
|
|
Documentation |
|
|
|
|
|
|
|
|
Instances | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The most primitive token recogniser. The expression tokenPrimEx show nextpos mbnextstate test,
recognises tokens when test returns Just x (and returns the value x). Tokens are shown in
error messages using show. The position is calculated using nextpos, and finally, mbnextstate,
can hold a function that updates the user state on every token recognised (nice to count tokens :-).
The function is packed into a Maybe type for performance reasons.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Constructors | State | | stateInput :: [tok] | | statePos :: !SourcePos | | stateUser :: !st | |
|
|
|
|
|
|
|
|
Produced by Haddock version 0.9 |