|
| |
| | Regular expression - Wikipedia, the free encyclopedia |
 | | The origins of regular expressions lies in automata theory and formal language theory, both of which are part of theoretical computer science. | | | The other algorithm is to match the pattern against the input string by backtracking. | | | The integration of regular expressions in most computer languages is still very poor and, even though Perl's regular expression integration is one of the best around, part of the effort in the design of the future Perl6 is improving this integration. |
|
http://en.wikipedia.org/wiki/Regular_expression
(3575 words)
|
|
| |
| | PlanetMath: regular expression |
| | Here is an example of a regular expression that specifies a grammar that generates the binary representation of all multiples of 3 (and only multiples of 3). | | | Of course, for computer implementations, one must transform this into a deterministic finite automaton, but there are various algorithms for doing this efficiently. | | | One can understand the language described by a regular expression in another way, by viewing the regular expression operators as shorthand for various set-theoretic operations. |
|
http://planetmath.org/encyclopedia/RegularExpression.html
(515 words)
|
|
| |
| | 4.2.1 Regular Expression Syntax |
| | Matches whatever regular expression is inside the parentheses, but the substring matched by the group cannot be retrieved after performing a match or referenced later in the pattern. | | | A regular expression (or RE) specifies a set of strings that matches it; the functions in this module let you check if a particular string matches a given regular expression (or if a given regular expression matches a particular string, which comes down to the same thing). | | | Matches whatever regular expression is inside the parentheses, and indicates the start and end of a group; the contents of a group can be retrieved after a match has been performed, and can be matched later in the string with the |
|
http://www.python.org/doc/current/lib/re-syntax.html
(1742 words)
|
|
| |
| | Regular Expression HOWTO |
| | Regular expressions are often used to dissect strings by writing a RE divided into several subgroups which match different components of interest. | | | This can be handled by writing a regular expression which matches an entire header line, and has one group which matches the header name, and another group which matches the header's value. | | | Since regular expressions are used to operate on strings, we'll begin with the most common task: matching characters. |
|
http://www.amk.ca/python/howto/regex
(6489 words)
|
|
| |
| | Regular Expressions |
| | Regular expressions are a powerful way of specifying complex search and replace operations. | | | An ordinary character is a simple regular expression which matches that character and nothing else. | | | Nontrivial regular expressions use certain special constructs so that they can match more than one string. |
|
http://www.emerson.emory.edu/services/editors/ne/Regular_Expressions.html
(1076 words)
|
|
| |
| | 4.2 re -- Regular expression operations |
| | Regular expression pattern strings may not contain null bytes, but can specify the null byte using the | | | This module provides regular expression matching operations similar to those found in Perl. | | | Both patterns and strings to be searched can be Unicode strings as well as 8-bit strings. |
|
http://www.python.org/doc/current/lib/module-re.html
(196 words)
|
|
| |
| | Regular Expression Basics evolt.org |
| | Although regular expressions had their origins in neurophysiology in the 1940s and were developed by theoretical mathematicians in the 1950s and 1960s, the evolution and subsequent divergence of regex implementations was due to the independent development of various Unix tools such as grep, awk, sed, Emacs, and others. | | | It's not possible in general to match strings using regular expressions which are recursively defined. | | | takes a regular expression, a function, and a string, and repeatedly matches the regular expression against the string, each time replacing the matching bit how the function given tells it to. |
|
http://www.evolt.org/article/rating/20/22700
(7060 words)
|
|
| |
| | Jakarta-Regexp 1.4 API: Class RE |
| | Regular expressions are pattern descriptions which enable sophisticated matching of strings. | | | Given a regular expression of "a*b" and an array of String objects of [foo, aab, zzz, aaaab], the array of Strings returned by grep would be [aab, aaaab]. | | | Match the current regular expression program against the current input string, starting at index i of the input string. |
|
http://jakarta.apache.org/regexp/apidocs/org/apache/regexp/RE.html
(2489 words)
|
|
| |
| | The Regular Expression Rundown |
| | The expression can be a simple string, and the input data can be a named list of files. | | | Regular expressions evaluate text data and return an answer of true or false. | | | What data the expression evaluates and what transpires after a successful match depends entirely on the application. |
|
http://www.webmonkey.com/geektalk/97/33/index3a.html
(715 words)
|
|
| |
| | regex_proposal |
| | Regular expressions are used by many familiar Unix utilities, including egrep, grep, lex, and sed[1], and are supported directly in many programming languages including awk[1], perl[2], C#[3], and ECMAScript[4] (also known as JavaScript), and indeed are often used ubiquitously wherever text processing occurs. | | | Regular expression algorithms: iterator based non-member functions for searching for a match, and for finding an exact match (discussion). | | | Specifies that when a regular expression match is to be replaced by a new string, that the new string is constructed using the rules used by the Unix sed utility in IEEE Std 1003.1-2001, Portable Operating SystemInterface (POSIX), Shells and Utilities.. |
|
http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1429.htm
(11024 words)
|
|
| |
| | Regular Expressions |
| | The regular expression "^A" will match all lines that start with a capital A. The expression "A$" will match all lines that end with the capital A. If the anchor characters are not used at the proper end of the pattern, then they no longer act as anchors. | | | That is, the regular expression "0*" matches zero or more zeros, while the expression "[0-9]*" matches zero or more numbers. | | | Regular expressions confuse people because they look a lot like the file matching patterns the shell uses. |
|
http://www.grymoire.com/Unix/Regular.html
(2747 words)
|
|
| |
| | Pattern (Java 2 Platform SE v1.4.2) |
| | Compiles the given regular expression and attempts to match the given input against it. | | | This method compiles an expression and matches an input sequence against it in a single invocation. | | | By default these expressions only match at the beginning and the end of the entire input sequence. |
|
http://java.sun.com/j2se/1.4.2/docs/api/java/util/regex/Pattern.html
(1992 words)
|
|
| |
| | Amazon.com: Mastering Regular Expressions: Books: Jeffrey E. F. Friedl |
| | Regular expressions are a central element of UNIX utilities like egrep and programming languages such as Perl. | | | Most computer programmers have heard of regular expressions, discussed in hushed tones and conjuring images of Unix gurus and their incomprehensible commands and godlike mastery of their systems, yet few actually know enough about regular expressions or how they work to do more than a simple word match using one, if that. | | | But whether you're a UNIX user or not, you can benefit from a better understanding of regular expressions since they work with applications ranging from validating data-entry fields to manipulating information in multimegabyte text files. |
|
http://www.amazon.com/exec/obidos/tg/detail/-/1565922573?v=glance
(2229 words)
|
|
| |
| | 4GuysFromRolla.com - An Introduction to Regular Expression with VBScript |
| | Regular expression is, technically, a defined grammar for use in complex pattern searching. | | | Regular expression use to be a thing that only UNIX users knew about. | | | There are a few basic type of matching that you will need to acquaint yourself with: character matching, repetition matching, and position matching. |
|
http://www.4guysfromrolla.com/webtech/090199-1.shtml
(933 words)
|
|
| |
| | zez.org: about code |
| | Probably the most known use of regular expressions are in the programming language Perl, you'll find that Perl sports the most advanced regular expression implementation to this day. | | | I'll start off with explaining what regular expressions are and introduce it's syntax, then some examples with varying complexity and last a list of tools which use regular expressions. | | | The latter is basicly the same as the reverse match ie. |
|
http://zez.org/article/articleview/11
(417 words)
|
|
| |
| | Regular Expression Tutorial - Learn How to Use Regular Expressions |
| | A regular expression "engine" is a piece of software that can process regular expressions, trying to match the pattern to the given string. | | | Compose and analyze regex patterns with RegexBuddy's easy-to-grasp regex blocks and intuitive regex tree, instead of or in combination with the traditional regex syntax. | | | With the above regular expression pattern, you can search through a text file to find email addresses, or verify if a given string looks like an email address. |
|
http://www.regular-expressions.info/tutorial.html
(1132 words)
|
|
| |
| | perlre - Perl regular expressions |
| | For the modifiers that alter the way a regular expression is used by Perl, see Regexp Quote-Like Operators and Gory details of parsing quoted constructs. | | | The patterns used in pattern matching are regular expressions such as those supplied in the Version 8 regex routines. | | | One warning: particularly complicated regular expressions can take exponential time to solve due to the immense number of possible ways they can use backtracking to try match. |
|
http://www.perl.com/doc/manual/html/pod/perlre.html
(4541 words)
|
|
| |
| | Introductory Guide to regular expressions in JavaScript |
| | Now that you've got a taste of what regular expressions is all about, lets formally look at its syntax, so you can create complex expressions that validate virtually anything you want. | | | For example, the following regular expression determines whether a string contains a valid 5-digit US postal code (for sake or simplicity, other possibilities are not considered): | | | You can perform complex tasks that once required lengthy procedures with just a few lines of code using regular expressions. |
|
http://www.javascriptkit.com/javatutors/re.shtml
(462 words)
|
|
| |
| | PERL Regular Expressions |
| | This operator appears between the string var you are comparing, and the regular expression you're looking for (note that in selection or substitution a regular expression operates on the string var rather than comparing). | | | Regular expressions are a syntax, implemented in PERL and certain other environments, making it not only possible but easy to do some of the following: | | | Without regular expressions, PERL would be a fast development environment. |
|
http://www.troubleshooters.com/codecorn/littperl/perlreg.htm
(1774 words)
|
|
| |
| | A Tao of Regular Expressions |
| | grep is a program used to match regular expressions in one or more specified files or in an input stream. | | | Grep uses the regular expression we supply and tries to match it to every line of the file. | | | Sometimes it is easier to indicate something what should not be matched rather than all the cases that should be matched. |
|
http://sitescooper.org/tao_regexps.html
(2493 words)
|
|
| |
| | Perl Regular Expression Tutorial |
| | In its simplest form, a regular expression is just a word or phrase to search for. | | | Note that the null string will be matched by the period-star pair; thus, "cycloane" would be matche by the above expression. | | | Because they are complex, it can be more work mastering a search than just sifting through a long list of matches (unless you're already familiar with regular expressions). |
|
http://virtual.park.uga.edu/humcomp/perl/regex2a.html
(2124 words)
|
|
| |
| | The Regex Coach - interactive regular expressions |
| | parse tree of the regular expression and assume that every leaf of the tree which is a string is further divided into the single characters which together constitute the string. | | | Common Lisp and was developed using the LispWorks development environment. | | | This is how the regex engine "sees" the expression and it might help you to understand what's going on (or why the regular expression isn't interpreted as you intended it to be). |
|
http://weitz.de/regex-coach
(2641 words)
|
|
| |
| | Open Directory - Computers: Programming: Languages: Regular Expressions |
| | Regular Expression Tester - Uses browser's JavaScript to show matches and subgroups, and highlights match in the input string. | | | Regular Expression allows for complex pattern matching and replacing. | | | Also provides examples with varying complexity and a list of tools which use regular expressions. |
|
http://dmoz.org/Computers/Programming/Languages/Regular_Expressions
(874 words)
|
|
| |
| | Regular Expressions |
| | Although the syntax of regular expressions that this package accepts is similar to Perl, knowledge of the Perl programming language is not a prerequisite. | | | Defines reusable code for testing and explores pattern matching with regular expressions. | | | Explains greedy, reluctant, and possessive quantifiers for matching a specified expression x number of times. |
|
http://java.sun.com/docs/books/tutorial/extra/regex
(187 words)
|
|
| |
| | 4GuysFromRolla.com - Regular Expression Information |
| | Regular Expressions are a neat way to perform powerful string matching and replacing. | | | I think you'll find regular expressions are a powerful tool for performing advanced string searching, matching, and replacing. | | | If you are a beginner, novice, or expert at regular expressions, you'll find the collection of regular expression articles and information we have posted here an invaluable resource! |
|
http://www.4guysfromrolla.com/webtech/RegularExpressions.shtml
(304 words)
|
|
| |
| | PCRE - Perl Compatible Regular Expressions |
| | The PCRE library is a set of functions that implement regular expression pattern matching using the same syntax and semantics as Perl 5. | | | PCRE has its own native API, as well as a set of wrapper functions that correspond to the POSIX regular expression API. | | | For Perl 5 regular expression syntax, read the Perl regular expressions man page. |
|
http://www.pcre.org
(203 words)
|
|
| |
| | Jakarta Regexp - Jakarta Regexp |
| | Jakarta Regexp is a 100% Pure Java Regular Expression package that was graciously donated to the Apache Software Foundation by Jonathan Locke. | | | He originally wrote this software back in 1996 and it has stood up quite well to the test of time. | | | This package is intended to be an answer to a question we commonly hear in the Java world: |
|
http://jakarta.apache.org/regexp
(192 words)
|
|
| |
| | RegEx Builder |
| | I am a software engineer in central Pennsylvania, and have used it every day for the past week. | | | Steven B. This project is also hosted on | | | Unfortunately I don't know if this is supported in operating systems prior to Windows 2000. |
|
http://renschler.net/RegexBuilder
(175 words)
|
|
| |
| | Regular Expression Tester Professional |
| | LiveEval evaluates your regular expression while you are typing it, gives feedback on possible errors and shows any matches automatically | | | Replace every occurence of the regex with a different string | | | LiveEval is supported for changes of the regular expression, the search text and the pattern flags |
|
http://brosinski.com/regex
(331 words)
|
|
| |
| | oreilly.com -- Online Catalog: Regular Expression Pocket Reference |
| | This handy book offers programmers a complete overview of the syntax and semantics of regular expressions, which are at the heart of every text-processing application. | | | Ideal as an introduction for beginners and a quick reference for advanced programmers, Regular Expression Pocket Reference is a comprehensive guide to regular expression APIs for C, Perl, PHP, Java,.NET, Python, vi, and the POSIX regular expression libraries. | | | When you've reached a sticking point and need to get to a solution quickly, the new Regular Expression Pocket Reference is the book you'll want to have. |
|
http://www.oreilly.com/catalog/regexppr
(165 words)
|
|
| |
| | PHP: Regular Expression Functions (Perl-Compatible) - Manual |
| | This extension maintains a global per-thread cache of compiled regexes (up to 4096). | | | If you want to perform regular expressions on Unicode strings, the PCRE functions will NOT be of any help. | | | The expression should be enclosed in the delimiters, a forward slash (/), for example. |
|
http://www.php.net/manual/en/ref.pcre.php
(840 words)
|
|
| |
| | Regular Expression Transformation |
| | If all columns selected pass their tests then rows are passed down the successful match output. | | | The component is provided as an MSI file, however to complete the installation, you will have to add the transformation to the Visual Studio toolbox by hand. | | | Rows that fail to pass all tests are directed down the alternate output. |
|
http://www.sqlis.com/default.aspx?91
(187 words)
|
|
| |
| | Regular Expression Library |
| | Welcome to RegExLib.com, the Internet's first Regular Expression Library. | | | Currently we have indexed 1239 expressions from 797 contributors around the world. | | | The extracted data can be modified with formatters similar to those used by sprintf, or with standard Java date and decimal formatters. |
|
http://regexlib.com
(172 words)
|
|
| |
| | Regular Expression Online Tester |
| | Anytime I use Regular Expressions, I find myself doing a bit of trial-and-error until I get the right pattern. |
|
http://www.quanetic.com/regex.php
(54 words)
|
|
|
