Open Source Windows Parser Generators - Page 4

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.

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.

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

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.

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.

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.

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.

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.