OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
42 | 42 |
43 // Create a regexp in the form of ((..(a)a..)a. | 43 // Create a regexp in the form of ((..(a)a..)a. |
44 // Compiling it causes EatsAtLeast to reach the maximum | 44 // Compiling it causes EatsAtLeast to reach the maximum |
45 // recursion depth possible with a given budget. | 45 // recursion depth possible with a given budget. |
46 // This should not cause a stack overflow. | 46 // This should not cause a stack overflow. |
47 var r3 = "a"; | 47 var r3 = "a"; |
48 for (var i = 0; i < 1000; i++) { | 48 for (var i = 0; i < 1000; i++) { |
49 r3 = "(" + r3 + ")a"; | 49 r3 = "(" + r3 + ")a"; |
50 } | 50 } |
51 "test".match(RegExp(r3)); | 51 "test".match(RegExp(r3)); |
52 | |
OLD | NEW |