Open Source Linux Parser Generators - Page 3

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.

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.

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

It is basically an education Java compiler we are developing - just to gain an insight into the workings of a compiler. It is NOT meant for commercial use!! Its written in Java and uses ANTLR parser generator and the Byte Code Engineering Library extensiv

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.

The LALR parser generator (LPG) is a tool for developing scanners and parsers written in Java, C++ or C. Input is specified by BNF rules. LPG supports backtracking (to resolve ambiguity), automatic AST generation and grammar inheritance.

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.

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.

Logos is a lexer generator for Rust, designed to create fast and efficient lexers with minimal code. It leverages Rust's procedural macros to define token patterns, streamlining the process of lexical analysis.​

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

Meriyah is a high-performance, fully compliant JavaScript parser that generates ESTree-compatible Abstract Syntax Trees (ASTs). Designed for speed and stability, it serves as an alternative to parsers like Acorn and Esprima.​

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.