@hackage FormalGrammars0.3.1.0

(Context-free) grammars in formal language theory

Installation
In your cabal file:
Tested Compilers
- 7.10.3
Dependencies (18)
- ADPfusion >=0.5.2 && <0.5.3
- HaTeX >=3.16 && <4.0
- PrimitiveArray >=0.7.1 && <0.7.2
- ansi-wl-pprint >=0.6.7 && <0.6.8
- base >=4.7 && <5.0
- bytestring >=0.10 && <0.11
Dependents (10)
@hackage/WordAlignment, @hackage/Forestry, @hackage/Gene-CluEDO, @hackage/GrammarProducts, @hackage/ShortestPathProblems, @hackage/acme-everything, Show all…

examples

(off by default)

build the examples

debug

(off by default)

dump intermediate Core files

FormalGrammars: A DSL for formal languages in Haskell

The gADP homepage has a tutorial and example on how to write algorithms / grammars.

Ideas implemented here are described in a couple of papers:

Christian Hoener zu Siederdissen
Sneaking Around ConcatMap: Efficient Combinators for Dynamic Programming
2012, Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
paper preprint
Andrew Farmer, Christian Höner zu Siederdissen, and Andy Gill.
The HERMIT in the stream: fusing stream fusion’s concatMap
2014, Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation.
paper
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
paper
Christian Höner zu Siederdissen, Sonja J. Prohaska, and Peter F. Stadler
Algebraic Dynamic Programming over General Data Structures
2015, BMC Bioinformatics
preprint
Maik Riechert, Christian Höner zu Siederdissen, and Peter F. Stadler
Algebraic dynamic programming for multiple context-free languages
2015, submitted
preprint