Lexer and Parser
for nearly all phases of a compiler:
REX, a scanner generator;
the parser generators LALR and ELL;
AST, a generator for abstract syntax trees;
AG, an attribute evaluator generator;
PUMA, a transformation tool based on pattern matching.
Eli offers solutions for most of the tasks that must be carried out
to implement a language.
They range from structural analysis
through analysis of names, types and values, to storage of
translation data structures and production of the target text.
An integrated system that covers the full spectrum of compiler construction.
Gentle supports language recognition, definition of abstract syntax trees,
construction of tree walkers based on pattern matching,
optimal code selection for microprocessors,
and simple unparsing for source-to-source translation.
PCCTS is a public domain tool set that aids in the construction of
language recognizers and translators;
it is comprised of three tools:
ANTLR, a parser generator that functions like yacc,
but is based on predicated LL(k);
DLG, a simple lexical analyzer (scanner) generator in the spirit of lex.
SORCERER, a tree-parser generator that allows the programmer to specify
the structure of a tree data-structure via a grammar.
COPYRIGHT © 1996-2006
GERMAN NATIONAL RESEARCH CENTER FOR INFORMATION TECHNOLOGY
FRAUNHOFER INSTITUTE FOR COMPUTER ARCHITECTURE AND SOFTWARE TECHNOLOGY