Search Results for "regular expression tool"

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. The spg tool takes .parser files that contain descriptions of parsers as input and produces C++ source code for parser classes as output. ...

Sequence Diagram is a tool to generate simple sequence diagrams (UML) from Java, kotlin, scala(Beta), and Groovy (limited) code.

qtFlexC++ is a tool for generating scanners: programs which recognized lexical patterns in text. qtFlexC++ reads the given input files for a description of a scanner to generate. The description is in the form of pairs of regular expressions and C++ code, called rules. qtFlexC++ generates as output a C++ source and include file, `lexyy.cpp` and `lexyy.h`, which defines a class `lexyy'.

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.

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.