# The context-free-grammar package

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.1.0 |
---|---|

Change log | changelog |

Dependencies | array (>=0.5), base (==4.*), containers (>=0.5), control-monad-omega (>=0.3), dlist (>=0.7), mtl (>=2.1), pretty (>=1.1), template-haskell [details] |

License | BSD3 |

Copyright | (c) 2015 Eric Nedervold |

Author | Eric Nedervold<nedervoldsoftware@gmail.com> |

Maintainer | Eric Nedervold<nedervoldsoftware@gmail.com> |

Stability | alpha |

Category | Language |

Home page | http://github.com/nedervold/context-free-grammar |

Bug tracker | http://github.com/nedervold/context-free-grammar/issues |

Source repository | head: git clone git://github.com/nedervold/context-free-grammar.git |

Uploaded | Thu Apr 2 21:20:01 UTC 2015 by nedervold |

Distributions | NixOS:0.1.0 |

Downloads | 304 total (5 in the last 30 days) |

Votes | |

Status | Docs available [build log] Last success reported on 2015-04-02 [all 1 reports] |

## Downloads

- context-free-grammar-0.1.0.tar.gz [browse] (Cabal source package)
- Package description (included in the package)