| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Text.Grampa.PEG.Backtrack
Description
Backtracking parser for Parsing Expression Grammars
- data Parser g s r
Documentation
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.
Instances
| MultiParsing Parser Source # | Backtracking PEG parser
|
| 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 # | |
| FactorialMonoid s => Parsing (Parser g s) Source # | |
| Monoid x => Monoid (Parser g s x) Source # | |
| type ResultFunctor Parser Source # | |
| type GrammarConstraint Parser g Source # | |