See also:

• Computers: Programming: Compilers: Attribute Grammar Systems  (4)
• Computers: Programming: Compilers: Compiler Construction Kits  (31)
• Computers: Programming: Metaprogramming: Source Code Generators  (16)

AnaGram  www.parsifalsoft.com Provides a powerful grammar notation, special features for maintenance of highly configurable parsers, visual parsing and unique interactive debugging tools, supporting thread-safe parsers. The program produces C/C++ parsers for use on any platform and runs under Win9x/NT. A free trial copy is available.

Bison++ and Flex++  ftp://lnx1.hrz.tu-darmstadt.de/pub/programming/languages/C++/tools/fle… A retargeting of bison-1 and flex 2.3 to C++ capable of generating classes. As with Bison and Flex these two tools are independent but designed for mutual compatibility. Examples are provided to help in getting started.

BtYacc: BackTracking Yacc  www.siber.com/btyacc A modified version of yacc that supports automatic backtracking and semantic disambiguation to parse ambiguous grammars. It also has syntactic sugar for inherited attributes.

BtYacc patches: BackTracking Yacc  www.vendian.org/mncharity/dir3/btyacc The version of BtYacc on siber.com suffers from a few minor, but annoying bugs. This is a page with patches.

ClearParse  www.clearjump.com/products/clearparse A small, flexible parsing engine with practically unlimited backtracking capability. [Commercial]

Coco/R compiler generator  www.ssw.uni-linz.ac.at/Research/Projects/Compiler.html Coco/R combines the functionality of the well-known UNIX tools lex and yacc, to form an extremely easy to use compiler generator that generates recursive descent parsers, their associated scanners, and (in some versions) a driver program, from attributed grammars (written using EBNF syntax with attributes and semantic actions) which conform to the restrictions imposed by LL(1) parsing (rather than LALR parsing, as allowed by yacc).

A Compact Guide to Lex and Yacc  epaperpress.com/lexandyacc/index.html Tutorial in Lex and Yacc, tools that simplify compiler construction.

CppCC (C++ Compiler Compiler)  cppcc.sourceforge.net a scanner+LL(k = 1..Inf) parser generator for C++. Allows easy top-down description of grammars in an intuitive and extensible manner. Good generated code speed (as comared to GNU Flex/Bison). [Open source, GPL]

Depot4 homepage  www.math.tu-dresden.de/wir/depot4 A simple to use translator generator.

EAG  www.cs.ru.nl/~kees/eag A compiler compiler that uses the Extended Affix Grammar (EAG) formalism which describes both the context free and context sensitive syntax of language. The compiler generates either a recognizer or a transducer or a translator or a syntax-directed editor for a described language.

Elkhound: A GLR Parser Generator  www.cs.berkeley.edu/~smcpeak/elkhound Almost as fast as Bison (for deterministic portions of input), but can parse any context-free grammar. [Open source, BSD]

GNU Bison  www.gnu.org/software/bison A general-purpose parser generator that converts a grammar description for an LALR context-free grammar into a C program to parse that grammar. [Open source, GPL]

GNU Flex  www.gnu.org/software/flex A fast lexical analyser generator. It is a tool for generating programs that perform pattern-matching on text. There are many applications for Flex, including writing compilers in conjunction with GNU Bison. [Open source, GPL]

GnuWin32  gnuwin32.sourceforge.net Various GNU tools and software for Win32 including ports of bison, byacc, and flex

GOLD Parser  www.devincook.com/goldparser A free parser generator. Unlike common compiler-compilers, the GOLD Parser does not require you to embed your grammar directly into your source code. Instead, the Builder analyzes the grammar description and saves the parse tables to a separate file. This file can be subsequently loaded by the actual parser engine and used. Currently the GOLD Parser Engine is available in Java, .NET and ActiveX. [Open Source]

GradSoft YaYacc  www.gradsoft.com.ua/eng/Products/YaYacc/yayacc.html Yet another Yacc, which accept yacc grammar nad produce C++ template-based reentrant code. [Open Source, BSD license]

Grammatica  grammatica.percederberg.net Grammatica is a free LL(k) parser generator (compiler compiler) for C# and Java. Support for automatic error recovery, and instant parsing is available.

