1 files changed, 0 insertions, 120 deletions
diff --git a/tests/auto/declarative/parserstress/tests/ecma_2/RegExp/octal-003.js b/tests/auto/declarative/parserstress/tests/ecma_2/RegExp/octal-003.js
deleted file mode 100644
index ee07ca602b..0000000000
--- a/tests/auto/declarative/parserstress/tests/ecma_2/RegExp/octal-003.js
+++ /dev/null
@@ -1,120 +0,0 @@
-/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
-/* ***** BEGIN LICENSE BLOCK *****
- * Version: MPL 1.1/GPL 2.0/LGPL 2.1
- *
- * The contents of this file are subject to the Mozilla Public License Version
- * 1.1 (the "License"); you may not use this file except in compliance with
- * the License. You may obtain a copy of the License at
- * http://www.mozilla.org/MPL/
- *
- * Software distributed under the License is distributed on an "AS IS" basis,
- * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
- * for the specific language governing rights and limitations under the
- * License.
- *
- * The Original Code is JavaScript Engine testing utilities.
- *
- * The Initial Developer of the Original Code is
- * Netscape Communication Corporation.
- * Portions created by the Initial Developer are Copyright (C) 1998
- * the Initial Developer. All Rights Reserved.
- *
- * Contributor(s):
- *
- * Alternatively, the contents of this file may be used under the terms of
- * either the GNU General Public License Version 2 or later (the "GPL"), or
- * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
- * in which case the provisions of the GPL or the LGPL are applicable instead
- * of those above. If you wish to allow use of your version of this file only
- * under the terms of either the GPL or the LGPL, and not to allow others to
- * use your version of this file under the terms of the MPL, indicate your
- * decision by deleting the provisions above and replace them with the notice
- * and other provisions required by the GPL or the LGPL. If you do not delete
- * the provisions above, a recipient may use your version of this file under
- * the terms of any one of the MPL, the GPL or the LGPL.
- *
- * ***** END LICENSE BLOCK ***** */
-
-gTestfile = 'octal-003.js';
-
-/**
- *  File Name:          RegExp/octal-003.js
- *  ECMA Section:       15.7.1
- *  Description:        Based on ECMA 2 Draft 7 February 1999
- *  Simple test cases for matching OctalEscapeSequences.
- *  Author:             christine@netscape.com
- *  Date:               19 February 1999
- *
- *  Revised:            02 August 2002
- *  Author:             pschwartau@netscape.com
- *
- *  WHY:  the original test expected the regexp /.\011/
- *        to match 'a' + String.fromCharCode(0) + '11'
- *
- *  This is incorrect: the string is a 4-character string consisting of
- *  the characters <'a'>, <nul>, <'1'>, <'1'>. By contrast, the \011 in the
- *  regexp should be parsed as a single token: it is the octal escape sequence
- *  for the horizontal tab character '\t' === '\u0009' === '\x09' === '\011'.
- *
- *  So the regexp consists of 2 characters: <any-character>, <'\t'>.
- *  There is no match between the regexp and the string.
- *
- *  See the testcase ecma_3/RegExp/octal-002.js for an elaboration.
- *
- */
-var SECTION = "RegExp/octal-003.js";
-var VERSION = "ECMA_2";
-var TITLE   = "RegExp patterns that contain OctalEscapeSequences";
-var BUGNUMBER="http://scopus/bugsplat/show_bug.cgi?id=346132";
-
-startTest();
-
-AddRegExpCases( /.\011/, "/\\011/", "a" + String.fromCharCode(0) + "11", "a\\011", 0, null );
-
-test();
-
-function AddRegExpCases(
-  regexp, str_regexp, pattern, str_pattern, index, matches_array ) {
-
-  // prevent a runtime error
-
-  if ( regexp.exec(pattern) == null || matches_array == null ) {
-    AddTestCase(
-      regexp + ".exec(" + str_pattern +")",
-      matches_array,
-      regexp.exec(pattern) );
-
-    return;
-  }
-  AddTestCase(
-    str_regexp + ".exec(" + str_pattern +").length",
-    matches_array.length,
-    regexp.exec(pattern).length );
-
-  AddTestCase(
-    str_regexp + ".exec(" + str_pattern +").index",
-    index,
-    regexp.exec(pattern).index );
-
-  AddTestCase(
-    str_regexp + ".exec(" + str_pattern +").input",
-    escape(pattern),
-    escape(regexp.exec(pattern).input) );
-
-  AddTestCase(
-    str_regexp + ".exec(" + str_pattern +").toString()",
-    matches_array.toString(),
-    escape(regexp.exec(pattern).toString()) );
-
-  var limit = matches_array.length > regexp.exec(pattern).length
-    ? matches_array.length
-    : regexp.exec(pattern).length;
-
-  for ( var matches = 0; matches < limit; matches++ ) {
-    AddTestCase(
-      str_regexp + ".exec(" + str_pattern +")[" + matches +"]",
-      matches_array[matches],
-      escape(regexp.exec(pattern)[matches]) );
-  }
-
-}