Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re^5: Compiling Regular Expressions

by hv (Parson)
on Feb 19, 2003 at 14:43 UTC ( #236646=note: print w/ replies, xml ) Need Help??

in reply to Re^4: Compiling Regular Expressions
in thread Compiling Regular Expressions

It should also be noted that study() is not as well tested in perl as it ought to be, and as a result changes to the regexp engine over the years have managed to introduce various problems that cause study() not to gain as much speed as it should, and in some cases even give the wrong answer.

In particular, I don't think study() knows anything about Unicode (though I haven't checked).

The plan is that 5.10.0 should involve a big cleanup of the regexp engine, so this may improve in the future.


Comment on Re^5: Compiling Regular Expressions
Select or Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (5)
As of 2015-11-27 07:22 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (719 votes), past polls