Search Results for "regular expression generator"

Parser library that uses an EBNF like grammar to generate a parse tree You can use it to create a quick parser It uses backtracking so it may be slow for some grammar rules

This is a self compiling XPL compiler for the Modcomp III/IV and Classic. The XPL language is described in the book "A Compiler Generator" by McKeeman, Horning and Wortman. This project has two compilers. The first was written in the late 1970's and released to the Modcomp Users Group (MUSE). The second compiler is an extension of the first that includes a Common Sub-Expression optimizer. XPL was used to write the HAL/S compiler for NASA about the same time this XPL compiler was being developed but this is not the compiler used to create HAL/S. ...

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.

IronMeta is an implementation of Alessandro Warth's OMeta metaprogramming system in C#. It provides a packrat parser generator that generates parsers for Parsing Expression Grammars that operate on arbitrary streams of objects.

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.

orca is yet another script language which supports OO & distribute processing & functional programming aspects. And It's useful in string processing with decode statements & regular expression in it.

cmptNFA is a tool for automatic construction of compact non-deterministic finite automates from simple regular expression specification.We implemented tool using GNU Bison and Flex .

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.

Regular Expression Engine for pattern matching Using Hardware supported dfa.