summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorBenjamin Peterson <benjamin@python.org>2016-02-18 07:43:08 (GMT)
committerBenjamin Peterson <benjamin@python.org>2016-02-18 07:43:08 (GMT)
commitbd8112901ae442413c77c8cf2f4ae42f6905565d (patch)
treeb2917200f443133540855c7be948a558a8e5113a
parent4a180a693f5e926784f65855734c4726839dcf48 (diff)
parent8f0432ffbb81d1acb8e950dbdcdb8d4d305c13ba (diff)
downloadcpython-bd8112901ae442413c77c8cf2f4ae42f6905565d.zip
cpython-bd8112901ae442413c77c8cf2f4ae42f6905565d.tar.gz
cpython-bd8112901ae442413c77c8cf2f4ae42f6905565d.tar.bz2
merge 3.5 (#26378)
-rw-r--r--Doc/howto/regex.rst2
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/howto/regex.rst b/Doc/howto/regex.rst
index 70721a9..909420b 100644
--- a/Doc/howto/regex.rst
+++ b/Doc/howto/regex.rst
@@ -178,7 +178,7 @@ are usually not written to match that much data.
Repetitions such as ``*`` are :dfn:`greedy`; when repeating a RE, the matching
engine will try to repeat it as many times as possible. If later portions of the
pattern don't match, the matching engine will then back up and try again with
-few repetitions.
+fewer repetitions.
A step-by-step example will make this more obvious. Let's consider the
expression ``a[bcd]*b``. This matches the letter ``'a'``, zero or more letters