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.

The Meta-S Type-0 adaptive context-sensitive parsing calculus and the Grammar Forge IDE for developing and testing Meta-S grammars.

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

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 c...

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. ...

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 ...

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.

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.

An object-oriented parser generator implemented in Java.

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.