Regular Expressions is a query language created in 1951 by Stephen Kleene.
| #267on PLDB | 73Years Old | 59kRepos |
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. The concept arose in the 1950s when the American mathematician Stephen Cole Kleene formalized the description of a regular language. Read more on Wikipedia...
\b(\d*1[1-3]th|\d*0th|(?:(?!11st)\d)*1st|\d*2nd|(?:(?!13rd)\d*)3rd|\d*[4-9]th)\b
Hello World
contains a character other than a, b, and c.| Feature | Supported | Example | Token |
|---|---|---|---|
| Semantic Indentation | X | ||
| Line Comments | X | ||
| Comments | X |