Invertible parsing combinators framework

Version on this page:0.1.2@rev:1
LTS Haskell 12.26:0.1.1
Stackage Nightly 2019-07-22:0.1.2@rev:2
Latest on Hackage:0.1.2@rev:2

See all snapshots invertible-grammar appears in

BSD-3-Clause licensed by Eugene Smolanka, Sergey Vinokurov
Maintained by Eugene Smolanka

Module documentation for 0.1.2

This version can be pinned in stack with:invertible-grammar-0.1.2@sha256:b441e0a1c2541891ed06d3d43f1598d292b352f1549b6832ffab166251bc60e2,1670


Framework to build invertible parsing combinator libraries.

See sexp-grammar.

comments powered byDisqus