Elex
A multi-language scanner generator package which generates a scanner (i.e. a lexer) from a specification oriented around regular expressions. Elex differs from most other scanner generators in that it supports multiple languages.
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]
Flex for Microsoft Visual C++ 6.0 and .Net
Describes how to build Flex using Microsoft Visual C++ 6.0 and .Net.
GNU Bison
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]
GNU 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 compilers in conjunction with GNU Bison. [Open source, GPL]
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.
Results: Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next
Site
Menu 
