The frisby package

[Tags: bsd3, library]

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.


Versions0.1, 0.2
Change logNone available
Dependenciesarray, base (==4.*), containers, mtl [details]
CopyrightJohn Meacham (2006)
AuthorJohn Meacham <>
MaintainerJohn Meacham <>
Home page
UploadedWed Jun 30 22:06:39 UTC 2010 by ChrisDone
DistributionsLTSHaskell:0.2, NixOS:0.2, Stackage:0.2
Downloads594 total (15 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees