-
1 regular expression
"A concise and flexible notation for finding and replacing patterns of text. The notation comprises two basic character types: literal (normal) text characters, which indicate text that must exist in the target string, and metacharacters, which indicate the text that can vary in the target string. You can use regular expressions to quickly parse large amounts of text to find specific character patterns; extract, edit, replace, or delete text substrings; or to add the extracted strings to a collection in order to generate a report." -
2 regex
"A concise and flexible notation for finding and replacing patterns of text. The notation comprises two basic character types: literal (normal) text characters, which indicate text that must exist in the target string, and metacharacters, which indicate the text that can vary in the target string. You can use regular expressions to quickly parse large amounts of text to find specific character patterns; extract, edit, replace, or delete text substrings; or to add the extracted strings to a collection in order to generate a report."
См. также в других словарях:
String searching algorithm — String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text. Let Σ be… … Wikipedia
string vest — noun A vest made of a netlike fabric • • • Main Entry: ↑string * * * string vest UK US noun [countable] [singular string vest plural string vests … Useful english dictionary
Regular expression — In computing, a regular expression provides a concise and flexible means for matching (specifying and recognizing) strings of text, such as particular characters, words, or patterns of characters. Abbreviations for regular expression include… … Wikipedia
Regular grammar — Strictly regular grammars = In computer science, a right regular grammar (also called right linear grammar) is a formal grammar ( N , Σ, P , S ) such that all the production rules in P are of one of the following forms: # A → a where A is a non… … Wikipedia
String operations — In computer science, in the area of formal language theory, frequent use is made of a variety of string functions; however, the notation used is different from that used on computer programming, and some commonly used functions in the theoretical … Wikipedia
Regular Expression — In der Informatik ist ein Regulärer Ausdruck (engl. regular expression, Abk. RegExp oder Regex) eine Zeichenkette, die der Beschreibung von Mengen beziehungsweise Untermengen von Zeichenketten mit Hilfe bestimmter syntaktischer Regeln dient.… … Deutsch Wikipedia
Regular expression examples — 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… … Wikipedia
String (computer science) — In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from a set or alphabet. In computer programming, a string is traditionally a sequence of… … Wikipedia
Regular language — In theoretical computer science, a regular language is a formal language (i.e., a possibly infinite set of finite sequences of symbols from a finite alphabet) that satisfies the following equivalent properties: * it can be accepted by a… … Wikipedia
String theory — This article is about the branch of theoretical physics. For other uses, see String theory (disambiguation). String theory … Wikipedia
String literal — A string literal is the representation of a string value within the source code of a computer program. There are numerous alternate notations for specifying string literals, and the exact notation depends on the individual programming language in … Wikipedia
