homepage: https://github.com/minad/paripari#readme
changelog-type: ''
hash: b82fc32c44106458177392b312e05a26e127a8f1fddd519cf494ca764ad69773
test-bench-deps: {}
maintainer: Daniel Mendler <mail@daniel-mendler.de>
synopsis: Fast-path parser combinators with fallback for error reporting
changelog: ''
basic-deps:
  bytestring: ==0.10.*
  base: ! '>=4.8 && <5'
  parser-combinators: ==1.0.*
  text: ! '>=0.11 && <1.3'
  paripari: -any
all-versions:
- '0.1.0.0'
author: Daniel Mendler <mail@daniel-mendler.de>
latest: '0.1.0.0'
description-type: haddock
description: 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. Unlike Parsec and like Attoparsec, the
  parser combinators backtrack by default.
license-name: MIT

homepage: https://github.com/minad/paripari#readme
changelog-type: ''
hash: 46fb819fddd384a69fd731601218b6d815b8c2dd9c4943eafa1a6d91a0b2fdc4
test-bench-deps:
  bytestring: ! '>=0.10 && <0.11'
  base: ! '>=4.8 && <5'
  parser-combinators: ! '>=1.0 && <1.1'
  text: ! '>=0.11 && <1.3'
  paripari: -any
  tasty-hunit: -any
  tasty: -any
maintainer: Daniel Mendler <mail@daniel-mendler.de>
synopsis: Fast-path parser combinators with fallback for error reporting
changelog: ''
basic-deps:
  bytestring: ==0.10.*
  base: ! '>=4.8 && <5'
  parser-combinators: ==1.0.*
  text: ! '>=0.11 && <1.3'
  paripari: -any
all-versions:
- '0.1.0.0'
- '0.2.0.0'
author: Daniel Mendler <mail@daniel-mendler.de>
latest: '0.2.0.0'
description-type: haddock
description: 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. Unlike Parsec and like Attoparsec, the
  parser combinators backtrack by default.
license-name: MIT

Update from Hackage at 2018-09-08T12:01:14Z
Update from Hackage at 2018-09-08T12:01:14Z
