lrhn
commented
2 years ago Likely reason is that the RegExp implementation remembers each capture (meaning each character since the RegExp her captures each individual matched character) in case it needs to backtrack from the *. It doesn't recognize that it actually never needs to backtrack the *, since the continuation is irrefutable.
That makes the backtracking stack linear in the input, and for AoT, that stack appears to be limited in size. So, working "as intended", you're hitting a natural limit of the runtime.
The solution would be to rewrite the RegExp.
I'd probably just remove the parentheses to avoid the capturing entirely. If you really want to find the last matched character, I'd do it afterwards as
var input = "....";
var match = regex.matchAsPrefix(input);
String? lastMatchedChar;
if (match != null && match.end > match.start) lastMatchedChar = input[match.end - 1];Otherwise, specify formally what you want to match and capture, then it should be possible to create a RegExp which does that more efficiently.
tomyeh
shreya-concetto
MegatronKing
joshgoebel
kingwill101
mraleph
This tracker is for issues related to:
Dart Version: 2.16.1 Environment: MacOS (it shall be the same on Linux since it is simplified from our production system)
After compiling the following code into executable (
dart compile exe test.dart), executing the executable will cause StackOverflow:On the other hand, it works fine with Dart VM (i.e.,
dart test.dart).