Citizendia
Your Ad Here

In computing, regular expressions provide a concise and flexible means for identifying strings of text of interest, such as particular characters, words, or patterns of characters. Computing is usually defined like the activity of using and developing Computer technology Computer hardware and software. Regular expressions (abbreviated as regex or regexp, with plural forms regexes, regexps, or regexen) are written in a formal language that can be interpreted by a regular expression processor, a program that either serves as a parser generator or examines text and identifies parts that match the provided specification. A compiler-compiler or compiler generator is a tool that creates a parser, interpreter, or Compiler from some form of formal description

The following examples illustrate a few specifications that could be expressed in a regular expression:

Regular expressions can be much more complex than these examples.

Regular expressions are used by many text editors, utilities, and programming languages to search and manipulate text based on patterns. A text editor is a type of program used for editing plain Text files Text editors are often provided with Operating systems or software development A pattern, from the French patron, is a theme of recurring events or objects sometimes referred to as elements of a set For example, Perl and Tcl have a powerful regular expression engine built directly into their syntax. NOTES FOR EDITORS "Perl" is not an acronym (read the "Name" section below Tcl (originally from "Tool Command Language" but nonetheless conventionally rendered as "Tcl" rather than "TCL" pronounced as " tickle " Several utilities provided by Unix distributions—including the editor ed and the filter grep—were the first to popularize the concept of regular expressions. Unix (officially trademarked as UNIX, sometimes also written as Unix with Small caps) is a computer ed is the standard Text editor on the Unix operating system ed was originally written by Ken Thompson and contains one of the first implementations of grep is a command line text search utility originally written for Unix.

As an example of the syntax, the regular expression \bex can be used to search for all instances of the string "ex" that occur after word boundaries (signified by the \b). Thus in the string "Texts for experts," \bex matches the "ex" in "experts" but not in "Texts" (because the "ex" occurs inside a word and not immediately after a word boundary).

Many modern computing systems provide wildcard characters in matching filenames from a file system. For other meanings of 'wild card' see Wild card. The term wildcard character has the following meanings Telecommunication In In Computing, a file system (often also written as filesystem) is a method for storing and organizing Computer files and the data they contain to make This is a core capability of many command-line shells and is also known as globbing. In computing a shell is a piece of software that provides an interface for users In Computer programming, the verb glob or globbing is used to refer to an instance of Pattern matching behavior Wildcards differ from regular expressions in that they generally only express very limited forms of alternation.

Contents

Basic concepts

A regular expression, often called a pattern, is an expression that describes a set of strings. They are usually used to give a concise description of a set, without having to list all elements. For example, the set containing the three strings "Handel", "Händel", and "Haendel" can be described by the pattern H(ä|ae?)ndel (or alternatively, it is said that the pattern matches each of the three strings). In most formalisms, if there is any regex that matches a particular set then there is an infinite number of such expressions. Most formalisms provide the following operations to construct regular expressions.

Alternation
A vertical bar separates alternatives. For example, gray|grey can match "gray" or "grey".
Grouping
Parentheses are used to define the scope and precedence of the operators (among other uses). For example, gray|grey and gr(a|e)y are equivalent patterns which both describe the set of "gray" and "grey".
Quantification
A quantifier after a token (such as a character) or group specifies how often that preceding element is allowed to occur. The most common quantifiers are ?, *, and +.
? The question mark indicates there is zero or one of the preceding element. For example, colou?r matches both "color" and "colour".
* The asterisk indicates there are zero or more of the preceding element. For example, ab*c matches "ac", "abc", "abbc", "abbbc", and so on.
+ The plus sign indicates that there is one or more of the preceding element. For example, ab+c matches "abc", "abbc", "abbbc", and so on, but not "ac".

These constructions can be combined to form arbitrarily complex expressions, much like one can construct arithmetical expressions from numbers and the operations +, −, ×, and ÷. For example, H(ae?|ä)ndel and H(a|ae|ä)ndel are both valid patterns which match the same strings as the earlier example, H(ä|ae?)ndel.

The precise syntax for regular expressions varies among tools and with context; more detail is given in the Syntax section. In Linguistics, syntax (from Ancient Greek grc συν- syn-, "together" and grc τάξις táxis, "arrangement" is the

History

The origins of regular expressions lie in automata theory and formal language theory, both of which are part of theoretical computer science. A formal language is a set of words, ie finite strings of letters, or symbols. Theoretical computer science is the collection of topics of Computer science that focuses on the more abstract logical and mathematical aspects of Computing, such These fields study models of computation (automata) and ways to describe and classify formal languages. In the 1950s, mathematician Stephen Cole Kleene described these models using his mathematical notation called regular sets. Stephen Cole Kleene ( January 5, 1909, Hartford Connecticut, USA &ndash January 25, 1994, Madison Wisconsin The SNOBOL language was an early implementation of pattern matching, but not identical to regular expressions. SNOBOL ( String Oriented Symbolic Language) is a Computer Programming language developed between 1962 and 1967 at AT&T Bell Laboratories In Computer science, pattern matching is the act of checking for the presence of the constituents of a given Pattern. Ken Thompson built Kleene's notation into the editor QED as a means to match patterns in text files. Kenneth Lane Thompson (born February 4 1943) commonly referred to as Ken Thompson (or simply QED is a line-oriented computer Text editor that was designed by Butler Lampson and L He later added this capability to the Unix editor ed, which eventually led to the popular search tool grep's use of regular expressions ("grep" is a word derived from the command for regular expression searching in the ed editor: g/re/p where re stands for regular expression). ed is the standard Text editor on the Unix operating system ed was originally written by Ken Thompson and contains one of the first implementations of grep is a command line text search utility originally written for Unix. Since that time, many variations of Thompson's original adaptation of regular expressions have been widely used in Unix and Unix-like utilities including expr, AWK, Emacs, vi, and lex. expr is a command line Unix utility which evaluates an expression and outputs the corresponding value AWK is a general purpose Programming language that is designed for processing text-based data either in files or data streams and was created at Bell Labs in the 1970s Emacs is a class of feature-rich Text editors usually characterized by their extensibility vi is a screen-oriented Text editor written by Bill Joy in 1976 for an early BSD release In Computer science, lex is a program that generates lexical analyzers ("scanners" or "lexers"

Perl and Tcl regular expressions were derived from a regex library written by Henry Spencer, though Perl later expanded on Spencer's library to add many new features. NOTES FOR EDITORS "Perl" is not an acronym (read the "Name" section below Tcl (originally from "Tool Command Language" but nonetheless conventionally rendered as "Tcl" rather than "TCL" pronounced as " tickle " Henry Spencer is a Canadian Computer programmer and space enthusiast [1] Philip Hazel developed PCRE (Perl Compatible Regular Expressions), which attempts to closely mimic Perl's regular expression functionality, and is used by many modern tools including PHP and Apache HTTP Server. Philip Hazel is a Computer programmer best known for writing the Exim mail transport agent and the PCRE regular expression library Perl Compatible Regular Expressions ( PCRE) is a Regular expression C library inspired by Perl 's external interface written by PHP is a computer Scripting language. Originally designed for producing Dynamic web pages it has evolved to include a Command line interface capability Part of the effort in the design of Perl 6 is to improve Perl's regular expression integration, and to increase their scope and capabilities to allow the definition of parsing expression grammars. Perl 6 is a planned major revision to the Perl Programming language. A parsing expression grammar, or PEG, is a type of analytic Formal grammar that describes a Formal language in terms of a set of rules for recognizing [2] The result is a mini-language called Perl 6 rules, which are used to define Perl 6 grammar as well as provide a tool to programmers in the language. Perl 6 rules are Perl 6 's Regular expression, Pattern matching and general-purpose Parsing facility and are a core part of the language These rules maintain existing features of Perl 5. x regular expressions, but also allow BNF-style definition of a recursive descent parser via sub-rules. In Computer science, Backus–Naur Form ( BNF) is a Metasyntax used to express Context-free grammars that is a formal way to describe Formal A recursive descent parser is a top-down parser built from a set of mutually-recursive procedures (or a non-recursive equivalent where each such Procedure

The use of regular expressions in structured information standards for document and database modeling started in the 1960s and expanded in the 1980s when industry standards like ISO SGML (precursored by ANSI "GCA 101-1983") consolidated. The Standard Generalized Markup Language ( ISO 88791986 SGML) is an ISO Standard Metalanguage in which one can define Markup languages The kernel of the structure specification language standards are regular expressions. An XML schema is a description of a type of XML document typically expressed in terms of constraints on the structure and content of documents of that type above and beyond Simple use is evident in the DTD element group syntax. Document Type Definition ( DTD) is one of several SGML and XML schema languages and is also the term used to describe a document or portion thereof that

See also Pattern matching: History. In Computer science, pattern matching is the act of checking for the presence of the constituents of a given Pattern.

Formal language theory

Regular expressions can be expressed in terms of formal language theory. A formal language is a set of words, ie finite strings of letters, or symbols. Regular expressions consist of constants and operators that denote sets of strings and operations over these sets, respectively. Given a finite alphabet Σ the following constants are defined:

The following operations are defined:

The above constants and operators form a Kleene algebra. In Mathematics, a Kleene algebra (named after Stephen Cole Kleene, ˈkleɪni as in "clay-knee" is either of two different things A

To avoid brackets it is assumed that the Kleene star has the highest priority, then concatenation and then set union. If there is no ambiguity then brackets may be omitted. For example, (ab)c can be written as abc, and a|(b(c*)) can be written as a|bc*.

Examples:

The formal definition of regular expressions is purposely parsimonious and avoids defining the redundant quantifiers ? and +, which can be expressed as follows: a+ = aa*, and a? = (a|ε). Sometimes the complement operator ~ is added; ~R denotes the set of all strings over Σ* that are not in R. The complement operator is redundant, as it can always be expressed by using the other operators (although the process for computing such a representation is complex, and the result may be exponentially larger).

Regular expressions in this sense can express the regular languages, exactly the class of languages accepted by finite state automata. There is, however, a significant difference in compactness. Some classes of regular languages can only be described by automata that grow exponentially in size, while the length of the required regular expressions only grow linearly. Exponential growth (including Exponential decay) occurs when the growth rate of a mathematical function is proportional to the function's current value Regular expressions correspond to the type-3 grammars of the Chomsky hierarchy. In Formal semantics, Computer science and Linguistics, a formal grammar (also called formation rules) is a precise description of a Formal Within the field of Computer science, specifically in the area of Formal languages, the Chomsky hierarchy (occasionally referred to as Chomsky–Schützenberger On the other hand, there is a simple mapping between regular expressions and nondeterministic finite automata (NFAs) that does not lead to such a blowup in size; for this reason NFAs are often used as alternative representations of regular expressions. In the Theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA is a Finite state machine where for each

We can also study expressive power within the formalism. As the examples show, different regular expressions can express the same language: the formalism is redundant.

It is possible to write an algorithm which for two given regular expressions decides whether the described languages are essentially equal, reduces each expression to a minimal deterministic finite state machine, and determines whether they are isomorphic (equivalent). In Mathematics, Computing, Linguistics and related subjects an algorithm is a sequence of finite instructions often used for Calculation In Abstract algebra, an isomorphism ( Greek: ἴσος isos "equal" and μορφή morphe "shape" is a bijective

To what extent can this redundancy be eliminated? Can we find an interesting subset of regular expressions that is still fully expressive? Kleene star and set union are obviously required, but perhaps we can restrict their use. This turns out to be a surprisingly difficult problem. As simple as the regular expressions are, it turns out there is no method to systematically rewrite them to some normal form. The lack of axiomatization in the past led to the star height problem. The star-height problem in Formal language theory is the question whether all Regular languages can be expressed using regular expressions of limited Recently, Cornell University professor Dexter Kozen axiomatized regular expressions with Kleene algebra. In Mathematics, a Kleene algebra (named after Stephen Cole Kleene, ˈkleɪni as in "clay-knee" is either of two different things A

It is worth noting that many real-world "regular expression" engines implement features that cannot be expressed in the regular expression algebra; see below for more on this.

Syntax

POSIX

POSIX Basic Regular Expressions

Traditional Unix regular expression syntax followed common conventions but often differed from tool to tool. Unix (officially trademarked as UNIX, sometimes also written as Unix with Small caps) is a computer The IEEE POSIX Basic Regular Expressions (BRE) standard (released alongside an alternative flavor called Extended Regular Expressions or ERE) was designed mostly for backward compatibility with the traditional syntax but provided a common standard which has since been adopted as the default syntax of many Unix regular expression tools, though there is often some variation or additional features. The Institute of Electrical and Electronics Engineers or IEEE (read eye-triple-e) is an international Non-profit, professional organization POSIX (ˈpɒzɪks or "Portable Operating System Interface" is the collective name of a family of related standards specified by the IEEE to define Many such tools also provide support for ERE syntax with command line arguments. In computer Command line interfaces a command line argument is an argument sent to a program being called

In the BRE syntax, most characters are treated as literals — they match only themselves (i. e. , a matches "a"). The exceptions, listed below, are called metacharacters or metasequences. A metacharacter is a character that has a special meaning (instead of a Literal meaning to a computer program such as a shell interpreter or a Regular expression

. Matches any single character (many applications exclude newlines, and exactly which characters are considered newlines is flavor, character encoding, and platform specific, but it is safe to assume that the line feed character is included). Within POSIX bracket expressions, the dot character matches a literal dot. For example, a. c matches "abc", etc. , but [a. c] matches only "a", ". ", or "c".
[ ] A bracket expression. Matches a single character that is contained within the brackets. For example, [abc] matches "a", "b", or "c". [a-z] specifies a range which matches any lowercase letter from "a" to "z". These forms can be mixed: [abcx-z] matches "a", "b", "c", "x", "y", and "z", as does [a-cx-z].

The - character is treated as a literal character if it is the last or the first character within the brackets, or if it is escaped with a backslash: [abc-], [-abc], or [a\-bc].

[^ ] Matches a single character that is not contained within the brackets. For example, [^abc] matches any character other than "a", "b", or "c". [^a-z] matches any single character that is not a lowercase letter from "a" to "z". As above, literal characters and ranges can be mixed.
^ Matches the starting position within the string. In line-based tools, it matches the starting position of any line.
$ Matches the ending position of the string or the position just before a string-ending newline. In line-based tools, it matches the ending position of any line.
\( \) Defines a marked subexpression. The string matched within the parentheses can be recalled later (see the next entry, \n). A marked subexpression is also called a block or capturing group.
\n Matches what the nth marked subexpression matched, where n is a digit from 1 to 9. This construct is theoretically irregular and was not adopted in the POSIX ERE syntax. Some tools allow referencing more than nine capturing groups.
* Matches the preceding element zero or more times. For example, ab*c matches "ac", "abc", "abbbc", etc. [xyz]* matches "", "x", "y", "z", "zx", "zyx", "xyzzy", and so on. \(ab\)* matches "", "ab", "abab", "ababab", and so on.
\{m,n\} Matches the preceding element at least m and not more than n times. For example, a\{3,5\} matches only "aaa", "aaaa", and "aaaaa". This is not found in a few, older instances of regular expressions.

Examples:

POSIX Extended Regular Expressions

The meaning of metacharacters escaped with a backslash is reversed for some characters in the POSIX Extended Regular Expression (ERE) syntax. This article refers to codes used as commands for computing devices With this syntax, a backslash causes the metacharacter to be treated as a literal character. Additionally, support is removed for \n backreferences and the following metacharacters are added:

? Matches the preceding element zero or one time. For example, ba? matches "b" or "ba".
+ Matches the preceding element one or more times. For example, ba+ matches "ba", "baa", "baaa", and so on.
| The choice (aka alternation or set union) operator matches either the expression before or the expression after the operator. For example, abc|def matches "abc" or "def".

Examples:

POSIX Extended Regular Expressions can often be used with modern Unix utilities by including the command line flag -E.

POSIX character classes

Since many ranges of characters depend on the chosen locale setting (i. e. , in some settings letters are organized as abc. . . zABC. . . Z, while in some others as aAbBcC. . . zZ), the POSIX standard defines some classes or categories of characters as shown in the following table:

POSIX ASCII Description
[:alnum:] [A-Za-z0-9] Alphanumeric characters
[:alpha:] [A-Za-z] Alphabetic characters
[:blank:] [ \t] Space and tab
[:cntrl:] [\x00-\x1F\x7F] Control characters
[:digit:] [0-9] Digits
[:graph:] [\x21-\x7E] Visible characters
[:lower:] [a-z] Lowercase letters
[:print:] [\x20-\x7E] Visible characters and spaces
[:punct:] [-!"#$%&'()*+,. /:;<=>?@[\\\]_`{|}~] Punctuation characters
[:space:] [ \t\r\n\v\f] Whitespace characters
[:upper:] [A-Z] Uppercase letters
[:xdigit:] [A-Fa-f0-9] Hexadecimal digits

POSIX character classes can only be used within bracket expressions. For example, [[:upper:]ab] matches the uppercase letters and lowercase "a" and "b".

In Perl regular expressions, [:print:] matches [:graph:] union [:space:]. An additional non-POSIX class understood by some tools is [:word:], which is usually defined as [:alnum:] plus underscore. This reflects the fact that in many programming languages these are the characters that may be used in identifiers. The editor Vim further distinguishes word and word-head classes (using the notation \w and \h) since in many programming languages the characters that can begin an identifier are not the same as those that can occur in other positions. Vim is a Text editor first released by Bram Moolenaar in 1991 for the Amiga computer

Note that what the POSIX regular expression standards call character classes are commonly referred to as POSIX character classes in other regular expression flavors which support them. With most other regular expression flavors, the term character class is used to describe what POSIX calls bracket expressions.

Perl-derivative regular expressions

Perl has a more predictable and much richer syntax than the POSIX basic (BRE) and extended (ERE) regular expression standards. NOTES FOR EDITORS "Perl" is not an acronym (read the "Name" section below An example of its predictability is that \ always escapes a non-alphanumeric character. An example of functionality possible with Perl but not POSIX-compliant regular expressions is the concept of lazy quantification (see the next section).

Due largely to its expressive power, many other utilities and programming languages have adopted syntax similar to Perl's — for example, Java, JavaScript, PCRE, Python, Ruby, Microsoft's .NET Framework, and the W3C's XML Schema all use regular expression syntax similar to Perl's. JavaScript is a Scripting language most often used for Client-side web development Perl Compatible Regular Expressions ( PCRE) is a Regular expression C library inspired by Perl 's external interface written by Python is a general-purpose High-level programming language. Its design philosophy emphasizes programmer productivity and code readability Ruby is a dynamic, reflective, general purpose Object-oriented programming language that combines syntax inspired by Perl with Smalltalk Microsoft Corporation is an American multinational Computer technology Corporation, which rose to dominate the Home computer XML Schema, published as a W3C recommendation in May 2001 is one of several XML schema languages. Some languages and tools such as PHP support multiple regular expression flavors. PHP is a computer Scripting language. Originally designed for producing Dynamic web pages it has evolved to include a Command line interface capability Perl-derivative regular expression implementations are not identical, and many implement only a subset of Perl's features. With Perl 5. 10, this process has come full circle with Perl incorporating syntax extensions originally from Python, PCRE, the . NET Framework, and Java.

Lazy quantification

The standard quantifiers in regular expressions are greedy, meaning they match as much as they can, only giving back as necessary to match the remainder of the regex. For example, someone new to regexes wishing to find the first instance of an item between < and > symbols in this example:

Another whale explosion occurred on <January 26>, <2004>.

. . . would likely come up with the pattern <. *>, or similar. However, this pattern will actually return "<January 26>, <2004>" instead of the "<January 26>" which might be expected, because the * quantifier is greedy — it will consume as many characters as possible from the input, and "January 26>, <2004" has more characters than "January 26".

Though this problem can be avoided in a number of ways (e. g. , by specifying the text that is not to be matched: <[^>]*>), modern regular expression tools allow a quantifier to be specified as lazy (also known as non-greedy, reluctant, minimal, or ungreedy) by putting a question mark after the quantifier (e. g. , <. *?>), or by using a modifier which reverses the greediness of quantifiers (though changing the meaning of the standard quantifiers can be confusing). By using a lazy quantifier, the expression tries the minimal match first. Though in the previous example lazy matching is used to select one of many matching results, in some cases it can also be used to improve performance when greedy matching would require more backtracking. Backtracking is a type of Algorithm that is a refinement of Brute force search.

Patterns for non-regular languages

Many features found in modern regular expression libraries provide an expressive power that far exceeds the regular languages. For example, the ability to group subexpressions with parentheses and recall the value they match in the same expression means that a pattern can match strings of repeated words like "papa" or "WikiWiki", called squares in formal language theory. The pattern for these strings is (. *)\1. However, the language of squares is not regular, nor is it context-free. In Formal language theory, a context-free language is a language generated by some Context-free grammar. Pattern matching with an unbounded number of back references, as supported by numerous modern tools, is NP-hard. In Computer science, pattern matching is the act of checking for the presence of the constituents of a given Pattern. NP-hard (nondeterministic Polynomial-time hard in Computational complexity theory, is a class of problems informally "at least as hard as the hardest problems

However, many tools, libraries, and engines that provide such constructions still use the term regular expression for their patterns. This has led to a nomenclature where the term regular expression has different meanings in formal language theory and pattern matching. A formal language is a set of words, ie finite strings of letters, or symbols. For this reason, some people have taken to using the term regex or simply pattern to describe the latter. Larry Wall (author of Perl) writes in Apocalypse 5:

“ 'Regular expressions' [. Larry Wall (born September 27, 1954) is a Programmer and Author, most widely known for his creation of the Perl Programming . . ] are only marginally related to real regular expressions. Nevertheless, the term has grown with the capabilities of our pattern matching engines, so I'm not going to try to fight linguistic necessity here. I will, however, generally call them "regexes" (or "regexen", when I'm in an Anglo-Saxon mood). [2] ”

Implementations and running times

There are at least two fundamentally different algorithms that decide if and how a given regular expression matches a string. In Mathematics, Computing, Linguistics and related subjects an algorithm is a sequence of finite instructions often used for Calculation

The oldest and fastest relies on a result in formal language theory that allows every nondeterministic finite state machine (NFA) to be transformed into a deterministic finite state machine (DFA). In the Theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA is a Finite state machine where for each In the Theory of computation, a deterministic finite state machine (also known as deterministic finite state automaton (DFSA or deterministic finite The algorithm performs or simulates this transformation and then runs the resulting DFA on the input string, one symbol at a time. The latter process takes time linear to the length of the input string. More precisely, an input string of size n can be tested against a regular expression of size m in time O(n+2m) or O(nm), depending on the details of the implementation. In mathematics big O notation (so called because it uses the symbol O) describes the limiting behavior of a function for very small or very large arguments This algorithm is often referred to as DFA. It is fast, but can only be used for matching and not for recalling grouped subexpressions, lazy quantification, and several other features commonly found in modern regular expression libraries. It is also possible to run the NFA directly, essentially building each DFA state on demand and then discarding it at the next step. This avoids the exponential memory requirements of a fully-constructed DFA while still guaranteeing linear-time search. [3]

The other algorithm is to match the pattern against the input string by backtracking. Backtracking is a type of Algorithm that is a refinement of Brute force search. This algorithm is commonly called NFA, but this terminology can be confusing. Its running time can be exponential, which simple implementations exhibit when matching against expressions like (a|aa)*b that contain both alternation and unbounded quantification and force the algorithm to consider an exponentially increasing number of sub-cases. More complex implementations will often identify and speed up or abort common cases where they would otherwise run slowly.

Although backtracking implementations give an exponential guarantee in the worst case, they provide much greater flexibility and expressive power. For example, any implementation which allows the use of backreferences, or implements the various improvements introduced by Perl, must use a backtracking implementation.

Some implementations try to provide the best of both algorithms by first running a fast DFA match to see if the string matches the regular expression at all, and only in that case perform a potentially slower backtracking match.

Regular expressions and Unicode

Regular expressions were originally used with ASCII characters. American Standard Code for Information Interchange ( ASCII) Many regular expression engines can now handle Unicode. In Computing, Unicode is an Industry standard allowing Computers to consistently represent and manipulate text expressed in most of the world's In most respects it makes no difference what the character set is, but some issues do arise when extending regular expressions to support Unicode.

Uses of regular expressions

Regular expressions are useful in the production of syntax highlighting systems, data validation, and many other tasks. Syntax highlighting is a feature of some Text editors that displays text&mdashespecially Source code &mdashin different colors and fonts according to

While regular expressions would be useful on search engines such as Google or Live Search, processing them across the entire database could consume excessive computer resources depending on the complexity and design of the regex. Google Inc is an American public corporation, earning revenue from advertising related to its Internet search, e-mail, online Live Search (formerly Windows Live Search and MSN Search) is the name of Microsoft 's web Search engine, designed to compete with the Although in many cases system administrators can run regex-based queries internally, most search engines do not offer regex support to the public. A notable exception is Google Code Search. Google Code Search is a free beta product from Google which debuted in Google Labs on October 5, 2006 allowing web users to search

See also

Notes

  1. ^ Wall, Larry and the Perl 5 development team (2006). Libraries Languages Language features NOTE An application using a library for regular expression support does not necessarily offer the In Computer science, Extended Backus–Naur Form (EBNF is a Metasyntax notation used to express Context-free grammars that is a formal way to describe The following is a list of software applications that use Regular expressions In some cases only later versions of the applications use regular expressions A Regular expression ( also "RegEx" or "regex") is a string that is used to describe or match a set of strings according to certain Syntax rules In Computer Science, a regular tree grammar is a Formal grammar that allows to generate trees Larry Wall (born September 27, 1954) is a Programmer and Author, most widely known for his creation of the Perl Programming perlre: Perl regular expressions.
  2. ^ a b Wall, Larry (2002-06-04). Larry Wall (born September 27, 1954) is a Programmer and Author, most widely known for his creation of the Perl Programming See also 2002 (disambiguation Year 2002 ( MMII) was a Common year starting on Tuesday of the Gregorian calendar. Events 781 BC - The first historic Solar eclipse is recorded in China. Apocalypse 5: Pattern Matching.
  3. ^ Cox, Russ (2007). Regular Expression Matching Can Be Simple and Fast.

References

External links

Mozilla Developer Center ( MDC) started in early 2005 is the official Mozilla Foundation Website for development documentation and news about Firefox The Open Directory Project ( ODP) also known as dmoz (from directory

Dictionary

regular expression

-noun

  1. (computing theory) A concise description of a regular formal language with notations for concatenation, alternation, and iteration (repetition) of subexpressions.
  2. (computing more generally) Any pattern for text matching or searching, frequently offering more or less functionality than a theoretical regular expression.
© 2009 citizendia.org; parts available under the terms of GNU Free Documentation License, from http://en.wikipedia.org
 Dapyx Software network: MP3 Explorer | Ebook Manager | Zenithic