homepage: ''
changelog-type: ''
hash: 5547708af91d78a437490ab29e4594ee5cf145a87987e57689811dad9c2294c6
test-bench-deps:
  bytestring: -any
  base: -any
  rere: -any
  clock: ^>=0.8
  criterion: ! '>=1.5.5.0 && <1.6'
  parsec: -any
  containers: -any
  quickcheck-instances: ^>=0.3.22
  tasty-quickcheck: ^>=0.10.1.1
  vec: -any
  attoparsec: -any
  tasty: ^>=1.2.3
  derp: -any
  QuickCheck: -any
  aeson: ^>=1.4.6.0
  fin: -any
maintainer: Oleg Grenrus <oleg.grenrus@iki.fi>
synopsis: Regular-expressions extended with fixpoints for context-free powers
changelog: ''
basic-deps:
  base: ! '>=4.3.0.0 && <4.15'
  parsec: ^>=3.1.12.0
  containers: ^>=0.4.0.0 || ^>=0.5.0.0 || ^>=0.6.0.1
  vec: ^>=0.3
  transformers: ^>=0.3.0.0 || ^>=0.4.2.0 || ^>=0.5.2.0
  QuickCheck: ^>=2.13.2
  fin: ^>=0.1.1
all-versions:
- '0.1'
author: Oleg Grenrus <oleg.grenrus@iki.fi>
latest: '0.1'
description-type: haddock
description: |-
  By extending regular expressions with (explicit) fixed points
  we can recognize context-free grammars.
license-name: BSD-3-Clause

Update from Hackage at 2020-03-09T11:58:34Z
Update from Hackage at 2020-03-09T11:58:34Z
