tests/mozilla/ecma_3/RegExp/regress-209919.js

   1 /* ***** BEGIN LICENSE BLOCK *****
   2 * Version: NPL 1.1/GPL 2.0/LGPL 2.1
   3 *
   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/
   8 *
   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
  12 * License.
  13 *
  14 * The Original Code is JavaScript Engine testing utilities.
  15 *
  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.
  19 *
  20 * Contributor(s): sagdjb@softwareag.com, pschwartau@netscape.com
  21 *
  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.
  33 *
  34 * ***** END LICENSE BLOCK *****
  35 *
  36 *
  37 * Date:    19 June 2003
  38 * SUMMARY: Testing regexp submatches with quantifiers
  39 *
  40 * See http://bugzilla.mozilla.org/show_bug.cgi?id=209919
  41 *
  42 */
  43 //-----------------------------------------------------------------------------
  44 var i = 0;
  45 var bug = 209919;
  46 var summary = 'Testing regexp submatches with quantifiers';
  47 var status = '';
  48 var statusmessages = new Array();
  49 var pattern = '';
  50 var patterns = new Array();
  51 var string = '';
  52 var strings = new Array();
  53 var actualmatch = '';
  54 var actualmatches = new Array();
  55 var expectedmatch = '';
  56 var expectedmatches = new Array();
  57
  58
  59 /*
  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."
  63  *
  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
  67  * the condition b*
  68  *
  69  */
  70 status = inSection(1);
  71 string = 'a';
  72 pattern = /(a|b*)*/;
  73 actualmatch = string.match(pattern);
  74 expectedmatch = Array(string, 'a');
  75 addThis();
  76
  77
  78 /*
  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 ''.
  82  */
  83 status = inSection(2);
  84 string = 'a';
  85 pattern = /(a|b*){5,}/;
  86 actualmatch = string.match(pattern);
  87 expectedmatch = Array(string, '');
  88 addThis();
  89
  90
  91 /*
  92  * Reduction of the above examples to contain only the condition b*
  93  * inside the capturing parens. This can be even harder to grasp!
  94  *
  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!
  97  */
  98 status = inSection(3);
  99 string = 'a';
 100 pattern = /(b*)*/;
 101 actualmatch = string.match(pattern);
 102 expectedmatch = Array('', undefined);
 103 addThis();
 104
 105
 106 /*
 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 -
 110  */
 111 status = inSection(4);
 112 string = 'a';
 113 pattern = /(b*)+/;
 114 actualmatch = string.match(pattern);
 115 expectedmatch = Array('', '');
 116 addThis();
 117
 118
 119 /*
 120  * More complex examples -
 121  */
 122 pattern = /^\-?(\d{1,}|\.{0,})*(\,\d{1,})?$/;
 123
 124   status = inSection(5);
 125   string = '100.00';
 126   actualmatch = string.match(pattern);
 127   expectedmatch = Array(string, '00', undefined);
 128   addThis();
 129
 130   status = inSection(6);
 131   string = '100,00';
 132   actualmatch = string.match(pattern);
 133   expectedmatch = Array(string, '100', ',00');
 134   addThis();
 135
 136   status = inSection(7);
 137   string = '1.000,00';
 138   actualmatch = string.match(pattern);
 139   expectedmatch = Array(string, '000', ',00');
 140   addThis();
 141
 142
 143
 144
 145 //-----------------------------------------------------------------------------
 146 test();
 147 //-----------------------------------------------------------------------------
 148
 149
 150
 151 function addThis()
 152 {
 153   statusmessages[i] = status;
 154   patterns[i] = pattern;
 155   strings[i] = string;
 156   actualmatches[i] = actualmatch;
 157   expectedmatches[i] = expectedmatch;
 158   i++;
 159 }
 160
 161
 162 function test()
 163 {
 164   enterFunc ('test');
 165   printBugNumber (bug);
 166   printStatus (summary);
 167   testRegExp(statusmessages, patterns, strings, actualmatches, expectedmatches);
 168   exitFunc ('test');
 169 }