Rob Dixon writes: > I'm sure you have something useful to say. This seems such a waste of > your effort. > > Rob
I think we are failing to communicate. What I am asking is: "Does the regular expression mechanism in perl optimize regular expressions such as the one you used earlier in this thread so that the execution overhead is nearly as good as the C approach I outlined earlier in this thread? In other words, for the problem stated earlier, does o(C) = o(perl)? Can I really use regular expressions as my main tool for scanning and modifying strings and expect to get speeds comparable to what I would get with hand tailored code? I hope so, because that would be wonderful. -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] <http://learn.perl.org/> <http://learn.perl.org/first-response>
