frisby: Linear time composable parser for PEG grammars
frisby is a parser library that can parse arbitrary PEG grammars in linear time. Unlike other parsers of PEG grammars, frisby need not be supplied with all possible rules up front, allowing composition of smaller parsers.
PEG parsers are never ambiguous and allow infinite lookahead with no backtracking penalty. Since PEG parsers can look ahead arbitrarily, they can easily express rules such as the maximal munch rule used in lexers, meaning no separate lexer is needed.
In addition to many standard combinators, frisby provides routines to translate standard regex syntax into frisby parsers.
|Versions [RSS]||0.1, 0.2, 0.2.1, 0.2.2, 0.2.3, 0.2.4|
|Dependencies||array, base (>=4 && <5), containers, fail, mtl, semigroups [details]|
|Copyright||John Meacham (2006)|
|Author||John Meacham <firstname.lastname@example.org>|
|Maintainer||Ben Gamari <email@example.com>|
|Source repo||head: git clone https://github.com/bgamari/frisby|
|Uploaded||by BenGamari at 2020-03-31T00:37:42Z|
|Distributions||LTSHaskell:0.2.4, NixOS:0.2.4, Stackage:0.2.4|
|Downloads||4454 total (29 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2020-03-31 [all 1 reports]