Regular expressions (Computer science)
Enlarge text Shrink text-
Topic
|
System number
987012575112805171
-
Save successfulThe item can be found in your Personal ZoneשגיאהLog in to your account to save
Information for Authority record
Name (Hebrew)
ביטויים רגולריים (מדעי המחשב)
Name (Latin)
Regular expressions (Computer science)
Name (Arabic)
تعبير نمطي
Other forms of name
Rational expressions (Computer science)
Regexes (Computer science)
Regexps (Computer science)
See Also From tracing topical name
Text processing (Computer science)
MARC
MARC
Other Identifiers
Wikidata:
Q185612
Library of congress:
sh2018002310
Sources of Information
- Work cat.: 2016962076: Introducing regular expressions, 2017.
- 2016302350: Windham, Matthew. Introduction to Regular Expressions in SAS, 2014.
- 2001034634: Effective awk programming, 2001:table of contents (gawk-Specific Regexp Operators [...] Using Dynamic Regexps)
- A regular expression, regex or regexp (sometimes called a rational expression) is, in theoretical computer science and formal language theory, a sequence of characters that define a search pattern. Usually this pattern is then used by string searching algorithms for "find" or "find and replace" operations on strings. ( (Wikipedia article "Regular expression," viewed online February 7, 2018) )
- Regular expressions (regexps) are patterns which describe the contents of a string. They're used for testing whether a string contains a given pattern, or extracting the portions that match. ( (Ruby programming language documentation, Regexp class page, viewed February 7, 2018:) )
- Regular expressions, regexes for short, are a sequence of characters that describe a pattern of text. Pattern matching is the process of matching those patterns to actual text. ( (Perl 6 Documentation, Regexes, viewed February 7, 2018:) )
- TechTarget, Oct. 15, 2018(Regular expression (regex): A regular expression (sometimes abbreviated to "regex") is a way for a computer user or programmer to express how a computer program should look for a specified pattern in text and then what the program is to do when each pattern match is found. For example, a regular expression could tell a program to search for all text lines that contain the word "Windows 95" and then to print out each line in which a match is found or substitute another text sequence (for example, just "Windows") where any match occurs)