Text.Grampa.PEG.Packrat

Packrat parser

Documentation

data Parser g s r

Parser type for Parsing Expression Grammars that uses an improved packrat algorithm, with O(1) performance bounds but with worse constants and more memory consumption than Parser. The parse function returns an input prefix parse paired with the remaining input suffix.

Instances

GrammarParsing Parser

Associated Types

type GrammarFunctor (Parser :: ((* -> *) -> *) -> * -> * -> *) :: ((* -> *) -> *) -> * -> * -> *

Methods

nonTerminal :: (g (GrammarFunctor Parser g s) -> GrammarFunctor Parser g s a) -> Parser g s a

selfReferring :: Distributive g => g (Parser g s)

fixGrammar :: Distributive g => (g (Parser g s) -> g (Parser g s)) -> g (Parser g s)

recursive :: Parser g s a -> Parser g s a

MultiParsing Parser

Packrat parser

parseComplete :: (Rank2.Functor g, FactorialMonoid s) =>
                 g (Packrat.Parser g s) -> s -> g ParseResults

Associated Types

type ResultFunctor (Parser :: ((* -> *) -> *) -> * -> * -> *) :: * -> *

type GrammarConstraint (Parser :: ((* -> *) -> *) -> * -> * -> *) (g :: (* -> *) -> *) :: Constraint

Methods

parseComplete :: (GrammarConstraint Parser g, FactorialMonoid s) => g (Parser g s) -> s -> g (ResultFunctor Parser)

parsePrefix :: (GrammarConstraint Parser g, FactorialMonoid s) => g (Parser g s) -> s -> g (Compose * * (ResultFunctor Parser) ((,) s))

MonoidParsing (Parser g)

Methods

endOfInput :: FactorialMonoid s => Parser g s ()

getInput :: MonoidNull s => Parser g s s

anyToken :: FactorialMonoid s => Parser g s s

token :: (Eq s, FactorialMonoid s) => s -> Parser g s s

satisfy :: FactorialMonoid s => (s -> Bool) -> Parser g s s

satisfyChar :: TextualMonoid s => (Char -> Bool) -> Parser g s Char

scan :: FactorialMonoid t => s -> (s -> t -> Maybe s) -> Parser g t t

scanChars :: TextualMonoid t => s -> (s -> Char -> Maybe s) -> Parser g t t

string :: (FactorialMonoid s, LeftReductiveMonoid s, Show s) => s -> Parser g s s

takeWhile :: FactorialMonoid s => (s -> Bool) -> Parser g s s

takeWhile1 :: FactorialMonoid s => (s -> Bool) -> Parser g s s

takeCharsWhile :: TextualMonoid s => (Char -> Bool) -> Parser g s s

takeCharsWhile1 :: TextualMonoid s => (Char -> Bool) -> Parser g s s

whiteSpace :: TextualMonoid s => Parser g s ()

concatMany :: Monoid a => Parser g s a -> Parser g s a

Monad (Parser g s)

Methods

(>>=) :: Parser g s a -> (a -> Parser g s b) -> Parser g s b

(>>) :: Parser g s a -> Parser g s b -> Parser g s b

return :: a -> Parser g s a

fail :: String -> Parser g s a

Functor (Parser g s)

Methods

fmap :: (a -> b) -> Parser g s a -> Parser g s b

(<$) :: a -> Parser g s b -> Parser g s a

Applicative (Parser g s)

Methods

pure :: a -> Parser g s a

(<*>) :: Parser g s (a -> b) -> Parser g s a -> Parser g s b

(*>) :: Parser g s a -> Parser g s b -> Parser g s b

(<*) :: Parser g s a -> Parser g s b -> Parser g s a

Alternative (Parser g s)

Methods

empty :: Parser g s a

(<|>) :: Parser g s a -> Parser g s a -> Parser g s a

some :: Parser g s a -> Parser g s [a]

many :: Parser g s a -> Parser g s [a]

MonadPlus (Parser g s)

Methods

mzero :: Parser g s a

mplus :: Parser g s a -> Parser g s a -> Parser g s a

FactorialMonoid s => Parsing (Parser g s)

Methods

try :: Parser g s a -> Parser g s a

(<?>) :: Parser g s a -> String -> Parser g s a

skipMany :: Parser g s a -> Parser g s ()

skipSome :: Parser g s a -> Parser g s ()

unexpected :: String -> Parser g s a

eof :: Parser g s ()

notFollowedBy :: Show a => Parser g s a -> Parser g s ()

Monoid x => Monoid (Parser g s x)

Methods

mempty :: Parser g s x

mappend :: Parser g s x -> Parser g s x -> Parser g s x

mconcat :: [Parser g s x] -> Parser g s x

type GrammarFunctor Parser

type GrammarFunctor Parser

type ResultFunctor Parser

type ResultFunctor Parser = ParseResults

type GrammarConstraint Parser g

type GrammarConstraint Parser g = Functor g