Search Results for "regular expression generator"

Re2c is a tool for writing very fast and very flexible scanners. Unlike any other such tool, re2c focuses on generating high efficient code for regular expression matching. As a result this allows a much broader range of use than any traditional lexer.

The SoulNG project contains two tools: a lexical analyzer generator slg and a parser generator spg. The generators and the produced lexical analyzers and parsers use four C++ libraries that are also included in the project. The slg tool takes a .lexer file that contains the description of a lexical analyzer as input and produces C++ source code for a lexical analyzer as output. The produced lexical analyzer is a finite state machine that recognizes patterns described as regular expressions and return corresponding token identifiers to the parser. ...

Junicon is a Java-based implementation of Unicon, a very high level object-oriented goal-directed programming language that lives at Unicon.org. Junicon features seamless Java object access, interactive interpretation, and numerous cleanups and enhancements while retaining Unicon's core expression-evaluation semantics. Please see the Junicon Project Web Site for publications about Junicon.

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.

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

A Mac application (written in MacRuby) that will allow users to write in english a definition for a regular expression, which will then be converted into a ruby regular expression, which can also be used in other languages with minimal modification.

The Chilon Library is a C++0x utility library. The most advanced parts are a command-line argument parser and a parser generator library based on parsing expression grammars with built in AST generation abilities.

PET is a C++ library that implements generic regular path expressions. It provides a set of classes and overloaded operators that allow the programmer to define regular path expressions over user-defined data structures using solely the GCC compiler

Provides a Java programmable only text file editor. No gui is available. It supplies most of the features you expect from an editor including selections.

RExASTor is a code generator for tree like structures. The user gives it a set of expressions that look a lot like regular expression but for trees and the tool generates Java data-structures for the described trees.

A flexible XML based PHP code generator, generates: 1) fully functional HTML forms that update and insert on multiple tables, 2) validation methods using regular expressions 3) HTML table generation from database using separate HTML layout files.

This program allows you to specify a Deterministic Finite Automata, Nondeterministic Finite Automata, or Generalized NFA and will return a regular expression which recognizes the same language as the FA you described.

An Regular Expression with Korean Support.