Many of these algorithms are for arbitrary string searching; it's difficult to outperform Perl's regex engine. (Please note that the portion of my post which you did not quite implied that you can't pull in PCRE.) I suspect, but can't immediately prove, that code heavy with malloc/free temporary data may reach a point where it's faster in Perl than in C, but that depends on overcoming the overhead of op dispatch in Perl.
In reply to Re^5: Perl vs C
by chromatic
in thread Perl vs C
by santhosh_89
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |