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.
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 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.
ProGrammar
object-oriented grammar definition language and integrated suite of visual tools that assist in building, testing and debugging parsers.
Ragel State Machine Compiler
Compiles FSM from regular languages into executable C 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.
The RDP parser generator
A parser generator which compiles attributed LL(1) grammars decorated with C semantic actions into recursive descent compilers.
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 much more flexible.
Rie
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.
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; the parse table contains enough information for both the lexical and the context-free syntax. [Open source, LGPL]
The SLK Parser Generator
Produces compact and efficient table-driven LL(k) parsers in C, C++, C#, and Java. Features include automated grammar transformations, clean EBNF syntax, backtracking, new LL(k) algorithms, and an uncomplicated API.
Soul
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]
Spirit C++ Parser Framework
An object oriented recursive descent parser generator framework implemented using template meta-programming techniques. Expression templates allow to approximate the syntax of Extended Backus Normal Form (EBNF) completely in C++.
Results: Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next
Site
Menu 
