Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 37. Chapters: Regular expression, Wildcard character, Diff, Escape character, Metacharacter, Metaphone, Rete algorithm, Delimiter, Comparison of regular expression engines, Perl Compatible Regular Expressions, Backtracking, Approximate string matching, Regular expression examples, Soundex, Terminal and nonterminal symbols, RegexBuddy, Glob, List of regular expression software, International Components for Unicode, Parser Grammar Engine, Match Rating Approach, Daitch-Mokotoff Soundex, Wildmat, Caverphone, New York State Identification and Intelligence System, Ragel, Find, Compressed pattern matching, Tom, Oniguruma. Excerpt: In computing, a regular expression, also referred to as regex or regexp, provides a concise and flexible means for matching strings of text, such as particular characters, words, or patterns of characters. A regular expression is written in a formal language that can be interpreted by a regular expression processor, a program that either serves as a parser generator or examines text and identifies parts that match the provided specification. The following examples illustrate a few specifications that could be expressed in a regular expression: Regular expressions can be much more complex than these examples. Utilities provided by Unix distributions-including the editor ed and the filter grep-were the first to popularize the concept of regular expressions. Regular expressions are used by many text editors, utilities, and programming languages to search and manipulate text based on patterns. Some of these languages, including Perl, Ruby, Awk, and Tcl, have fully integrated regular expressions into the syntax of the core language itself. Others like .NET languages, Java, and Python instead provide regular expressions through standard libraries. For other languages, such as C and C++, non-core libraries are availa...