Re: Is there a way to allow consecutive zero-length matches without using pos()?

Can you show an example of "matching consecutive zero-length strings"?

I can easily generate a random string with

my $string = join q(), map +('a' .. 'z')[rand 26], 1 .. 10_000
[download]

but I have no idea what regex(es) to try to match to play with it.

($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,
[download]

Comment on Re: Is there a way to allow consecutive zero-length matches without using pos()? Select or Download Code

Replies are listed 'Best First'.
Re^2: Is there a way to allow consecutive zero-length matches without using pos()? by ambrus (Abbot) on Nov 03, 2017 at 16:24 UTC
For an example, please see my old node The story of a strange line of code: pos($_) = pos($_); where I deliberately want to do that. It happens because to make the code more readable, I'm not matching one big regex with a lot of alternation, but multiple regexes one after another, and more than one of those can match the empty string at the same position.	[reply]
Re^3: Is there a way to allow consecutive zero-length matches without using pos()? by hippo (Archbishop) on Nov 03, 2017 at 16:41 UTC
Thanks for the context. Does rubasov's solution not answer this question? In what way does it fail to meet your criteria?	[reply]
Re^4: Is there a way to allow consecutive zero-length matches without using pos()? by ambrus (Abbot) on Nov 03, 2017 at 17:05 UTC
That solution rewrites the multiple regular expressions to a single big regular expression. That works, but I didn't need it. I never had jsm's performance problem (presumably because I didn't use those perl versions for that very old code), so assigning pos worked just fine for me.	[reply]