GNU Compiler Collection

iburg, A Tree Parser Generator iburg, A Tree Parser Generator- Generates fast tree parsers for cost-augmented tree grammars. A variant of iburg is used in the code generators for lcc. ModelCC Model-Driven Parser Generator ModelCC Model-Driven Parser Generator- A model-based parser generator that decouples language specification from language processing, avoiding some of the problems caused by gramm… PEG.js PEG.js- A parser generator for JavaScript based on the parsing expression grammar formalism. SLK Parser Generator SLK Parser Generator- Produces compact and efficient LR(k) or LL(k) parsers in C, C++, C# and Java. Features include automated grammar transformations, clean EBNF syntax, optional… Spirit C++ Parser Framework Spirit C++ Parser Framework- Set of C++ libraries for parsing and output generation implemented as Domain Specific Embedded Languages (DSEL) using Expression templates and Templat… JS/CC Parser Generator JS/CC Parser Generator- JS/CC is a LALR(1) parser and lexer generator for JavaScript/ECMAScript which is entirely written in JavaScript. Flex 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 compil… Ragel State Machine Compiler Ragel State Machine Compiler- 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 langua… JavaCC JavaCC- Java Compiler Compiler reads a grammar specification and converts it to a Java program that can recognize matches to the grammar. In addition to the parser generator itsel… VisualLangLab: A Visual Parser-Generator IDE VisualLangLab: A Visual Parser-Generator IDE- A visual parser-generator IDE for developing parsers without any textual grammar specification (BNF/EBNF/PEG), script or code. Parsertl: The Modular Parser Generator Parsertl: The Modular Parser Generator- A parser generator for C++. Currently supporting LALR(1), it may eventually possibly IELR and LALR(k). Soul Soul- 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 … Naive Language Tools Naive Language Tools- 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 o… AustenX Parser Generator AustenX Parser Generator- An easy-to-use parser (and lexical) generator for Java, using an extended Parsing Expression Grammar framework and with advanced packrat parsing ability. IronMeta IronMeta- IronMeta is an implementation of Alessandro Warth's OMeta metaprogramming system in C#. It provides a packrat parser generator that generates parsers for Parsing Express… Sweet Parser Sweet Parser- A C++ parser library that generates LALR(1) parsers from EBNF grammars. Elkhound: A GLR Parser Generator Elkhound: A GLR Parser Generator- Almost as fast as Bison (for deterministic portions of input) but can parse any context-free grammar. [Open source (BSD)] Toy Parser Generator Toy Parser Generator- TPG is a parser generator for Python. Given a simple attributed grammar, it produces a Recursive Descent Parser. GOLD Parser GOLD Parser- 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 d… GradSoft YaYacc GradSoft YaYacc- Yet another Yacc, which accept yacc grammar and produce C++ template-based reentrant code. [Open Source, BSD license] LRSTAR LRSTAR- LALR parser generator and lexer generator producing fast applications in C/C++. lexertl: The Modular Lexical Analyser Generator lexertl: The Modular Lexical Analyser Generator- Generation of run-time lexical analysers, increasing flexibility through exposed state machine generated from a lex specification.… PRECC - A PREttier Compiler-Compiler PRECC - A PREttier Compiler-Compiler- An infinite-lookahead parser generator for context-dependent grammars which generates ANSI C code. Specification scripts are in very extended… Visual Parse++ Visual Parse++- 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 wit… SGLR: a Scannerless Generalized LR parser SGLR: a Scannerless Generalized LR parser- Interprets parse tables generated from an SDF2 syntax definition. Scannerless means that no scanner is used to tokenize the input stream… ClearParse ClearParse- A small, flexible parsing engine with practically unlimited backtracking capability. [Open Source] Happy Parser Generator for Haskell Happy Parser Generator for Haskell- Takes BNF specification of a grammar and produces a Haskell module containing the parser for that grammar. re2c lexer generator re2c lexer generator- 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 m… jay jay- A version of yacc for Java rather than C. Documentation in German. Oops Oops- An object-oriented parser generator implemented in Java.