Search Results for "bnf"

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 an executable. When the executable is run, it analyses its input to verify that its correspond to the grammar.

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.

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.

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.

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.