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.

[maintain] [Publish]

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 0.0.1, 0.1.0, 0.1.1, 0.1.1
Change log changelog
Dependencies array (>=0.5), base (>=4 && <5), containers (>=0.5), control-monad-omega (>=0.3), dlist (>=0.7), mtl (>=2.1), pretty (>=1.1), semigroups, template-haskell [details]
License BSD-3-Clause
Copyright (c) 2015, 2021 Eric Nedervold, 2021 Andreas Abel.
Author Eric Nedervold<>
Maintainer Eric Nedervold<>
Category Language
Home page
Bug tracker
Source repo head: git clone git://
Uploaded by nedervold at 2021-05-29T04:28:37Z


[Index] [Quick Jump]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees