Search Results for "tree grammar"

ANTLR (ANother Tool for Language Recognition) is a powerful parser generator for reading, processing, executing, or translating structured text or binary files. It's widely used to build languages, tools, and frameworks. From a grammar, ANTLR generates a parser that can build and walk parse trees. It’s widely used in academia and industry to build all sorts of languages, tools, and frameworks. Twitter search uses ANTLR for query parsing, with over 2 billion queries a day. The languages for...

Linguistic Tree Constructor (LTC) is a tool for drawing lingusitic syntax trees of already-existing text. It is a syntax editor, not a text editor, so the text has to exist already. It is best suited for large-scale, rapid creation of hand-annotated treebanks. The user can define their own node categories, and can label each node with labels, also definable by the user. LTC supports "generic", X-Bar and RRG trees. Supports interlinear texts in SIL SFM format.

Grammar based parsing in Java 8 to a tree structure. Create with no overhead a grammar in java and parse it into a tree structure. Will probably work right away with your grammar.

PHParser 1.2 generates a pure Java parser for PHP programs. Invoking this parser yields an explicit parse tree (AST) and a tree walker suitable for further analysis. This tool package is based upon: - ANTLR 3.2 or higher (www.antlr.org). - JDK 1.6 or higher (java.sun.com). - Grammar specifications of PHP 5.3.

Conversion between different grammar frameworks is of great importance to comparative performance analysis of the parsers developed on them. This tool can convert CCG derivations to PTB trees by using Max Entropy models as well as visualizing the tree graphs. The main technical innovation presented here is the effective conversion method which achieves a F score over 95%.

Extension of the CUP parser generator for working with abstract syntax trees (ast). Implements support for class hierarchy generation and automatic tree building from CUP grammar specification files. Version 10k of CUP is used.

A Java library for parsing files and building Abstract Syntax Tree based on context free (CF) grammar. Easy to use and provides fast prototyping. With grammar provided the library provides the AST of input. Command line interface is provided.

A flexible Japanese to English language translation engine that allows multiple results be displayed according to all possible grammar ratings, i.e. a list of results will be displayed instead of only one. Please browse the CVS tree for actual project.

This aim of this project is to provide an efficient LTAG Parser (Lexicalized Tree Adjoining Grammar) and some linguistic resources to the NALP community and other interested people. Please feel free to submit bug reports, feature requests, or any other co

The main goal of this project is to create a programming editor, which allows editing the tree structure of the code instead of editing the linearization. This should be implemented using XML and XML Schemas, see homepage for details.