paripari: Parser combinators with fast-path and slower fallback for error reporting
PariPari offers two parsing strategies. There is a fast Acceptor and a slower Reporter. If the Acceptor fails, the Reporter returns a report about the parsing errors.
Modules
[Index] [Quick Jump]
Downloads
- paripari-0.7.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 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, 0.7.0.0 |
|---|---|
| Dependencies | base (>=4.8 && <5), bytestring (>=0.10 && <0.11), paripari, parser-combinators (>=1.0 && <1.3), text (>=0.11 && <1.3) [details] |
| Tested with | ghc ==8.4.4, ghc ==8.6.5, ghc ==8.8.3, ghc ==8.10.1 |
| 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 2020-06-17T18:21:07Z |
| Distributions | |
| Executables | paripari-specialise-all, paripari-example |
| Downloads | 4171 total (28 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2020-06-17 [all 1 reports] |