in reply to How to match more than 32766 times in regex?

perlre: "This is usually 32766 on the most common platforms"

What do you think about the need to expand the perlre section about quantifiers with the suggestion how to handy overcome '+' and '*' limitation and make the equivalent regex which matches {0,infty}? The regex should be readable and not slow in performance.
  • Comment on Re: How to match more than 32766 times in regex?

Replies are listed 'Best First'.
Re^2: How to match more than 32766 times in regex?
by choroba (Cardinal) on Nov 06, 2018 at 16:13 UTC
    Feel free to send a perlbug with the patch to the documentation.

    ($q=q:Sq=~/;[c](.)(.)/;chr(-||-|5+lengthSq)`"S|oS2"`map{chr |+ord }map{substrSq`S_+|`|}3E|-|`7**2-3:)=~y+S|`+$1,++print+eval$q,q,a,