1 /* ***** BEGIN LICENSE BLOCK *****
2 * Version: NPL 1.1/GPL 2.0/LGPL 2.1
4 * The contents of this file are subject to the Netscape Public License
5 * Version 1.1 (the "License"); you may not use this file except in
6 * compliance with the License. You may obtain a copy of the License at
7 * http://www.mozilla.org/NPL/
9 * Software distributed under the License is distributed on an "AS IS" basis,
10 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
11 * for the specific language governing rights and limitations under the
14 * The Original Code is JavaScript Engine testing utilities.
16 * The Initial Developer of the Original Code is Netscape Communications Corp.
17 * Portions created by the Initial Developer are Copyright (C) 2003
18 * the Initial Developer. All Rights Reserved.
20 * Contributor(s): sagdjb@softwareag.com, pschwartau@netscape.com
22 * Alternatively, the contents of this file may be used under the terms of
23 * either the GNU General Public License Version 2 or later (the "GPL"), or
24 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
25 * in which case the provisions of the GPL or the LGPL are applicable instead
26 * of those above. If you wish to allow use of your version of this file only
27 * under the terms of either the GPL or the LGPL, and not to allow others to
28 * use your version of this file under the terms of the NPL, indicate your
29 * decision by deleting the provisions above and replace them with the notice
30 * and other provisions required by the GPL or the LGPL. If you do not delete
31 * the provisions above, a recipient may use your version of this file under
32 * the terms of any one of the NPL, the GPL or the LGPL.
34 * ***** END LICENSE BLOCK *****
38 * SUMMARY: Testing regexp submatches with quantifiers
40 * See http://bugzilla.mozilla.org/show_bug.cgi?id=209919
43 //-----------------------------------------------------------------------------
46 var summary = 'Testing regexp submatches with quantifiers';
48 var statusmessages = new Array();
50 var patterns = new Array();
52 var strings = new Array();
54 var actualmatches = new Array();
55 var expectedmatch = '';
56 var expectedmatches = new Array();
60 * Waldemar: "ECMA-262 15.10.2.5, third algorithm, step 2.1 states that
61 * once the minimum repeat count (which is 0 for *, 1 for +, etc.) has
62 * been satisfied, an atom being repeated must not match the empty string."
64 * In this example, the minimum repeat count is 0, so the last thing the
65 * capturing parens is permitted to contain is the 'a'. It may NOT go on
66 * to capture the '' at the $ position of 'a', even though '' satifies
70 status = inSection(1);
73 actualmatch = string.match(pattern);
74 expectedmatch = Array(string, 'a');
79 * In this example, the minimum repeat count is 5, so the capturing parens
80 * captures the 'a', then goes on to capture the '' at the $ position of 'a'
81 * 4 times before it has to stop. Therefore the last thing it contains is ''.
83 status = inSection(2);
85 pattern = /(a|b*){5,}/;
86 actualmatch = string.match(pattern);
87 expectedmatch = Array(string, '');
92 * Reduction of the above examples to contain only the condition b*
93 * inside the capturing parens. This can be even harder to grasp!
95 * The global match is the '' at the ^ position of 'a', but the parens
96 * is NOT permitted to capture it since the minimum repeat count is 0!
98 status = inSection(3);
101 actualmatch = string.match(pattern);
102 expectedmatch = Array('', undefined);
107 * Here we have used the + quantifier (repeat count 1) outside the parens.
108 * Therefore the parens must capture at least once before stopping, so it
109 * does capture the '' this time -
111 status = inSection(4);
114 actualmatch = string.match(pattern);
115 expectedmatch = Array('', '');
120 * More complex examples -
122 pattern = /^\-?(\d{1,}|\.{0,})*(\,\d{1,})?$/;
124 status = inSection(5);
126 actualmatch = string.match(pattern);
127 expectedmatch = Array(string, '00', undefined);
130 status = inSection(6);
132 actualmatch = string.match(pattern);
133 expectedmatch = Array(string, '100', ',00');
136 status = inSection(7);
138 actualmatch = string.match(pattern);
139 expectedmatch = Array(string, '000', ',00');
145 //-----------------------------------------------------------------------------
147 //-----------------------------------------------------------------------------
153 statusmessages[i] = status;
154 patterns[i] = pattern;
156 actualmatches[i] = actualmatch;
157 expectedmatches[i] = expectedmatch;
165 printBugNumber (bug);
166 printStatus (summary);
167 testRegExp(statusmessages, patterns, strings, actualmatches, expectedmatches);