frisby: Linear time composable parser for PEG grammars.

[ bsd3, library, text ] [ Propose Tags ]

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 0.1, 0.2, 0.2.1, 0.2.2
Dependencies array (<0.4), base (>=4 && <4.5), containers (<0.6), mtl (<2.3) [details]
License BSD-3-Clause
Copyright John Meacham (2006)
Author John Meacham <john@repetae.net>
Maintainer John Meacham <john@repetae.net>
Revised Revision 1 made by HerbertValerioRiedel at Wed Dec 7 20:30:18 UTC 2016
Category Text
Home page http://repetae.net/computer/frisby/
Uploaded by ChrisDone at Wed Jun 30 22:06:39 UTC 2010
Distributions LTSHaskell:0.2.2, NixOS:0.2.2, Stackage:0.2.2, openSUSE:0.2.2
Downloads 1694 total (24 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees