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

[ bsd3, language, library ] [ Propose Tags ]

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.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


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), 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:59Z
Distributions NixOS:0.1.1
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1768 total (10 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-05-29 [all 1 reports]