Safe Haskell	None
Language	Haskell2010

Text.Grampa.PEG.Backtrack

Description

Backtracking parser for Parsing Expression Grammars

Synopsis

Documentation

newtype Parser g s r Source #

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 Source #	Backtracking PEG parser `parseComplete` :: (Rank2.`Functor` g, `FactorialMonoid` s) => g (Backtrack.`Parser` g s) -> s -> g `ParseResults`
Associated Types type ResultFunctor (Parser :: ((* -> ) -> ) -> * -> * -> ) :: -> * Source # type GrammarConstraint (Parser :: ((* -> ) -> ) -> * -> * -> ) (g :: ( -> ) -> ) :: Constraint Source # Methods parseComplete :: (GrammarConstraint Parser g, FactorialMonoid s) => g (Parser g s) -> s -> g (ResultFunctor Parser) Source # parsePrefix :: (GrammarConstraint Parser g, FactorialMonoid s) => g (Parser g s) -> s -> g (Compose * * (ResultFunctor Parser) ((,) s)) Source #
MonoidParsing (Parser g) Source #
Methods endOfInput :: FactorialMonoid s => Parser g s () Source # getInput :: FactorialMonoid s => Parser g s s Source # anyToken :: FactorialMonoid s => Parser g s s Source # token :: (Eq s, FactorialMonoid s) => s -> Parser g s s Source # satisfy :: FactorialMonoid s => (s -> Bool) -> Parser g s s Source # satisfyChar :: TextualMonoid s => (Char -> Bool) -> Parser g s Char Source # satisfyCharInput :: TextualMonoid s => (Char -> Bool) -> Parser g s s Source # notSatisfy :: FactorialMonoid s => (s -> Bool) -> Parser g s () Source # notSatisfyChar :: TextualMonoid s => (Char -> Bool) -> Parser g s () Source # scan :: FactorialMonoid t => s -> (s -> t -> Maybe s) -> Parser g t t Source # scanChars :: TextualMonoid t => s -> (s -> Char -> Maybe s) -> Parser g t t Source # string :: (FactorialMonoid s, LeftReductiveMonoid s, Show s) => s -> Parser g s s Source # takeWhile :: FactorialMonoid s => (s -> Bool) -> Parser g s s Source # takeWhile1 :: FactorialMonoid s => (s -> Bool) -> Parser g s s Source # takeCharsWhile :: TextualMonoid s => (Char -> Bool) -> Parser g s s Source # takeCharsWhile1 :: TextualMonoid s => (Char -> Bool) -> Parser g s s Source # whiteSpace :: TextualMonoid s => Parser g s () Source # concatMany :: Monoid a => Parser g s a -> Parser g s a Source #
Monad (Parser g s) Source #
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) Source #
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) Source #
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 #
FactorialMonoid s => Alternative (Parser g s) Source #
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) Source #
Methods mzero :: Parser g s a # mplus :: Parser g s a -> Parser g s a -> Parser g s a #
(Show s, TextualMonoid s) => TokenParsing (Parser g s) Source #
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 #
(Show s, TextualMonoid s) => CharParsing (Parser g s) Source #
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 => LookAheadParsing (Parser g s) Source #
Methods lookAhead :: Parser g s a -> Parser g s a #
FactorialMonoid s => Parsing (Parser g s) Source #
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) Source #
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 Source #
type ResultFunctor Parser = ParseResults
type GrammarConstraint Parser g Source #
type GrammarConstraint Parser g = Functor * g

data Result g s v Source #

Constructors

Parsed
Fields parsedPrefix :: !v parsedSuffix :: !s
NoParse FailureInfo

Instances

Functor (Result g s) Source #
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) Source #
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 Source #

A named and unconstrained version of the <|> operator