# FormalGrammars: (Context-free) grammars in formal language theory

[ bioinformatics, formal-languages, gpl, library ] [ Propose Tags ]

Context-free grammars in formal language theory are sets of production rules, non-terminal and terminal symbols. This library provides basic data types and functions to manipulate such grammars.

Grammars can be defined in a small domain-specific language that is very close to typical CFG notation.

In addition, TemplateHaskell and QuasiQuoting functionality allow embedding thusly defined grammars in Haskell programs. ADPfusion then turns such a grammar into an efficient dynamic program. It is also possible to generate Haskell modules that contain the resulting grammar, signature and algebra product.

Alternatives are ansi- or LaTeX-based pretty-printing for users that want to implement their CFG in another language than Haskell.

Formal background can be found in two papers:  Christian Höner zu Siederdissen, Ivo L. Hofacker, and Peter F. Stadler Product Grammars for Alignment and Folding submitted  and  Christian Höner zu Siederdissen, Ivo L. Hofacker, and Peter F. Stadler How to Multiply Dynamic Programming Algorithms Brazilian Symposium on Bioinformatics (BSB 2013) Lecture Notes in Bioinformatics 8213, Springer, Heidelberg 

## Modules

• FormalLanguage
• FormalLanguage.CFG
• FormalLanguage.CFG.Grammar
• FormalLanguage.CFG.Parser
• FormalLanguage.CFG.PrettyPrint
• FormalLanguage.CFG.PrettyPrint.ANSI