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:
augmenting a grammar
calculating nullability
calculating reachability
calculating productivity
calculating first sets
calculating follow sets
calculating predict sets
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.
Properties
| Versions | 0.0.1, 0.0.1, 0.1.0, 0.1.1 |
|---|---|
| Change log | None available |
| Dependencies | array (>=0.5 && <0.6), base (>=4 && <5), containers (>=0.5 && <0.6), control-monad-omega (>=0.3 && <0.4), dlist (>=0.7 && <0.8), mtl (>=2.1 && <2.2), pretty (>=1.1 && <1.2), template-haskell [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2015 Eric Nedervold |
| Author | Eric Nedervold<nedervoldsoftware@gmail.com> |
| Maintainer | Eric Nedervold<nedervoldsoftware@gmail.com> |
| Category | Language |
| Home page | http://github.com/nedervold/context-free-grammar |
| Bug tracker | http://github.com/nedervold/context-free-grammar/issues |
| Source repo | head: git clone git://github.com/nedervold/context-free-grammar.git |
| Uploaded | by nedervold at 2015-03-15T03:54:49Z |
Modules
[Index]
Downloads
- context-free-grammar-0.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees