Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

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

by hippo (Bishop)
on Nov 03, 2017 at 16:41 UTC ( [id://1202711]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Is there a way to allow consecutive zero-length matches without using pos()?
in thread Is there a way to allow consecutive zero-length matches without using pos()?

Thanks for the context. Does rubasov's solution not answer this question? In what way does it fail to meet your criteria?

  • Comment on Re^3: Is there a way to allow consecutive zero-length matches without using pos()?

Replies are listed 'Best First'.
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.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1202711]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others browsing the Monastery: (7)
As of 2024-04-23 20:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found