gam3 has asked for the wisdom of the Perl Monks concerning the following question:
# Regular expressions - Perl's regular expression engine is so called NFA (Non-Finite Automaton), which among other things means that it can rather easily consume large amounts of both time and space if the regular expression may match in several ways. Careful crafting of the regular expressions can help but quite often there really isn't much one can do (the book "Mastering Regular Expressions" is required reading, see perlfaq2). Running out of space manifests itself by Perl running out of memory.So this notes how running out of space manifests itself in Perl, but does not say how running out of time is manifested in Perl. I am sure that there are some monks that would like to help me answer this question.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: Running out of time?
by blokhead (Monsignor) on Jan 28, 2007 at 21:34 UTC | |
|
Re: Running out of time?
by shmem (Chancellor) on Jan 28, 2007 at 23:33 UTC | |
by wazoox (Prior) on Jan 29, 2007 at 12:15 UTC | |
by hardburn (Abbot) on Jan 30, 2007 at 18:19 UTC |