GOLD Parser
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]
GradSoft YaYacc
Yet another Yacc, which accept yacc grammar nad produce C++ template-based reentrant code. [Open Source, BSD license]
Grammatica
Grammatica is a free LL(k) parser generator (compiler compiler) for C# and Java. Support for automatic error recovery, and instant parsing is available.
Happy
A parser generator for Haskell.
Hapy
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]
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.
IParse
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.
jay
A version of yacc for Java rather than C. Documentation in German.
JB2CSharp
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]
The LEMON Parser Generator
Very simple LALR(1) open-source parser generator. Outputs C, claims to produce faster parsers than yacc/bison.
The LEX & YACC Page
All about Lex, Yacc, Flex, and Bison: Overview, Online Documentation, Papers, Tools, Pointers
Lex and Yacc for Delphi 3
Port of lex and yacc to Delphi 3. Base at port to Turbo Pascal.
Lex/YACC (actually Flex and Bison)
Flex/Bison ports to Win32, includes MAN pages, and email list for peer to peer support.
LLgen parser generator
A tool for generating an efficient recursive descent parser from an ELL(1) grammar. The grammar may be ambiguous or more general than ELL(1): there are both static and dynamic facilities to resolve the ambiguities.
LLOOP
An object-oriented parser generator. It also allows to perform the reverse operation (expanding), whereby the original input can be re-constituted or modified.
LRgen Lexer & Parser Generator from Parsetec
LRgen is an LALR parser generator and LALR lexer generator, featuring TBNF grammar notation and LALR lexers for parser and compiler development. The lexers and parsers both use the 4MPT technology.
oolex (object-oriented lexer)
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 different contexts.
Oops
An object-oriented parser generator implemented in Java.
Pattern matching
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++.
PCCTS Resources and
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.
Results: Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next
Site
Menu 
