frisby: Linear time composable parser for PEG grammars

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.


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.


Versions0.1, 0.2, 0.2.1, 0.2.1, 0.2.2
Change logNone available
Dependenciesarray, base (==4.*), containers, mtl, semigroups [details]
CopyrightJohn Meacham (2006)
AuthorJohn Meacham <>
MaintainerBen Gamari <>
Home page
Source repositoryhead: git clone
UploadedWed Sep 27 15:32:35 UTC 2017 by BenGamari




Maintainers' corner

For package maintainers and hackage trustees