Package0.2.0.2Parsing
rere
Regular-expressions extended with fixpoints for context-free powers
- Version0.2.0.2
- CategoryParsing
- LicenceBSD-3-Clause
- AuthorOleg Grenrus <oleg.grenrus@iki.fi>
- MaintainerArtem Pelenitsyn <a@pelenitsyn.top>
- Pinned byhackage rere 0.2.0.2
- Sourcehackage.haskell.org/package/rere-0.2.0.2
Modules
13 modules- RERE32Regular-expressions extended with fixpoints
- RERE.Absurd2Absurd i.e. not inhabited types.
- RERE.CFG3Context free grammars, where
- RERE.CharClasses3Charactor classes.
- RERE.CharSet16Sets of characters. Using this is more efficint than RE.Type.Alt:ng individual characters.
- RERE.Examples20Various examples of using rere,
- RERE.Examples.JSON5JSON grammar example.
- RERE.Gen1Using RE to generate example Strings.
- RERE.LaTeX3Pretty-print structures as LaTeX code. Note: doesn't work with MathJax. Requires rere.sty distributed with this package, or definition of
- RERE.Ref3Regular expression with explicit sharing. RR is an opaque type, to maintain the invariants.
- RERE.ST3Regular expression with explicit sharing. RST is an opaque type, to maintain the invariants.
- RERE.Type15Regular-expression with fixed points.
- RERE.Var5Variables, de Bruijn indices and names.
Description
By extending regular expressions with (explicit) fixed points we can recognize context-free grammars.
Depends on
7 packages- QuickCheck-2.15.0.1in this set
- base-4.20.2.0with GHC
- containers-0.7with GHC
- fin-0.3.2in this set
- parsec-3.1.18.0with GHC
- transformers-0.6.1.1with GHC
- vec-0.5.1in this set
Used by in this set · 0
Nothing in this set depends on it.