Re^3: Pattern matching: Lazy vs. greedy

[QM]

... I can’t categorically rule out repetitions of the first word, ...

Can you elaborate on the rules or goals you have in mind?

I would guess something like "shortest matching string" or "string with the smallest number of words" (for some value of $words). It's not necessarily easy to come up with this, but you should be able to list positive and negative examples to help tune the solution.

And most of us are just nerdy enough to want more specifics so we can solve it, or near enough. (Allowing the dreams of examples and counter-examples to be replaced once again by the more familiar nightmares of github DDOSs or Linus rants.)