OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 169 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
180 NoHang(/(?=(((.*)*)*x)å)foo/); // Positive lookahead is filtered. | 180 NoHang(/(?=(((.*)*)*x)å)foo/); // Positive lookahead is filtered. |
181 NoHang(/(?=(((.*)*)*x))å/); // Continuation branch of positive lookahead. | 181 NoHang(/(?=(((.*)*)*x))å/); // Continuation branch of positive lookahead. |
182 NoHang(/(?=å)(((.*)*)*x)/); // Positive lookahead also prunes continuation. | 182 NoHang(/(?=å)(((.*)*)*x)/); // Positive lookahead also prunes continuation. |
183 NoHang(/(æ|ø|å)(((.*)*)*x)/); // All branches of alternation are filtered. | 183 NoHang(/(æ|ø|å)(((.*)*)*x)/); // All branches of alternation are filtered. |
184 NoHang(/(a|b|(((.*)*)*x))å/); // 1 out of 3 branches pruned. | 184 NoHang(/(a|b|(((.*)*)*x))å/); // 1 out of 3 branches pruned. |
185 NoHang(/(a|(((.*)*)*x)ø|(((.*)*)*x)å)/); // 2 out of 3 branches pruned. | 185 NoHang(/(a|(((.*)*)*x)ø|(((.*)*)*x)å)/); // 2 out of 3 branches pruned. |
186 | 186 |
187 var s = "Don't prune based on a repetition of length 0"; | 187 var s = "Don't prune based on a repetition of length 0"; |
188 assertEquals(null, s.match(/å{1,1}prune/)); | 188 assertEquals(null, s.match(/å{1,1}prune/)); |
189 assertEquals("prune", (s.match(/å{0,0}prune/)[0])); | 189 assertEquals("prune", (s.match(/å{0,0}prune/)[0])); |
| 190 |
| 191 // Some very deep regexps where FilterASCII gives up in order not to make the |
| 192 // stack overflow. |
| 193 var regex6 = /a*\u0100*\w/; |
| 194 var input0 = "a"; |
| 195 regex6.exec(input0); |
| 196 |
| 197 var re = "\u0100*\\w"; |
| 198 |
| 199 for (var i = 0; i < 200; i++) re = "a*" + re; |
| 200 |
| 201 var regex7 = new RegExp(re); |
| 202 regex7.exec(input0); |
| 203 |
| 204 var regex8 = new RegExp(re, "i"); |
| 205 regex8.exec(input0); |
| 206 |
| 207 re = "[\u0100]*\\w"; |
| 208 for (var i = 0; i < 200; i++) re = "a*" + re; |
| 209 |
| 210 var regex9 = new RegExp(re); |
| 211 regex9.exec(input0); |
| 212 |
| 213 var regex10 = new RegExp(re, "i"); |
| 214 regex10.exec(input0); |
OLD | NEW |