Open Source Windows Parser Generators - Page 5

upgen is a scanner and parser generator, which can generate parser programs in C++, Object Pascal, ...

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

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

Waxeye is a parser generator based on parsing expression grammars (PEGs). It supports C, Java, Javascript, Python, Ruby and Scheme.

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

Library providing real-life XBNF grammars. All ressources about XBNF neurotranslator compiler here : https://neurotranslator.sourceforge.io

A generic XML parser generator. With a DTD input for any ML language, the C parser for that language is generated. The users can embed their C code with a minimal knowledge of lex/yacc.

XMLpg - XML parser generator. Generates an XML parser in C++ from a DTD. The generated code will provide validation as well as conversion of the input XML.

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

Extension of the CUP parser generator for working with abstract syntax trees (ast). Implements support for class hierarchy generation and automatic tree building from CUP grammar specification files. Version 10k of CUP is used.

The Chilon Library is a C++0x utility library. The most advanced parts are a command-line argument parser and a parser generator library based on parsing expression grammars with built in AST generation abilities.

Fastjson is a Java library that can be used to quickly convert Java Objects into their JSON representation or convert JSON strings to their equivalent Java object. Based on benchmarks it provides the best performance in both server side and Android client, and can work with arbitrary Java objects, even those pre-existing objects of which you do not have the source code. Fastjson provides a simple conversion method to turn Java objects to JSON and vice versa, with extensive support of Java Generics and arbitrarily complex objects.

a higher order parser combinator library written in Java. It enables writing parser in the native Java language without resorting to any parser generator tool.

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.

Not C Sharp. Four goals: 1. Create a CSharp compiler written in C# and CUP Parser Generator. 2. Learn how to write a compiler. 3. Encourage compiler experimentation by anyone who is interested.

Nyu is a PEG based parser generator in which an appropriate AST type and a parser which populates this AST can be created from a single grammar description.

Pgj is a parser generator written in Java. It generates a paser code for some programming language according to a template.

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.

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.

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. The spg tool takes .parser files that contain descriptions of parsers as input and produces C++ source code for parser classes as output. The parser generator produces a recursive descent top-down backtracking parser that use the lexical analyzer generated by slg to tokenize the input.