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

Re^2: Perl regexp matching is slow??

by Aristotle (Chancellor)
on Feb 07, 2007 at 09:34 UTC ( #598716=note: print w/replies, xml ) Need Help??


in reply to Re: Perl regexp matching is slow??
in thread Perl regexp matching is slow??

Second, you must understand that Perl set the bar for regexes when P5 was released over 10 years ago. [] In that time, a lot of theoretical work has been done.

You missed the part where the author writes he will be reviewing a regular expression search algorithm invented by Ken Thompson in the mid-1960s.

Makeshifts last the longest.

Replies are listed 'Best First'.
Re^3: Perl regexp matching is slow??
by dragonchild (Archbishop) on Feb 07, 2007 at 14:46 UTC
    No, I didn't miss that. New code is always being written to implement old algorithms. Just because an algorithm exists doesn't mean that there is an efficient implementation of it. Theoretical work has advanced in the implementation of these algorithms and in how the various algorithms can be used to solve the problems Perl's regexes need to solve.

    My criteria for good software:
    1. Does it work?
    2. Can someone else come in, make a change, and be reasonably certain no bugs were introduced?
      I guess you missed the part where it was used to write UNIX's lex(1) and grep(1), too.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://598716]
help
Chatterbox?
and snow settles gently...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (2)
As of 2016-12-11 14:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (169 votes). Check out past polls.