WANTED
JOBS
B2B
Our Exclusive Condition Reports Show
Every Detail!
SEE EXAMPLE
ADD
REPORT TO YOUR ITEM
Millions of page views every month!
Over 1800
Transportation Categories.
|
ODP++
- Computers: Programming: Compilers: Lexer and Parser Generators
(27 matches)
|
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.
|
|
url: www.cs.vu.nl/~ceriel/LLgen.html
|
|
Very simple LALR(1) opensource parser generator. Outputs C, claims to produce faster parsers than yacc/bison.
|
|
url: www.hwaci.com/sw/lemon/
|
|
Coco/R combines the functionality of the wellknown 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).
|
|
url: www.ssw.uni-linz.ac.at/Research/Projects/Compiler.....
|
|
A parser generator which compiles attributed LL(1) grammars decorated with C semantic actions into recursive descent compilers.
|
|
url: www.dcs.rhbnc.ac.uk/research/languages/projects/rd....
|
|
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 for everyday use.
|
|
url: christophe.delord.free.fr/tpg/
|
|
JS/CC is a LALR(1) parser and lexer generator for JavaScript/ECMAScript which is entirely written in JavaScript.
|
|
re2c is a tool for writing fast and flexible lexers. A re2c generated scanner is usually 23 times faster than a flex based scanner, and its input model is much more flexible.
|
|
Generates fast tree parsers for costaugmented tree grammars. A variant of iburg is used in the code generators for lcc.
|
|
url: code.google.com/p/iburg/
|
|
Produces compact and efficient tabledriven 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.
|
|
url: members.cox.net/slkpg/
|
|
A generalpurpose parser generator that converts a grammar description for an LALR contextfree grammar into a C program to parse that grammar. [Open source, GPL]
|
|
url: www.gnu.org/software/bison/
|
|
A simple to use translator generator.
|
|
url: www.math.tu-dresden.de/wir/depot4/
|
|
A parser generator for Haskell.
|
|
url: haskell.cs.yale.edu/happy/
|
|
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 language. The present version works with all recent flavours of Turbo/Borland Pascal, including Delphi and Free Pascal Compiler, a GPL''ed Turbo Pascalcompatible compiler which currently runs on DOS and Linux.
|
|
url: www.musikwissenschaft.uni-mainz.de/~ag/tply/
|
|
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.
|
|
url: www.polhode.com/pccts.html
|
|
a scanner+LL(k = 1..Inf) parser generator for C++. Allows easy topdown description of grammars in an intuitive and extensible manner. Good generated code speed (as comared to GNU Flex/Bison). [Open source, GPL]
|
|
url: cppcc.sourceforge.net/
|
|
A Flex like scanner code generator, but it generates C++ scanner classes that are reentrant and compatible with the newer standard of C++/STL. Multiple scanner classes and instances can coexist in a program without tweaking of macros.
|
|
url: yoolex.sourceforge.net/
|
|
An object oriented recursive descent parser generator framework implemented using template metaprogramming techniques. Expression templates allow to approximate the syntax of Extended Backus Normal Form (EBNF) completely in C++.
|
|
url: spirit.sourceforge.net/
|
|
Closedsource, but free LALR(2) parser generator, accepts yacc input with some extensions.
|
|
url: www.thinkage.ca/english/products/product-yay.shtml
|
|
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 facilitate sourcesource translation.
|
|
url: www.speculate.de/styx/
|
|
A free parser generator. Unlike common compilercompilers, 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]
|
|
url: www.devincook.com/goldparser/
|
Next
|
|
|
Powered by ODP++
|
