From 8f0432ffbb81d1acb8e950dbdcdb8d4d305c13ba Mon Sep 17 00:00:00 2001
From: Benjamin Peterson <benjamin@python.org>
Date: Wed, 17 Feb 2016 23:42:46 -0800
Subject: [PATCH] fix typo (closes #26378)

---
 Doc/howto/regex.rst | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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
-- 
2.40.0