gll: GLL parser with simple combinator interface
GLL is a parser combinator library for writing generalised parsers. The user can write parsers for arbitrary context-free grammars, including both non-determinism and all forms of left and right-recursion. The underlying parsing algorithm is GLL (Scott and Johnstone 2013).
The library provides an interface in
it uses the combinators
<$> and derivations.
<$> arbitrary semantic actions are added to the parser.
Four functions can be used to run a parser:
parse relies on the builtin
Token datatype, receiving a list of
Token as an input string. User-defined token-types are currently not supported.
Function *parseString* enables parsing character-level parsing.
The result of aparse is a list of semantic results, one result for each derivation.
To avoid infinite recursion, only 'good parse trees' are considered (Ridge 2014).
To limit the number of accepted derivation, and therefore avoiding potential
GLL.Combinators.Options are available to specify certain
GLL.Combinators.MemInterface is a memoised version of the library.
Memoisation is used to speed up the process of applying semantic actions,
it is not necessary for generalised parsing:
In the memoised version, parsers are no longer pure functions and must be
developed inside the IO monad.
Examples can be found in the
|Versions [faq]||0.1.0.0, 0.1.0.1, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3, 0.3.0.0, 0.3.0.1, 0.3.0.6, 0.3.0.7, 0.3.0.9, 0.3.0.10, 0.4.0.2, 0.4.0.3, 0.4.0.4, 0.4.0.5, 0.4.0.11, 0.4.0.12 (info)|
|Dependencies||array, base (>=4.5 && <=220.127.116.11), containers (>=0.4), TypeCompose [details]|
|Author||L. Thomas van Binsbergen|
|Uploaded||by ltvanbinsbergen at Sat Jun 6 11:24:41 UTC 2015|
|Downloads||5202 total (370 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2015-06-09 [all 1 reports]
For package maintainers and hackage trustees