Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Slow Regex - How to Optimize

by noslenj123 (Scribe)
on Aug 30, 2005 at 22:50 UTC ( #487973=note: print w/ replies, xml ) Need Help??


in reply to Slow Regex - How to Optimize

As usual, I didn't explain the concept of what I'm trying to accomplish along with the problem.

I gather a list of created subroutines by parsing the .h files. That creates %SUBS.

For each $sub in %SUBS I need to gather all the subroutines that the $sub calls, but only if is exists in %SUBS.

From all your inputs I have learned how to work with the code as a string and apply the regex in a while loop which is so far much faster. I'm trying something like:

while ( $data =~ /\b([a-zA-Z]+)\b\s*\(/g ) { print "$1\n"; }
Thanks for the direction! I'll post results and look for more advice.


Comment on Re: Slow Regex - How to Optimize
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (5)
As of 2014-11-24 03:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (135 votes), past polls