Remove extra indenatation from sample interpreter session.

Remove whitespace from the middle of an inline RE example; it was OK for
the typeset formats, but LaTeX2HTML is more touchy about this.

diff --git a/Doc/lib/libre.tex b/Doc/lib/libre.tex
index ab51c10c658be70aee751859c3c314e6709e3c12..ca829df0e2a72a58312b6404a300c18314dd86cd 100644 (file)
--- a/Doc/lib/libre.tex
+++ b/Doc/lib/libre.tex
@@ -857,17 +857,17 @@ of backtracking, you may encounter a RuntimeError exception with the message
 \code{maximum recursion limit exceeded}.  For example,
 
 \begin{verbatim}
-    >>> s = "<" + "that's a very big string!"*1000 + ">"
-    >>> re.match('<.*?>', s)
-    Traceback (most recent call last):
-      File "<stdin>", line 1, in ?
-      File "/usr/local/lib/python2.3/sre.py", line 132, in match
-       return _compile(pattern, flags).match(string)
-    RuntimeError: maximum recursion limit exceeded
+>>> s = "<" + "that's a very big string!"*1000 + ">"
+>>> re.match('<.*?>', s)
+Traceback (most recent call last):
+  File "<stdin>", line 1, in ?
+  File "/usr/local/lib/python2.3/sre.py", line 132, in match
+    return _compile(pattern, flags).match(string)
+RuntimeError: maximum recursion limit exceeded
 \end{verbatim}
 
 You can often restructure your regular expression to avoid backtracking.
-The above regular expression can be recast as \regexp{\textless
-[\textasciicircum \textgreater]*\textgreater}.  As a further
-benefit, such regular expressions will run faster than their backtracking
-equivalents.
+The above regular expression can be recast as
+\regexp{\textless[\textasciicircum \textgreater]*\textgreater}.  As a
+further benefit, such regular expressions will run faster than their
+backtracking equivalents.