FormalGrammars-0.0.0.2: FormalGrammars.cabal

name:           FormalGrammars
version:        0.0.0.2
author:         Christian Hoener zu Siederdissen, 2013
copyright:      Christian Hoener zu Siederdissen, 2013
homepage:       http://www.tbi.univie.ac.at/~choener/gramprod/
maintainer:     choener@tbi.univie.ac.at
category:       Formal Languages, Bioinformatics
license:        GPL-3
license-file:   LICENSE
build-type:     Simple
stability:      experimental
cabal-version:  >= 1.6.0
synopsis:
                (Context-free) grammars in formal language theory
description:
                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
                @



Extra-Source-Files:
  changelog

library
  build-depends:
    base >= 4 && < 5 ,
    ADPfusion             >= 0.2.0.3  ,
    ansi-wl-pprint        >= 0.6      ,
    bytestring            >= 0.10     ,
    containers                        ,
    data-default          >= 0.5      ,
    HaTeX                             ,
    lens                  >= 3.9      ,
    mtl                               ,
    parsers               >= 0.9      ,
    repa                  >= 3.2      ,
    template-haskell                  ,
    text                              ,
    transformers          >= 0.3      ,
    trifecta              >= 1.2      ,
    unordered-containers  >= 0.2      ,
    vector                >= 0.10
  exposed-modules:
    FormalLanguage
    FormalLanguage.CFG
    FormalLanguage.CFG.Grammar
    FormalLanguage.CFG.Parser
    FormalLanguage.CFG.PrettyPrint
    FormalLanguage.CFG.PrettyPrint.ANSI
    FormalLanguage.CFG.PrettyPrint.Haskell
    FormalLanguage.CFG.PrettyPrint.LaTeX
    FormalLanguage.CFG.QuickCheck
    FormalLanguage.CFG.TH
  ghc-options:

-- A Simple pretty-printer for formal grammars.

executable GrammarPP
  build-depends:
    cmdargs == 0.10.*
  main-is:
    GrammarPP.hs

source-repository head
  type: git
  location: git://github.com/choener/FormalGrammars