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.2), 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>
Revised Revision 2 made by minad at Thu Jun 13 15:27:58 UTC 2019
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 Mon Oct 8 10:55:00 UTC 2018
Distributions LTSHaskell:0.6.0.0, NixOS:0.6.0.1, Stackage:0.6.0.0
Executables paripari-specialise-all, paripari-example
Downloads 2456 total (329 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2018-10-08 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees