Text.ParserCombinators.Poly.StateLazy

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.

Constructors

P (s -> [t] -> (Either String a, s, [t]))

Instances

Functor (Parser s t)

Monad (Parser s t)

PolyParse (Parser s t)

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

next :: Parser s t t

Source

Yield one token.

satisfy :: (t -> Bool) -> Parser s t t

Source

Yield one token if it satisfies a predicate.

State-handling

stUpdate :: (s -> s) -> Parser s t ()

Source

Update the internal state.

stQuery :: (s -> a) -> Parser s t a

Source

Query the internal state.

stGet :: Parser s t s

Source

Deliver the entire internal state.

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.

Re-export all more general combinators

module Text.ParserCombinators.Poly.Base

Produced by Haddock version 0.8