Search Results for "grammar"

The Emacs package ANTLR-Mode provides: syntax highlighting for ANTLR grammar files, automatic indentation, menus containing rule/token definitions and supported options and various other things like running ANTLR from within Emacs.

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.

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

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.

C3PO is a software synthesis tool that provides a solution for building maintainable, reliable and robust software infrastructures and/or compiler frontends from a set of attributed grammar rules in EBNF notation.

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.

Coco/S is a compiler generator that takes plain EBNF grammar files and features a SAX style call back API. It is written in Java and produces a Java Scanner (Lexer) and Parser for the language described by the input grammar. Coco/S is a branch of the 2010/11 release of Coco/R for Java. While Coco/R takes an attributed grammar file, Coco/S has a callback API. This has the advantage of a clean separation between grammar (EBNF) and Compiler/Interpreter.

Provides an ANTLR plugin (including grammar file editor with outline page and project nature with incremental builder) for the Eclipse platform

The goal of this project is to create a simple and easy to use parser generator that will accept a textual grammar file as an input and output modularized classes representing a limited parser interface. Long term goals include a robust grammar file syntax, output suitable for multiple programming languages, and tools for better integrating compiler functionality, parse tree manipulation, and FSM based scanner generation.

** JUST CHECK OUT THE CODE (svn) OR DOWNLOAD THE ECLIPSE PROJECT FROM FILES - AN EXAMPLE OF HOW TO USE THE DERIVATOR IS CONTAINED IN BOTH ** This component was developed for the use in a xtext project. A possible use case is enhancing auto generated classes or interfaces with additional functionality. For example: you define your grammar within a .xtext file. The mwe2 workflow generates xtext artifacts (classes and interfaces) representing your language. If you want to add further functionality to those artifacts, just configure custom inheritance by the use of this workflow component. Integrate this component in your xtext artifacts generation workflow and your custom inheritance will be considered every time you regenerate your language.

Kayacc is an alternate name for the TOMBO project. I am in the process of updating the Tombo project page with version 2.1.0. Please download Tombo2.1.0.tar.gz from the Files tab. Tombo is a compiler generation toolkit for constructing compilers and interpreters. It includes a BNF compiler that generates parsers for context free grammars, and a class library to support compiler development. The class library supports symbol tables, Unicode text manipulation, reserved word mappings,...

Styx is a scanner and parser generator designed to address some shortcomings of the traditional lex/yacc combination. It has unique features like automatic derivation of depth grammar, production of the derivation tree including it's C interface which provides access to the abstract syntax tree, preservation of full source information and pretty printing to facilitate source-source translation, persistence to aid rapid interpreter writing. For application in contemporary computing environments, it supports unicode, reentrancy and offers thread-safeness.

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.

Parse software messages and transform them into actions. LazyBat has a command line utility which can transform input data, and also a parser generator for C/C++. LazyBat doesn't support recursive parsing, but rather focuses on common parsing jobs.

Libparser is a C++ library for parsing. It can generate a parsing table at runtime (loading a BNF grammar file). It also includes a tool for creating the parsing table in a file or in C/C++ code. It currently can parse LL1 and SLR1 grammars.

lightJacc is a small but strong grammar parser generator. It adopts a parsing strategy of its own: dynamic concurrent parsing -- which made it much stronger than LR or LL family CCs (YACC, ANTLR, etc), but still keep good performance.

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?

The Language Machine is a toolkit for language and grammar: a library, main program, and self-hosted rule compilers with one frontend. The system is easy to use. It directly implements unrestricted rule-based grammars with actions and external interfaces.

Covra is a project to help design compilers. C3 is a tool specialized on the easy design and construction of ASTs, it is independent of the compiler compilers or parser generator that is used. It generates Java and C# code. Require JRE 1.6.0.

Given YACC-like and LEX-like input files, yagg generates a C++ program that generates all strings of a user-specified length. yagg is easy to use, and provides a means of generating test inputs or validating a parser grammar by inspecting the strings.

YAXX is an XML extension to YACC, a well-known public-domain compiler-compiler. This extension allows a program of a YACC grammar to be automatically converted into an XML document.

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)

JavaCCCS is a port of JavaCC to generate C# code instead of Java. JavaCCCS is a compiler compiler, i.e. given a grammar file it generates a parser for it that can then be used directly or by other applications.

In a nutshell it takes as input the formal specification of any text protocol in ABNF and generates the parser in C language for that grammar using lex/yacc.