Grammar products and higher-dimensional grammars

Latest on Hackage:

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow to host generated Haddocks.

GPL-3 licensed by Christian Hoener zu Siederdissen, 2013-2017

GrammarProducts: Products of formal languages

Build Status

generalized Algebraic Dynamic Programming Homepage

An abstract algebra for linear and context-free grammars.

  1. Christian Höner zu Siederdissen, Ivo L. Hofacker, and Peter F. Stadler.
    Product Grammars for Alignment and Folding
    2014, IEEE/ACM Transactions on Computational Biology and Bioinformatics. 99
  2. Christian Höner zu Siederdissen, Ivo L. Hofacker, and Peter F. Stadler.
    How to Multiply Dynamic Programming Algorithms
    2013, Brazilian Symposium on Bioinformatics (BSB 2013)
    Lecture Notes in Bioinformatics 8213. Springer, Heidelberg.
    paper preprint


Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany


  • removed upper bounds

  • This new version builds with both FormalGrammars 0.2 and 0.3. However, the example requires 0.3

  • FormalGrammars ==
  • relaxed upper bounds

  • FormalGrammars == 0.2.1.x with revamped indexed rules system
  • new travis.yml

  • major version bump
  • updated dependencies
  • using ADPfusion now
  • rewritten as ‘plugin’ of FormalGrammars
  • QQ here combines FormalGrammars + GrammarProducts
  • travis-ci integration

  • fixed dependencies

  • the parser now comes with a very ad-hoc TN and Symb renaming system for products

  • Version bump for new TH stuff

  • Products of linear and context-free grammars
comments powered byDisqus