AI & ChatGPT searches , social queries for REGULAR EXPRESSION
Search references for REGULAR EXPRESSION. Phrases containing REGULAR EXPRESSION
See searches and references containing REGULAR EXPRESSION!
Search references for REGULAR EXPRESSION. Phrases containing REGULAR EXPRESSION
See searches and references containing REGULAR EXPRESSION!REGULAR EXPRESSION
Sequence of characters that forms a search pattern
A regular expression (shortened as regex or regexp), sometimes referred to as a rational expression, is a sequence of characters that specifies a match
Regular_expression
Patterns used in computer programming
mandate multi-range ([a-c0-3]) support, which derive originally from regular expressions. As reimplementations of Bell Labs' UNIX proliferated, so did reimplementations
Glob_(programming)
Software library for interpreting regular expressions
Perl Compatible Regular Expressions (PCRE) is a library written in C, which implements a regular expression engine, inspired by the capabilities of the
Perl Compatible Regular Expressions
Perl_Compatible_Regular_Expressions
Command-line utility for text search
searching text for lines that match a regular expression. Its name comes from the ed command g/re/p (global, regular expression, print), which has the same effect
Grep
This is a comparison of regular expression engines. Formerly called Regex++. One of fuzzy regular expression engines. Included since version 2.13.0. ICU4J
Comparison of regular expression engines
Comparison_of_regular_expression_engines
Formal language that can be expressed using a regular expression
language theory, a regular language (also called a rational language) is a formal language that can be defined by a regular expression, in the strict sense
Regular_language
Regular expression denial-of-service attack
regular expression denial of service (ReDoS) is an algorithmic complexity attack that produces a denial-of-service by providing a regular expression (regex)
ReDoS
Type of grammar for describing formal languages
as a regular expression which does not match as parsing expression: [ab]?[bc][cd] is both a valid regular expression and a valid parsing expression. As
Parsing_expression_grammar
Topics referred to by the same term
something that will return a value Regular expression, a means of matching strings of text in computing Expression marks, in music, notating the musical
Expression
Interpreted programming language first released in 1987
mid-1990s as a CGI scripting language, in part due to its powerful regular expression and string parsing abilities. In addition to CGI, Perl 5 is used for
Perl
Type of formal grammar
0\}} , the paradigmatic non-regular linear language. Regular expression, a compact notation for regular grammars Regular tree grammar, a generalization
Regular_grammar
Algorithm to transform a regular expression into a finite automaton
regular expression into an equivalent nondeterministic finite automaton (NFA). This NFA can be used to match strings against the regular expression.
Thompson's_construction
Software library for regular expressions
library which implements a regular expression engine. It uses finite-state machines, in contrast to most other regular expression libraries. RE2 requires
RE2_(software)
Function defined on formal languages in computer science
compute the derivative of a generalized regular expression. Even though originally studied for regular expressions, the definition applies to arbitrary formal
Brzozowski_derivative
the mathematical formalisms called "finite automaton", "regular grammar", or "regular expression", all of which have the same expressive power. Since the
Induction of regular languages
Induction_of_regular_languages
Type of finite-state machine in automata theory
used in the implementation of regular expressions: Thompson's construction is an algorithm for compiling a regular expression to an NFA that can efficiently
Nondeterministic finite automaton
Nondeterministic_finite_automaton
Text processing programming language
associative arrays (that is, arrays indexed by key strings), and regular expressions. While AWK has a limited intended application domain and was especially
AWK
Written or spoken word game
Xghost, played on regular languages generated by regular expressions. Thus Superghost, Superduperghost, Xghost played on regular languages are all PSPACE-hard
Ghost_(game)
Beta product from Google
custom-built, denial-of-service resistant regular expression engine. In March 2010, the code of RE2, the regular expression engine used in Google Code Search
Google_Code_Search
Text-string-oriented programming language
object-oriented languages such as JavaScript whose patterns are known as regular expressions. In addition SNOBOL4 strings generated during execution can be treated
SNOBOL
Algorithm relating regular expressions to NFAs
transforms a given regular expression into an equivalent nondeterministic finite automaton (NFA). Thus, it forms a bridge between regular expressions and nondeterministic
Glushkov's construction algorithm
Glushkov's_construction_algorithm
Conversion of character sequences into token sequences in computer science
syntax. The lexical syntax is usually a regular language, with the grammar rules consisting of regular expressions; they define the set of possible character
Lexical_analysis
Compiling bytecode to machine code at runtime
applications of regular expressions, here for pattern matching in the text editor QED. For speed, Thompson implemented regular expression matching by JITing
Just-in-time_compilation
Idempotent semiring endowed with a closure operator
Stephen Cole Kleene) is a semiring that generalizes the theory of regular expressions: it consists of a set supporting union (addition), concatenation
Kleene_algebra
Topics referred to by the same term
equations Regular algebra, or Kleene algebra Regular code, an algebraic code with a uniform distribution of distances between codewords Regular expression, a
Regular
Character that has a special meaning to a computer program
special meaning to a computer program, such as a shell interpreter or a regular expression (regex) engine. For instance, in XML, the < character is interpreted
Metacharacter
High-level programming language
the beginning, regularly updated) support, first released 1999. Regular expressions Cross-platform: Windows API; Unix, Linux, Macintosh etc. Close, cross-platform
Tcl_(programming_language)
Functional programming construct
Sequence patterns (e.g., a text string) are often described using regular expressions and matched using techniques such as backtracking. Tree patterns
Pattern_matching
General-purpose programming language
such as in regular expressions and Windows-style paths. (Compare "@-quoting" in C#.) Python has array index and array slicing expressions in lists, which
Python_(programming_language)
Character(s) for specifying the boundary between regions of data
escape / in Perl regular expressions, leading to sequences such as "\/\/"); Data becomes difficult to parse via regular expression Requires a way to
Delimiter
Specialized computer hardware
networks, and regular expression hardware acceleration for spam control in the server industry, intended to prevent regular expression denial of service
Hardware_acceleration
Algorithm in theoretical computer science
into a regular expression. Together with other conversion algorithms, it establishes the equivalence of several description formats for regular languages
Kleene's_algorithm
for the structural complexity of regular expressions and regular languages. The star height of a regular expression equals the maximum nesting depth of
Star_height
Programming language specialized to a specific application domain
a regular expression syntax which matches patterns in lines of text. The sed utility defines a syntax for matching and replacing regular expressions. Often
Domain-specific_language
Sequence of words formed by specific rules
formal grammar; those strings described or matched by a particular regular expression; those strings accepted by some automaton, such as a Turing machine
Formal_language
Utility for transforming text
("quick editor", 1965–66). It was one of the earliest tools to support regular expressions, and remains in use for text processing, most notably with the substitution
Sed
Object-oriented programming language
+ c _endproc x << my_procedure(1, 2, 3) # x = 6 Magik supports // regular expression syntax: _if /Hello\,\s(\w)+!/.matches?("Hello, Magik!") _then write("Got
Magik_(programming_language)
writing regular expressions (RE, or regexes), and the interpreter contains an engine for matching strings to regular expressions. The regular-expression engine
Perl_language_structure
American computer scientist known for Unix (born 1943)
operating system. Other notable contributions included his work on regular expressions and early computer text editors QED and ed, the definition of the
Ken_Thompson
Punctuation and accent mark (~, ◌̃)
operator" that creates a regular expression pattern object. =~ and ==~ can in Groovy be used to match a regular expression. In Haskell, the tilde is
Tilde
Typographic symbol
may see use as a delimiter for regular expression operations (e.g. in sed). This is useful when the regular expression contains instances of the more
Vertical_bar
Topics referred to by the same term
numerator and the denominator are polynomials. A regular expression, also known as rational expression, used in formal language theory (computer science)
Rational_expression
Open-source library for pattern matching in text
open-source library for pattern matching in text, which works like a regular expression engine with the ability to do approximate string matching. It was
TRE_(computing)
Delimited series of characters that represent a string in code
escaped regular expression matching a UNC name begins with 8 backslashes, "\\\\\\\\", due to needing to escape the string and the regular expression. Using
String_literal
GNU replacement for the Bourne shell
bracket test: [[...]], which includes advanced features: Extended regular expression and extglob matching Lexicographic comparisons with < and >; ((..
Bash_(Unix_shell)
Analysing a string of symbols, according to the rules of a formal grammar
parsing is done using regular expressions, in which a group of regular expressions defines a regular language and a regular expression engine automatically
Parsing
Standard UNIX utility
evaluates an expression and outputs the result. It evaluates integer or string expressions, including pattern matching regular expressions. Comparison
Expr
Set of rules defining correctly structured programs
grads. /expression/.test(string); // returns Boolean "string".search(/expression/); // returns position Number "string".replace(/expression/, replacement);
JavaScript_syntax
Algorithm for the minimization of Boolean functions
regularExpression ← ConvertToRegularExpression(primeImplicant) for j = 0 to length(minterms) do // If there is a match between the regular expression
Quine–McCluskey_algorithm
General-purpose programming language
grep_v(regexp) which will match all negative examples of a given regular expression in addition to other new features. Ruby 2.4.0 includes performance
Ruby_(programming_language)
Class of languages studied in formal language theory in computer science
theory, the ω-regular languages are a class of ω-languages that generalize the definition of regular languages to infinite words. As regular languages accept
Omega-regular_language
Control flow statement that branches according to a Boolean expression
control flow based on the value of a condition; a Boolean expression. A conditional expression evaluates to a value without the side-effect of changing
Conditional (computer programming)
Conditional_(computer_programming)
Canadian computer programmer
enthusiast. He wrote "regex", a widely used software library for regular expressions, and co-wrote C News, a Usenet server program. He also wrote The
Henry_Spencer
Free and open text editor component
basic regular expression search implementation is rudimentary, but if compiled with C++11 support Scintilla can support the runtime's regular expression engine
Scintilla_(software)
Unsolved problem in formal language theory
Unsolved problem in computer science Can all regular languages be expressed using generalized regular expressions with a limited nesting depth of Kleene stars
Generalized star-height problem
Generalized_star-height_problem
Problem in formal language theory
language theory is the question whether all regular languages can be expressed using regular expressions of limited star height, i.e. with a limited nesting
Star_height_problem
Sequence of characters, data type
Ruby, and Tcl employ regular expressions to facilitate text operations. Perl is particularly noted for its regular expression use, and many other languages
String_(computer_science)
Reset to the beginning of a line of text
"Regular expression syntax reference". JetBrains. Archived from the original on 2023-10-03. Retrieved 2024-03-04. Jan Goyvaerts. "Regular Expressions Quick
Carriage_return
Topics referred to by the same term
division, in Python 2.2+ and other programming languages An empty regular expression, in ed-style syntax The logical defined-or (null coalescing) operator
//
Text that identifies an item in a computer file system
escape sequences and in regular expressions, cases of leaning toothpick syndrome may arise. An escaped string for a regular expression matching a UNC begins
Path_(computing)
Searching for patterns in text
prefixes or suffixes, etc. Another more complex type of search is regular expression searching, where the user constructs a pattern of characters or other
String-searching_algorithm
Rule-based malware analysis tool
rule-based approach to create descriptions of malware families based on regular expression, textual or binary patterns. A description is essentially a YARA rule
YARA
Algorithm to compare text strings using wildcard syntax
databases. Wildcard matching is a subset of the problem of matching regular expressions and string matching in general. A wildcard matcher tests a wildcard
Matching_wildcards
by some path satisfying the regular expression; or it can consist of the list of all paths satisfying the regular expression. However, this set of paths
Regular_path_query
Improved version of the vi text editor
(known as vimdiff), a comprehensive integrated help system, extended regular expressions, scripting languages (both native and through alternative scripting
Vim_(text_editor)
Computer data interchange format
object BSON array JavaScript code MD5 binary data Regular expression (Perl compatible regular expressions ("PCRE") version 8.41 with UTF-8 support) An important
BSON
be within a prescribed range, or that all room names must follow a regular expression such as "Office001". A typical workflow is: Requirements are described
Information Delivery Specification
Information_Delivery_Specification
Software system for finding relevant information on the Web
gatherer, which fetched site listings of anonymous FTP files, with a regular expression matcher for retrieving file names matching a user query. (4) In other
Search_engine
Hierarchy of classes of formal grammars
Additionally, this family of formal languages can be obtained by regular expressions. Regular languages are commonly used to define search patterns and the
Chomsky_hierarchy
JavaScript, OCaml, Python, Rust, V and Zig. It compiles declarative regular expression specifications to deterministic finite automata. Originally written
Re2c
Finite state machine compiler
representing ASCII characters and control codes. 48..57 is equivalent to the regular expression [0-9] (i.e. any digit), so only sequences beginning with a digit can
Ragel
Core component of a complex software system
engine Polymorphic engine Reasoning engine Recommendation engine Regular expression engine Search engine Workflow engine Mainstream web browsers have
Software_engine
High-level programming language
application programming interfaces (APIs) for working with text, dates, regular expressions, standard data structures, and the Document Object Model (DOM). The
JavaScript
Escape characters making an expression unreadable
describe regular expressions that match Unix-style paths, in which the elements are separated by slashes /. The slash is also used as the default regular expression
Leaning_toothpick_syndrome
1980s programmer's text editor
caching for all files and macros Mouse support Complete edit operations Regular expression search and replace Multiple windows, including multiple windows on
Brief_(text_editor)
File search utility for Windows
file names matching a user search expression, which may be a fragment of the target file name or a regular expression, displaying intermediate and immediate
Everything_(software)
Serial number used to identify a periodical publication
and C is in {0,1,2,...,9,X}; or by a Perl Compatible Regular Expressions (PCRE) regular expression: ^[0-9]{4}-[0-9]{3}[0-9X]$. For example, the ISSN of
ISSN
Line-oriented text editor
versions of qed were notable as the first to implement regular expressions. Regular expressions are also implemented in ed, though their implementation
Ed_(text_editor)
String matching algorithm
the target object is not precisely known or when queries may be regular expressions. It finds objects which have the most matches against three-character
Trigram_search
number of regular languages Regular Expression Star-Freeness Equivalence problem for regular expressions Emptiness problem for regular expressions with intersection
List of PSPACE-complete problems
List_of_PSPACE-complete_problems
Type of data model
columns assisting input validation, e.g., maximum string length and regular expression, set of permissible values, etc. The value of the attribute. Consider
Entity–attribute–value_model
Typographical mark (\)
string. An actual backslash is produced by a double backslash \\. Regular expression languages used it the same way, changing subsequent literal characters
Backslash
Programming language derived from Perl
"Essential Perl: String Processing with Regular Expressions". Christiansen, Tom (1996). "PERL5 Regular Expression Description". Archived from the original
Raku_(programming_language)
Type of resource record in the Domain Name System (DNS)
resource. Each NAPTR record contains a service name, a set of flags, a regular expression rule, an order value, a preference and a replacement pattern. Multiple
NAPTR_record
Elapsed time before a specified event is to take place
user input. To prevent a ReDoS (regular expression denial of service), one can use timeouts to cancel regular expression matching calls that exceed a time
Timeout_(computing)
Multi-file text editor
Sam is a multi-file text editor based on structural regular expressions. It was originally designed in the early 1980s at Bell Labs by Rob Pike with the
Sam_(text_editor)
Raku rules are the regular expression, string matching and general-purpose parsing facility of the Raku programming language, and are a core part of the
Raku_rules
manager. Path expressions have been extended to support regular expression-like flexibility. XPath is an example of a path expression language. In concurrency
Path_expression
Open-source Library in Programming
Oniguruma (鬼車) is a free and open-source regular expression library that supports a variety of character encodings, written by K. Kosako. The Ruby programming
Oniguruma
Form of source code, without regard to meaning
defined using the notation of regular expressions and Extended Backus–Naur form. It describes the syntax of S-expressions, a data syntax of the programming
Syntax (programming languages)
Syntax_(programming_languages)
Topics referred to by the same term
?= may refer to: Regular expression § look-ahead assertions The end of a MIME § Encoded-Word Search for "?=" on Wikipedia. All pages with titles beginning
?=
Method of writing text on seven-segment displays
English words – A list of calculator spelling words generated by regular expression search Online Calculator - Calculatrice Version – A Normal Calculator
Calculator_spelling
Rule system for formal languages
grammar (or regular right part grammar) is one in which the right-hand side of the production rules is allowed to be a regular expression over the grammar's
Context-free_grammar
Versions of a JavaScript standard
in obj syntax, to test for presence of private fields on objects; regular expression match indices via the /d flag, which provides start and end indices
ECMAScript_version_history
with any regular expression. The GNFA reads blocks of symbols from the input which constitute a string as defined by the regular expression on the transition
Generalized nondeterministic finite automaton
Generalized_nondeterministic_finite_automaton
Mechanical device used to extract milk from human breasts
electricity, offer increased efficiency and are often preferred for regular expression. Hospital-grade breast pumps are the most powerful, designed for frequent
Breast_pump
Type of decision problem in computer science
Problems known to be PSPACE-complete include determining properties of regular expressions and context-sensitive grammars, determining the truth of quantified
PSPACE-complete
help convert some finite automatons to regular expressions,[how?] as in Kleene's algorithm. Regular expression Nondeterministic finite automaton Daintith
Arden's_rule
Automated recognition of patterns and regularities in data
pre-existing patterns. A common example of a pattern-matching algorithm is regular expression matching, which looks for patterns of a given sort in textual data
Pattern_recognition
Relational database management system
addition to the LIKE operator, CUBRID provides the REGEXP operator for regular expression pattern matching. By default, the operator does a case insensitive
CUBRID
REGULAR EXPRESSION
REGULAR EXPRESSION
REGULAR EXPRESSION
REGULAR EXPRESSION
REGULAR EXPRESSION
REGULAR EXPRESSION
REGULAR EXPRESSION
REGULAR EXPRESSION
REGULAR EXPRESSION