When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Comparison of regular expression engines - Wikipedia

    en.wikipedia.org/wiki/Comparison_of_regular...

    Regular Expression Flavor Comparison – Detailed comparison of the most popular regular expression flavors; Regexp Syntax Summary; Online Regular Expression Testing – with support for Java, JavaScript, .Net, PHP, Python and Ruby; Implementing Regular Expressions – series of articles by Russ Cox, author of RE2; Regular Expression Engines

  3. Module:Convert/tester - Wikipedia

    en.wikipedia.org/wiki/Module:Convert/tester

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Help; Learn to edit; Community portal; Recent changes; Upload file

  4. Template:Regex/string/testcases - Wikipedia

    en.wikipedia.org/wiki/Template:Regex/string/test...

    This is the template test cases page for the sandbox of Template:Regex/string Purge this page to update the examples. If there are many examples of a complicated template, later ones may break due to limits in MediaWiki ; see the HTML comment " NewPP limit report " in the rendered page.

  5. Wikipedia:Tools/Editing tools - Wikipedia

    en.wikipedia.org/wiki/Wikipedia:Tools/Editing_tools

    Converting the formatted text to wikicode; Wikicode syntax highlighting; Regular expression search and replace and find-as-you-type; Server-independent Show preview and Show changes; Fullscreen editing mode; Single-click fixing of common mistakes; History for summary, search, and replace fields; Search/replace box that supports regular expressions.

  6. Regular expression - Wikipedia

    en.wikipedia.org/wiki/Regular_expression

    Regular expressions are used in search engines, in search and replace dialogs of word processors and text editors, in text processing utilities such as sed and AWK, and in lexical analysis. Regular expressions are supported in many programming languages. Library implementations are often called an "engine", [4] [5] and many of these are ...

  7. Thompson's construction - Wikipedia

    en.wikipedia.org/wiki/Thompson's_construction

    The algorithm works recursively by splitting an expression into its constituent subexpressions, from which the NFA will be constructed using a set of rules. [3] More precisely, from a regular expression E, the obtained automaton A with the transition function Δ [clarification needed] respects the following properties:

  8. Perl Compatible Regular Expressions - Wikipedia

    en.wikipedia.org/wiki/Perl_Compatible_Regular...

    Perl Compatible Regular Expressions (PCRE) is a library written in C, which implements a regular expression engine, inspired by the capabilities of the Perl programming language. Philip Hazel started writing PCRE in summer 1997. [ 3 ]

  9. ReDoS - Wikipedia

    en.wikipedia.org/wiki/ReDoS

    This happens when a regular expression has three properties: the regular expression applies repetition (+, *) to a subexpression; the subexpression can match the same input in multiple ways, or the subexpression can match an input string which is a prefix of a longer possible match;