polyparse Source code Contents Index

Text.ParserCombinators.Poly.Plain

Contents The Parser datatype basic parsers re-parsing Re-export all more general combinators

Synopsis

newtype Parser t a = P ([t] -> (EitherE String a, [t])) runParser :: Parser t a -> [t] -> (Either String a, [t]) next :: Parser t t satisfy :: (t -> Bool) -> Parser t t reparse :: [t] -> Parser t () module Text.ParserCombinators.Poly.Base

The Parser datatype

newtype Parser t a Source

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 ([t] -> (EitherE String a, [t])) Instances Functor (Parser t) Monad (Parser t) PolyParse (Parser t)

runParser :: Parser t a -> [t] -> (Either String a, [t]) Source

Apply a parser to an input token sequence.

basic parsers

next :: Parser t t Source

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

re-parsing

reparse :: [t] -> Parser 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