antlrc-examples.cabal

Name:                antlrc-examples
Version:             0.0.1
Synopsis:            Examples for the Haskell binding to the ANTLR parser generator C runtime library.
Description:         ANTLR is a LL(*) parser generator that supports semantic predicates,
                     syntax predicates and backtracking.  antlrc provides a Haskell interface
                     to the ANTLR C runtime.  ANTLR generates the lexer and/or parser C
                     code, which can call Haskell code for things such as: semantic predicates
                     which may look up entries in the symbol table, creating symbol table entries,
                     type checking, creating abstract syntax trees, etc.
                     .
                     The C source code for the lexer and/or parser are generated from the
                     ANTLR grammar file, which by convention has a .g filename extension.
                     .
                     The generated C files can be compiled as C or C++.
                     .
                     The main entry point to the program can be written in C or C++, which
                     calls the generated parser and lexer.  The parser can make calls to
                     Haskell to build the AST and symbol table, and to implement
                     dis-ambiguating semantic predicates if necessary (for context sensitive
                     languages).
                     .
                     The ANTLR parser generator is written in Java.  It is necessary to use
                     the same ANTLR parser generator version as the ANTLR C runtime version.
                     antlrc is tested with ANTLR 3.2 and libantlr3c 3.2.
                     .
                     In addition to creating the GrammarLexer.c and GrammarParser.c files,
                     the antlr parser generator creates a Grammar.tokens file which contains
                     a list of lexer token identifier numbers and any associated name that is
                     is specified in the tokens section of the Grammar.g file.  The
                     antlrcmkenums is run specifying the input Grammar.tokens file, and generates
                     a GrammarTokens.h C/C++ header file containing an enum with enum members for
                     those tokens that have user specified names.  This enum is then processed by
                     c2hs to create a Haskell enum for the token identifiers.
                     .
                     The Haskell bindings to the ANTLR parser generator is on github:
                     .
                     <https://github.com/markwright/antlrc>
                     .
                     Documentation for the ANTLR C runtime library is at:
                     .
                     <http://www.antlr.org/wiki/display/ANTLR3/ANTLR3+Code+Generation+-+C>
                     .
                     Documentation for the ANTLR parser generator is at:
                     .
                     <http://www.antlr.org/wiki/display/ANTLR3/ANTLR+v3+documentation>
                     .
Homepage:            https://github.com/markwright/antlrc-examples
License:             BSD3
License-file:        LICENSE
Author:              Mark Wright
Maintainer:          markwright@internode.on.net
Stability:           experimental
Copyright:           Copyright (c) Mark Wright 2010-2011. All rights reserved.
Category:            Parsing
Build-type:          Simple
Extra-source-files:  README
Cabal-version:       >= 1.8.0.4
build-depends:       base >= 3 && <5,
                     c2hs >= 0.16
source-repository    head
  type:              git
  location:          git://github.com/markwright/antlrc-examples.git

Executable           fulluntyped
  Build-tools:       c2hs >= 0.16
  hs-source-dirs:    src/tapl/fulluntyped
  Extensions:        ForeignFunctionInterface
  main-is:           Main.hs
  Build-depends:     antlrc,
                     base >= 3 && <5,
                     haskell98