Skip to content
#

regular-expressions

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.

Here are 956 public repositories matching this topic...

A high-performance C++ regex library and lexical analyzer generator with Unicode support. Extends Flex++ with Unicode support, indent/dedent anchors, lazy quantifiers, functions for lex and syntax error reporting and more. Seamlessly integrates with Bison and other parsers.

  • Updated Oct 29, 2024
  • C++

Created by Stephen Cole Kleene

Released 1950

Followers
27 followers
Wikipedia
Wikipedia

Related Topics

awk glob grep pattern-matching sed wildcard