Text.Grampa.ContextFree.LeftRecursive.Transformer

Documentation

type ParserT m = Fixed (ParserT m)

data SeparatedParser p (g :: (* -> *) -> *) s a

Constructors

FrontParser (p g s a)

CycleParser

Fields

• cycleParser :: p g s a
• backParser :: p g s a
• appendResultsArrow :: ResultAppend p g s a
• dependencies :: Dependencies g

BackParser

Fields

• backParser :: p g s a

class AmbiguityDecidable a

Minimal complete definition

ambiguityWitness

Instances

AmbiguityDecidable a

Defined in Text.Grampa.Internal

Methods

ambiguityWitness :: Maybe (AmbiguityWitness a)

AmbiguityDecidable (Ambiguous a)

Defined in Text.Grampa.Internal

Methods

ambiguityWitness :: Maybe (AmbiguityWitness (Ambiguous a))

lift :: Applicative m => m a -> ParserT m g s a

Lift a parse-free computation into the parser.

liftPositive :: p g s a -> Fixed p g s a

Lifts a primitive positive parser (i.e., one that always consumes some input) into a left-recursive one

tbind :: (Monad m, AmbiguityDecidable b) => ParserT m g s a -> (a -> m b) -> ParserT m g s b

Transform the computation carried by the parser using the monadic bind (>>=).

tmap :: AmbiguityDecidable b => (m a -> m b) -> ParserT m g s a -> ParserT m g s b

Transform the computation carried by the parser.

parseSeparated :: forall p g rl s. (Apply g, Foldable g, Eq s, FactorialMonoid s, LeftReductive s, TailsParsing (p g s), GrammarConstraint (p g s) g, GrammarFunctor (p g s) ~ rl s, FallibleResults rl, s ~ ParserInput (p g s)) => g (SeparatedParser p g s) -> s -> [(s, g (GrammarFunctor (p g s)))]

Parse the given input using a context-free grammar separated into two parts: the first specifying all the left-recursive productions, the second all others. The first function argument specifies the left-recursive dependencies among the grammar productions.

separated :: forall p g s. (Alternative (p g s), Apply g, Distributive g, Traversable g, AmbiguousAlternative (GrammarFunctor (p g s))) => g (Fixed p g s) -> g (SeparatedParser p g s)