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]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0, 0.1.1, 0.1.2, 0.1.3, 0.1.3.1, 0.1.3.2, 0.1.3.3
Dependencies base (>=4.8 && <5.0), bifunctors (>=4.2 && <5.6), containers (>=0.5.5 && <0.7), mtl (>=2.1 && <2.4), prettyprinter (>=1 && <1.8), profunctors (>=4.4 && <5.7), semigroups (>=0.16 && <0.21), tagged (>=0.7 && <0.9), template-haskell (>=2.9 && <2.20), text (>=1.2 && <1.3 || >=2.0 && <2.1), transformers (>=0.3 && <0.6) [details]
License BSD-3-Clause
Author Yevhen Smolanka, Sergey Vinokurov
Maintainer Yevhen Smolanka <ys@polymorphic.me>
Category Language
Home page https://github.com/esmolanka/invertible-grammar
Source repo head: git clone https://github.com/esmolanka/sexp-grammar
Uploaded by EugeneSmolanka at 2022-09-27T21:07:45Z
Distributions LTSHaskell:0.1.3.3, NixOS:0.1.3.3, Stackage:0.1.3.3
Reverse Dependencies 1 direct, 3 indirect [details]
Downloads 2856 total (32 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2022-09-27 [all 1 reports]

Readme for invertible-grammar-0.1.3.3

[back to package description]

invertible-grammar

Framework to build invertible parsing combinator libraries.

See sexp-grammar.