One thought I have is that there may potentially be a memory issue. How often is the /g modifier used? This modifier will remember position and in some cases this may lead to a growing memory foot print.
I might try running the script without including /g to try to rule that out.
Beyond this, an individual regex could cause an issue if you are not validating them in any way. In addition to global matching something like a recursive regex could create an infinite loop.
What type of regex patterns are potentially being passed in? If you can find a way of seeing what patterns were processed just before the problem begins this would likely be helpful.
If all else fails, you could also look at unrolling your recursion. This thread is a good starting point should you venture down that road. Turning a recursive function into an iterator
After some aggravation in writing recursive node structure processors, I now in practice write them using a stack algorithm instead. I believe the above thread likely has an example of such an approach.
In reply to Re: eval failing to match regex after sometime
by Kc12349
in thread eval failing to match regex after sometime
by sushant.ravale
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |