Open Source Parser Generators - Page 3

This is an implementation continuously under development of Dynamic Syntax, a word-by-word incremental semantic grammar, especially suited to dialogue. The implementation contains the following: (1) depth-first and breadth-first parsers and generators, based on hand-crafted domain-specific lexicons but cover a broad range of structures, including relatives and tense; (2) a prototype incremental dialogue system, DyLan, based on Jindigo (Skantze & Hjalmarsson, 2010), but using the Dynamic Syntax (Kempson et. al. 2001, Cann et. al. 2005) parser/generator; (3) a grammar induction module which learns DS incremental grammars from data (Eshghi et. al. 2013). For more information on DS, and this implementation, please see the files DSImp_TechReport.pdf, and README.txt included here under "files".

Elcc is an Earley parser generator written in Python and compatible with Yacc/Bison Syntax.

The Embedded XML Parser Generator is creating some C source code that parses XML files (or streams) from a user specified document structure. Generated code can support advanced features (inter-dependencies, native data types etc...).

GJSON is a Go library designed for extremely fast, allocation-free retrieval of values from JSON documents. It enables you to query nested JSON structures using one-liner dot-notation or array-based paths and includes wildcard and comparison operators. The library is optimized for speed and zero allocations, benchmarking significantly faster than Go’s standard encoding/json unmarshal approaches. It supports parsing JSON lines (newline-delimited JSON) as an array for large stream processing. GJSON also provides modifiers (such as @reverse, @flatten, @keys) which allow transformation or inspection directly via the path syntax. Because it works on raw bytes or strings, it's suited for high-performance JSON parsing without needing to define Go struct types.

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.

MIGRATED TO GITHUB: https://github.com/patins1/ifc4emf/

Instaparse is a simple yet powerful parser generator for Clojure and ClojureScript that turns grammars written in EBNF or ABNF into executable parsers, with support for left recursion, ambiguous grammars, PEG-like lookahead, and various output formats. Instaparse supports most of the common notations for context-free grammars. For example, a popular alternative to * is to surround the term with curly braces {}, and a popular alternative to ? is to surround the term with square brackets []. Rules can be specified with =, :, :=, or ::=. Rules can optionally end with ;. Instaparse is very flexible in terms of how you use whitespace (as in Clojure, , is treated as whitespace) and you can liberally use parentheses for grouping.

IronMeta is an implementation of Alessandro Warth's OMeta metaprogramming system in C#. It provides a packrat parser generator that generates parsers for Parsing Expression Grammars that operate on arbitrary streams of objects.

A Java command-line option parser generator, providing function similar to GNU Getopt, but much richer.

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

Top-down parser that can parse parentheses and braces and quotes but let's the rest to you. See documentation in Files/doc.

JPlex is an unconventional lexical analyzer generator for Java. JPlex lexers are NIO-based, DFA-powered, push-driven, and fully decoupled and reusable. Their state machines are precompiled and serialized, so run time initialization is fast no matter how large the rule set. JPlex is not a parser generator; it only generates an interface for its parsers, and it does not build a parse tree. When the lexer identifies a token that has a named event associated with it, it passes the token to the parser method associated with that event. A lexer can dispatch token events to any number of parsers. JPlex is steadily being improved, and the Subversion repo will almost always be newer and better than the binary download.

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.

json-machine is an efficient and easy-to-use PHP JSON stream parser. It enables processing of large JSON files or streams without loading the entire content into memory, making it suitable for memory-constrained environments.​

Javascript Parser Generator. A fork of LAPG project ported to javascript

This project aims to provide a Java-Bytecode compiler for the fairly new programming language WRL and others like PHP4 and Postfix, based on the research on the SableCC parser generator and common W3C.ORG standards.

A full flavored Eclipse editor for Jikespg and LALR Parser Generator (LPG) grammar files.

lightJacc is a small but strong grammar parser generator. It adopts a parsing strategy of its own: dynamic concurrent parsing -- which made it much stronger than LR or LL family CCs (YACC, ANTLR, etc), but still keep good performance.

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

This project has moved to GitHub ! The version here at SourceForge will remain for historic purpose. Koopa is a parser generator, made for COBOL. It can handle source files in isolation (no preprocessing required) and doesn't mind the presence of CICS/SQL fragments. The grammar is easily extensible in a way which minimizes the impact on the overall code.

Complete LALR(1) parser generator and engine (like BISON or YACC) but it's all done in PHP, and the input grammar is easier and more maintainable. Write your actions in PHP. Generate PHP output code. Drive your parser with PHP. Wanna make a language?

A parser generator based on parsing expression grammar rules. It generates code and accepts actions in LLVM Assembly rather than C like its predecessor, PEG, did.

The generator for LR parsers uses Pager's method, augmented with Tom Pennello's Forward Move Algorithm for error recovery. The grammar specifies identifiers for nodes in the abstract syntax tree, and the identifiers for tokens. It generates Fortran declarations for tree node identifiers and named constants that represent the PDA. The lexer generator accepts regular expressions and generates a DFA. It generates Fortran declarations for character classes, recognized objects, named constants that represent the DFA. A third program generates declarations that connect the parser and lexer. The LR parser generator and lexer generator both use parsers and lexers generated by themselves. An infrastructure to use a generated lexer and parser is therefore included as part of these programs.

A full LR(1) parser generator system with many advanced features.

Laja is a combined code generator and parser generator written in Java. Focus has been on easy of use. It runs on most Windows and Unix/Linux plattforms. The parser generator generate parsers for Java.