Or even tried following the links provided, leading to answers already given 13 years ago?

To say it plain, this theoretical idea of regexes creating unlimited matches is bullshit academic masturbation.

If the match is indeed too large to hold two chunks in memory (which have to be individually bigger than the maximal match), in what way do you expect to be able to process this match???

Truth is it's far harder to construct problems which can't be solved with sliding windows, then just to solve the real world tasks.

update

PS: If a little boy asks for a birthday cake bigger than any building on earth, do you really honestly start discussing where to find suitable candles?

No, it's not academic masturbation.

This is not the first time I would need such thing due to a concrete real-world-problem.