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.

...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, and translating between Unicode and byte oriented encodings. Tombo is an alternative for lex, yacc and Bison tools. Source can be browsed in git/code repository or src directory. ...

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.

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

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.

BNF processing tool checks correctness of BNF grammar, generates cross-referenced HTML documentation, generates tests for language recognizers (parsers).

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.