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.0@rev:1
LTS Haskell 18.14: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.0@sha256:07e2399bc6f115b0aefba035e466da2406363c5a91ec23bfe0071ea76ceb3f71,3448

Module documentation for 0.6.0.0

  • Text
    • Text.PariPari
      • Text.PariPari.Internal
        • Text.PariPari.Internal.Acceptor
        • Text.PariPari.Internal.CharCombinators
        • Text.PariPari.Internal.Chunk
        • Text.PariPari.Internal.Class
        • Text.PariPari.Internal.ElementCombinators
        • Text.PariPari.Internal.Reporter
        • Text.PariPari.Internal.Run
        • Text.PariPari.Internal.Tracer
      • Text.PariPari.Lens
Used by 1 package in nightly-2019-06-11(full list with versions):

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.