Text.Grampa.PEG.Packrat

Packrat parser

Documentation

newtype 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.

Constructors

Parser

Fields

• applyParser :: [(s, g (Result g s))] -> Result g s r

Instances

GrammarParsing Parser

Defined in Text.Grampa.PEG.Packrat

Associated Types

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

Methods

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

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

fixGrammar :: (GrammarConstraint Parser g, 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

Defined in Text.Grampa.PEG.Packrat

Associated Types

type ResultFunctor Parser :: Type -> Type

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)

Defined in Text.Grampa.PEG.Packrat

Methods

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

getInput :: FactorialMonoid s => Parser g s s

anyToken :: FactorialMonoid s => Parser g s s

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

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

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

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

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

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

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

Monad (Parser g s)

Defined in Text.Grampa.PEG.Packrat

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)

Defined in Text.Grampa.PEG.Packrat

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)

Defined in Text.Grampa.PEG.Packrat

Methods

pure :: a -> Parser g s a

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

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

(*>) :: 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)

Defined in Text.Grampa.PEG.Packrat

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)

Defined in Text.Grampa.PEG.Packrat

Methods

mzero :: Parser g s a

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

(Lexical g, LexicalConstraint Parser g s, Show s, TextualMonoid s) => TokenParsing (Parser g s)

Defined in Text.Grampa.PEG.Packrat

Methods

someSpace :: Parser g s ()

nesting :: Parser g s a -> Parser g s a

semi :: Parser g s Char

highlight :: Highlight -> Parser g s a -> Parser g s a

token :: Parser g s a -> Parser g s a

FactorialMonoid s => LookAheadParsing (Parser g s)

Defined in Text.Grampa.PEG.Packrat

Methods

lookAhead :: Parser g s a -> Parser g s a

(Show s, TextualMonoid s) => CharParsing (Parser g s)

Defined in Text.Grampa.PEG.Packrat

Methods

satisfy :: (Char -> Bool) -> Parser g s Char

char :: Char -> Parser g s Char

notChar :: Char -> Parser g s Char

anyChar :: Parser g s Char

string :: String -> Parser g s String

text :: Text -> Parser g s Text

FactorialMonoid s => Parsing (Parser g s)

Defined in Text.Grampa.PEG.Packrat

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 ()

Semigroup x => Semigroup (Parser g s x)

Defined in Text.Grampa.PEG.Packrat

Methods

(<>) :: Parser g s x -> Parser g s x -> Parser g s x

sconcat :: NonEmpty (Parser g s x) -> Parser g s x

stimes :: Integral b => b -> Parser g s x -> Parser g s x

Monoid x => Monoid (Parser g s x)

Defined in Text.Grampa.PEG.Packrat

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

Defined in Text.Grampa.PEG.Packrat

type GrammarFunctor Parser = Result

type ResultFunctor Parser

Defined in Text.Grampa.PEG.Packrat

type ResultFunctor Parser = ParseResults

type GrammarConstraint Parser g

Defined in Text.Grampa.PEG.Packrat

type GrammarConstraint Parser g = Functor g

data Result g s v

Constructors

Parsed

Fields

• parsedPrefix :: !v
• parsedSuffix :: ![(s, g (Result g s))]

NoParse FailureInfo

Instances

Functor (Result g s)

Defined in Text.Grampa.PEG.Packrat

Methods

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

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

Show1 (Result g s)

Defined in Text.Grampa.PEG.Packrat

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Result g s a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Result g s a] -> ShowS