Search Results for "regular expression generator"

The Simple components for Ada library provides implementations of smart pointers for automatically collected objects (using reference counting), object persistence, unbounded and bounded arrays of smart pointers, generic unbounded arrays of private objects and plain pointers, generic sets, maps, arbitrary precision arithmetic, B-trees, directed graphs, directed weighted graphs, stacks, and storage pools. It also includes table management, string editing, IEEE 754 support, and infix...

This project has moved to https://github.com/jplevyak/dparser The master on github is the stable. Please pull that for the very latest code. DParser is a scannerless GLR parser generator based on the Tomita algorithm. It is self-hosted and very easy to use. Grammars are written in a natural style of EBNF and regular expressions and support both speculative and final actions.

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.

Waxeye is a parser generator based on parsing expression grammars (PEGs). It supports C, Java, Javascript, Python, Ruby and Scheme.

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.

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.