Open Source Linux Parser Generators - Page 3

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

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.

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

The VISL Phrase Structure Grammar Compiler is an implementation of a parser generator for ambiguous context-free grammars, ambiguous input, and ambiguous output.

Extension of the CUP parser generator for working with abstract syntax trees (ast). Implements support for class hierarchy generation and automatic tree building from CUP grammar specification files. Version 10k of CUP is used.

Not C Sharp. Four goals: 1. Create a CSharp compiler written in C# and CUP Parser Generator. 2. Learn how to write a compiler. 3. Encourage compiler experimentation by anyone who is interested.

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.

Ayauhteotl is a parser generator to parse XML files, using an XML-like syntax. The parser generator takes an XML file which describe the structure of the XML files to parse and which associates a semantic (for now in \\\\\\\"C\\\\\\\") t

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.

A simple way to create a syntax highlighting editor for a custom language/grammar and/or create custom grammar parsers. This is a .NET project written in C#. See details here: http://acct001.com/wordpress/?p=190

Berkeley Yacc is an LALR(1) parser generator. Berkeley Yacc has been made as compatible as possible with AT&T Yacc. Berkeley Yacc has been extended to generate Python, Perl and Java code.

Blade Language Developer (or Project Blade for short) is a toolkit for creating domain specific or general programming languages. The toolkit offers a language for describing grammars, and templatable parser generator.

Generate a parser at runtime from a collection of C++ objects. Concisely state a parser specification in ordinary C++ code. Learn from a parser generator with an object-oriented design.

cson (CoffeeScript‑Object‑Notation) is a human-friendly data serialization format similar to JSON but using CoffeeScript syntax, with a library (and CLI) to parse and serialize between CSON, JSON, and JavaScript objects. Executing the method with a callback still executes the method synchronously. Requires or parses a file path of the desired format into an Object If the format option is not specified, we use the filename to detect what it should be; otherwise, we default to parsing CSON.

CSP Canonical LR(1) Parser Generator. Includes lexer and parser generator. Supports all OS. Produces code as standard ANSI C++ w/ minimal STL and usable in commercial or non-commercial purposes.

Chatette is a Python-based tool for generating training datasets for Natural Language Understanding (NLU) models, particularly those used with Rasa NLU. It employs a domain-specific language to define templates, enabling the creation of diverse and extensive training examples for intent classification and entity recognition.​

Chevrotain is a powerful and fast parser-building toolkit for JavaScript. It supports the construction of LL(k) parsers and is suitable for building interpreters, compilers, and DSLs.​

RiDL is a set of tools to simplify building compilers using Nemerle. It includes a lexical analyzer generator and a parser generator.

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...).

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.

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