Hackage :: [Package]

antlrc: Haskell binding to the ANTLR parser generator C runtime library.

[ bsd3, library, parsing, program ] [ Propose Tags ]

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.

Examples are provided on github:

https://github.com/markwright/antlrc-examples

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

[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.0.1, 0.0.2
Dependencies base (>=3 && <5), bytestring, enumerator, haskell98, regex-posix [details]
License BSD-3-Clause
Copyright Copyright (c) Mark Wright 2010-2011. All rights reserved.
Author Mark Wright
Maintainer markwright@internode.on.net
Category Parsing
Home page https://github.com/markwright/antlrc
Source repo head: git clone git://github.com/markwright/antlrc.git
Uploaded by MarkWright at 2011-01-20T11:03:22Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Executables antlrcmkenums
Downloads 1990 total (7 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for antlrc-0.0.2

[back to package description] 
Haskell binding to the ANTLR parser generator C runtime library

http://www.antlr.org/wiki/display/ANTLR3/ANTLR3+Code+Generation+-+C

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.

Examples are provided on github:

https://github.com/markwright/antlrc-examples

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

ANTLR C runtime library dependency:
-----------------------------------

The latest released libanltr3c run-time library should work
(libantlr3c 3.2 at the time of writing):

http://antlr.org/download/C

ANTLR Java parser generator
---------------------------

This Haskell antlrc package does not depend on the ANTLR Java parser generator.

The ANTLR Java parser generator is required to build examples
and programs that use the ANTLR C runtime and the Haskell antlrc
binding to the ANTLR C runtime.

http://antlr.org/download.html