homepage: ''
changelog-type: text
hash: f35166529d6720ad543eb692d7280c50a6739ef5d603a69f213e34185aaa25b5
test-bench-deps:
  base: -any
  doctest: ==0.18.1
  regex-applicative: ==0.3.4
  lexer-applicative: ==2.1.0.2
maintainer: Askar Safin <safinaskar@mail.ru>
synopsis: Parsing combinator library with unbiased choice and support for embedding
  arbitrary monad. You may use applicative or arrow style. Supports left recursion,
  location tracking, parsing and semantic error messages, heuristic ambiguity checking.
  Based on Earley
changelog: ''
basic-deps:
  srcloc: '>=0.6 && <=0.6'
  base: '>=4.13.0.0 && <=4.15.0.0'
  containers: '>=0.6.2.1 && <=0.6.4.1'
  Earley: '>=0.13.0.1 && <=0.13.0.1'
all-versions:
- 0.0.0.1
author: ''
latest: 0.0.0.1
description-type: markdown
description: |
  See https://hackage.haskell.org/package/parser-unbiased-choice-monad-embedding

  You don't need to be registered on SourceHut to create bug report
license-name: BSD-3-Clause

Update from Hackage at 2021-07-08T23:57:57Z
Update from Hackage at 2021-07-08T23:57:57Z
