I don't know what that means. I don't see how auto-generated code would fix my problem. The regex parser should return an error to the caller if the regex exceeds some limit.
Dynamically growing the stack sounds like a cute hack. I doubt I'd consider it superior to just using the heap though.
I don't know what that means. I don't see how auto-generated code would fix my problem. The regex parser should return an error to the caller if the regex exceeds some limit.
Dynamically growing the stack sounds like a cute hack. I doubt I'd consider it superior to just using the heap though.