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

Versions 0.1, 0.2
Dependencies array, base (==4.*), containers, mtl [details]
License BSD3
Copyright John Meacham (2006)
Author John Meacham <john@repetae.net>
Maintainer John Meacham <john@repetae.net>, Chris Done <chrisdone@gmail.com>
Stability experimental
Category Text
Home page http://repetae.net/computer/frisby/
Source repository head: git clone https://github.com/chrisdone/frisby
Uploaded Sun Nov 30 12:47:03 UTC 2014 by ChrisDone
Distributions LTSHaskell:0.2, NixOS:0.2, Stackage:0.2, Tumbleweed:0.2
Downloads 655 total (7 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees