Search Results for "version"

Ox is an attribute grammar compiling system that augments Lex and Yacc specifications with definitions of synthesized and inherited attributes written in a combination of Ox and C/C++ syntax. From these augmented specifications, Ox generates ordinary Lex and Yacc specifications that build and decorate attributed parse trees. The user can specify parse-tree traversals for easy ordering of side effects such as code generation. Ox handles the tedious and error-prone details of writing code...

A program for generating C++ code based on an RDF schema. The generated code can then navigate RDF structures that conform to the schema.

This project is a library which provide examples of XBNF grammars. XBNF neurotranslator compiler and ressources available here: https://neurotranslator.sourceforge.io

Win flex-bison is a windows port the Flex (the fast lexical analyser) and Bison (GNU parser generator). win_flex based on Flex version 2.6.3 source code and win_bison based on Bison version 2.7 and they depend on system libraries only. Git repository: https://github.com/lexxmark/winflexbison UPDATE1: Bison version 3.x.x available in Files section in win_flex_bison3-latest.zip package. UPDATE2: Now "winflexbison" available as package in Chocolatey (https://chocolatey.org/packages/winflexbison and https://chocolatey.org/packages/winflexbison3) UPDATE3: You can use VS custom build rules to simplify working with winflexbison in Visual Studio 2010 and upper (https://sourceforge.net/p/winflexbison/wiki/Visual%20Studio%20custom%20build%20rules/).

Genparse is a command line parser generator. Based on a simple description of the command line options you want in your program, genparse creates the necessary C, C++ or Java code for their processing.

Native C++ implementation of a JSON library. Contains a Parser, a Generator and and easy-to-use Navigator in one single class. To build you will need at least a C++11 capable compiler such as MSVC 10 (express edition). There is no other 3rd party library required to compile or run it.

Soul is a recursive descent parser generator tool for Windows and Linux that comes with a parsing 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...

Styx is a scanner and parser generator designed to address some shortcomings of the traditional lex/yacc combination. It has unique features like automatic derivation of depth grammar, production of the derivation tree including it's C interface which provides access to the abstract syntax tree, preservation of full source information and pretty printing to facilitate source-source translation, persistence to aid rapid interpreter writing. For application in contemporary computing...

UML 2 Statemachine Code Generator is a developer framework for an easy implementation of statemachine based applications. Here, with this framework only one Domain-specific language (DSL) specification is necessary to create executable codes for Linux, Mac OS X, and Microsoft Windows. With this framework you save a lot of time and effort during implementation; also you have an always valid - based on a well-defined C++ standard - generated code with high quality.

Lapg is the combined lexical analyzer and parser generator, which converts a description for a context-free LALR grammar into source file to parse the grammar. Generates code for Java, Javascript, C, C++ and C#.

QPG is a lexer and parser generator tailored for modern C++. The syntax of its grammer is designed to be more flexible and easily read than those of traditional tools like flex and bison. It's build on Qt4 but can produce output independent of it.

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.

LR(k) parser generator (k>=0) implementation.

A backtracking (non-packrat) parser generator for parsing expression grammars. The parsers are generated at run-time using the LLVM JIT compilation engine.

Generate a parser at runtime from a collection of C++ objects. Concisely state a parser specification in ordinary C++ code. Learn from a parser generator with an object-oriented design.

Implementation of a combined scanner and parser generator for object oriented C++ or Java code generation

Kncc is a New C++ Compiler. Kncc bases on ParaLR parser generator.

Wisent is an LALR(1) parser generator with pluggable front- and backends. It generates object-oriented code with clean namespace separation. A yacc-like frontend is currently accompanied by a C++ and a Java backend. The tool itself is implemented in C++.

The VISL Constraint Grammar Compiler is a natural language parser generator. It is an implementation of Pasi Tapanainen's CG-2 constraint grammar formalism.

CppCC is an object-oriented scanner and LL(k) parser generator. It aims to replace LEX&YACC for those who write C++ applications that involve parsing.

Scannerless recursive descent C++ parser generator

This project is a parser generator, like the lex and yacc, but is based on the JavaCC grammar. It was writing in c++, run on linux and dos, and don't use another library. The grammar parser is specified through a simple file, and the parser generated

The VISL Phrase Structure Grammar Compiler is an implementation of a parser generator for ambiguous context-free grammars, ambiguous input, and ambiguous output.

cojson is a C++ pull-type JSON parser/serializer for constrained platforms, such as bare metal applications on low-end MCUs. It does not use memory allocation and has almost no external dependencies. It is not intrusive – it neither forces nor implies any particular design of the application. Instead it adapts to fit any existing application code. It is tolerant to data type mismatching. When such occurs, parser just skips mismatching data and makes best efforts to continue parsing. The...