Computers

Generates fast tree parsers for cost-augmented tree grammars. A variant of iburg is used in the code generators for lcc.

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.

An easy-to-use parser (and lexical) generator for Java, using an extended Parsing Expression Grammar framework and with advanced packrat parsing ability.

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.

The version of BtYacc on siber.com suffers from a few minor, but annoying bugs. This is a page with patches.

A modified version of yacc that supports automatic backtracking and semantic disambiguation to parse ambiguous grammars. It also has syntactic sugar for inherited attributes.

A small, flexible parsing engine with practically unlimited backtracking capability. [Open Source]

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

Tutorial in Lex and Yacc, tools that simplify compiler construction.

A scanner+LL(k = 1..Inf) parser generator for C++. Allows easy top-down description of grammars in an intuitive and extensible manner. [Open source, GPL]

Almost as fast as Bison (for deterministic portions of input) but can parse any context-free grammar. [Open source (BSD)]

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]

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]

Various GNU tools and software for Win32 including ports of bison, byacc, and flex.

A free parser generator. Unlike common compiler-compilers, it does not require to embed grammar directly into 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. [Open Source]

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

Takes BNF specification of a grammar and produces a Haskell module containing the parser for that grammar.

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]

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.

IronMeta is an implementation of Alessandro Warth's OMeta metaprogramming system in C#. It provides a packrat parser generator that generates parsers for Parsing Expression Grammars that operate on arbitrary streams of objects.

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

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 is a LALR(1) parser and lexer generator for JavaScript/ECMAScript which is entirely written in JavaScript.

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]

Very simple LALR(1) open-source parser generator. Outputs C, claims to produce faster parsers than yacc/bison.

Port of lex and yacc to Delphi 3. Base at port to Turbo Pascal.

Generation of run-time lexical analysers, increasing flexibility through exposed state machine generated from a lex specification. Compiles under Unix using GCC 4.0.1 and as Visual C++.

A model-based parser generator that decouples language specification from language processing, avoiding some of the problems caused by grammar-driven parser generators.

NLT is a free, open-source C# lexer and parser suite containing GLR parser, enabling parsing of ambiguous grammars. Grammar can be defined directly in code or in separate file (lex/yacc-like) for included generator.

An object-oriented parser generator implemented in Java.

A parser generator for C++. Currently supporting LALR(1), it may eventually possibly IELR and LALR(k).

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

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.

A parser generator for JavaScript based on the parsing expression grammar formalism.

An infinite-lookahead parser generator for context-dependent grammars which generates ANSI C code. Specification scripts are in very extended BNF with inherited and synthetic attributes allowed. Converter for yacc scripts is available as well as documentation and related papers.

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.

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

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.

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.

Interprets parse tables generated from an SDF2 syntax definition. Scannerless means that no scanner is used to tokenize the input stream; the parse table contains enough information for both the lexical and the context-free syntax. [Open source (LGPL)]

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

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

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

The tool allows visual design of lexers and parsers for use in C, C++, Java, Delphi and Visual Basic applications under Windows 95/98/NT/2000, SunOS, Linux and with XML support from version 4.0.

Object-oriented rewrite of Lex and Yacc for C++, with automatic AST class generation, grammar inheritance, minimal state ELR(1) and technology. (Commercial package)

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.