Search Results for "lalr"

An LALR(1) and LALR(*) parser generator. Generates parsers up to 140 times the speed of ANTLR parsers, and 1/10th of the size or smaller. Contains the DFA lexer generator, 80% faster than flex lexers. Works with Visual Studio C++. Contains 27 grammars. Parsers build a symbol table. Parsers construct an abstract-syntax tree (AST).

UniCC (UNIversal Compiler-Compiler) compiles an augmented grammar definition into a program source code that parses the described grammar. Because UniCC is intended to be target-language independent, it can be configured via template definition files to emit parsers in almost any programming language. UniCC comes with out of the box support for the programming languages C, C++, Python (both 2.x and 3.x) and JavaScript. Parsers can also be generated into JSON and XML.

C++ LALR parser generator

Hyacc is an efficient and practical Yacc/Bison-compatible full LR(1)/LALR(1)/LR(0) and partial LR(k) parser generator in ANSI C based on Knuth and Pager's LR(1) algorithms. Generated parser can be used in open-source or commercial software.

JS/CC is a parser generator for JavaScript/ECMAScript, which is entirely written in ECMAScript itself. It produces LALR(1) parsers with integrated lexical analyzers. JS/CC can run as a website or be invoked from a console, and runs on several platforms.

LALR(1) lexer and parser generator Java library.

qtBisonC++ is a general-purpose parser generator that converts a grammar description for an LALR(1) context-free grammar into a QT C++ program to parse that grammar. qtBisonC++ reads the given input files for a description of a scanner to generate. The description is in the form of grammar in Backus-Naur Form (BNF), called rules. qtBisonC++ generates as output a C++ source and include file, `lexyy.cpp` and `lexyy.h`, which defines a class `lexyy'.

Beaver is a LALR compiler compiler for Java that uses several techniques to generate very fast parsers.

Lemonade 0.01 An Lalr Parser Generator for "D" (www.digitalmars.com) Based on Lemon 1.0 Ref: http://www.hwaci.com/sw/lemon/

The LALR parser generator (LPG) is a tool for developing scanners and parsers written in Java, C++ or C. Input is specified by BNF rules. LPG supports backtracking (to resolve ambiguity), automatic AST generation and grammar inheritance.

Lapg is the combined lexical analyzer and parser generator, which converts a description for a context-free LALR grammar into source file to parse the grammar. Generates code for Java, Javascript, C, C++ and C#.

Lemon++ is clone of the Lemon LALR parser generator, written by Dr. Richard Hipp ( http://www.hwaci.com/sw/lemon/ ). It adds support for C++, for example user is not limited to POD types.

A collection of tools for the SETL Programming Language, including a LALR parser generator and lexical scanner generator.

ParGeL is an LALR(k) parser generator, which allows creation of inheritable parsers in runtime and compile time environments. ParGeL is written 100% in Java.

Complete LALR(1) parser generator and engine (like BISON or YACC) but it's all done in PHP, and the input grammar is easier and more maintainable. Write your actions in PHP. Generate PHP output code. Drive your parser with PHP. Wanna make a language?

A full flavored Eclipse editor for Jikespg and LALR Parser Generator (LPG) grammar files.

Wisent is an LALR(1) parser generator with pluggable front- and backends. It generates object-oriented code with clean namespace separation. A yacc-like frontend is currently accompanied by a C++ and a Java backend. The tool itself is implemented in C++.

Berkeley Yacc is an LALR(1) parser generator. Berkeley Yacc has been made as compatible as possible with AT&T Yacc. Berkeley Yacc has been extended to generate Python, Perl and Java code.

A parsing toolkit that supports both top-down (LL(1) and Simple Precedence) and bottom-up parsing (LR(0), SLR(1), LR(1) and LALR(1)). The toolkit supports generating Java parsers for all the bottom-up parsing methods, based on a CUP definition.

Pure Python implementation of GOLD Parser Engine. GOLD Parser Engine is a LALR(1) parser with DFA tokenizer. It uses compiled grammar table generated by GOLD Parser Builder (not included - available on http://www.devincook.com/goldparser)

Chaperon is a LALR(1) parser, which parse structured text documents and generate XML documents as output. It includes a parser generator like yacc and a regex scaner like lex. As input use Chaperon a grammar written in XML.

A command line tool written in C++ that analyzes the source files of a C program to represent the pattern of its system calls in terms of a LALR(1) grammar.