Parser Generators

 

ANTLR
ANother Tool for Language Recognition, (formerly PCCTS) is a language tool that provides a framework for constructing recognizers, language tool that provides a framework for constructing recognizers, compilers, and translators from grammatical descriptions containing Java, C#, or C++ actions. ANTLR provides excellent support for tree construction, tree walking, and translation.

SableCC
SableCC is an object-oriented framework that generates compilers (and interpreters) in the Java programming language. This framework is (and interpreters) in the Java programming language. This framework is based on two fundamental design decisions. Firstly, the framework uses object-oriented techniques to automatically build a strictly typed abstract syntax tree. Secondly, the framework generates tree-walker classes using an extended version of the visitor design pattern which enables the implementation of actions on the nodes of the abstract syntax tree using inheritance.

CUP
A LALR parser generator.

JavaCC
Java Compiler Compiler (JavaCC) is the most popular parser generator for use with Java [tm] applications. A parser generator is a generator for use with Java [tm] applications. A parser generator is a tool that reads a grammar specification and converts it to a Java program that can recognize matches to the grammar. In addition to the parser generator itself, JavaCC provides other standard capabilities related to parser generation such as tree building (via a tool called JJTree included with JavaCC), actions, debugging, etc.

JFlex
JFlex is a lexical analyzer generator (also known as scanner generator) for Java generator) for Java

Chaperon
Chaperon is a project that converts structured text to XML. It includes a strong LALR(1) parser to parse the text and a tree builder, includes a strong LALR(1) parser to parse the text and a tree builder, which creates an XML document.

Beaver
Beaver is a LALR(1) parser generator. It takes a context free grammar and converts it into a Java class that implements a parser for grammar and converts it into a Java class that implements a parser for the language described by a grammar.

Rats!
Rats! is a parser generator for C-like languages (though currently it only generates parsers in Java). It has been designed so currently it only generates parsers in Java). It has been designed so that grammars are concise and easily extensible. To this end, grammars are organized into modules that can be easily changed by adding, removing, or modifying alternatives in individual productions and composed with each other through module parameters. Furthermore, it relies on ordered choices to avoid ambiguities, supports syntactic predicates for unlimited lookahead, and integrates lexing with parsing. Finally, it has extensive support for automatically generating abstract syntax trees, thus greatly reducing the need for explicit semantic actions.

Grammatica
Grammatica is a C# and Java parser generator (compiler compiler). It improves upon simlar tools (like yacc and ANTLR) by creating It improves upon simlar tools (like yacc and ANTLR) by creating well-commented and readable source code, by having automatic error recovery and detailed error messages, and by support for testing and debugging grammars without generating source code.

Jparsec
Jparsec is a recursive-desent parser combinator framework written for Java. It can be used to construct parser for simple toy syntax as for Java. It can be used to construct parser for simple toy syntax as well as bizzare context-sensitive ones.

RunCC
RunCC is a new kind of parsergenerator that generates parsers and lexers at runtime. Source generation is only optional. It features the lexers at runtime. Source generation is only optional. It features the absence of any cryptography. Although intended for small languages, it comes with Java and XML example parsers.

SJPT
SJPT is a parsing toolkit that supports both top-down (LL(1) and Simple Precedence) and bottom-up parsing (LR(0), SLR(1), LR(1) and Simple Precedence) and bottom-up parsing (LR(0), SLR(1), LR(1) and LALR(1)). The toolkit also supports generating Java parsers for all the bottom-up parsing methods, based on a CUP definition (similar to Yacc and CUP, but not restricted to LALR parsers only).

OpenL
OpenL is an innovative framework for development of different language configurations. It is not another programming language, but language configurations. It is not another programming language, but rather a methodology and supporting tools allowing professional programmers to create their own versions of Java-like languages.

JTopas
The JTopas project provides a small, easy-to-use Java library for the common problem of parsing arbitrary text data. These data can come the common problem of parsing arbitrary text data. These data can come from a simple configuration file with a few comments, a HTML, XML or RTF stream, source code of various programming languages etc. Sometimes a text has to be parsed completely, sometimes only parts of it are important.

Who's new

  • admin

Who's online

There are currently 0 users online.