Search Results for "regular expression generator"

LABB-CAT is a browser-based linguistics research tool that stores recordings and regular-expression searchable text transcripts of interviews. The search results, entire transcripts, and media, can be viewed or exported in a variety of format

Artha is a handy thesaurus based on WordNet with distinct features like global hotkey look-up, passive desktop notifications, regular expression based search, etc.. Artha may be used as a free open-source replacement to the proprietary WordWeb Pro.

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as...

This project contains a set of php/perl scripts to analyze Cisco IOS-XR routers PE configuration, providing an html output which is very useful to surf over configurations. Moreover, it contains some other functions to search and compare configurations (access-list, prefix-sets, route-maps ...) between XR and IOS routers, and to analyze syslog data. It is not intended for "normal" end-users, but for network administrators and operations groups. You will need to install Apache (or any...

Geographic tag manipulator - a simple XSLT-based tool to add, remove, or change tags of OpenStreetMap objects.

dna2abc turns DNA sequences into musical sequences. The key feature is the rule editor; a rule is a regular expression paired with a Tcl script. dna2abc scans a DNA sequence, testing each regular expression: if it matches, the Tcl script is run.

Perl Entrez Gene Parser project provides Perl parsers for NCBI's Entrez Gene based on regular expression, Parse::RecDescent, Parse::Yapp and Perl-byacc. Some can parse human genome annotations in minutes. Documentation and user guides are provided.

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.

JREC is a framework for building finite state automatons from regular expressions based on a general grammar.

Pattern matching C++ library for simple regular expression in utf8 encoding.