Happy  haskell.cs.yale.edu/happy A parser generator for Haskell.

Hapy  hapy.sourceforge.net A runtime parser generator library. It generates parsers from BNF-like language grammars. Parsing scripting languages and communication protocol messages are typical use cases. [Public domain]

iburg, A Tree Parser Generator  code.google.com/p/iburg Generates fast tree parsers for cost-augmented tree grammars. A variant of iburg is used in the code generators for lcc.

IParse  www.iwriteiam.nl/MM.html An interpreting parser, meaning that it accepts as input a grammar and a source file to be parsed according to that grammar, producing an abstract program tree. Very compact implementation.

jay  www.cs.rit.edu/~ats/projects/lp/doc/jay/package-summary.html A version of yacc for Java rather than C. Documentation in German.

JB2CSharp  sourceforge.net/projects/jb2csharp A port of the Java-Bison/Flex software developed by the Serl project at the University of Colorado, Boulder. Parsers and lexers will be able to use C# actions. The open source .NET project Mono has requested the port, and here it is. [Open source, BSD License]

JS/CC Parser Generator  jscc.jmksf.com JS/CC is a LALR(1) parser and lexer generator for JavaScript/ECMAScript which is entirely written in JavaScript.

Kelbt: Backtracking LR Parsing  www.complang.org/kelbt Kelbt generates backtracking LALR(1) parsers. Whereas standard LALR(1) parser generators emit an error upon encountering a conflict in the parse tables, Kelbt forges onward, generating parsers which handle conflicts by backtracking at runtime. As Kelbt is able to generate a parser for any context-free grammar, it therefore implements a generalized parsing method.

Lapg  lapg.sourceforge.net The combined lexical analyzer and parser generator, which converts a description for a context-free LALR grammar into source file to parse the grammar. [Open source, GPL]

The LEMON Parser Generator  www.hwaci.com/sw/lemon Very simple LALR(1) open-source parser generator. Outputs C, claims to produce faster parsers than yacc/bison.

The LEX & YACC Page  dinosaur.compilertools.net All about Lex, Yacc, Flex, and Bison: Overview, Online Documentation, Papers, Tools, Pointers

Lex and Yacc for Delphi 3  www.17slon.com/gp/gp/tply.htm Port of lex and yacc to Delphi 3. Base at port to Turbo Pascal.

Lex/YACC (actually Flex and Bison)  www.monmouth.com/~wstreett/lex-yacc/lex-yacc.html Flex/Bison ports to Win32, includes MAN pages, and email list for peer to peer support.

LLgen parser generator  www.cs.vu.nl/~ceriel/LLgen.html A tool for generating an efficient recursive descent parser from an ELL(1) grammar. The grammar may be ambiguous or more general than ELL(1): there are both static and dynamic facilities to resolve the ambiguities.

LLOOP  www.ersa-france.com/lloop LLOOP generates C++ LL(1) parsers from EBNF grammars and allows a tight integration with object-oriented applications, based on a symbol/class mapping. The generated code can also perform the reverse operation (expanding), whereby the original input can be re-constituted or modified.

Meta-S Adaptive Context-Sensitive Parsing  www.thothic.com The Meta-S Type-0 adaptive context-sensitive parsing calculus and the Grammar Forge IDE for developing and testing Meta-S grammars.

oolex (object-oriented lexer)  www.inf.uos.de/alumni/bernd/oolex Approaches lexical analysis by basing the scanner strictly on the object-oriented paradigm. It can be extended without access to the source code in that symbol recognizers can be derived by inheritance and an executing scanner can be reconfigured for different contexts.

Oops  www.cs.rit.edu/~ats/projects/oops3/doc An object-oriented parser generator implemented in Java.

Pattern matching  www.dmitry-kazakov.de/match/match.htm Pattern matching in syntax analysis as influenced by SNOBOL4. The library distributed under the GNU Library General Public License provides for recursive patterns, various iterators and user-defined patterns along with bindings for Ada, K and R C/ANSI C/C++.

