1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/* -*- indent-tabs-mode: nil; js-indent-level: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/**
* 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 non262/RegExp/octal-002.js for an elaboration.
*
*/
var SECTION = "RegExp/octal-003.js";
var TITLE = "RegExp patterns that contain OctalEscapeSequences";
var BUGNUMBER="http://scopus/bugsplat/show_bug.cgi?id=346132";
printBugNumber(BUGNUMBER);
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]) );
}
}
|
