Linear time composable parser for PEG grammars

Version on this page:0.2@rev:1
LTS Haskell 21.13:0.2.4
Stackage Nightly 2023-06-21:0.2.4
Latest on Hackage:0.2.4

See all snapshots frisby appears in

BSD-3-Clause licensed by John Meacham
Maintained by John Meacham, Chris Done
This version can be pinned in stack with:frisby-0.2@sha256:12db65dfa550e3fb99cf8924ebf71c9308465391ee91a897741fdbcca65fe1c6,1819

Module documentation for 0.2

Depends on 4 packages(full list with versions):

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.