On 2017 Mar 15 04:34:46, you wrote to me:

 AP> What OS is Regex most common in and from what I see it's a VERY powerful
 AP> Query system almost like SQL in a way.  I'm intrigued by what it can do
and
 AP> once I know what OS it is drived from I'll ask more about it in that OS's
 AP> echo.

regex is not limited to any particular OS... one might say it comes from the
*nix type world where the mantra is "do one thing and do it well"... however,
i've used regex on winwhatever for several decades... as for "do one thing and
do it well", regex is used to look for matches to a search pattern, the
regex...

[quote]
Regular expressions originated in 1956, when mathematician Stephen Cole Kleene
described regular languages using his mathematical notation called regular
sets. ... Regexes were subsequently adopted by a wide range of programs, with
these early forms standardized in the POSIX.2 standard in 1992.
[/quote]

https://en.wikipedia.org/wiki/Regular_expression


[quote]
A regular expression, regex or regexp[1] (sometimes called a rational
expression)[2][3] 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.

The concept arose in the 1950s when the American mathematician Stephen Cole
Kleene formalized the description of a regular language. The concept came into
common use with Unix text-processing utilities. Today, different syntaxes for
writing regular expressions exist, one being the POSIX standard and another,
widely used, being the Perl syntax.

Regular expressions are used in search engines, search and replace dialogs of
word processors and text editors, in text processing utilities such as sed and
AWK and in lexical analysis. Many programming languages provide regex
capabilities, built-in, or via libraries.

[...]

[1] What Regular Expressions Are Exactly - Terminology

[2] Ruslan Mitkov (2003). The Oxford Handbook of Computational Linguistics.
Oxford University Press. p. 754. ISBN 978-0-19-927634-9.

[3] Mark V. Lawson (17 September 2003). Finite Automata. CRC Press. pp.
98-100. ISBN 978-1-58488-255-8.
[/quote]



)\/(ark

Always Mount a Scratch Monkey
Do you manage your own servers? If you are not running an IDS/IPS yer doin' it
wrong...
... Limitations are stepping stones to creativity.
---
 * Origin:  (1:3634/12.73)