Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Can I determine index point of failure in string during regex match attempt

by oiskuu (Hermit)
on May 06, 2014 at 23:36 UTC ( #1085258=note: print w/replies, xml ) Need Help??


in reply to Can I determine index point of failure in string during regex match attempt

If you can compile your regex into DFA, you will be able to tell (trivially). However, perl regex have backreferences, can embed code, and so on. Basically the Halting Problem? In that case, the answer is no.

  • Comment on Re: Can I determine index point of failure in string during regex match attempt

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1085258]
help
Chatterbox?
[Corion]: Oh. I've run out of prewritten blogs.perl.org articles. I need to release some more modules and write some more articles then ;)
choroba still has one more.
[Corion]: I have Thursday and Friday off, so then I might get to converting the rough outlines to more articles ;)

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (7)
As of 2017-04-24 08:51 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (437 votes). Check out past polls.