invertible-grammar: Invertible parsing combinators framework

[ bsd3, language, library ] [ Propose Tags ]

Grammar combinator framework to build invertible parsing libraries for concrete syntax.


[Skip to Readme]
Versions [faq] 0.1.0, 0.1.1, 0.1.2
Dependencies base (>=4.8 && <5.0), bifunctors (>=4.2 && <5.6), containers (>=0.5.5 && <0.7), mtl (>=2.1 && <2.3), prettyprinter (>=1 && <1.3), profunctors (>=4.4 && <5.4), semigroups (>=0.16 && <0.19), tagged (>=0.7 && <0.9), template-haskell (>=2.9 && <2.15), text (==1.2.*), transformers (>=0.3 && <0.6) [details]
License BSD-3-Clause
Author Eugene Smolanka, Sergey Vinokurov
Maintainer Eugene Smolanka <esmolanka@gmail.com>
Revised Revision 1 made by HerbertValerioRiedel at Sat Feb 9 17:36:03 UTC 2019
Category Language
Home page https://github.com/esmolanka/invertible-grammar
Source repo head: git clone https://github.com/esmolanka/invertible-grammar
Uploaded by EugeneSmolanka at Fri Feb 8 21:08:16 UTC 2019
Distributions NixOS:0.1.2
Downloads 481 total (28 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-02-08 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees


Readme for invertible-grammar-0.1.2

[back to package description]

invertible-grammar

Framework to build invertible parsing combinator libraries.

See sexp-grammar.