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 [RSS] [faq] 0.1.0, 0.1.1, 0.1.2, 0.1.3, 0.1.3.1, 0.1.3.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.8), profunctors (>=4.4 && <5.7), semigroups (>=0.16 && <0.21), tagged (>=0.7 && <0.9), template-haskell (>=2.9 && <2.18), text (==1.2.*), transformers (>=0.3 && <0.6) [details]
License BSD-3-Clause
Author Yevhen Smolanka, Sergey Vinokurov
Maintainer Yevhen Smolanka <ys@polymorphic.me>
Revised Revision 1 made by EugeneSmolanka at 2021-12-03T21:51:59Z
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 2021-10-10T10:18:26Z
Distributions LTSHaskell:0.1.3.2, NixOS:0.1.3, Stackage:0.1.3.2
Downloads 2444 total (11 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2021-10-10 [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

Candidates


Readme for invertible-grammar-0.1.3.2

[back to package description]

invertible-grammar

Framework to build invertible parsing combinator libraries.

See sexp-grammar.