Safe Haskell | None |
---|---|
Language | Haskell2010 |
- data FailureInfo = FailureInfo Int [String]
- data ResultList s r = ResultList !(BinTree (ResultInfo s r)) !FailureInfo
- data Parser (g :: (* -> *) -> *) s r
- fromResultList :: FactorialMonoid s => s -> ResultList s r -> ParseResults [(s, r)]
Documentation
data FailureInfo Source #
data ResultList s r Source #
ResultList !(BinTree (ResultInfo s r)) !FailureInfo |
Functor (ResultList s) Source # | |
Show1 (ResultList s) Source # | |
(Show s, Show r) => Show (ResultList s r) Source # | |
Semigroup (ResultList s r) Source # | |
Monoid (ResultList s r) Source # | |
data Parser (g :: (* -> *) -> *) s r Source #
Parser type for context-free grammars using a parallel parsing algorithm with no result sharing nor left recursion support.
MultiParsing Parser Source # | Parallel parser produces a list of all possible parses.
|
MonoidParsing (Parser g) Source # | |
Monad (Parser g s) Source # | |
Functor (Parser g s) Source # | |
Applicative (Parser g s) Source # | |
FactorialMonoid s => Alternative (Parser g s) Source # | |
FactorialMonoid s => MonadPlus (Parser g s) Source # | |
(Lexical g, LexicalConstraint Parser g s, Show s, TextualMonoid s) => TokenParsing (Parser g s) Source # | |
FactorialMonoid s => LookAheadParsing (Parser g s) Source # | |
(Show s, TextualMonoid s) => CharParsing (Parser g s) Source # | |
FactorialMonoid s => Parsing (Parser g s) Source # | |
Semigroup x => Semigroup (Parser g s x) Source # | |
Monoid x => Monoid (Parser g s x) Source # | |
type ResultFunctor Parser Source # | |
type GrammarConstraint Parser g Source # | |
fromResultList :: FactorialMonoid s => s -> ResultList s r -> ParseResults [(s, r)] Source #