summaryrefslogtreecommitdiff
path: root/Doc/howto
diff options
context:
space:
mode:
authorBenjamin Peterson <benjamin@python.org>2016-02-17 23:42:46 -0800
committerBenjamin Peterson <benjamin@python.org>2016-02-17 23:42:46 -0800
commit8f0432ffbb81d1acb8e950dbdcdb8d4d305c13ba (patch)
tree88dcea20047c65a9aff779edd8a63da9e8b6d855 /Doc/howto
parent1378f7ca68329e6eebdd1b47bcb7b86fca2aff24 (diff)
downloadcpython-git-8f0432ffbb81d1acb8e950dbdcdb8d4d305c13ba.tar.gz
fix typo (closes #26378)
Diffstat (limited to 'Doc/howto')
-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 70721a9f27..909420bfa9 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