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

Versions0.1, 0.2
Dependenciesarray, base (==4.*), containers, mtl
LicenseBSD3
CopyrightJohn Meacham (2006)
AuthorJohn Meacham <john@repetae.net>
MaintainerJohn Meacham <john@repetae.net>, Chris Done <chrisdone@gmail.com>
Stabilityexperimental
CategoryText
Home pagehttp://repetae.net/computer/frisby/
Source repositoryhead: git clone https://github.com/chrisdone/frisby
UploadedSun Nov 30 12:47:03 UTC 2014 by ChrisDone
DistributionsStackage:0.2
Downloads200 total (48 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees