Search Results for "ebnf"

An LALR(1) and LALR(*) parser generator. Generates parsers up to 140 times the speed of ANTLR parsers, and 1/10th of the size or smaller. Contains the DFA lexer generator, 80% faster than flex lexers. Works with Visual Studio C++. Contains 27 grammars. Parsers build a symbol table. Parsers construct an abstract-syntax tree (AST). Parser are very fast and small. Reads ANTLR and YACC grammars, after making some changes. Accepts advanced EBNF grammar notation. Includes 4 sample...

Fluent is a localization system designed to unleash the expressive power of the natural language. This repository contains the specification, the reference implementation of the parser and the documentation for Fluent. FTL is the syntax for describing translation resources in Project Fluent. FTL stands for Fluent Translation List. The syntax/ directory contains the reference implementation of the syntax as a LL(infinity) parser. The spec/ directory contains the formal EBNF grammar...

This project has moved to https://github.com/jplevyak/dparser The master on github is the stable. Please pull that for the very latest code. DParser is a scannerless GLR parser generator based on the Tomita algorithm. It is self-hosted and very easy to use. Grammars are written in a natural style of EBNF and regular expressions and support both speculative and final actions.

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.

Common Text Transformation Library of C++ classes and functions to parse and modify STL strings. CTTL substring classes may be compared, inserted, replaced, and parsed with EBNF grammars. Compiled program implements recursive descent LL(INF) parser.

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.

Python EBNF parser generator for use with mx.TextTools

A collection of Metasyntaxes like EBNF for .Net including a definition file parser and an expression tree.

Initially a simple C# EBNF file parser that construct the expression tree.

Java library for constructing embedded parsers. A parser is constructed by Java objects. A fluent interface API helps to define the grammar in an EBNF-like style. No Java source code will be generated. ParCinJ is suitable domain specific languages (DSL).

The EBNF Library scans strings with respect to a given EBNF grammar and returns a tree structure for the matches. It is an easy-to-use tool for scanning complex input.

K-automaton is a new parsing (syntactic analysis) machine isomorphous to language. Implemented in Java. Can generate Java code from grammars described in EBNF.

... visualizes EBNF (Extended Backus Naur Form). Therefore an .ebnf File is required, which contains rules written in EBNF. The program parses the rules, visualizes them as syntax diagrams and is able to generate .gif and .emf files for further use.

C++ STL-based parser toolkit that allows the specification of EBNF-like grammars (using operator overloading) and the conversion of arbitrary input (text, tokens or other) to user-defined structures through events attached to grammatic rules.

Nodular is a methodology plus a set of utilities to model data and convert between data formats (EBNF, SQL, UML, XML, XML schemas, and so on).