In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] (Dan Anderson) writes:
>
>I was reading O'Reilly's Programming Perl, and under the
>security section it says that regular expressions from outside the
>program are not trusted because it is possible that they can take
>foreve
On Jan 2, 2004, at 11:53 AM, Dan Anderson wrote:
[..]
Can anyone provide me with more information
then O'Reilly's "some regular
expressions take an exponential time to execute"?
What you want to do is read knuth
on searching algorithms - since what
is a Regular Expression, but an effort
to s
I was reading O'Reilly's Programming Perl, and under the
security section it says that regular expressions from outside the
program are not trusted because it is possible that they can take
forever to execute.
I was curious exactly what kind of regular expression
