context-free-grammar: Basic algorithms on context-free grammars

[ bsd3, language, library ] [ Propose Tags ]

Basic algorithms on context-free grammars:

You may define your context-free grammar textually using parse or with the quasiquoter bnf (both in Data.Cfg.Bnf), or you may use any data structure you like after making it an instance of Cfg (found in Data.Cfg.Cfg).

Testing is very thin in this version; basically just sanity-checking.

Versions [faq] 0.0.1, 0.1.0
Change log changelog
Dependencies array (>=0.5), base (==4.*), containers (>=0.5), control-monad-omega (>=0.3), dlist (>=0.7), mtl (>=2.1), pretty (>=1.1), template-haskell [details]
License BSD-3-Clause
Copyright (c) 2015 Eric Nedervold
Author Eric Nedervold<>
Maintainer Eric Nedervold<>
Category Language
Home page
Bug tracker
Source repo head: git clone git://
Uploaded by nedervold at 2015-04-02T21:20:01Z
Distributions NixOS:0.1.0
Downloads 1379 total (7 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 2015-04-02 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees