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

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

Closed-source, but free LALR(2) parser generator, accepts yacc input with some extensions.

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

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

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.

A parser generator which compiles attributed LL(1) grammars decorated with C semantic actions into recursive descent compilers.

Yet another Yacc, which accept yacc grammar and produce C++ template-based reentrant code. [Open Source, BSD license]

A version of yacc for Java rather than C. Documentation in German.

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