Open Source Parser Generators - Page 4

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.

Parse software messages and transform them into actions. LazyBat has a command line utility which can transform input data, and also a parser generator for C/C++. LazyBat doesn't support recursive parsing, but rather focuses on common parsing jobs.

CommonMark is a PHP library that implements the CommonMark Markdown specification, allowing developers to convert Markdown into HTML. It provides a robust and extensible parser with support for additional syntax and extensions. The library is designed to be efficient and standards-compliant, making it ideal for applications that require consistent and reliable Markdown processing.

Lemon++ is clone of the Lemon LALR parser generator, written by Dr. Richard Hipp ( http://www.hwaci.com/sw/lemon/ ). It adds support for C++, for example user is not limited to POD types.

Lemonade 0.01 An Lalr Parser Generator for "D" (www.digitalmars.com) Based on Lemon 1.0 Ref: http://www.hwaci.com/sw/lemon/

Lapg is the combined lexical analyzer and parser generator, which converts a description for a context-free LALR grammar into source file to parse the grammar. Generates code for Java, Javascript, C, C++ and C#.

Marid is a cross-platform data acquisition and visualization software intended to build complex and hierarchical data acquisition systems. The base concepts of its architecture include: * Graphical deploy configuration builders * Powerful Groovy scripting language * Embedded database ( H2 , HSQLDB) to store data * Cross-platform design (write once, run anywhere) * Embedded GUI-configurable binary/ascii device protocol parser/generator * Deploy manager to deploy firmwares to remote controllers/servers via secure channel * Embedded web-sever * Dynamically linked plugins available from Nexus Repository * Remote monitoring tools * Modular Marid IDE to manage them all

Annotation based lexer and parser generator suitable for processing wide range of languages, from small domain specific languages to big ones like Java. Actions may be written directly as annotated java methods. Examples of expression language and Java5.

Many Tools: PHP-based context-free grammar (CFG) parser generator, simple scanner generator, and nascent object relational mapping/query language in PHP. Talks to Postgres, MySQL for now. Needs PHP5. Comes with (relies on) many convenience functions.

Unlike Java or other languages where reflection / introspection is available, mocking is not easy with C++. Even with Google Mock, we need some hand writing. I solved this problem by using home made class definition parser/generator that reads the class definition (header file), then generates a mock class. What you need is to run the generator and full featured mock class is there for your unit test. ---- How to use: You need Ruby. Obtain it if you don't have it yet. Go to https://sourceforge.net/p/mockerplusplus/code/ci/master/tree/ Download everything except copy-tools.sh (which is for my internal use) (You can also skip unittest/ if you are not interested) doc/ folder contains a documentation that explains Mocker++ Code samples (unit test codes) are found in 'unittest/MockerppTest'

Unlike Java or other languages where reflection / introspection is available, mocking is not easy with C++. Even with Google Mock, we need some hand writing. I solved this problem by using home made class declaration parser/generator that reads the class declaration (header file), then generates a mock class. What you need is to run the generator and full featured mock class is there for your unit test. ---- How to use: You need Ruby. Obtain it if you don't have it yet. Get Tools At your convenient directory: git clone https://git.code.sf.net/p/cpp-tools-in-ruby/code tools Get Mocker++11 git clone https://git.code.sf.net/p/mockerplusplus11/code mocker++ Run it Change directory to mocker++ ./Mocker++ --help (On Mac/Unix, you may need to run dos2unix) Code samples (unit test codes) are found in 'unittest/MockerppTest

Monkey is a scanner and a LR(1) parser generator for object oriented languages. The platform on wich it runs is Java.

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.

NSqlParser is the .net version about JSqlParser project,usually,its used for parse and transform a SQL statement into c# classes. As we know,The JSqlParser(see http://jsqlparser.sourceforge.net/) is a very simple and intelligence tool which can parse SQL statement and translate it into a hierarchy of Java classes. This great assembly is based on another smart and famous assembly whoes name is 'javacc'. Now I build this c# project which is based on JSqlParser project .Notably,the JSqlParser is based on javacc, but the NSqlParser is based on another semantic analyzer whoes name is 'MinosseCC'(see http://www.codeproject.com/Articles/11632/MinosseCC-a-lexer-parser-generator-for-C), For c# Grammar,I modified the file 'JSqlParserCC.jj', now his name is 'NSqlParserCC.jj', Obvious, the other code files also I have changed. And please remember this, This project is free for you, And including any commercial behavior.

Nearley is a powerful and flexible parser generator for JavaScript, capable of parsing complex grammars and languages, making it suitable for building compilers, interpreters, and data processors.

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.

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.

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

Parser for Rust source code is a major Rust crate for parsing Rust source code (token streams) into a syntax tree (AST) that procedural macros can inspect or transform. The primary target is macro authors: you can parse TokenStreams into syn::File, syn::Item, syn::Expr, syn::Type, etc. It offers rich data structures, fine-grained parsing, span tracking (for error reporting), traversal and mutation APIs (visit, fold, visit_mut), printing back to tokens, and strong feature-gating so you only compile what you need. The documentation emphasises that while the crate is geared for procedural macros (and custom derives), some of the APIs may be of more general use. Using syn you can effectively write code that analyzes or generates Rust code at compile time.