comment on

Hi fellow monks,

I came across this article discussing speed of regexp processing. The article comes to the conclusion that Perl regexp is slow compared to an approach called "Thomson NFA" and there is scope for enhancing Perl regexp processing speed. While the article uses Perl as an example, the speed issue reported is not limited to Perl but other languages like Python, Ruby too.

I was surprised because till date, I always assumed that Perl set the bar for regexp and text processing. I never felt that Perl was slow for my regexp needs.

Please comment and discuss this. Have you felt that Perl regexp was slow and needed to be improved?

Regards,
Mahesh

In reply to Perl regexp matching is slow?? by smahesh

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


The stupid question is the question not asked
	PerlMonks