Today, we will discuss “Regular expressions”.
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. The specific syntax rules vary depending on the specific implementation, programming language, or library in use. Additionally, the functionality of regex implementations can vary between versions
In another words, 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 formalism, if there is any regex that matches a particular set then there are an infinite number of such expressions.
Sunday, April 29, 2007
Automata Step by Step
Labels:
expression,
Handel,
implementation,
pattern,
programming language,
regex,
regular expression,
String
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment