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
Change log Changelog.md
Dependencies array, base (==4.*), containers, mtl, semigroups [details]
License BSD-3-Clause
Copyright John Meacham (2006)
Author John Meacham <john@repetae.net>
Maintainer Ben Gamari <ben@smart-cactus.org>
Category Text
Home page http://repetae.net/computer/frisby/
Source repo head: git clone https://github.com/bgamari/frisby
Uploaded by BenGamari at Wed Dec 20 22:48:44 UTC 2017
Distributions LTSHaskell:0.2.2, NixOS:0.2.2, Stackage:0.2.2
Downloads 1869 total (26 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-12-21 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees