Welcome to the Monastery | |
PerlMonks |
Re: Re^3: How is a perl program processed ? (two kinds)by TheYoungMonk (Sexton) |
on Apr 07, 2003 at 11:49 UTC ( [id://248569]=note: print w/replies, xml ) | Need Help?? |
Great to see the topics diverting back to regex...i've been love with the beauty of regexes in perl. Wonder if there is any other language that has this capability of handling regex ? So why shud perl slow down while processing tree of opcodes if processing a tree of regnodes CAN be done faster ? If there is some optimized way of processing one kinda tree, cudnt it be applied to all nodetrees and make everything one step faster ? That cud make working with perl even more delightful!! I'm sure the monks cud throw some light in this angle i'm thinkin..
In Section
Seekers of Perl Wisdom
|
|