Open Source Parser Generators - Page 6

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.

Node.js body parsing middleware. Parse incoming request bodies in a middleware before your handlers, available under the req.body property. As req.body's shape is based on user-controlled input, all properties and values in this object are untrusted and should be validated before trusting. For example, req.body.foo.toString() may fail in multiple ways, for example the foo property may not be there or may not be a string, and toString may not be a function and instead a string or other user input. The bodyParser object exposes various factories to create middlewares. All middlewares will populate the req.body property with the parsed body when the Content-Type request header matches the type option, or an empty object ({}) if there was no body to parse, the Content-Type was not matched, or an error occurred.

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.

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 parser is recursive, e.g. nested JSON elements are handled with the recursion. However, this recursion is driven by the structure definition, not by the input data, which prevents stack faults on malformed input data. cojson is character type neutral – it can work with signed or unsigned character, as well as with standard wide character types: wchar_t, char16_t and char32_t. It is also transparent for UTF8 and properly handles BOM sequence.

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

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

getoptions is a POSIX-compliant shell script library designed to simplify command-line option parsing. It provides an elegant and extensible way to handle both short and long options in shell scripts without relying on external dependencies. ​

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.

jsBison is a parser generator which can read bison style grammar definitions and generates according parsers written solely in javascript. Therefore, using jsBison it is easily possible to perform "real" parsing on websites on the client side.

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.

C++ parser generator based on project lemon

loon is a GLR parser generator that takes EBNF grammars as specifications. Tokens are specified in the grammar file, and it generates a parse tree instead of executing actions. A single grammar can output a parser in any supported language.

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

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.

A file parser/generator interface

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.

rjsx-mode is an Emacs major mode derived from js2-mode, tailored for editing JSX files. It extends the parser to support full JSX syntax, providing features like syntax highlighting, indentation, and error checking for React development. ​