Open Source Parser Generators - Page 2

Python EBNF parser generator for use with mx.TextTools

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.

This project has moved to https://github.com/jplevyak/dparser The master on github is the stable. Please pull that for the very latest code. DParser is a scannerless GLR parser generator based on the Tomita algorithm. It is self-hosted and very easy to use. Grammars are written in a natural style of EBNF and regular expressions and support both speculative and final actions.

JSON parser is a highly efficient JSON data decoder written in C, that parses JSON data into a form that is very easy to use from within C code. You only need to include the json-parser.h file in your source code. If your project does not already incorporate D-List, you will also need to include dlist.h The JSON parser package also includes a JSON validator that does not parse or create resources, but allows the caller to validate JSON data from unknown sources, prior to any parsing attempts. The JSON data is returned to the caller as a set of hierarchical D-List list objects, that make the data very easy to manage, sort, search or use, and easy to remove when done. 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.

BNF for Java is a BNF Compiler-Compiler, or Parser-Generator. It implements ISO Standard Backus-Naur Format, using Java. BNF allows you to create a syntax, or a complete language, to parse your data source. Your custom Java extensions generate output.

Hyacc is an efficient and practical Yacc/Bison-compatible full LR(1)/LALR(1)/LR(0) and partial LR(k) parser generator in ANSI C based on Knuth and Pager's LR(1) algorithms. Generated parser can be used in open-source or commercial software.

C++ LALR parser generator

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.

A runtime parser generator library, generates parsers for context-free grammars. Parsing scripting languages and communication protocol messages are typical use cases. The library is written in straight C++ and requires STL. Clean, correct, efficient.

Open source mini Python compiler written in Java using Sablecc as parser generator.

JS/CC is a parser generator for JavaScript/ECMAScript, which is entirely written in ECMAScript itself. It produces LALR(1) parsers with integrated lexical analyzers. JS/CC can run as a website or be invoked from a console, and runs on several platforms.

More Than Parsing is a parser generator for context free grammars defined in a BNF-like format. It generates scanners, parsers, ASTs, etc. This sf project is no longer active, development will continue in a different place.

OFD.NET is a project to create an Open Flash Debugger in C#, plus other tools targeting flash technology and especially actionScript. There are plans for a swf parser/generator, an AS3 compiler, a decompiler, etc.

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.

UniCC (UNIversal Compiler-Compiler) compiles an augmented grammar definition into a program source code that parses the described grammar. Because UniCC is intended to be target-language independent, it can be configured via template definition files to emit parsers in almost any programming language. UniCC comes with out of the box support for the programming languages C, C++, Python (both 2.x and 3.x) and JavaScript. Parsers can also be generated into JSON and XML.

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

ANTLR is a well-known parser generator . It can generate parsers in several languages. This project provides the templates to produce D code and a D runtime library for running the created parser. It requires ANTLR tool. Use svn to get D target. One example is included. This target works with ANTLR 3.4

Tools to simplify parsing and processing XML using the ANTLR parser generator.

Tool for parsing and parser generation

Angstrom is a parser-combinator library in OCaml designed for high-performance applications. It provides monadic and applicative interfaces for composing parsers and supports incremental input processing. ​

Apt Parsing Tools (APT) is a toolkit of applications for compiler writing that make use of modern software development techniques and written in C. There are 3 major tools included: a lexical scanner generator, a parser generator, and a tool to generate m

argh is a tiny, pragmatic command-line argument parsing library that favors simple, readable code over elaborate configuration. It’s designed for the case where you just want to declare a few flags, accept some positional arguments, and print helpful usage text without wiring up a heavy framework. The API is intentionally compact so you can parse arguments inline near main() and map them straight into native types. It supports short and long options, boolean switches, and key–value flags while keeping error messages and help output understandable for end users. Subcommands can be modeled without much boilerplate, letting you structure larger CLIs while keeping each command self-contained. The overall feel is “get out of your way”: minimal setup, zero magic, and a straightforward path from argv to validated inputs.

LALR(1) lexer and parser generator Java library.

A parser generator for PEG grammars, built using Java, currently producing code for Java.