Search Results for "batch file generator"

The SoulNG project contains two tools: a lexical analyzer generator slg and a parser generator spg. The generators and the produced lexical analyzers and parsers use four C++ libraries that are also included in the project. The slg tool takes a .lexer file that contains the description of a lexical analyzer as input and produces C++ source code for a lexical analyzer as output. The produced lexical analyzer is a finite state machine that recognizes patterns described as regular expressions and return corresponding token identifiers to the parser. ...

Unlike Java or other languages where reflection / introspection is available, mocking is not easy with C++. Even with Google Mock, we need some hand writing. I solved this problem by using home made class declaration parser/generator that reads the class declaration (header file), then generates a mock class. What you need is to run the generator and full featured mock class is there for your unit test. ---- How to use: You need Ruby. Obtain it if you don't have it yet. Get Tools At your convenient directory: git clone https://git.code.sf.net/p/cpp-tools-in-ruby/code tools Get Mocker++11 git clone https://git.code.sf.net/p/mockerplusplus11/code mocker++ Run it Change directory to mocker++ ....

...Package includes a JSON textural generator which will create JSON grammar data blocks from hierarchical D-List representations of JSON data. The package also includes a variety of support functions to allow C code to easily find, add, and modify JSON values and members in D-List hierarchical structures.

...RapidJSON is Unicode-friendly. It supports UTF-8, UTF-16, UTF-32 (LE & BE), and their detection, validation and transcoding internally. For example, you can read a UTF-8 file and let RapidJSON transcode the JSON strings into UTF-16 in the DOM. It also supports surrogates and "\u0000" (null character).

Unlike Java or other languages where reflection / introspection is available, mocking is not easy with C++. Even with Google Mock, we need some hand writing. I solved this problem by using home made class definition parser/generator that reads the class definition (header file), then generates a mock class. What you need is to run the generator and full featured mock class is there for your unit test. ---- How to use: You need Ruby. Obtain it if you don't have it yet. Go to https://sourceforge.net/p/mockerplusplus/code/ci/master/tree/ Download everything except copy-tools.sh (which is for my internal use) (You can also skip unittest/ if you are not interested) doc/ folder contains a documentation that explains Mocker++ Code samples (unit test codes) are found in 'unittest/MockerppTest'

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

The goal of this project is to create a simple and easy to use parser generator that will accept a textual grammar file as an input and output modularized classes representing a limited parser interface. Long term goals include a robust grammar file syntax, output suitable for multiple programming languages, and tools for better integrating compiler functionality, parse tree manipulation, and FSM based scanner generation.

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

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

A file parser/generator interface