Computers, Programming, Compilers, Lexer and Parser Generators
See Also:
- A small, flexible parsing engine with practically unlimited backtracking capability. [Commercial]
- An object-oriented parser generator. It also allows to perform the reverse operation (expanding), whereby the original input can be re-constituted or modified.
- 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
- 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
- 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 la
- Closed-source, but free LALR(2) parser generator, accepts yacc input with some extensions.
- 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.
- Grammatica is a free LL(k) parser generator (compiler compiler) for C# and Java. Support for automatic error recovery, and instant parsing is available.
- Describes how to build Flex using Microsoft Visual C++ 6.0 and .Net.
- Object-oriented rewrite of Lex and Yacc for C++, with automatic AST class generation, grammar inheritance, minimal state ELR(1) and technology. (Commercial package)
- A parser generator for Haskell.
- All about Lex, Yacc, Flex, and Bison: Overview, Online Documentation, Papers, Tools, Pointers
- object-oriented grammar definition language and integrated suite of visual tools that assist in building, testing and debugging parsers.
- TPG is a parser generator for Python. Given a simple attributed grammar, TPG produces a Python Recursive Descent Parser. It is simple and useful for small parsers of everyday life.
- A parser generator which compiles attributed LL(1) grammars decorated with C semantic actions into recursive descent compilers.
- 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
- 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.
- Very simple LALR(1) open-source parser generator. Outputs C, claims to produce faster parsers than yacc/bison.
- 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]
- 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.
- A simple to use translator generator.
- Yet another Yacc, which accept yacc grammar nad produce C++ template-based reentrant code. [Open Source, BSD license]
- 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 add
- Port of lex and yacc to Delphi 3. Base at port to Turbo Pascal.
- The version of BtYacc on siber.com suffers from a few minor, but annoying bugs. This is a page with patches.
- Tutorial in Lex and Yacc, tools that simplify compiler construction.
- 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.
- 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.
- 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++.
- 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
- 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 dif
- 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]
- A modified version of yacc that supports automatic backtracking and semantic disambiguation to parse ambiguous grammars. It also has syntactic sugar for inherited attributes.
- AnaGram 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 us
- 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.
- Flex/Bison ports to Win32, includes MAN pages, and email list for peer to peer support.
- 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.
- Almost as fast as Bison (for deterministic portions of input), but can parse any context-free grammar. [Open source, BSD]
- An object-oriented parser generator implemented in Java.
- A version of yacc for Java rather than C. Documentation in German.
- 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, L
- 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.
- 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.
- A powerful tool for the automatic generation of Visual Programming Environments (Windows 3.x/95/NT), generated Borland C++ 4.53 compatible source code.
- 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
- Generates fast tree parsers for cost-augmented tree grammars. A variant of iburg is used in the code generators for lcc.
- a scanner+LL(k = 1..Inf) parser generator for C++. Allows easy top-down description of grammars in an intuitive and extensible manner. Good generated code speed (as comared to GNU Flex/Bison). [Open source, GPL]
- (FTP) A retargeting of bison-1 and flex 2.3 to C++, able to generate classes. As with Bison and Flex, these two tools are independent but designed for mutual compatibility. Examples are provided to help in getting started.
- A parsergenerator, a simple c++ interpreter and an interactive debugger combined to a visual development environment, which analyzes, evaluates, converts texts immediately.
- 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]
- A Flex like scanner code generator, but it generates C++ scanner classes that are re-entrant and compatible with the newer standard of C++/STL. Multiple scanner classes and instances can co-exist in a program without tweaking of macros.
- 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]
- 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.
- 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 Li
|
|
|
