Bound el and pt affix regex runs to prevent quadratic backtracking

[Fazel94]

Continuation of issue #14020

Description

Some affix regexes in el and pt languages would scale quadratically with input,
The fix tries to bound them 64 to alleviate its possible problems.

import re
import time

el_infix = re.compile(r"([a-zA-Z]+)\/([a-zA-Z]+)\/([a-zA-Z]+)")
pt_infix = re.compile(r"(\w+-\w+(-\w+)*)")

for name, pattern in [("el", el_infix), ("pt", pt_infix)]:
    print(name)
    for n in (5_000, 10_000, 20_000, 40_000):
        text = "a" * n  # no "/" or "-" -> never matches
        start = time.perf_counter()
        list(pattern.finditer(text))
        elapsed = time.perf_counter() - start
        print(f"  n={n:>6}  {elapsed:6.2f}s")

Output:

el
  n=  5000    0.24s
  n= 10000    1.03s
  n= 20000    4.09s
  n= 40000   17.11s
pt
  n=  5000    0.11s
  n= 10000    0.39s
  n= 20000    1.54s
  n= 40000    7.95s

Types of change

I have bounded the + to only {1,64} to prevent from catastrophic backtracking.

Checklist

• I confirm that I have the right to submit this contribution under the project's MIT license.
• I ran the tests, and all new and existing tests passed.
• My changes don't require a change to the documentation, or if they do, I've added all required information.