Search Results for "bnf"

XBNF Neurotranslator is a powerfull extended BNF grammar language to handle translations easily and many features to handle different kind of situations. This project is for common arch binaries, C++ sources, tests & support tickets. No installation, juste get binary for your architecture : > See [Files] > binary.{version} Library of smart samples of grammars> https://sourceforge.net/projects/xbnf/ Docker image which embeds the Linux/64bits binary and the library. ...

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.

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

An rich application development platform for both desktops and the Internet. It supports technologies like XSLT, XQuery, XML Schema, RELAX NG, XHTML, SVG, and a new scripting language - Candle (Common ApplicatioN Development LanguagE).

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

Generate parsers with ease, using a graphical user interface, or console. Design your parsers graphically or by using standard regular expressions and BNF syntax similar to lex/yacc. Generated parsers can be in C or C++.

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.

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.

A command line SIP/H323 softphone capable of sending and receiving audio files as well as sending out of band DTMF digits. Supports a BNF format configuration language for scripting call scenarios. Useful for example system testing.

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/

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 of each node visit. ...