3 var prefix = p.repeat(N);
4 var str = prefix + "[AB]";
7 var re = new RegExp(str);
10 // 1. Regexp too big is raised by the lack of the 64k virtual registers
11 // reserved for the regexp evaluation.
12 // 2. The stack overflow can occur during the analysis of the regexp
13 assertEq(e.message.includes("regexp too big") ||
14 e.message.includes("Stack overflow") ||
15 e.message.includes("too much recursion"), true);
19 var prefix = "/(?=k)ok/";
20 for (var i = 0; i < 18; i++)
21 g(Math.pow(2, i), prefix)