Text.Grampa.ContextFree.Parallel

A context-free, non-memoizing parser that handles all alternatives in parallel.

Documentation

data ResultList s r

Constructors

ResultList !(BinTree (ResultInfo s r)) (ParseFailure Pos s)

Instances

Show s => Show1 (ResultList s)

Defined in Text.Grampa.ContextFree.Parallel

Methods

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

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

Functor (ResultList s)

Defined in Text.Grampa.ContextFree.Parallel

Methods

fmap :: (a -> b) -> ResultList s a -> ResultList s b

(<$) :: a -> ResultList s b -> ResultList s a

Filterable (ResultList s)

Defined in Text.Grampa.ContextFree.Parallel

Methods

mapMaybe :: (a -> Maybe b) -> ResultList s a -> ResultList s b

catMaybes :: ResultList s (Maybe a) -> ResultList s a

filter :: (a -> Bool) -> ResultList s a -> ResultList s a

Ord s => Monoid (ResultList s r)

Defined in Text.Grampa.ContextFree.Parallel

Methods

mempty :: ResultList s r

mappend :: ResultList s r -> ResultList s r -> ResultList s r

mconcat :: [ResultList s r] -> ResultList s r

Ord s => Semigroup (ResultList s r)

Defined in Text.Grampa.ContextFree.Parallel

Methods

(<>) :: ResultList s r -> ResultList s r -> ResultList s r

sconcat :: NonEmpty (ResultList s r) -> ResultList s r

stimes :: Integral b => b -> ResultList s r -> ResultList s r

(Show s, Show r) => Show (ResultList s r)

Defined in Text.Grampa.ContextFree.Parallel

Methods

showsPrec :: Int -> ResultList s r -> ShowS

show :: ResultList s r -> String

showList :: [ResultList s r] -> ShowS

data Parser (g :: (Type -> Type) -> Type) s r

Parser type for context-free grammars using a parallel parsing algorithm with no result sharing nor left recursion support.

Instances

(FactorialMonoid s, Ord s) => MonadFail (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

Methods

fail :: String -> Parser g s a

(FactorialMonoid s, Ord s) => Alternative (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

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]

Ord s => Applicative (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

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

Functor (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

Methods

fmap :: (a -> b) -> Parser g s a -> Parser g s b

(<$) :: a -> Parser g s b -> Parser g s a

Ord s => Monad (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

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

(FactorialMonoid s, Ord s) => MonadPlus (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

Methods

mzero :: Parser g s a

mplus :: Parser g s a -> Parser g s a -> Parser g s a

(FactorialMonoid s, Ord s) => CommittedParsing (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

Associated Types

type CommittedResults (Parser g s) :: Type -> Type

Methods

commit :: Parser g s a -> Parser g s (CommittedResults (Parser g s) a)

admit :: Parser g s (CommittedResults (Parser g s) a) -> Parser g s a

(LeftReductive s, FactorialMonoid s, Ord s) => MultiParsing (Parser g s)

Parallel parser produces a list of all possible parses.

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

Defined in Text.Grampa.ContextFree.Parallel

Associated Types

type ResultFunctor (Parser g s) :: Type -> Type

type GrammarConstraint (Parser g s) g

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))

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))

(FactorialMonoid s, InputParsing (Parser g s)) => TraceableParsing (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

Methods

traceInput :: (ParserInput (Parser g s) -> String) -> Parser g s a -> Parser g s a

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

(FactorialMonoid s, Ord s) => DeterministicParsing (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

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 ()

(Ord s, TextualMonoid s) => InputCharParsing (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

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))

(LeftReductive s, FactorialMonoid s, Ord s) => InputParsing (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

Associated Types

type ParserInput (Parser g s)

type ParserPosition (Parser g s)

Methods

getInput :: Parser g s (ParserInput (Parser g s))

getSourcePos :: Parser g s (ParserPosition (Parser g s))

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))

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

Defined in Text.Grampa.ContextFree.Parallel

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, Ord s) => Parsing (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

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 ()

(FactorialMonoid s, Ord s) => LookAheadParsing (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

Methods

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

FactorialMonoid s => Filterable (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

Methods

mapMaybe :: (a -> Maybe b) -> Parser g s a -> Parser g s b

catMaybes :: Parser g s (Maybe a) -> Parser g s a

filter :: (a -> Bool) -> Parser g s a -> Parser g s a

(Monoid x, Ord s) => Monoid (Parser g s x)

Defined in Text.Grampa.ContextFree.Parallel

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

(Ord s, Semigroup x) => Semigroup (Parser g s x)

Defined in Text.Grampa.ContextFree.Parallel

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

type CommittedResults (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

type CommittedResults (Parser g s) = ParseResults s

type ResultFunctor (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

type ResultFunctor (Parser g s) = Compose (ParseResults s) []

type ParserInput (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

type ParserInput (Parser g s) = s

type ParserPosition (Parser g s)

Defined in Text.Grampa.ContextFree.Parallel

type ParserPosition (Parser g s) = Down Int

type GrammarConstraint (Parser g1 s) g2

Defined in Text.Grampa.ContextFree.Parallel

type GrammarConstraint (Parser g1 s) g2 = Functor g2