|
|
Home: Programming: Compilers: Lexer and Parser Generators
Pages: 1 2 [>>]
- AnaGram: LALR Parser Generator
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 use on any platform and runs under Win9x/NT. A free trial copy is available.
(Rating: 0.00 Votes: 0)
Rate It
- BtYacc: BackTracking Yacc
A modified version of yacc that supports automatic backtracking and semantic disambiguation to parse ambiguous grammars. It also has syntactic sugar for inherited attributes.
(Rating: 0.00 Votes: 0)
Rate It
- ClearParse
A small, flexible parsing engine with practically unlimited backtracking capability. [Commercial]
(Rating: 0.00 Votes: 0)
Rate It
- Coco/R compiler generator
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).
(Rating: 0.00 Votes: 0)
Rate It
- CppCC (C++ Compiler Compiler)
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]
(Rating: 0.00 Votes: 0)
Rate It
- 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]
(Rating: 0.00 Votes: 0)
Rate It
- 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]
(Rating: 0.00 Votes: 0)
Rate It
- 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]
(Rating: 10.00 Votes: 1)
Rate It
- GradSoft YaYacc
Yet another Yacc, which accept yacc grammar nad produce C++ template-based reentrant code. [Open Source, BSD license]
(Rating: 0.00 Votes: 0)
Rate It
- Happy
A parser generator for Haskell.
(Rating: 0.00 Votes: 0)
Rate It
- 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.
(Rating: 0.00 Votes: 0)
Rate It
- jay
A version of yacc for Java rather than C. Documentation in German.
(Rating: 0.00 Votes: 0)
Rate It
- 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]
(Rating: 0.00 Votes: 0)
Rate It
- 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.
(Rating: 0.00 Votes: 0)
Rate It
- 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.
(Rating: 0.00 Votes: 0)
Rate It
- Oops
An object-oriented parser generator implemented in Java.
(Rating: 0.00 Votes: 0)
Rate It
- Parsers.org - LL(k) Parser Generator
SLK produces table-driven LL(k) parsers. It also includes the ability to do controlled backtracking. SLK is a very simple, black-box tool that produces compact and efficient parsing code in C or C++.
(Rating: 0.00 Votes: 0)
Rate It
- 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.
(Rating: 0.00 Votes: 0)
Rate It
Pages: 1 2 [>>]
|
|
|
Web Hosting
Inkjet Cartridges
Go to my PC
Coupons
Discount Software
|