rere: Regular-expressions extended with fixpoints for context-free powers

[ bsd3, library, parsing ] [ Propose Tags ]

By extending regular expressions with (explicit) fixed points we can recognize context-free grammars.

Flags

Manual Flags

NameDescriptionDefault
rere-cfg

CFG functionality, adds dependency on fin and vec

Enabled
rere-intersection

Add intersection constructor. EXPERIMENTAL

Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1, 0.2, 0.2.0.1
Change log changelog.md
Dependencies base (>=4.3.0.0 && <4.20), containers (>=0.4.0.0 && <0.5 || >=0.5.0.0 && <0.6 || >=0.6.0.1 && <0.7), fin (>=0.2 && <0.4), parsec (>=3.1.12.0 && <3.2), QuickCheck (>=2.14.2 && <2.15), semigroups (>=0.18.5 && <0.21), transformers (>=0.3.0.0 && <0.4 || >=0.4.2.0 && <0.5 || >=0.5.2.0 && <0.6 || >=0.6.1.0 && <0.7), vec (>=0.4 && <0.6), void (>=0.7.3 && <0.8) [details]
License BSD-3-Clause
Author Oleg Grenrus <oleg.grenrus@iki.fi>
Maintainer Oleg Grenrus <oleg.grenrus@iki.fi>
Category Parsing
Source repo head: git clone https://github.com/phadej/rere.git
Uploaded by phadej at 2023-10-31T14:33:52Z
Distributions Arch:0.2.0.1, NixOS:0.2.0.1
Downloads 3542 total (36 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]