enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Regular expression - Wikipedia

    en.wikipedia.org/wiki/Regular_expression

    Constructing the DFA for a regular expression of size m has the time and memory cost of O(2 m), but it can be run on a string of size n in time O(n). Note that the size of the expression is the size after abbreviations, such as numeric quantifiers, have been expanded.

  3. Help:Searching/Regex - Wikipedia

    en.wikipedia.org/wiki/Help:Searching/Regex

    Preceding any other character with a backslash is harmless. For example, insource:/yes\.\no/ will search for pages containing the literal string "yes.no" (case-sensitive). Regex experts should note that \n does not mean "newline," \d does not mean "digit," and so on: In MediaWiki syntax, the only use of \ is to escape metacharacters.

  4. Help:Manipulating strings - Wikipedia

    en.wikipedia.org/wiki/Help:Manipulating_strings

    Regular expressions (or regex) are a common and very versatile programming technique for manipulating strings. On Wikipedia you can use a limited version of regex called a Lua pattern to select and modify bits of text from a string. The pattern is a piece of code describing what you are looking for in the string.

  5. Wikipedia:AutoWikiBrowser/Regular expression - Wikipedia

    en.wikipedia.org/.../Regular_expression

    Greed, in regular expression context, describes the number of characters which will be matched (often also stated as "consumed") by a variable length portion of a regular expression – a token or group followed by a quantifier, which specifies a number (or range of numbers) of tokens. If the portion of the regular expression is "greedy", it ...

  6. Help:Searching/Features - Wikipedia

    en.wikipedia.org/wiki/Help:Searching/Features

    find wildcard expressions and regular expressions. A search matches what you see rendered on the screen and in a print preview. The raw "source" wikitext is searchable by employing the insource parameter. For these two kinds of searches a word is any string of consecutive letters and numbers matching a whole word or phrase.

  7. Thompson's construction - Wikipedia

    en.wikipedia.org/wiki/Thompson's_construction

    In computer science, Thompson's construction algorithm, also called the McNaughton–Yamada–Thompson algorithm, [1] is a method of transforming a regular expression into an equivalent nondeterministic finite automaton (NFA). [2] This NFA can be used to match strings against the regular expression.

  8. findstr - Wikipedia

    en.wikipedia.org/wiki/Findstr

    /R Uses search strings as regular expressions. /S Searches for matching files in the current directory and all subdirectories. /I Specifies that the search is not to be case-sensitive. /X Prints lines that match exactly. /V Prints only lines that do not contain a match. /N Prints the line number before each line that matches.

  9. Wikipedia : AutoWikiBrowser/Custom Modules

    en.wikipedia.org/wiki/Wikipedia:AutoWikiBrowser/...

    public string ProcessArticle (string ArticleText, string ArticleTitle, int wikiNamespace, out string Summary, out bool Skip) {// define your regular expression Regex R1 = new Regex (@"foo"); // define how many times to replace the regular expression int n = 1; Skip = false; Summary =" "; // run the replace ArticleText = R1.