- newtype Parser s t a = P (s -> [t] -> (Either String a, s, [t]))
- runParser :: Parser s t a -> s -> [t] -> (a, s, [t])
- next :: Parser s t t
- satisfy :: (t -> Bool) -> Parser s t t
- stUpdate :: (s -> s) -> Parser s t ()
- stQuery :: (s -> a) -> Parser s t a
- stGet :: Parser s t s
- reparse :: [t] -> Parser s t ()
- module Text.ParserCombinators.Poly.Base
The Parser datatype.
Parsers do not return explicit failure. An exception is raised instead. This allows partial results to be returned before a full parse is complete.
The Parser
datatype is a fairly generic parsing monad with error
reporting and a running state. It can be used for arbitrary token
types, not just String input.
runParser :: Parser s t a -> s -> [t] -> (a, s, [t])Source
Apply a parser to an initial state and input token sequence. The parser cannot return an error value explicitly, so errors raise an exception. Thus, results can be partial (lazily constructed, but containing undefined).
Combinators:
Primitives
State-handling
Re-parsing
reparse :: [t] -> Parser s t ()Source
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.