Difference between revisions of "Regular expression"

Revision as of 12:17, 24 February 2017

In theoretical computer science and formal language theory, a regular expression (abbreviated regex or regexp and sometimes called a rational expression) is a sequence of characters that define a search pattern.

Description

This search pattern is used for pattern matching with strings, or string matching, i.e. "find and replace"-like operations.

History

The concept arose in the 1950s, when the American mathematician Stephen Kleene formalized the description of a regular language, and came into common use with the Unix text processing utilities ed, an editor, and grep (global regular expression print), a filter.

Standards

Regular expressions are so useful in computing that the various systems to specify regular expressions have evolved to provide both a basic and extended standard for the grammar and syntax.

Modern regular expressions heavily augment the standard.

Regular expression processors

Regular expression processors are found in several search engines, search and replace dialogs of several word processors and text editors, and in the command lines of text processing utilities, such as sed and AWK.

See also

• Comparison of regular expression engines
• Computer science
• Extended Backus–Naur Form
• Formal language
• List of regular expression software – applications which support regular expressions
• Pattern matching
• Ragel
• Regular tree grammar
• Search pattern
• String (computer science)
• Theoretical computer science
• Thompson's construction algorithm – converts a regular expression into an equivalent nondeterministic finite automaton (NFA)

External links

• Regular expression @ Wikipedia