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

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.


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.


Versions0.0.1, 0.0.1, 0.1.0
Change logNone available
Dependenciesarray (==0.5.*), base (==4.*), containers (==0.5.*), control-monad-omega (==0.3.*), dlist (==0.7.*), mtl (==2.1.*), pretty (==1.1.*), template-haskell [details]
Copyright(c) 2015 Eric Nedervold
AuthorEric Nedervold<>
MaintainerEric Nedervold<>
Home page
Bug tracker
Source repositoryhead: git clone git://
UploadedSun Mar 15 03:54:49 UTC 2015 by nedervold




Maintainers' corner

For package maintainers and hackage trustees