1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2 /* ***** BEGIN LICENSE BLOCK *****
3 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
5 * The contents of this file are subject to the Mozilla Public License Version
6 * 1.1 (the "License"); you may not use this file except in compliance with
7 * the License. You may obtain a copy of the License at
8 * http://www.mozilla.org/MPL/
10 * Software distributed under the License is distributed on an "AS IS" basis,
11 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12 * for the specific language governing rights and limitations under the
15 * The Original Code is JavaScript Engine testing utilities.
17 * The Initial Developer of the Original Code is
18 * Netscape Communications Corp.
19 * Portions created by the Initial Developer are Copyright (C) 2003
20 * the Initial Developer. All Rights Reserved.
23 * sagdjb@softwareag.com, pschwartau@netscape.com
25 * Alternatively, the contents of this file may be used under the terms of
26 * either the GNU General Public License Version 2 or later (the "GPL"), or
27 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
28 * in which case the provisions of the GPL or the LGPL are applicable instead
29 * of those above. If you wish to allow use of your version of this file only
30 * under the terms of either the GPL or the LGPL, and not to allow others to
31 * use your version of this file under the terms of the MPL, indicate your
32 * decision by deleting the provisions above and replace them with the notice
33 * and other provisions required by the GPL or the LGPL. If you do not delete
34 * the provisions above, a recipient may use your version of this file under
35 * the terms of any one of the MPL, the GPL or the LGPL.
37 * ***** END LICENSE BLOCK ***** */
42 * SUMMARY: Testing regexp submatches with quantifiers
44 * See http://bugzilla.mozilla.org/show_bug.cgi?id=209919
47 //-----------------------------------------------------------------------------
49 var BUGNUMBER = 209919;
50 var summary = 'Testing regexp submatches with quantifiers';
52 var statusmessages = new Array();
54 var patterns = new Array();
56 var strings = new Array();
58 var actualmatches = new Array();
59 var expectedmatch = '';
60 var expectedmatches = new Array();
64 * Waldemar: "ECMA-262 15.10.2.5, third algorithm, step 2.1 states that
65 * once the minimum repeat count (which is 0 for *, 1 for +, etc.) has
66 * been satisfied, an atom being repeated must not match the empty string."
68 * In this example, the minimum repeat count is 0, so the last thing the
69 * capturing parens is permitted to contain is the 'a'. It may NOT go on
70 * to capture the '' at the $ position of 'a', even though '' satifies
74 status = inSection(1);
77 actualmatch = string.match(pattern);
78 expectedmatch = Array(string, 'a');
83 * In this example, the minimum repeat count is 5, so the capturing parens
84 * captures the 'a', then goes on to capture the '' at the $ position of 'a'
85 * 4 times before it has to stop. Therefore the last thing it contains is ''.
87 status = inSection(2);
89 pattern = /(a|b*){5,}/;
90 actualmatch = string.match(pattern);
91 expectedmatch = Array(string, '');
96 * Reduction of the above examples to contain only the condition b*
97 * inside the capturing parens. This can be even harder to grasp!
99 * The global match is the '' at the ^ position of 'a', but the parens
100 * is NOT permitted to capture it since the minimum repeat count is 0!
102 status = inSection(3);
105 actualmatch = string.match(pattern);
106 expectedmatch = Array('', undefined);
111 * Here we have used the + quantifier (repeat count 1) outside the parens.
112 * Therefore the parens must capture at least once before stopping, so it
113 * does capture the '' this time -
115 status = inSection(4);
118 actualmatch = string.match(pattern);
119 expectedmatch = Array('', '');
124 * More complex examples -
126 pattern = /^\-?(\d{1,}|\.{0,})*(\,\d{1,})?$/;
128 status = inSection(5);
130 actualmatch = string.match(pattern);
131 expectedmatch = Array(string, '00', undefined);
134 status = inSection(6);
136 actualmatch = string.match(pattern);
137 expectedmatch = Array(string, '100', ',00');
140 status = inSection(7);
142 actualmatch = string.match(pattern);
143 expectedmatch = Array(string, '000', ',00');
149 //-----------------------------------------------------------------------------
151 //-----------------------------------------------------------------------------
157 statusmessages[i] = status;
158 patterns[i] = pattern;
160 actualmatches[i] = actualmatch;
161 expectedmatches[i] = expectedmatch;
169 printBugNumber(BUGNUMBER);
170 printStatus (summary);
171 testRegExp(statusmessages, patterns, strings, actualmatches, expectedmatches);