gll: GLL parser with simple combinator interface
GLL is a parser combinator library for writing generalised parsers. The parsers can correspond to arbitrary context-free grammar, accepting both non-determinism and (left-) recursion. The underlying parsing algorithm is GLL (Scott and Johnstone 2013).
The library provides an interface in Control.Applicative style (although no instance of Applicative is given). Users can add arbitrary semantic to the parser.
There are 4 top-level functions: parse, parseString, parseWithOptions and parseStringWithOptions. They all return a list of semantic results, one for each derivation. In the case that infinite derivations are possible only 'good parse trees' are accepted (Ridge 2014).
Function parse relies on a builtin Token datatype. User-defined token-types are currently not supported. parseString enables parsing character strings. The user is granted GLL.Combinators.Options to specify certain disambiguation rules.
GLL.Combinators.MemInterface is a memoised version of the library. Parsers are no longer pure functions and must be built inside the IO monad, providing fresh memo-tables to each memo'ed non-terminal.
See UnitTests and MemTests for examples of using both version of the library.
|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 && <=184.108.40.206), containers (>=0.4), TypeCompose [details]|
|Author||L. Thomas van Binsbergen|
|Uploaded||by ltvanbinsbergen at Thu Jun 4 16:43:59 UTC 2015|
|Downloads||4477 total (81 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs not available [build log]
Last success reported on 2015-06-09 [all 6 reports]
For package maintainers and hackage trustees