PCCTS Resources  www.polhode.com/pccts.html The primary source of maintenance releases for the PCCTS compiler construction tool set. PCCTS is an LL(k) recursive descent parser generator with semantic predicates and backtracking. It was developed by T.J. Parr.

ProGrammar  www.programmar.com/main.shtml object-oriented grammar definition language and integrated suite of visual tools that assist in building, testing and debugging parsers.

Ragel State Machine Compiler  www.complang.org/ragel Compiles FSMs from regular languages into executable C, C++, Objective-C or D code. The GPL'ed software can be used to create a parser for any language that is regular. Examples include parsing Unix mailbox files and general lexing tasks.

The RDP parser generator  www.dcs.rhbnc.ac.uk/research/languages/projects/rdp.html A parser generator which compiles attributed LL(1) grammars decorated with C semantic actions into recursive descent compilers.

re2c lexer generator  re2c.org re2c is a tool for writing fast and flexible lexers. A re2c generated scanner is usually 2-3 times faster than a flex based scanner, and its input model is much more flexible.

Rie  www.is.titech.ac.jp/~sassa/lab/rie-e.html This compiler frontend generation system based on an ECLR-attributed grammar is open source, written in C and may be regarded as an extension of Yacc/Bison.

The SLK Parser Generator  members.cavtel.net/slkpg Produces compact and efficient table-driven LL(k) parsers in C, C++, C#, and Java. Features include automated grammar transformations, clean EBNF syntax, backtracking, new LL(k) algorithms, and an uncomplicated API.

Soul  developer.berlios.de/projects/soul An object oriented recursive descent parser generator framework implemented using C++ operator overloading techniques. It is inspired by Spirit, but use only few template classes thus allowing more flexibility and fastest compilation time. [Open source, LGPL]

Spirit C++ Parser Framework  spirit.sourceforge.net An object oriented recursive descent parser generator framework implemented using template meta-programming techniques. Expression templates allow to approximate the syntax of Extended Backus Normal Form (EBNF) completely in C++.

Styx  www.speculate.de/styx A scanner and lalr(1) parser generator. It has features like automatic derivation of depth grammar, production of the abstract syntax tree including its C interface and preserves full source information to facilitate source-source translation.

TextTransformer  texttransformer.com A parsergenerator, a simple c++ interpreter and an interactive debugger combined to a visual development environment, which analyzes, evaluates, converts texts immediately.

Toy Parser Generator for Python  christophe.delord.free.fr/tpg TPG is a parser generator for Python. Given a simple attributed grammar, TPG produces a Python Recursive Descent Parser. It is simple and useful for small parsers for everyday use.

Turbo Pascal Lex/Yacc  www.musikwissenschaft.uni-mainz.de/~ag/tply a compiler generator for Turbo Pascal and compatibles. The package contains two programs, TP Lex and Yacc, which are approximately compatible with the UNIX utilities Lex and Yacc, but are written in and produce code for the Turbo Pascal programming language. The present version works with all recent flavours of Turbo/Borland Pascal, including Delphi and Free Pascal Compiler, a GPL'ed Turbo Pascal-compatible compiler which currently runs on DOS and Linux.

Visual BNF  www.intralogic.eu An LR(1) parser by Intralogic for Backus-Naur form and generating parse tables DLL's in .NET assembly.

VLDesk (Visual Language Desk)  www.scienzemfn.unisa.it/vldesk A powerful tool for the automatic generation of Visual Programming Environments. Its new reworked version of Visual Language Compiler-Compiler (VLCC).

Yacc++(R) and the Language Objects Library  world.std.com/~compres Object-oriented rewrite of Lex and Yacc for C++, with automatic AST class generation, grammar inheritance, minimal state ELR(1) and technology. (Commercial package)

YAY - Yet Another YACC  www.thinkage.ca/english/products/product-yay.shtml Closed-source, but free LALR(2) parser generator, accepts yacc input with some extensions.

YooLex (Yet another Object-Oriented Lex)  yoolex.sourceforge.net A Flex like scanner code generator, but it generates C++ scanner classes that are re-entrant and compatible with the newer standard of C++/STL. Multiple scanner classes and instances can co-exist in a program without tweaking of macros.