Reguler Expression (RegEx)

Reguler Expression (RegEx)

In theoretical computer science and formal language theory, a regular expression (abbreviated regex or regexp) is a sequence of characters that forms a search pattern, mainly for use in pattern matching with strings, or string matching, i.e. "find and replace"-like operations. 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.

Each character in a regular expression is either understood to be a metacharacter with its special meaning, or a regular character with its literal meaning. Together, they can be used to identify textual material of a given pattern, or process a number of instances of it that can vary from a precise equality to a very general similarity of the pattern. The pattern sequence itself is an expression that is a statement in a language designed specifically to represent prescribed targets in the most concise and flexible way to direct the automation of text processing of general text files, specific textual forms, or of random input strings.

A regular expression is a pattern that the regular expression engine attempts to match in input text. A pattern consists of one or more character literals, operators, or constructs. A regular expression (regex or regexp for short) is a special text string for describing a search pattern. You can think of regular expressions as wildcards on steroids.

Basically, a regular expression is a pattern describing a certain amount of text. Their name comes from the mathematical theory on which they are based. But we will not dig into that. You will usually find the name abbreviated to "regex" or "regexp". This tutorial uses "regex", because it is easy to pronounce the plural "regexes".

A regular expression processor processes a regular expression statement expressed in terms of a grammar in a given formal language, and with that examines the target text string, parsing it to identify substrings that are members of its language, the regular expressions.
A regular expression "engine" is a piece of software that can process regular expressions, trying to match the pattern to the given string. Usually, the engine is part of a larger application and you do not access the engine directly. Rather, the application invokes it for you when needed, making sure the right regular expression is applied to the right file or data.


Reguler Expression (RegEx)
added 5 years 8 months ago

Contents related to 'Reguler Expression (RegEx)'

Regular Expressions (Regex) Reference Sheet: A regular expression (regex or regexp for short) is a special text string for describing a search pattern.

- Scikit-learn
- Bower
- Apache Spark
- Apache Chukwa
- Scaldi
- Redis
- CruiseControl and CruiseControl.Net (CCNet)
- Financial Information Exchange (FIX) API
- Portable Operating System Interface (POSIX)
- Reguler Expression (RegEx)
- Metaprogramming
- Windows Communication Foundation (WCF)
- CXF
- MINA, NIO
- WebLogic
- Wildcards
- Message-oriented middleware (MOM)
- Team Foundation Server (TFS)
- CppUnit
- Google Protocol Buffer (ProtocolBuf)
5
4
3
2
1