Safe Haskell	None
Language	Haskell2010

Text.Grampa.PEG.Backtrack

Description

Backtracking parser for Parsing Expression Grammars

Synopsis

newtype Parser g s r = Parser {
- applyParser :: s -> Result g s r
}
data Result (g :: (* -> *) -> *) s v
- = Parsed {
  - parsedPrefix :: !v
  - parsedSuffix :: !s
  }
- | NoParse (FailureInfo s)
alt :: Parser g s a -> Parser g s a -> Parser g s a

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

Instances details

Monad (Parser g s) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack 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 #
Functor (Parser g s) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack 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 #
Instance details Defined in Text.Grampa.PEG.Backtrack 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) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack 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 #
Instance details Defined in Text.Grampa.PEG.Backtrack Methods mzero :: Parser g s a # mplus :: Parser g s a -> Parser g s a -> Parser g s a #
FactorialMonoid s => DeterministicParsing (Parser g s) Source #	Every PEG parser is deterministic all the time.
Instance details Defined in Text.Grampa.PEG.Backtrack Methods (<<\|>) :: Parser g s a -> Parser g s a -> Parser g s a # takeOptional :: Parser g s a -> Parser g s (Maybe a) # takeMany :: Parser g s a -> Parser g s [a] # takeSome :: Parser g s a -> Parser g s [a] # concatAll :: Monoid a => Parser g s a -> Parser g s a # skipAll :: Parser g s a -> Parser g s () #
(LeftReductive s, FactorialMonoid s) => InputParsing (Parser g s) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack Associated Types type ParserInput (Parser g s) # Methods getInput :: Parser g s (ParserInput (Parser g s)) # getSourcePos :: Parser g s Position # anyToken :: Parser g s (ParserInput (Parser g s)) # take :: Int -> Parser g s (ParserInput (Parser g s)) # satisfy :: (ParserInput (Parser g s) -> Bool) -> Parser g s (ParserInput (Parser g s)) # notSatisfy :: (ParserInput (Parser g s) -> Bool) -> Parser g s () # scan :: state -> (state -> ParserInput (Parser g s) -> Maybe state) -> Parser g s (ParserInput (Parser g s)) # string :: ParserInput (Parser g s) -> Parser g s (ParserInput (Parser g s)) # takeWhile :: (ParserInput (Parser g s) -> Bool) -> Parser g s (ParserInput (Parser g s)) # takeWhile1 :: (ParserInput (Parser g s) -> Bool) -> Parser g s (ParserInput (Parser g s)) #
(Show s, TextualMonoid s) => InputCharParsing (Parser g s) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack Methods satisfyCharInput :: (Char -> Bool) -> Parser g s (ParserInput (Parser g s)) # notSatisfyChar :: (Char -> Bool) -> Parser g s () # scanChars :: state -> (state -> Char -> Maybe state) -> Parser g s (ParserInput (Parser g s)) # takeCharsWhile :: (Char -> Bool) -> Parser g s (ParserInput (Parser g s)) # takeCharsWhile1 :: (Char -> Bool) -> Parser g s (ParserInput (Parser g s)) #
FactorialMonoid s => LookAheadParsing (Parser g s) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack Methods lookAhead :: Parser g s a -> Parser g s a #
(Show s, TextualMonoid s) => CharParsing (Parser g s) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack 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) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack 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 () #
(LeftReductive s, FactorialMonoid s) => MultiParsing (Parser g s) Source #	Backtracking PEG parser `parseComplete` :: (Rank2.`Functor` g, `FactorialMonoid` s) => g (Backtrack.`Parser` g s) -> s -> g (`ParseResults` s)
Instance details Defined in Text.Grampa.PEG.Backtrack Associated Types type ResultFunctor (Parser g s) :: Type -> Type Source # type GrammarConstraint (Parser g s) g Source # Methods parseComplete :: (ParserInput (Parser g s) ~ s0, GrammarConstraint (Parser g s) g0, Eq s0, FactorialMonoid s0) => g0 (Parser g s) -> s0 -> g0 (ResultFunctor (Parser g s)) Source # parsePrefix :: (ParserInput (Parser g s) ~ s0, GrammarConstraint (Parser g s) g0, Eq s0, FactorialMonoid s0) => g0 (Parser g s) -> s0 -> g0 (Compose (ResultFunctor (Parser g s)) ((,) s0)) Source #
Semigroup x => Semigroup (Parser g s x) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack 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) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack 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 ParserInput (Parser g s) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack type ParserInput (Parser g s) = s
type ResultFunctor (Parser g s) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack type ResultFunctor (Parser g s) = ParseResults s
type GrammarConstraint (Parser g1 s) g2 Source #
Instance details Defined in Text.Grampa.PEG.Backtrack type GrammarConstraint (Parser g1 s) g2 = Functor g2

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

Constructors

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

Instances

Instances details

Functor (Result g s) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack Methods fmap :: (a -> b) -> Result g s a -> Result g s b # (<$) :: a -> Result g s b -> Result g s a #
Show s => Show1 (Result g s) Source #
Instance details Defined in Text.Grampa.PEG.Backtrack 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

Key	Shortcut
s	Open this search box
esc	Close this search box
↓,ctrl + j	Move down in search results
↑,ctrl + k	Move up in search results
↵	Go to active search result