Text.Grampa.ContextFree.SortedMemoizing.Transformer

A context-free memoizing parser that handles all alternatives in parallel and carries a monadic computation with each parsing result.

Documentation

data ResultListT m g s r

Constructors

ResultList

Fields

• resultSuccesses :: ![ResultsOfLengthT m g s r]
• resultFailures :: !(ParseFailure Pos s)

Instances

Functor m => Functor (ResultListT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

fmap :: (a -> b) -> ResultListT m g s a -> ResultListT m g s b

(<$) :: a -> ResultListT m g s b -> ResultListT m g s a

(Applicative m, Ord s) => Applicative (ResultListT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

pure :: a -> ResultListT m g s a

(<*>) :: ResultListT m g s (a -> b) -> ResultListT m g s a -> ResultListT m g s b

liftA2 :: (a -> b -> c) -> ResultListT m g s a -> ResultListT m g s b -> ResultListT m g s c

(*>) :: ResultListT m g s a -> ResultListT m g s b -> ResultListT m g s b

(<*) :: ResultListT m g s a -> ResultListT m g s b -> ResultListT m g s a

(Applicative m, Ord s) => Alternative (ResultListT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

empty :: ResultListT m g s a

(<|>) :: ResultListT m g s a -> ResultListT m g s a -> ResultListT m g s a

some :: ResultListT m g s a -> ResultListT m g s [a]

many :: ResultListT m g s a -> ResultListT m g s [a]

Traversable m => Filterable (ResultListT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

mapMaybe :: (a -> Maybe b) -> ResultListT m g s a -> ResultListT m g s b

catMaybes :: ResultListT m g s (Maybe a) -> ResultListT m g s a

filter :: (a -> Bool) -> ResultListT m g s a -> ResultListT m g s a

(Monad m, Traversable m, Monoid state) => Filterable (ResultListT (StateT state m) g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

mapMaybe :: (a -> Maybe b) -> ResultListT (StateT state m) g s a -> ResultListT (StateT state m) g s b

catMaybes :: ResultListT (StateT state m) g s (Maybe a) -> ResultListT (StateT state m) g s a

filter :: (a -> Bool) -> ResultListT (StateT state m) g s a -> ResultListT (StateT state m) g s a

Ord s => Semigroup (ResultListT m g s r)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

(<>) :: ResultListT m g s r -> ResultListT m g s r -> ResultListT m g s r

sconcat :: NonEmpty (ResultListT m g s r) -> ResultListT m g s r

stimes :: Integral b => b -> ResultListT m g s r -> ResultListT m g s r

Ord s => Monoid (ResultListT m g s r)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

mempty :: ResultListT m g s r

mappend :: ResultListT m g s r -> ResultListT m g s r -> ResultListT m g s r

mconcat :: [ResultListT m g s r] -> ResultListT m g s r

newtype ParserT m g s r

Parser for a context-free grammar with packrat-like sharing that carries a monadic computation as part of the parse result.

Constructors

Parser

Fields

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

Instances

(Monad m, Traversable m, Ord s) => Monad (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

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

(>>) :: ParserT m g s a -> ParserT m g s b -> ParserT m g s b

return :: a -> ParserT m g s a

Functor m => Functor (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

fmap :: (a -> b) -> ParserT m g s a -> ParserT m g s b

(<$) :: a -> ParserT m g s b -> ParserT m g s a

(Monad m, Traversable m, Ord s) => MonadFail (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

fail :: String -> ParserT m g s a

(Applicative m, Ord s) => Applicative (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

pure :: a -> ParserT m g s a

(<*>) :: ParserT m g s (a -> b) -> ParserT m g s a -> ParserT m g s b

liftA2 :: (a -> b -> c) -> ParserT m g s a -> ParserT m g s b -> ParserT m g s c

(*>) :: ParserT m g s a -> ParserT m g s b -> ParserT m g s b

(<*) :: ParserT m g s a -> ParserT m g s b -> ParserT m g s a

(Applicative m, Ord s) => Alternative (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

empty :: ParserT m g s a

(<|>) :: ParserT m g s a -> ParserT m g s a -> ParserT m g s a

some :: ParserT m g s a -> ParserT m g s [a]

many :: ParserT m g s a -> ParserT m g s [a]

(Foldable m, Monad m, Traversable m, Ord s) => MonadPlus (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

mzero :: ParserT m g s a

mplus :: ParserT m g s a -> ParserT m g s a -> ParserT m g s a

(Applicative m, MonoidNull s, Ord s) => DeterministicParsing (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

(<<|>) :: ParserT m g s a -> ParserT m g s a -> ParserT m g s a

takeOptional :: ParserT m g s a -> ParserT m g s (Maybe a)

takeMany :: ParserT m g s a -> ParserT m g s [a]

takeSome :: ParserT m g s a -> ParserT m g s [a]

concatAll :: Monoid a => ParserT m g s a -> ParserT m g s a

skipAll :: ParserT m g s a -> ParserT m g s ()

(Applicative m, LeftReductive s, FactorialMonoid s, Ord s) => InputParsing (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Associated Types

type ParserInput (ParserT m g s)

type ParserPosition (ParserT m g s)

Methods

getInput :: ParserT m g s (ParserInput (ParserT m g s))

getSourcePos :: ParserT m g s (ParserPosition (ParserT m g s))

anyToken :: ParserT m g s (ParserInput (ParserT m g s))

take :: Int -> ParserT m g s (ParserInput (ParserT m g s))

satisfy :: (ParserInput (ParserT m g s) -> Bool) -> ParserT m g s (ParserInput (ParserT m g s))

notSatisfy :: (ParserInput (ParserT m g s) -> Bool) -> ParserT m g s ()

scan :: state -> (state -> ParserInput (ParserT m g s) -> Maybe state) -> ParserT m g s (ParserInput (ParserT m g s))

string :: ParserInput (ParserT m g s) -> ParserT m g s (ParserInput (ParserT m g s))

takeWhile :: (ParserInput (ParserT m g s) -> Bool) -> ParserT m g s (ParserInput (ParserT m g s))

takeWhile1 :: (ParserInput (ParserT m g s) -> Bool) -> ParserT m g s (ParserInput (ParserT m g s))

(Applicative m, Ord s, Show s, TextualMonoid s) => InputCharParsing (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

satisfyCharInput :: (Char -> Bool) -> ParserT m g s (ParserInput (ParserT m g s))

notSatisfyChar :: (Char -> Bool) -> ParserT m g s ()

scanChars :: state -> (state -> Char -> Maybe state) -> ParserT m g s (ParserInput (ParserT m g s))

takeCharsWhile :: (Char -> Bool) -> ParserT m g s (ParserInput (ParserT m g s))

takeCharsWhile1 :: (Char -> Bool) -> ParserT m g s (ParserInput (ParserT m g s))

(Applicative m, LeftReductive s, FactorialMonoid s, Ord s) => ConsumedInputParsing (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

match :: ParserT m g s a -> ParserT m g s (ParserInput (ParserT m g s), a)

(Applicative m, MonoidNull s, Ord s) => LookAheadParsing (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

lookAhead :: ParserT m g s a -> ParserT m g s a

(Applicative m, Ord s, Show s, TextualMonoid s) => CharParsing (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

satisfy :: (Char -> Bool) -> ParserT m g s Char

char :: Char -> ParserT m g s Char

notChar :: Char -> ParserT m g s Char

anyChar :: ParserT m g s Char

string :: String -> ParserT m g s String

text :: Text -> ParserT m g s Text

(Applicative m, MonoidNull s, Ord s) => Parsing (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

try :: ParserT m g s a -> ParserT m g s a

(<?>) :: ParserT m g s a -> String -> ParserT m g s a

skipMany :: ParserT m g s a -> ParserT m g s ()

skipSome :: ParserT m g s a -> ParserT m g s ()

unexpected :: String -> ParserT m g s a

eof :: ParserT m g s ()

notFollowedBy :: Show a => ParserT m g s a -> ParserT m g s ()

(Applicative m, Traversable m) => Filterable (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

mapMaybe :: (a -> Maybe b) -> ParserT m g s a -> ParserT m g s b

catMaybes :: ParserT m g s (Maybe a) -> ParserT m g s a

filter :: (a -> Bool) -> ParserT m g s a -> ParserT m g s a

(Monad m, Traversable m, Monoid state) => Filterable (ParserT (StateT state m) g s)

The StateT instance dangerously assumes that the filtered parser is stateless.

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

mapMaybe :: (a -> Maybe b) -> ParserT (StateT state m) g s a -> ParserT (StateT state m) g s b

catMaybes :: ParserT (StateT state m) g s (Maybe a) -> ParserT (StateT state m) g s a

filter :: (a -> Bool) -> ParserT (StateT state m) g s a -> ParserT (StateT state m) g s a

(Applicative m, Traversable m, Ord s) => CommittedParsing (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Associated Types

type CommittedResults (ParserT m g s) :: Type -> Type

Methods

commit :: ParserT m g s a -> ParserT m g s (CommittedResults (ParserT m g s) a)

admit :: ParserT m g s (CommittedResults (ParserT m g s) a) -> ParserT m g s a

(Applicative m, Eq (m ()), Ord s) => AmbiguousParsing (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

ambiguous :: ParserT m g s a -> ParserT m g s (Ambiguous a)

(Applicative m, Ord s, LeftReductive s, FactorialMonoid s) => GrammarParsing (ParserT m g s)

Memoizing parser that carries an applicative computation. Can be wrapped with Fixed to provide left recursion support.

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Associated Types

type ParserGrammar (ParserT m g s) :: (Type -> Type) -> Type

type GrammarFunctor (ParserT m g s) :: Type -> Type

Methods

parsingResult :: ParserInput (ParserT m g s) -> GrammarFunctor (ParserT m g s) a -> ResultFunctor (ParserT m g s) (ParserInput (ParserT m g s), a)

nonTerminal :: (g0 ~ ParserGrammar (ParserT m g s), GrammarConstraint (ParserT m g s) g0) => (g0 (GrammarFunctor (ParserT m g s)) -> GrammarFunctor (ParserT m g s) a) -> ParserT m g s a

selfReferring :: (g0 ~ ParserGrammar (ParserT m g s), GrammarConstraint (ParserT m g s) g0, Distributive g0) => g0 (ParserT m g s)

fixGrammar :: (g0 ~ ParserGrammar (ParserT m g s), GrammarConstraint (ParserT m g s) g0, Distributive g0) => (g0 (ParserT m g s) -> g0 (ParserT m g s)) -> g0 (ParserT m g s)

recursive :: ParserT m g s a -> ParserT m g s a

(Applicative m, LeftReductive s, FactorialMonoid s, Ord s) => MultiParsing (ParserT m g s)

Memoizing parser that carries an applicative computation. Can be wrapped with Fixed to provide left recursion support.

parseComplete :: (Rank2.Functor g, FactorialMonoid s) =>
                 g (Memoizing.Parser g s) -> s -> g (Compose (ParseResults s) [])

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Associated Types

type ResultFunctor (ParserT m g s) :: Type -> Type

type GrammarConstraint (ParserT m g s) g

Methods

parseComplete :: (ParserInput (ParserT m g s) ~ s0, GrammarConstraint (ParserT m g s) g0, Eq s0, FactorialMonoid s0) => g0 (ParserT m g s) -> s0 -> g0 (ResultFunctor (ParserT m g s))

parsePrefix :: (ParserInput (ParserT m g s) ~ s0, GrammarConstraint (ParserT m g s) g0, Eq s0, FactorialMonoid s0) => g0 (ParserT m g s) -> s0 -> g0 (Compose (ResultFunctor (ParserT m g s)) ((,) s0))

InputParsing (ParserT m g s) => TraceableParsing (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

traceInput :: (ParserInput (ParserT m g s) -> String) -> ParserT m g s a -> ParserT m g s a

traceAs :: Show (ParserInput (ParserT m g s)) => String -> ParserT m g s a -> ParserT m g s a

(Applicative m, Semigroup x, Ord s) => Semigroup (ParserT m g s x)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

(<>) :: ParserT m g s x -> ParserT m g s x -> ParserT m g s x

sconcat :: NonEmpty (ParserT m g s x) -> ParserT m g s x

stimes :: Integral b => b -> ParserT m g s x -> ParserT m g s x

(Applicative m, Monoid x, Ord s) => Monoid (ParserT m g s x)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

Methods

mempty :: ParserT m g s x

mappend :: ParserT m g s x -> ParserT m g s x -> ParserT m g s x

mconcat :: [ParserT m g s x] -> ParserT m g s x

type ParserPosition (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

type ParserPosition (ParserT m g s) = Down Int

type ParserInput (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

type ParserInput (ParserT m g s) = s

type CommittedResults (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

type CommittedResults (ParserT m g s) = ParseResults s

type ParserGrammar (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

type ParserGrammar (ParserT m g s) = g

type GrammarFunctor (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

type GrammarFunctor (ParserT m g s) = ResultListT m g s

type ResultFunctor (ParserT m g s)

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

type ResultFunctor (ParserT m g s) = Compose (Compose (ParseResults s) []) m

type GrammarConstraint (ParserT m g s) g'

Defined in Text.Grampa.ContextFree.SortedMemoizing.Transformer

type GrammarConstraint (ParserT m g s) g' = (g ~ g', Functor g)

(<<|>) :: DeterministicParsing m => m a -> m a -> m a infixl 3

Left-biased choice: if the left alternative succeeds, the right one is never tried.

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

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

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

Lift a parse-free computation into the parser.

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

Transform the computation carried by the parser.

longest :: ParserT Identity g s a -> Parser g [(s, g (ResultListT Identity g s))] a

Turns a context-free parser into a backtracking PEG parser that consumes the longest possible prefix of the list of input tails, opposite of peg

peg :: (Applicative m, Ord s) => Parser g [(s, g (ResultListT m g s))] a -> ParserT m g s a

Turns a backtracking PEG parser of the list of input tails into a context-free parser, opposite of longest

terminalPEG :: (Applicative m, Monoid s, Ord s) => Parser g s a -> ParserT m g s a

Turns a backtracking PEG parser into a context-free parser