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.
QPG is a lexer and parser generator tailored for modern C++. The syntax of its grammer is designed to be more flexible and easily read than those of traditional tools like flex and bison. It's build on Qt4 but can produce output independent of it.
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.
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.
A universal parsing tool and source code generator for generative programming. It extracts useful information by parsing (BNF parser generator) and generates source code by several techniques, by interpreting a scripting language for flexibility.
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.
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.
AppSignal starts at $23/month with all features included. No overages, no hidden fees. 30-day free trial.
Tired of monitoring tools that punish you for scaling? AppSignal offers transparent, predictable pricing with every feature unlocked on every plan. Track errors, monitor performance, detect anomalies, and manage logs across Ruby, Python, Node.js, and more. Trusted by developers since 2012 with free dev-to-dev support. No credit card required to start your 30-day trial.
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.
Complete LALR(1) parser generator and engine in PHP.
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?
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.
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.
...C3 is a tool specialized on the easy design and construction of ASTs, it is independent of the compiler compilers or parser generator that is used. It generates Java and C# code. Require JRE 1.6.0.
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 parser generator derived from ANTLR with JavaCC like (but not the same) syntax and some new features. It also comes with sample grammars for CSharp, Java, GnuC, Html, XHtml, Xml, ECMA262... etc.
A runtime parser generator library, generates parsers for context-free grammars.
Parsing scripting languages and communication protocol messages are typical use cases.
The library is written in straight C++ and requires STL.
Clean, correct, efficient.
Wisent is an LALR(1) parser generator with pluggable front- and backends. It generates object-oriented code with clean namespace separation. A yacc-like frontend is currently accompanied by a C++ and a Java backend. The tool itself is implemented in C++.
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.
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...).
A generic XML parser generator. With a DTD input for any ML language, the C parser for that language is generated. The users can embed their C code with a minimal knowledge of lex/yacc.