diff options
author | Andrew M. Kuchling <amk@amk.ca> | 1998-10-28 15:44:14 (GMT) |
---|---|---|
committer | Andrew M. Kuchling <amk@amk.ca> | 1998-10-28 15:44:14 (GMT) |
commit | c1cea208bc50d3eea77388ebd3cbd5545b518886 (patch) | |
tree | 25a3a49919c65f6442ab58fdd5233ace1fb2e7b4 /Doc/lib/libre.tex | |
parent | 1d5f9884579cffea181467b5b4366eb330047ce6 (diff) | |
download | cpython-c1cea208bc50d3eea77388ebd3cbd5545b518886.zip cpython-c1cea208bc50d3eea77388ebd3cbd5545b518886.tar.gz cpython-c1cea208bc50d3eea77388ebd3cbd5545b518886.tar.bz2 |
Added URL to HOWTO page, with reference to Regex HOWTO.
Corrected error: {,5} is not equivalent to {0,5}.
Diffstat (limited to 'Doc/lib/libre.tex')
-rw-r--r-- | Doc/lib/libre.tex | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/Doc/lib/libre.tex b/Doc/lib/libre.tex index a6e1316..92de4c0 100644 --- a/Doc/lib/libre.tex +++ b/Doc/lib/libre.tex @@ -50,8 +50,9 @@ details of the theory and implementation of regular expressions, consult the Friedl book referenced below, or almost any textbook about compiler construction. -A brief explanation of the format of regular expressions follows. -%For further information and a gentler presentation, consult XXX somewhere. +A brief explanation of the format of regular expressions follows. For +further information and a gentler presentation, consult the Regular +Expression HOWTO, accessible from \url{http://www.python.org/doc/howto/}. Regular expressions can contain both special and ordinary characters. Most ordinary characters, like \character{A}, \character{a}, or \character{0}, @@ -109,10 +110,9 @@ expression will match only \code{'<H1>'}. \item[\code{\{\var{m},\var{n}\}}] Causes the resulting RE to match from \var{m} to \var{n} repetitions of the preceding RE, attempting to -match as many repetitions as possible. For example, \regexp{a\{3,5\}} -will match from 3 to 5 \character{a} characters. Omitting \var{m} is the same -as specifying 0 for the lower bound; omitting \var{n} specifies an -infinite upper bound. +match as many repetitions as possible. For example, \regexp{a\{3,5\}} +will match from 3 to 5 \character{a} characters. Omitting \var{n} +specifies an infinite upper bound; you can't omit \var{m}. \item[\code{\{\var{m},\var{n}\}?}] Causes the resulting RE to match from \var{m} to \var{n} repetitions of the preceding RE, |