Search Results for "syntax analyzer java"

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...

This project has moved to GitHub ! The version here at SourceForge will remain for historic purpose. Koopa is a parser generator, made for COBOL. It can handle source files in isolation (no preprocessing required) and doesn't mind the presence of CICS/SQL fragments. The grammar is easily extensible in a way which minimizes the impact on the overall code.

...As we know,The JSqlParser(see http://jsqlparser.sourceforge.net/) is a very simple and intelligence tool which can parse SQL statement and translate it into a hierarchy of Java classes. This great assembly is based on another smart and famous assembly whoes name is 'javacc'. Now I build this c# project which is based on JSqlParser project .Notably,the JSqlParser is based on javacc, but the NSqlParser is based on another semantic analyzer whoes name is 'MinosseCC'(see http://www.codeproject.com/Articles/11632/MinosseCC-a-lexer-parser-generator-for-C), For c# Grammar,I modified the file 'JSqlParserCC.jj', now his name is 'NSqlParserCC.jj', Obvious, the other code files also I have changed. ...

JPlex is an unconventional lexical analyzer generator for Java. JPlex lexers are NIO-based, DFA-powered, push-driven, and fully decoupled and reusable. Their state machines are precompiled and serialized, so run time initialization is fast no matter how large the rule set. JPlex is not a parser generator; it only generates an interface for its parsers, and it does not build a parse tree.

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#.

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.

BNF for Java is a BNF Compiler-Compiler, or Parser-Generator. It implements ISO Standard Backus-Naur Format, using Java. BNF allows you to create a syntax, or a complete language, to parse your data source. Your custom Java extensions generate output.

A parser generator derived from ANTLR with JavaCC like (but not the same) syntax and some new features. It also comes with sample grammars for CSharp, Java, GnuC, Html, XHtml, Xml, ECMA262... etc.