Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re^2: My regex works, but I want to make sure it's not blind luck

by Fletch (Chancellor)
on Dec 22, 2020 at 15:59 UTC ( #11125611=note: print w/replies, xml ) Need Help??


in reply to Re: My regex works, but I want to make sure it's not blind luck
in thread My regex works, but I want to make sure it's not blind luck

If you want a . . . (well, I almost said "fun" but that's probably not the right word :) an interesting rabbit hole to go down check out Nondeterministic finite automaton and Deterministic finite automaton to get a better picture of what's going on under the hood in a regex engine. And/or find an undergraduate course in automata theory to audit. If you use the Regexp::Debugger that's already been mentioned above it'll let you watch and you can almost picture the state machine hopping along from node to node until it gets to a valid terminal state.

The cake is a lie.
The cake is a lie.
The cake is a lie.

  • Comment on Re^2: My regex works, but I want to make sure it's not blind luck

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (3)
As of 2021-04-10 15:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?