Open Source Parser Generators - Page 5

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.

Developer tools for EXPRESS (ISO 10303-11), an information modeling language. The core of this project is a Java Express parser using the ANTLR parser generator. This project was initiated by the National Institute of Standards and Technology.

PEG.js is a simple parser generator for JavaScript that produces fast parsers with excellent error reporting. You can use it to process complex data or computer languages and build transformers, interpreters, compilers and other tools easily. PEG.js is still very much work in progress. There are no compatibility guarantees until version 1.0. Based on parsing expression grammar formalism, more powerful than traditional LL(k) and LR(k) parsers. Usable from your browser, from the command line, or via JavaScript API.

PackCC is a packrat parser generator for C, which can handle PEGs (Parsing Expression Grammars) very efficiently, and can support direct and indirect left-recursive grammar rules.

ParGeL is an LALR(k) parser generator, which allows creation of inheritable parsers in runtime and compile time environments. ParGeL is written 100% in Java.

It is an LL(1) recursive descent parser generator written in VB.NET which can generate a scanner, parser, and parsetree file in either C# , Java or VB code. The original code and documentation can be found in the article 'A Tiny Parser Generator v1.2' on CodeProject. Requires dotNet2.0

Queryparser is Uber’s open source Haskell library for parsing and analyzing SQL queries written in different dialects (Vertica, Hive, Presto). It creates a unified AST and supports name resolution using catalog metadata, enabling large-scale query analysis for lineage detection, analytics, and tooling. The parsing logic produces an AST with table and column identifiers that are "raw" or optionally qualified. Frequently, it is desirable to convert the AST over raw names to an AST over resolved names, where identifiers are fully qualified. This transformation is called "name resolution" or simply "resolution". It requires as input the full list of columns in every table and the full list of tables in every schema, otherwise known as "catalog information". The parsing logic produces an AST with table and column identifiers that are "raw" or optionally qualified.

A collection of tools for the SETL Programming Language, including a LALR parser generator and lexical scanner generator.

scala-parser-combinators is a library that offers simple combinator-based parsing for Scala. Originally part of the Scala standard library, it allows developers to construct parsers using combinators directly in Scala code. ​

Seafox is a high-performance ECMAScript parser written in JavaScript. It aims to be a fast and compliant parser for JavaScript, suitable for various tooling and analysis purposes.​

Soul is a recursive descent parser generator tool for Windows and Linux that comes with a parsing library.

Styx is a scanner and parser generator designed to address some shortcomings of the traditional lex/yacc combination. It has unique features like automatic derivation of depth grammar, production of the derivation tree including it's C interface which provides access to the abstract syntax tree, preservation of full source information and pretty printing to facilitate source-source translation, persistence to aid rapid interpreter writing. For application in contemporary computing environments, it supports unicode, reentrancy and offers thread-safeness.

TFieldedText is a component which allows you to easily: generate and parse Fielded Text Files (eg. CSV files); and create and edit Fielded Text Meta files. For more information about the Fielded Text standard see http://www.fieldedtext.org

A portable and retargetable lexer/parser generator.

Scannerless recursive descent C++ parser generator

Tedir is a general purpose top-down parser library for java. Unlike a parser generator, it allows efficient parsers to be constructed at run-time, rather than at compile-time, and allows parsers to be extended while running.

In a nutshell it takes as input the formal specification of any text protocol in ABNF and generates the parser in C language for that grammar using lex/yacc.

The purpose of the project was to serve as a testbed for compiler technology. Currently there is a PEG parser generator and a C99 preprocessor in C.

Spirit is an object oriented recursive descent parser generator framework implemented using template meta-programming techniques.

A backtracking (non-packrat) parser generator for parsing expression grammars. The parsers are generated at run-time using the LLVM JIT compilation engine.

Turn.Message is .NET parser / generator of the TURN (Traversal Using Relay NAT) messages written in C#. Compatible with [MS-TURN] extension and clients based on Microsoft UCCAPI SDK.

ua-parser is a multi-language library for parsing User-Agent strings into structured data, such as browser, OS, and device information. Originally created for web analytics and user tracking, it supports a wide range of platforms and is available in JavaScript, Python, Java, and other languages. ua-parser is often used in server logs, analytics dashboards, and A/B testing systems to segment traffic.

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.