context-free-grammar: Basic algorithms on context-free grammars
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.
Modules
[Index]
Downloads
- context-free-grammar-0.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 0.0.1, 0.1.0, 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), 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-04-02T21:20:01Z |
Distributions | NixOS:0.1.1 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 1810 total (20 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2015-04-02 [all 1 reports] |