From eb6214279905917e42a2671a0d8eb14ef1a8a542 Mon Sep 17 00:00:00 2001 From: "Andrew M. Kuchling" Date: Wed, 28 Oct 1998 15:44:14 +0000 Subject: Added URL to HOWTO page, with reference to Regex HOWTO. Corrected error: {,5} is not equivalent to {0,5}. --- Doc/lib/libre.tex | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) (limited to 'Doc/lib/libre.tex') diff --git a/Doc/lib/libre.tex b/Doc/lib/libre.tex index a6e1316c3f..92de4c06a4 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{'

'}. \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, -- cgit v1.2.1