paripari

Parser combinators with fast-path and slower fallback for error reporting

https://github.com/minad/paripari#readme

Version on this page:	0.6.0.1
LTS Haskell 18.28:	0.7.0.0
Stackage Nightly 2021-06-14:	0.7.0.0
Latest on Hackage:	0.7.0.0

See all snapshots paripari appears in

MIT licensed and maintained by Daniel Mendler

This version can be pinned in stack with:paripari-0.6.0.1@sha256:66d43995266b2caf90d720e91747b3be136bb9dcc3a3455e60cf717eccc377b9,3335

Module documentation for 0.6.0.1

Text
- Text.PariPari
  - Text.PariPari.Internal
  - Text.PariPari.Lens

Depends on 5 packages(full list with versions):

base, bytestring, paripari, parser-combinators, text

Used by 1 package in lts-16.31(full list with versions):

paripari

PariPari offers two parsing strategies. There is a fast Acceptor and a slower Reporter which are evaluated in parallel. If the Acceptor fails, the Reporter returns a report about the parsing errors. Like Attoparsec, the parser combinators backtrack by default.