An easy to use Regular Expression Tester/Evaluator
-
Updated
Aug 11, 2013 - Python
A regular expression (shortened as regex or regexp), sometimes referred to as rational expression, is a sequence of characters that specifies a match pattern in text. Usually such patterns are used by string-searching algorithms for "find" or "find and replace" operations on strings, or for input validation.
Regular expression techniques are developed in theoretical computer science and formal language theory. They are used in search engines, in search and replace dialogs of word processors and text editors, in text processing utilities such as sed and AWK, and in lexical analysis. Regular expressions are also supported in many programming languages.
Different syntaxes for writing regular expressions have existed since the 1980s, one being the POSIX standard and another, widely used, being the Perl syntax.
An easy to use Regular Expression Tester/Evaluator
Generate text from regular expressions. (wait, I definitely implemented this functionality (reverse regexps) at some point; where did I put that? there are no changes in this fork. oh well, there are other libraries for it now I think)
Automata generators for multiple input types (regular expression, right linear grammar etc.)
states is a utility for working with NFA, DFA and regular expressions
Reverse regular expression engine that calculates strings matching a given regex
UKZN Computer Science Theory of Computation 3rd year project.
A delightful regular expressions DSL
PHP parser combinators
C automata library to build, determinize, minimize, translate regexp etc
A *correct* implementation of regular expression matching (using finite state automata).
A better API for PHP's regular expression functions
Object-oriented wrappers for PHP strings, arrays, and regexes
Search engine for checking your internal marks for SRMites.
Renames files in bulk using regular expressions.
Consume a text file with sentences and produce a tweet (< 145 characters) with the style of the input text. I see several layers of success in this project and encourage you to shoot for the level that best matches your team's abilities: Level 1 does the base Markov Sentence Generation from the sample text. (Google around and you'll find lots of…
A Toolkit of Quartets for Parsing different parts of ECMAScript