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.


Properties

Version0.1
Dependenciesarray, base (==4.*), containers, mtl
LicenseBSD3
CopyrightJohn Meacham (2006)
AuthorJohn Meacham <john@repetae.net>
MaintainerJohn Meacham <john@repetae.net>
Stabilityexperimental
CategoryText
Home pagehttp://repetae.net/computer/frisby/
Upload dateWed Jun 30 22:06:39 UTC 2010
Uploaded byChrisDone
Downloads150 total (10 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees