Search Results for "bnf parser"

bnf2xml a simple BNF parser that takes text as input, searches according to a BNF query file, and outputs text marked up by the xml labels that show context. bnf2xml is as simple to use as any text binary ie, awk(1) grep(1). bnf2xml does not require C API because it outputs simple xml labeling. README is visible on file dl page. EXAMPLE: $ echo "hi" | bnf2xml patternfile <word><alph>h</alph><alph>i</alph></word> or <gas>hydrogen iodide</gas> patternfile says how to find...

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.

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'. This file is compiled with your code to produce...

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

A universal syntax verification utility utilizing a generic BNF-adaptable parser. The parser is generated at run-time depending on given syntax specification in a Backus-Naur Form (BNF).

Dapar is a universal parsing library written in C. It will interpret any grammar you give it in a BNF-like format, and constructs a matching expression tree for any given input. This makes developing a new parser for any language simple and reliable. Includes an ABNF parser, EBNF parser, XML parser and algebraic math parser.

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.

The goal of this project is to create a BNF parser embedded in an Open Office file, which can transfer customizable BNF types into XML documents and diagrams. This will be achieved by using ooRexx, BSF4ooRexx and the OpenOffice java API

metaDSL provides a framework which eases creation of BNF grammars, parser generators and code generators. Executes as a Maven plugin or from the command line via a lightweight launcher powered by Maven runtime. See also: http://www.metadsl.com/

A universal parsing tool and source code generator for generative programming. It extracts useful information by parsing (BNF parser generator) and generates source code by several techniques, by interpreting a scripting language for flexibility.

Railroad diagram generator. Generates diagrams in PNG and SVG from parser grammars specified in BNF and other parser formats. Implemented in Java.

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.

More Than Parsing is a parser generator for context free grammars defined in a BNF-like format. It generates scanners, parsers, ASTs, etc. This sf project is no longer active, development will continue in a different place.

C++ template classes for declaring non-left recursive grammars (in BNF) directly in the code as set of compound classes. Includes implementation of regular expression parser - regexp_parser. Supports wide char. See http://grammar2parser.sourceforge.net/

MetaGen is a Parser and DOM generator for java. It acts as a kind of a front-end to antlr. It creates a parser and a syntax tree for a language defined in a special labelled BNF.

Native Java parser framework, no (pre-)compilers needed. Closely follows BNF syntax. Optimized for performance and low overhead. Highly flexible and extendable using a streamlined API. Integrate semantics, tracing and even context sensitive parsers.

ebnf2yacc is a tool to help write yacc parsers/compilers. It takes as input a grammar written in bnf (ebnf support is planned), and outputs a c++ abstract syntax tree that supports the visitor pattern, along with a yacc parser that builds the tree.

SimpleCompiler is a suite of tools for generating compilers and code generators. A simple BNF style language is used to describe scanner and parser in a UTF-8 source file. The output is described with a template language that is used to add formatting to the parse tree. Code is generated that automatically traverses the parse tree and calls a method on a transformer object to modify the parse tree. Each node is visited in document order, and a method is called at the beginning and end...