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

[ library, mit, program, text ] [ Propose Tags ]

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.

Versions [faq] 0.1.0.0, 0.2.0.0, 0.2.1.0, 0.3.0.0, 0.4.0.0, 0.5.0.0, 0.6.0.0, 0.6.0.1
Dependencies base (>=4.8 && <5), bytestring (==0.10.*), paripari, parser-combinators (>=1.0 && <1.3), text (>=0.11 && <1.3) [details]
License MIT
Copyright 2018 Daniel Mendler
Author Daniel Mendler <mail@daniel-mendler.de>
Maintainer Daniel Mendler <mail@daniel-mendler.de>
Category Text
Home page https://github.com/minad/paripari#readme
Bug tracker https://github.com/minad/paripari/issues
Source repo head: git clone https://github.com/minad/paripari
Uploaded by minad at Tue Oct 15 16:50:46 UTC 2019
Distributions LTSHaskell:0.6.0.0, NixOS:0.6.0.0, Stackage:0.6.0.0
Executables paripari-specialise-all, paripari-example
Downloads 1249 total (193 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-10-15 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees