Text.Grampa.PEG.Backtrack

Backtracking parser for Parsing Expression Grammars

Documentation

newtype Parser g s r

Parser type for Parsing Expression Grammars that uses a backtracking algorithm, fast for grammars in LL(1) class but with potentially exponential performance for longer ambiguous prefixes.

Constructors

Parser

Fields

• applyParser :: s -> Result g s r

Instances

MultiParsing Parser

Backtracking PEG parser

parseComplete :: (Rank2.Functor g, FactorialMonoid s) =>
                 g (Backtrack.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 :: 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)

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

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

FactorialMonoid s => 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]

FactorialMonoid s => MonadPlus (Parser g s)

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)

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)

Methods

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

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

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)

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)

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)

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 ResultFunctor Parser

type ResultFunctor Parser = ParseResults

type GrammarConstraint Parser g

type GrammarConstraint Parser g = Functor * g

data Result (g :: (* -> *) -> *) s v

Constructors

Parsed

Fields

• parsedPrefix :: !v
• parsedSuffix :: !s

NoParse FailureInfo

Instances

Functor (Result g s)

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)

Methods

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

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

alt :: Parser g s a -> Parser g s a -> Parser g s a

A named and unconstrained version of the <|> operator