58 sites in Lexer and Parser Generators
AnaGram
Save
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.
http://www.parsifalsoft.com/
Coco/R compiler generator
Save
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).
http://www.ssw.uni-linz.ac.at/Researc...
EAG
Save
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.
http://www.cs.ru.nl/~kees/eag/
GNU Flex
Save
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]
http://www.gnu.org/software/flex/
GOLD Parser
Save
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]
http://www.devincook.com/goldparser/
Hapy
Save
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]
http://hapy.sourceforge.net/
IParse
Save
An interpretting parser, meaning that it accept on the input a grammar and a source file which should be parsed according to that grammar, and produces an abstract program tree from this. Very compact implementation.
http://www.iwriteiam.nl/MM.html
JB2CSharp
Save
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]
http://sourceforge.net/projects/jb2cs...
LLOOP
Save
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.
http://www.ersa-france.com/lloop/
Lapg
Save
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]
http://lapg.sourceforge.net/
PRECC - A PREttier Compiler-Compiler
Save
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. Scripts can be compiled in separate modules and later linked together, and meta-production rules are allowed. Converter for yacc scripts is available.
http://www.afm.sbu.ac.uk/precc/
Pattern matching
Save
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&R C/ANSI C/C++.
http://www.dmitry-kazakov.de/match/ma...
Soul
Save
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]
http://developer.berlios.de/projects/...
Styx
Save
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 faciliate source-source translation.
http://www.speculate.de/styx/
The SYNTAX System
Save
A set of tools for the design and implementation of the front-end part of translators. The SYNTAX tools allow the generation of analyzers and the compilation of source texts with those analyzers. This has all the capabilities of lex and yacc plus some additional features including better error processing, i.e. an automatic (and tunable) error repair and recovery mechanism.
http://www-rocq.inria.fr/oscar/www/sy...
Turbo Pascal Lex/Yacc
Save
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.
http://www.musikwissenschaft.uni-main...
Visual Parse++ 4.0
Save
The tool allows visual design of lexers and parsers for use in C++, Java, Delphi and Visual Basic applications under UNIX, Linux and Windows/NT. New to version 4.0 is support for XML, XPath, XSLT, XPointer, XQL, DTD and Namespaces.
http://www.sand-stone.com/
re2c lexer generator
Save
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.
http://re2c.org
See also