Add m-esr52 at 52.6.0

659 files changed, 51422 insertions, 0 deletions

diff --git a/js/src/tests/ecma/Array/15.4-1.js b/js/src/tests/ecma/Array/15.4-1.js
new file mode 100644
index 000000000..5371d71bc
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4-1.js
@@ -0,0 +1,99 @@
+/* -*- 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:          15.4-1.js
+   ECMA Section:       15.4 Array Objects
+
+   Description:        Every Array object has a length property whose value
+   is always an integer with positive sign and less than
+   Math.pow(2,32).
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.4-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array Objects";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,32)-2]='hi'; myarr[Math.pow(2,32)-2]",
+             "hi",
+             eval("var myarr = new Array(); myarr[Math.pow(2,32)-2]='hi'; myarr[Math.pow(2,32)-2]")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,32)-2]='hi'; myarr.length",
+             (Math.pow(2,32)-1),
+             eval("var myarr = new Array(); myarr[Math.pow(2,32)-2]='hi'; myarr.length")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,32)-3]='hi'; myarr[Math.pow(2,32)-3]",
+             "hi",
+             eval("var myarr = new Array(); myarr[Math.pow(2,32)-3]='hi'; myarr[Math.pow(2,32)-3]")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,32)-3]='hi'; myarr.length",
+             (Math.pow(2,32)-2),
+             eval("var myarr = new Array(); myarr[Math.pow(2,32)-3]='hi'; myarr.length")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,31)-2]='hi'; myarr[Math.pow(2,31)-2]",
+             "hi",
+             eval("var myarr = new Array(); myarr[Math.pow(2,31)-2]='hi'; myarr[Math.pow(2,31)-2]")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,31)-2]='hi'; myarr.length",
+             (Math.pow(2,31)-1),
+             eval("var myarr = new Array(); myarr[Math.pow(2,31)-2]='hi'; myarr.length")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,31)-1]='hi'; myarr[Math.pow(2,31)-1]",
+             "hi",
+             eval("var myarr = new Array(); myarr[Math.pow(2,31)-1]='hi'; myarr[Math.pow(2,31)-1]")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,31)-1]='hi'; myarr.length",
+             (Math.pow(2,31)),
+             eval("var myarr = new Array(); myarr[Math.pow(2,31)-1]='hi'; myarr.length")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,31)]='hi'; myarr[Math.pow(2,31)]",
+             "hi",
+             eval("var myarr = new Array(); myarr[Math.pow(2,31)]='hi'; myarr[Math.pow(2,31)]")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,31)]='hi'; myarr.length",
+             (Math.pow(2,31)+1),
+             eval("var myarr = new Array(); myarr[Math.pow(2,31)]='hi'; myarr.length")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,30)-2]='hi'; myarr[Math.pow(2,30)-2]",
+             "hi",
+             eval("var myarr = new Array(); myarr[Math.pow(2,30)-2]='hi'; myarr[Math.pow(2,30)-2]")
+  );
+
+new TestCase(SECTION,
+             "var myarr = new Array(); myarr[Math.pow(2,30)-2]='hi'; myarr.length",
+             (Math.pow(2,30)-1),
+             eval("var myarr = new Array(); myarr[Math.pow(2,30)-2]='hi'; myarr.length")
+  );
+
+test();
+
diff --git a/js/src/tests/ecma/Array/15.4-2.js b/js/src/tests/ecma/Array/15.4-2.js
new file mode 100644
index 000000000..d16167844
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4-2.js
@@ -0,0 +1,80 @@
+/* -*- 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:          15.4-2.js
+   ECMA Section:       15.4 Array Objects
+
+   Description:        Whenever a property is added whose name is an array
+   index, the length property is changed, if necessary,
+   to be one more than the numeric value of that array
+   index; and whenever the length property is changed,
+   every property whose name is an array index whose value
+   is not smaller  than the new length is automatically
+   deleted.  This constraint applies only to the Array
+   object itself, and is unaffected by length or array
+   index properties that may be inherited from its
+   prototype.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.4-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array Objects";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+              "var arr=new Array();  arr[Math.pow(2,16)] = 'hi'; arr.length",     
+              Math.pow(2,16)+1,  
+              eval("var arr=new Array();  arr[Math.pow(2,16)] = 'hi'; arr.length") );
+
+new TestCase( SECTION,
+              "var arr=new Array();  arr[Math.pow(2,30)-2] = 'hi'; arr.length",   
+              Math.pow(2,30)-1,  
+              eval("var arr=new Array();  arr[Math.pow(2,30)-2] = 'hi'; arr.length") );
+
+new TestCase( SECTION,
+              "var arr=new Array();  arr[Math.pow(2,30)-1] = 'hi'; arr.length",   
+              Math.pow(2,30),    
+              eval("var arr=new Array();  arr[Math.pow(2,30)-1] = 'hi'; arr.length") );
+
+new TestCase( SECTION,
+              "var arr=new Array();  arr[Math.pow(2,30)] = 'hi'; arr.length",     
+              Math.pow(2,30)+1,  
+              eval("var arr=new Array();  arr[Math.pow(2,30)] = 'hi'; arr.length") );
+
+
+new TestCase( SECTION,
+              "var arr=new Array();  arr[Math.pow(2,31)-2] = 'hi'; arr.length",   
+              Math.pow(2,31)-1,  
+              eval("var arr=new Array();  arr[Math.pow(2,31)-2] = 'hi'; arr.length") );
+
+new TestCase( SECTION,
+              "var arr=new Array();  arr[Math.pow(2,31)-1] = 'hi'; arr.length",   
+              Math.pow(2,31),    
+              eval("var arr=new Array();  arr[Math.pow(2,31)-1] = 'hi'; arr.length") );
+
+new TestCase( SECTION,
+              "var arr=new Array();  arr[Math.pow(2,31)] = 'hi'; arr.length",     
+              Math.pow(2,31)+1,  
+              eval("var arr=new Array();  arr[Math.pow(2,31)] = 'hi'; arr.length") );
+
+new TestCase( SECTION,
+              "var arr = new Array(0,1,2,3,4,5); arr.length = 2; String(arr)",    
+              "0,1",             
+              eval("var arr = new Array(0,1,2,3,4,5); arr.length = 2; String(arr)") );
+
+new TestCase( SECTION,
+              "var arr = new Array(0,1); arr.length = 3; String(arr)",            
+              "0,1,",            
+              eval("var arr = new Array(0,1); arr.length = 3; String(arr)") );
+
+test();
+
diff --git a/js/src/tests/ecma/Array/15.4.1.1.js b/js/src/tests/ecma/Array/15.4.1.1.js
new file mode 100644
index 000000000..b64198517
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.1.1.js
@@ -0,0 +1,77 @@
+/* -*- tab-width: 2; 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:          15.4.1.1.js
+   ECMA Section:       15.4.1 Array( item0, item1,... )
+
+   Description:        When Array is called as a function rather than as a
+   constructor, it creates and initializes a new array
+   object.  Thus, the function call Array(...) is
+   equivalent to the object creation new Array(...) with
+   the same arguments.
+
+   An array is created and returned as if by the expression
+   new Array( item0, item1, ... ).
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+var SECTION = "15.4.1.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array Constructor Called as a Function";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "typeof Array(1,2)",       
+	      "object",          
+	      typeof Array(1,2) );
+
+new TestCase( SECTION,
+	      "(Array(1,2)).toString",   
+	      Array.prototype.toString,   
+	      (Array(1,2)).toString );
+
+new TestCase( SECTION,
+	      "var arr = Array(1,2,3); arr.toString = Object.prototype.toString; arr.toString()",
+	      "[object Array]",
+	      eval("var arr = Array(1,2,3); arr.toString = Object.prototype.toString; arr.toString()") );
+
+new TestCase( SECTION,
+	      "(Array(1,2)).length",     
+	      2,                 
+	      (Array(1,2)).length );
+
+new TestCase( SECTION,
+	      "var arr = (Array(1,2)); arr[0]", 
+	      1,          
+	      eval("var arr = (Array(1,2)); arr[0]") );
+
+new TestCase( SECTION,
+	      "var arr = (Array(1,2)); arr[1]", 
+	      2,          
+	      eval("var arr = (Array(1,2)); arr[1]") );
+
+new TestCase( SECTION,
+	      "var arr = (Array(1,2)); String(arr)", 
+	      "1,2", 
+	      eval("var arr = (Array(1,2)); String(arr)") );
+
+test();
+
+function ToUint32( n ) {
+  n = Number( n );
+  if( isNaN(n) || n == 0 || n == Number.POSITIVE_INFINITY ||
+      n == Number.NEGATIVE_INFINITY ) {
+    return 0;
+  }
+  var sign = n < 0 ? -1 : 1;
+
+  return ( sign * ( n * Math.floor( Math.abs(n) ) ) ) % Math.pow(2, 32);
+}
+
diff --git a/js/src/tests/ecma/Array/15.4.1.2.js b/js/src/tests/ecma/Array/15.4.1.2.js
new file mode 100644
index 000000000..08e3c0d77
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.1.2.js
@@ -0,0 +1,128 @@
+/* -*- tab-width: 2; 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:          15.4.1.2.js
+   ECMA Section:       15.4.1.2 Array(len)
+
+   Description:        When Array is called as a function rather than as a
+   constructor, it creates and initializes a new array
+   object.  Thus, the function call Array(...) is
+   equivalent to the object creationi new Array(...) with
+   the same arguments.
+
+   An array is created and returned as if by the
+   expression new Array(len).
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+var SECTION = "15.4.1.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array Constructor Called as a Function:  Array(len)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, 
+	      "(Array()).length",            
+	      0,                             
+	      (Array()).length );
+
+new TestCase( SECTION,
+	      "(Array(0)).length",           
+	      0,                             
+	      (Array(0)).length );
+
+new TestCase( SECTION,
+	      "(Array(1)).length",           
+	      1,                             
+	      (Array(1)).length );
+
+new TestCase( SECTION,
+	      "(Array(10)).length",          
+	      10,                            
+	      (Array(10)).length );
+
+new TestCase( SECTION,
+	      "(Array('1')).length",         
+	      1,                             
+	      (Array('1')).length );
+
+new TestCase( SECTION,
+	      "(Array(1000)).length",        
+	      1000,                          
+	      (Array(1000)).length );
+
+new TestCase( SECTION,
+	      "(Array('1000')).length",      
+	      1,                             
+	      (Array('1000')).length );
+
+new TestCase( SECTION,
+	      "(Array(4294967295)).length",  
+	      ToUint32(4294967295),          
+	      (Array(4294967295)).length );
+
+new TestCase( SECTION,
+	      "(Array(Math.pow(2,31)-1)).length",    
+	      ToUint32(Math.pow(2,31)-1),    
+	      (Array(Math.pow(2,31)-1)).length );
+
+new TestCase( SECTION,
+	      "(Array(Math.pow(2,31))).length",      
+	      ToUint32(Math.pow(2,31)),      
+	      (Array(Math.pow(2,31))).length );
+
+new TestCase( SECTION,
+	      "(Array(Math.pow(2,31)+1)).length",    
+	      ToUint32(Math.pow(2,31)+1),    
+	      (Array(Math.pow(2,31)+1)).length );
+
+new TestCase( SECTION,
+	      "(Array('8589934592')).length",
+	      1,                             
+	      (Array("8589934592")).length );
+
+new TestCase( SECTION,
+	      "(Array('4294967296')).length",
+	      1,                             
+	      (Array("4294967296")).length );
+
+new TestCase( SECTION,
+	      "(Array(1073741823)).length",  
+	      ToUint32(1073741823),          
+	      (Array(1073741823)).length );
+
+new TestCase( SECTION,
+	      "(Array(1073741824)).length",  
+	      ToUint32(1073741824),	       
+	      (Array(1073741824)).length );
+
+new TestCase( SECTION,
+	      "(Array('a string')).length",  
+	      1,                             
+	      (Array("a string")).length );
+
+test();
+
+function ToUint32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+  n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+  if ( n < 0 ){
+    n += Math.pow(2,32);
+  }
+
+  return ( n );
+}
diff --git a/js/src/tests/ecma/Array/15.4.1.3.js b/js/src/tests/ecma/Array/15.4.1.3.js
new file mode 100644
index 000000000..b6f09ce8b
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.1.3.js
@@ -0,0 +1,50 @@
+/* -*- tab-width: 2; 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:          15.4.1.3.js
+   ECMA Section:       15.4.1.3 Array()
+
+   Description:        When Array is called as a function rather than as a
+   constructor, it creates and initializes a new array
+   object.  Thus, the function call Array(...) is
+   equivalent to the object creationi new Array(...) with
+   the same arguments.
+
+   An array is created and returned as if by the
+   expression new Array(len).
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+var SECTION = "15.4.1.3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array Constructor Called as a Function:  Array()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"typeof Array()",
+		"object",
+		typeof Array() );
+
+new TestCase(   SECTION,
+		"MYARR = new Array();MYARR.getClass = Object.prototype.toString;MYARR.getClass()",
+		"[object Array]",
+		eval("MYARR = Array();MYARR.getClass = Object.prototype.toString;MYARR.getClass()") );
+
+new TestCase(   SECTION,
+		"(Array()).length",
+		0,         
+		(Array()).length );
+
+new TestCase(   SECTION,
+		"Array().toString()",
+		"",
+		Array().toString() );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.1.js b/js/src/tests/ecma/Array/15.4.1.js
new file mode 100644
index 000000000..18208b1ba
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.1.js
@@ -0,0 +1,98 @@
+/* -*- tab-width: 2; 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:          15.4.1.js
+   ECMA Section:       15.4.1 The Array Constructor Called as a Function
+
+   Description:        When Array is called as a function rather than as a
+   constructor, it creates and initializes a new array
+   object.  Thus, the function call Array(...) is
+   equivalent to the object creationi new Array(...) with
+   the same arguments.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.4.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Array Constructor Called as a Function";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"Array() +''",
+		"",
+		Array() +"" );
+
+new TestCase(   SECTION,
+		"typeof Array()",
+		"object",
+		typeof Array() );
+
+new TestCase(   SECTION,
+		"var arr = Array(); arr.getClass = Object.prototype.toString; arr.getClass()",
+		"[object Array]",
+		eval("var arr = Array(); arr.getClass = Object.prototype.toString; arr.getClass()") );
+
+new TestCase(   SECTION,
+		"var arr = Array(); arr.toString == Array.prototype.toString",
+		true,
+		eval("var arr = Array(); arr.toString == Array.prototype.toString") );
+
+new TestCase(   SECTION,
+		"Array().length",
+		0,
+		Array().length );
+
+new TestCase(   SECTION,
+		"Array(1,2,3) +''",
+		"1,2,3",
+		Array(1,2,3) +"" );
+
+new TestCase(   SECTION,
+		"typeof Array(1,2,3)",
+		"object",
+		typeof Array(1,2,3) );
+
+new TestCase(   SECTION,
+		"var arr = Array(1,2,3); arr.getClass = Object.prototype.toString; arr.getClass()",
+		"[object Array]",
+		eval("var arr = Array(1,2,3); arr.getClass = Object.prototype.toString; arr.getClass()") );
+
+new TestCase(   SECTION,
+		"var arr = Array(1,2,3); arr.toString == Array.prototype.toString",
+		true,
+		eval("var arr = Array(1,2,3); arr.toString == Array.prototype.toString") );
+
+new TestCase(   SECTION,
+		"Array(1,2,3).length",
+		3,
+		Array(1,2,3).length );
+
+new TestCase(   SECTION,
+		"typeof Array(12345)",
+		"object",
+		typeof Array(12345) );
+
+new TestCase(   SECTION,
+		"var arr = Array(12345); arr.getClass = Object.prototype.toString; arr.getClass()",
+		"[object Array]",
+		eval("var arr = Array(12345); arr.getClass = Object.prototype.toString; arr.getClass()") );
+
+new TestCase(   SECTION,
+		"var arr = Array(1,2,3,4,5); arr.toString == Array.prototype.toString",
+		true,
+		eval("var arr = Array(1,2,3,4,5); arr.toString == Array.prototype.toString") );
+
+new TestCase(   SECTION,
+		"Array(12345).length",
+		12345,
+		Array(12345).length );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.2.1-1.js b/js/src/tests/ecma/Array/15.4.2.1-1.js
new file mode 100644
index 000000000..af31fed87
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.2.1-1.js
@@ -0,0 +1,78 @@
+/* -*- tab-width: 2; 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:          15.4.2.1-1.js
+   ECMA Section:       15.4.2.1 new Array( item0, item1, ... )
+   Description:        This description only applies of the constructor is
+   given two or more arguments.
+
+   The [[Prototype]] property of the newly constructed
+   object is set to the original Array prototype object,
+   the one that is the initial value of Array.prototype
+   (15.4.3.1).
+
+   The [[Class]] property of the newly constructed object
+   is set to "Array".
+
+   The length property of the newly constructed object is
+   set to the number of arguments.
+
+   The 0 property of the newly constructed object is set
+   to item0... in general, for as many arguments as there
+   are, the k property of the newly constructed object is
+   set to argument k, where the first argument is
+   considered to be argument number 0.
+
+   This file tests the typeof the newly constructed object.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.4.2.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Array Constructor:  new Array( item0, item1, ...)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "typeof new Array(1,2)",       
+	      "object",          
+	      typeof new Array(1,2) );
+
+new TestCase( SECTION,
+	      "(new Array(1,2)).toString",   
+	      Array.prototype.toString,   
+	      (new Array(1,2)).toString );
+
+new TestCase( SECTION,
+	      "var arr = new Array(1,2,3); arr.getClass = Object.prototype.toString; arr.getClass()",
+	      "[object Array]",
+	      eval("var arr = new Array(1,2,3); arr.getClass = Object.prototype.toString; arr.getClass()") );
+
+new TestCase( SECTION,
+	      "(new Array(1,2)).length",     
+	      2,                 
+	      (new Array(1,2)).length );
+
+new TestCase( SECTION,
+	      "var arr = (new Array(1,2)); arr[0]", 
+	      1,          
+	      eval("var arr = (new Array(1,2)); arr[0]") );
+
+new TestCase( SECTION,
+	      "var arr = (new Array(1,2)); arr[1]", 
+	      2,          
+	      eval("var arr = (new Array(1,2)); arr[1]") );
+
+new TestCase( SECTION,
+	      "var arr = (new Array(1,2)); String(arr)", 
+	      "1,2", 
+	      eval("var arr = (new Array(1,2)); String(arr)") );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.2.1-2.js b/js/src/tests/ecma/Array/15.4.2.1-2.js
new file mode 100644
index 000000000..4cb1ce2b3
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.2.1-2.js
@@ -0,0 +1,67 @@
+/* -*- tab-width: 2; 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:          15.4.2.1-2.js
+   ECMA Section:       15.4.2.1 new Array( item0, item1, ... )
+   Description:        This description only applies of the constructor is
+   given two or more arguments.
+
+   The [[Prototype]] property of the newly constructed
+   object is set to the original Array prototype object,
+   the one that is the initial value of Array.prototype
+   (15.4.3.1).
+
+   The [[Class]] property of the newly constructed object
+   is set to "Array".
+
+   The length property of the newly constructed object is
+   set to the number of arguments.
+
+   The 0 property of the newly constructed object is set
+   to item0... in general, for as many arguments as there
+   are, the k property of the newly constructed object is
+   set to argument k, where the first argument is
+   considered to be argument number 0.
+
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+var SECTION = "15.4.2.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Array Constructor:  new Array( item0, item1, ...)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var TEST_STRING = "new Array(";
+var ARGUMENTS = ""
+  var TEST_LENGTH = Math.pow(2,10); //Math.pow(2,32);
+
+for ( var index = 0; index < TEST_LENGTH; index++ ) {
+  ARGUMENTS += index;
+  ARGUMENTS += (index == (TEST_LENGTH-1) ) ? "" : ",";
+}
+
+TEST_STRING += ARGUMENTS + ")";
+
+TEST_ARRAY = eval( TEST_STRING );
+
+for ( var item = 0; item < TEST_LENGTH; item++ ) {
+  new TestCase( SECTION,
+		"["+item+"]",    
+		item,   
+		TEST_ARRAY[item] );
+}
+
+new TestCase( SECTION,
+	      "new Array( ["+TEST_LENGTH+" arguments] ) +''",   
+	      ARGUMENTS,
+	      TEST_ARRAY +"" );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.2.1-3.js b/js/src/tests/ecma/Array/15.4.2.1-3.js
new file mode 100644
index 000000000..36910aef8
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.2.1-3.js
@@ -0,0 +1,103 @@
+/* -*- tab-width: 2; 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:          15.4.2.1-3.js
+   ECMA Section:       15.4.2.1 new Array( item0, item1, ... )
+   Description:        This description only applies of the constructor is
+   given two or more arguments.
+
+   The [[Prototype]] property of the newly constructed
+   object is set to the original Array prototype object,
+   the one that is the initial value of Array.prototype
+   (15.4.3.1).
+
+   The [[Class]] property of the newly constructed object
+   is set to "Array".
+
+   The length property of the newly constructed object is
+   set to the number of arguments.
+
+   The 0 property of the newly constructed object is set
+   to item0... in general, for as many arguments as there
+   are, the k property of the newly constructed object is
+   set to argument k, where the first argument is
+   considered to be argument number 0.
+
+   This test stresses the number of arguments presented to
+   the Array constructor.  Should support up to Math.pow
+   (2,32) arguments, since that is the maximum length of an
+   ECMAScript array.
+
+   ***Change TEST_LENGTH to Math.pow(2,32) when larger array
+   lengths are supported.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+var SECTION = "15.4.2.1-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Array Constructor:  new Array( item0, item1, ...)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var TEST_STRING = "new Array(";
+var ARGUMENTS = ""
+  var TEST_LENGTH = Math.pow(2,10); //Math.pow(2,32);
+
+for ( var index = 0; index < TEST_LENGTH; index++ ) {
+  ARGUMENTS += index;
+  ARGUMENTS += (index == (TEST_LENGTH-1) ) ? "" : ",";
+}
+
+TEST_STRING += ARGUMENTS + ")";
+
+TEST_ARRAY = eval( TEST_STRING );
+
+for ( var item = 0; item < TEST_LENGTH; item++ ) {
+  new TestCase( SECTION,
+		"TEST_ARRAY["+item+"]",    
+		item,   
+		TEST_ARRAY[item] );
+}
+
+new TestCase( SECTION,
+	      "new Array( ["+TEST_LENGTH+" arguments] ) +''", 
+	      ARGUMENTS,         
+	      TEST_ARRAY +"" );
+
+new TestCase( SECTION,
+	      "TEST_ARRAY.toString",                          
+	      Array.prototype.toString,  
+	      TEST_ARRAY.toString );
+
+new TestCase( SECTION,
+	      "TEST_ARRAY.join",                              
+	      Array.prototype.join,      
+	      TEST_ARRAY.join );
+
+new TestCase( SECTION,
+	      "TEST_ARRAY.sort",                              
+	      Array.prototype.sort,      
+	      TEST_ARRAY.sort );
+
+new TestCase( SECTION,
+	      "TEST_ARRAY.reverse",                           
+	      Array.prototype.reverse,   
+	      TEST_ARRAY.reverse );
+
+new TestCase( SECTION,
+	      "TEST_ARRAY.length",                            
+	      TEST_LENGTH,       
+	      TEST_ARRAY.length );
+
+new TestCase( SECTION,
+	      "TEST_ARRAY.toString = Object.prototype.toString; TEST_ARRAY.toString()",
+	      "[object Array]",
+	      eval("TEST_ARRAY.toString = Object.prototype.toString; TEST_ARRAY.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.2.2-1.js b/js/src/tests/ecma/Array/15.4.2.2-1.js
new file mode 100644
index 000000000..6a8956113
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.2.2-1.js
@@ -0,0 +1,149 @@
+/* -*- tab-width: 2; 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:          15.4.2.2-1.js
+   ECMA Section:       15.4.2.2 new Array(len)
+
+   Description:        This description only applies of the constructor is
+   given two or more arguments.
+
+   The [[Prototype]] property of the newly constructed
+   object is set to the original Array prototype object,
+   the one that is the initial value of Array.prototype(0)
+   (15.4.3.1).
+
+   The [[Class]] property of the newly constructed object
+   is set to "Array".
+
+   If the argument len is a number, then the length
+   property  of the newly constructed object is set to
+   ToUint32(len).
+
+   If the argument len is not a number, then the length
+   property of the newly constructed object is set to 1
+   and the 0 property of the newly constructed object is
+   set to len.
+
+   This file tests cases where len is a number.
+
+   The cases in this test need to be updated since the
+   ToUint32_t description has changed.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+var SECTION = "15.4.2.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Array Constructor:  new Array( len )";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "new Array(0)",            
+	      "",                
+	      (new Array(0)).toString() );
+
+new TestCase( SECTION,
+	      "typeof new Array(0)",     
+	      "object",          
+	      (typeof new Array(0)) );
+
+new TestCase( SECTION,
+	      "(new Array(0)).length",   
+	      0,                 
+	      (new Array(0)).length );
+
+new TestCase( SECTION,
+	      "(new Array(0)).toString",
+	      Array.prototype.toString,   
+	      (new Array(0)).toString );
+
+new TestCase( SECTION,  
+	      "new Array(1)",           
+	      "",                
+	      (new Array(1)).toString() );
+
+new TestCase( SECTION,  
+	      "new Array(1).length",    
+	      1,                 
+	      (new Array(1)).length );
+
+new TestCase( SECTION,  
+	      "(new Array(1)).toString",
+	      Array.prototype.toString,  
+	      (new Array(1)).toString );
+
+new TestCase( SECTION,
+	      "(new Array(-0)).length",                      
+	      0, 
+	      (new Array(-0)).length );
+
+new TestCase( SECTION,
+	      "(new Array(0)).length",                       
+	      0, 
+	      (new Array(0)).length );
+
+new TestCase( SECTION,
+	      "(new Array(10)).length",          
+	      10,        
+	      (new Array(10)).length );
+
+new TestCase( SECTION,
+	      "(new Array('1')).length",         
+	      1,         
+	      (new Array('1')).length );
+
+new TestCase( SECTION,
+	      "(new Array(1000)).length",        
+	      1000,      
+	      (new Array(1000)).length );
+
+new TestCase( SECTION,
+	      "(new Array('1000')).length",      
+	      1,         
+	      (new Array('1000')).length );
+
+new TestCase( SECTION,
+	      "(new Array(4294967295)).length",  
+	      ToUint32(4294967295),  
+	      (new Array(4294967295)).length );
+
+new TestCase( SECTION,
+	      "(new Array('8589934592')).length",
+	      1,                     
+	      (new Array("8589934592")).length );
+
+new TestCase( SECTION,
+	      "(new Array('4294967296')).length",
+	      1,                     
+	      (new Array("4294967296")).length );
+
+new TestCase( SECTION,
+	      "(new Array(1073741824)).length",  
+	      ToUint32(1073741824),
+	      (new Array(1073741824)).length );
+
+test();
+
+function ToUint32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+  n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+  if ( n < 0 ){
+    n += Math.pow(2,32);
+  }
+
+  return ( n );
+}
diff --git a/js/src/tests/ecma/Array/15.4.2.2-2.js b/js/src/tests/ecma/Array/15.4.2.2-2.js
new file mode 100644
index 000000000..f8c88f862
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.2.2-2.js
@@ -0,0 +1,84 @@
+/* -*- tab-width: 2; 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:          15.4.2.2-2.js
+   ECMA Section:       15.4.2.2 new Array(len)
+
+   Description:        This description only applies of the constructor is
+   given two or more arguments.
+
+   The [[Prototype]] property of the newly constructed
+   object is set to the original Array prototype object,
+   the one that is the initial value of Array.prototype(0)
+   (15.4.3.1).
+
+   The [[Class]] property of the newly constructed object
+   is set to "Array".
+
+   If the argument len is a number, then the length
+   property  of the newly constructed object is set to
+   ToUint32(len).
+
+   If the argument len is not a number, then the length
+   property of the newly constructed object is set to 1
+   and the 0 property of the newly constructed object is
+   set to len.
+
+   This file tests length of the newly constructed array
+   when len is not a number.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+var SECTION = "15.4.2.2-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Array Constructor:  new Array( len )";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "(new Array(new Number(1073741823))).length",  
+	      1,     
+	      (new Array(new Number(1073741823))).length );
+
+new TestCase( SECTION,
+	      "(new Array(new Number(0))).length",           
+	      1,     
+	      (new Array(new Number(0))).length );
+
+new TestCase( SECTION,
+	      "(new Array(new Number(1000))).length",        
+	      1,     
+	      (new Array(new Number(1000))).length );
+
+new TestCase( SECTION,
+	      "(new Array('mozilla, larryzilla, curlyzilla')).length",
+	      1, 
+	      (new Array('mozilla, larryzilla, curlyzilla')).length );
+
+new TestCase( SECTION,
+	      "(new Array(true)).length",                    
+	      1,     
+	      (new Array(true)).length );
+
+new TestCase( SECTION,
+	      "(new Array(false)).length",                   
+	      1,     
+	      (new Array(false)).length);
+
+new TestCase( SECTION,
+	      "(new Array(new Boolean(true)).length",        
+	      1,     
+	      (new Array(new Boolean(true))).length );
+
+new TestCase( SECTION,
+	      "(new Array(new Boolean(false)).length",       
+	      1,     
+	      (new Array(new Boolean(false))).length );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.2.3.js b/js/src/tests/ecma/Array/15.4.2.3.js
new file mode 100644
index 000000000..5ec7989dc
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.2.3.js
@@ -0,0 +1,67 @@
+/* -*- tab-width: 2; 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:          15.4.2.3.js
+   ECMA Section:       15.4.2.3 new Array()
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the origianl Array prototype object,
+   the one that is the initial value of Array.prototype.
+   The [[Class]] property of the new object is set to
+   "Array".  The length of the object is set to 0.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.4.2.3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Array Constructor:  new Array()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "new   Array() +''",       
+	      "",                
+	      (new Array()) +"" );
+
+new TestCase( SECTION,
+	      "typeof new Array()",      
+	      "object",          
+	      (typeof new Array()) );
+
+new TestCase( SECTION,
+	      "var arr = new Array(); arr.getClass = Object.prototype.toString; arr.getClass()",
+	      "[object Array]",
+	      eval("var arr = new Array(); arr.getClass = Object.prototype.toString; arr.getClass()") );
+
+new TestCase( SECTION,
+	      "(new Array()).length",    
+	      0,                 
+	      (new Array()).length );
+
+new TestCase( SECTION,
+	      "(new Array()).toString == Array.prototype.toString",  
+	      true,      
+	      (new Array()).toString == Array.prototype.toString );
+
+new TestCase( SECTION,
+	      "(new Array()).join  == Array.prototype.join",         
+	      true,      
+	      (new Array()).join  == Array.prototype.join );
+
+new TestCase( SECTION,
+	      "(new Array()).reverse == Array.prototype.reverse",    
+	      true,      
+	      (new Array()).reverse  == Array.prototype.reverse );
+
+new TestCase( SECTION,
+	      "(new Array()).sort  == Array.prototype.sort",        
+	      true,      
+	      (new Array()).sort  == Array.prototype.sort );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.3.1-2.js b/js/src/tests/ecma/Array/15.4.3.1-2.js
new file mode 100644
index 000000000..70f38f831
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.3.1-2.js
@@ -0,0 +1,47 @@
+/* -*- tab-width: 2; 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:          15.4.3.1-1.js
+   ECMA Section:       15.4.3.1 Array.prototype
+   Description:        The initial value of Array.prototype is the built-in
+   Array prototype object (15.4.4).
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.4.3.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var ARRAY_PROTO = Array.prototype;
+
+new TestCase( SECTION, 
+	      "var props = ''; for ( p in Array  ) { props += p } props",
+	      "",
+	      eval("var props = ''; for ( p in Array  ) { props += p } props") );
+
+new TestCase( SECTION, 
+	      "Array.prototype = null; Array.prototype",  
+	      ARRAY_PROTO,
+	      eval("Array.prototype = null; Array.prototype") );
+
+new TestCase( SECTION, 
+	      "delete Array.prototype",                  
+	      false,      
+	      delete Array.prototype );
+
+new TestCase( SECTION, 
+	      "delete Array.prototype; Array.prototype", 
+	      ARRAY_PROTO,
+	      eval("delete Array.prototype; Array.prototype") );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.3.2.js b/js/src/tests/ecma/Array/15.4.3.2.js
new file mode 100644
index 000000000..33d50005a
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.3.2.js
@@ -0,0 +1,28 @@
+/* -*- tab-width: 2; 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:          15.4.3.2.js
+   ECMA Section:       15.4.3.2 Array.length
+   Description:        The length property is 1.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.4.3.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array.length";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Array.length",     
+	      1,       
+	      Array.length );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.4.1.js b/js/src/tests/ecma/Array/15.4.4.1.js
new file mode 100644
index 000000000..7ffe56002
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.4.1.js
@@ -0,0 +1,29 @@
+/* -*- tab-width: 2; 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:          15.4.4.1.js
+   ECMA Section:       15.4.4.1 Array.prototype.constructor
+   Description:        The initial value of Array.prototype.constructor
+   is the built-in Array constructor.
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.4.4.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array.prototype.constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION,
+	      "Array.prototype.constructor == Array",
+	      true,  
+	      Array.prototype.constructor == Array);
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.4.2.js b/js/src/tests/ecma/Array/15.4.4.2.js
new file mode 100644
index 000000000..a471da1cc
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.4.2.js
@@ -0,0 +1,76 @@
+/* -*- tab-width: 2; 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:          15.4.4.2.js
+   ECMA Section:       15.4.4.2 Array.prototype.toString()
+   Description:        The elements of this object are converted to strings
+   and these strings are then concatenated, separated by
+   comma characters.  The result is the same as if the
+   built-in join method were invoiked for this object
+   with no argument.
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.4.4.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array.prototype.toString";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, 
+	      "Array.prototype.toString.length", 
+	      0, 
+	      Array.prototype.toString.length );
+
+new TestCase( SECTION, 
+	      "(new Array()).toString()",    
+	      "",    
+	      (new Array()).toString() );
+
+new TestCase( SECTION, 
+	      "(new Array(2)).toString()",   
+	      ",",   
+	      (new Array(2)).toString() );
+
+new TestCase( SECTION, 
+	      "(new Array(0,1)).toString()", 
+	      "0,1", 
+	      (new Array(0,1)).toString() );
+
+new TestCase( SECTION, 
+	      "(new Array( Number.NaN, Number.POSITIVE_INFINITY, Number.NEGATIVE_INFINITY)).toString()", 
+	      "NaN,Infinity,-Infinity",  
+	      (new Array( Number.NaN, Number.POSITIVE_INFINITY, Number.NEGATIVE_INFINITY)).toString() );
+
+new TestCase( SECTION, 
+	      "(new Array( Boolean(1), Boolean(0))).toString()",  
+	      "true,false",  
+	      (new Array(Boolean(1),Boolean(0))).toString() );
+
+new TestCase( SECTION, 
+	      "(new Array(void 0,null)).toString()",   
+	      ",",   
+	      (new Array(void 0,null)).toString() );
+
+var EXPECT_STRING = "";
+var MYARR = new Array();
+
+for ( var i = -50; i < 50; i+= 0.25 ) {
+  MYARR[MYARR.length] = i;
+  EXPECT_STRING += i +",";
+}
+
+EXPECT_STRING = EXPECT_STRING.substring( 0, EXPECT_STRING.length -1 );
+
+new TestCase( SECTION,
+	      "MYARR.toString()", 
+	      EXPECT_STRING, 
+	      MYARR.toString() );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.4.3-1.js b/js/src/tests/ecma/Array/15.4.4.3-1.js
new file mode 100644
index 000000000..dd550e511
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.4.3-1.js
@@ -0,0 +1,127 @@
+/* -*- tab-width: 2; 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:    15.4.4.3-1.js
+   ECMA Section: 15.4.4.3-1 Array.prototype.join()
+   Description:  The elements of this object are converted to strings and
+   these strings are then concatenated, separated by comma
+   characters. The result is the same as if the built-in join
+   method were invoiked for this object with no argument.
+   Author:       christine@netscape.com, pschwartau@netscape.com
+   Date:         07 October 1997
+   Modified:     14 July 2002
+   Reason:       See http://bugzilla.mozilla.org/show_bug.cgi?id=155285
+   ECMA-262 Ed.3  Section 15.4.4.5 Array.prototype.join()
+   Step 3: If |separator| is |undefined|, let |separator|
+   be the single-character string ","
+   *
+   */
+
+var SECTION = "15.4.4.3-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Array.prototype.join()");
+
+var ARR_PROTOTYPE = Array.prototype;
+
+new TestCase( SECTION, "Array.prototype.join.length",           1,      Array.prototype.join.length );
+
+// case where array length is 0
+
+new TestCase(   SECTION,
+		"var TEST_ARRAY = new Array(); TEST_ARRAY.join()",
+		"",
+		eval("var TEST_ARRAY = new Array(); TEST_ARRAY.join()") );
+
+// array length is 0, but spearator is specified
+
+new TestCase(   SECTION,
+		"var TEST_ARRAY = new Array(); TEST_ARRAY.join(' ')",
+		"",
+		eval("var TEST_ARRAY = new Array(); TEST_ARRAY.join(' ')") );
+
+// length is greater than 0, separator is supplied
+new TestCase(   SECTION,
+		"var TEST_ARRAY = new Array(null, void 0, true, false, 123, new Object(), new Boolean(true) ); TEST_ARRAY.join('&')",
+		"&&true&false&123&[object Object]&true",
+		eval("var TEST_ARRAY = new Array(null, void 0, true, false, 123, new Object(), new Boolean(true) ); TEST_ARRAY.join('&')") );
+
+// length is greater than 0, separator is empty string
+new TestCase(   SECTION,
+		"var TEST_ARRAY = new Array(null, void 0, true, false, 123, new Object(), new Boolean(true) ); TEST_ARRAY.join('')",
+		"truefalse123[object Object]true",
+		eval("var TEST_ARRAY = new Array(null, void 0, true, false, 123, new Object(), new Boolean(true) ); TEST_ARRAY.join('')") );
+
+// length is greater than 0, separator is undefined
+new TestCase(   SECTION,
+		"var TEST_ARRAY = new Array(null, void 0, true, false, 123, new Object(), new Boolean(true) ); TEST_ARRAY.join(void 0)",
+		",,true,false,123,[object Object],true",
+		eval("var TEST_ARRAY = new Array(null, void 0, true, false, 123, new Object(), new Boolean(true) ); TEST_ARRAY.join(void 0)") );
+
+// length is greater than 0, separator is not supplied
+new TestCase(   SECTION,
+		"var TEST_ARRAY = new Array(null, void 0, true, false, 123, new Object(), new Boolean(true) ); TEST_ARRAY.join()",
+		",,true,false,123,[object Object],true",
+		eval("var TEST_ARRAY = new Array(null, void 0, true, false, 123, new Object(), new Boolean(true) ); TEST_ARRAY.join()") );
+
+// separator is a control character
+new TestCase(   SECTION,
+		"var TEST_ARRAY = new Array(null, void 0, true, false, 123, new Object(), new Boolean(true) ); TEST_ARRAY.join('\v')",
+		decodeURIComponent("%0B%0Btrue%0Bfalse%0B123%0B[object Object]%0Btrue"),
+		eval("var TEST_ARRAY = new Array(null, void 0, true, false, 123, new Object(), new Boolean(true) ); TEST_ARRAY.join('\v')") );
+
+// length of array is 1
+new TestCase(   SECTION,
+		"var TEST_ARRAY = new Array(true) ); TEST_ARRAY.join('\v')",
+		"true",
+		eval("var TEST_ARRAY = new Array(true); TEST_ARRAY.join('\v')") );
+
+
+SEPARATOR = "\t"
+  TEST_LENGTH = 100;
+TEST_STRING = "";
+ARGUMENTS = "";
+TEST_RESULT = "";
+
+for ( var index = 0; index < TEST_LENGTH; index++ ) {
+  ARGUMENTS   += index;
+  ARGUMENTS   += ( index == TEST_LENGTH -1 ) ? "" : ",";
+
+  TEST_RESULT += index;
+  TEST_RESULT += ( index == TEST_LENGTH -1 ) ? "" : SEPARATOR;
+}
+
+TEST_ARRAY = eval( "new Array( "+ARGUMENTS +")" );
+
+new TestCase( SECTION,
+	      "TEST_ARRAY.join("+SEPARATOR+")",  
+	      TEST_RESULT,   
+	      TEST_ARRAY.join( SEPARATOR ) );
+
+new TestCase( SECTION,
+	      "(new Array( Boolean(true), Boolean(false), null,  void 0, Number(1e+21), Number(1e-7))).join()",
+	      "true,false,,,1e+21,1e-7",
+	      (new Array( Boolean(true), Boolean(false), null,  void 0, Number(1e+21), Number(1e-7))).join() );
+
+// this is not an Array object
+new TestCase(   SECTION,
+		"var OB = new Object_1('true,false,111,0.5,1.23e6,NaN,void 0,null'); OB.join(':')",
+		"true:false:111:0.5:1230000:NaN::",
+		eval("var OB = new Object_1('true,false,111,0.5,1.23e6,NaN,void 0,null'); OB.join(':')") );
+
+test();
+
+function Object_1( value ) {
+  this.array = value.split(",");
+  this.length = this.array.length;
+  for ( var i = 0; i < this.length; i++ ) {
+    this[i] = eval(this.array[i]);
+  }
+  this.join = Array.prototype.join;
+  this.getClass = Object.prototype.toString;
+}
diff --git a/js/src/tests/ecma/Array/15.4.4.3-2.js b/js/src/tests/ecma/Array/15.4.4.3-2.js
new file mode 100644
index 000000000..9b01737c2
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.4.3-2.js
@@ -0,0 +1,39 @@
+var arr = [0,1,,3,4];
+Object.prototype[2] = 2;
+
+assertEq(arr.join(""), "01234");
+assertEq(arr.join(","), "0,1,2,3,4");
+
+arr[2] = "porkchops";
+assertEq(arr.join("*"), "0*1*porkchops*3*4");
+
+delete Object.prototype[2];
+assertEq(arr.join("*"), "0*1*porkchops*3*4");
+
+delete arr[2];
+assertEq(arr.join("*"), "0*1**3*4");
+
+Object.prototype[2] = null;
+assertEq(arr.join("*"), "0*1**3*4");
+Object.prototype[2] = undefined;
+assertEq(arr.join("*"), "0*1**3*4");
+arr[2] = null;
+assertEq(arr.join("*"), "0*1**3*4");
+arr[2] = undefined;
+assertEq(arr.join("*"), "0*1**3*4");
+
+var arr = new Array(10);
+assertEq(arr.join(""), "");
+assertEq(arr.join(), ",,,,,,,,,");
+assertEq(arr.join("|"), "|||||||||");
+
+arr[2] = "doubt";
+assertEq(arr.join(","), ",,doubt,,,,,,,");
+
+arr[9] = "failure";
+assertEq(arr.join(","), ",,doubt,,,,,,,failure");
+
+delete arr[2];
+assertEq(arr.join(","), ",,,,,,,,,failure");
+
+reportCompare(true, true);
diff --git a/js/src/tests/ecma/Array/15.4.4.4-1.js b/js/src/tests/ecma/Array/15.4.4.4-1.js
new file mode 100644
index 000000000..da3e2ecdf
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.4.4-1.js
@@ -0,0 +1,250 @@
+/* -*- tab-width: 2; 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:          15.4.4.3-1.js
+   ECMA Section:       15.4.4.3-1 Array.prototype.reverse()
+   Description:
+
+   The elements of the array are rearranged so as to reverse their order.
+   This object is returned as the result of the call.
+
+   1.   Call the [[Get]] method of this object with argument "length".
+   2.   Call ToUint32(Result(1)).
+   3.   Compute floor(Result(2)/2).
+   4.   Let k be 0.
+   5.   If k equals Result(3), return this object.
+   6.   Compute Result(2)k1.
+   7.   Call ToString(k).
+   8.   ToString(Result(6)).
+   9.   Call the [[Get]] method of this object with argument Result(7).
+   10.   Call the [[Get]] method of this object with argument Result(8).
+   11.   If this object has a property named by Result(8), go to step 12; but
+   if this object has no property named by Result(8), then go to either
+   step 12 or step 14, depending on the implementation.
+   12.   Call the [[Put]] method of this object with arguments Result(7) and
+   Result(10).
+   13.   Go to step 15.
+   14.   Call the [[Delete]] method on this object, providing Result(7) as the
+   name of the property to delete.
+   15.   If this object has a property named by Result(7), go to step 16; but if
+   this object has no property named by Result(7), then go to either step 16
+   or step 18, depending on the implementation.
+   16.   Call the [[Put]] method of this object with arguments Result(8) and
+   Result(9).
+   17.   Go to step 19.
+   18.   Call the [[Delete]] method on this object, providing Result(8) as the
+   name of the property to delete.
+   19.   Increase k by 1.
+   20.   Go to step 5.
+
+   Note that the reverse function is intentionally generic; it does not require
+   that its this value be an Array object. Therefore it can be transferred to other
+   kinds of objects for use as a method. Whether the reverse function can be applied
+   successfully to a host object is implementation dependent.
+
+   Note:   Array.prototype.reverse allows some flexibility in implementation
+   regarding array indices that have not been populated. This test covers the
+   cases in which unpopulated indices are not deleted, since the JavaScript
+   implementation does not delete uninitialzed indices.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+var SECTION = "15.4.4.4-1";
+var VERSION = "ECMA_1";
+var BUGNUMBER="123724";
+startTest();
+
+writeHeaderToLog( SECTION + " Array.prototype.reverse()");
+
+var ARR_PROTOTYPE = Array.prototype;
+
+new TestCase( SECTION,
+	      "Array.prototype.reverse.length",          
+	      0,     
+	      Array.prototype.reverse.length );
+
+// length of array is 0
+new TestCase( SECTION,
+	      "var A = new Array();   A.reverse(); A.length",
+	      0,
+	      eval("var A = new Array();   A.reverse(); A.length") );
+
+// length of array is 1
+var A = new Array(true);
+var R = Reverse(A);
+
+new TestCase( SECTION,
+	      "var A = new Array(true);   A.reverse(); A.length",
+	      R.length,
+	      eval("var A = new Array(true);   A.reverse(); A.length") );
+
+CheckItems( R, A );
+
+// length of array is 2
+var S = "var A = new Array( true,false )";
+eval(S);
+var R = Reverse(A);
+
+new TestCase( SECTION,
+	      S +";  A.reverse(); A.length",
+	      R.length,
+	      eval( S + "; A.reverse(); A.length") );
+
+CheckItems(  R, A );
+
+// length of array is 3
+var S = "var A = new Array( true,false,null )";
+eval(S);
+var R = Reverse(A);
+
+new TestCase( SECTION,
+	      S +";  A.reverse(); A.length",
+	      R.length,
+	      eval( S + "; A.reverse(); A.length") );
+
+CheckItems( R, A );
+
+// length of array is 4
+var S = "var A = new Array( true,false,null,void 0 )";
+eval(S);
+var R = Reverse(A);
+
+new TestCase( SECTION,
+	      S +";  A.reverse(); A.length",
+	      R.length,
+	      eval( S + "; A.reverse(); A.length") );
+CheckItems( R, A );
+
+
+// some array indexes have not been set
+var S = "var A = new Array(); A[8] = 'hi', A[3] = 'yo'";
+eval(S);
+var R = Reverse(A);
+
+new TestCase( SECTION,
+	      S +";  A.reverse(); A.length",
+	      R.length,
+	      eval( S + "; A.reverse(); A.length") );
+
+CheckItems( R, A );
+
+
+var OBJECT_OBJECT = new Object();
+var FUNCTION_OBJECT = new Function( 'return this' );
+var BOOLEAN_OBJECT = new Boolean;
+var DATE_OBJECT = new Date(0);
+var STRING_OBJECT = new String('howdy');
+var NUMBER_OBJECT = new Number(Math.PI);
+var ARRAY_OBJECT= new Array(1000);
+
+var args = "null, void 0, Math.pow(2,32), 1.234e-32, OBJECT_OBJECT, BOOLEAN_OBJECT, FUNCTION_OBJECT, DATE_OBJECT, STRING_OBJECT,"+
+  "ARRAY_OBJECT, NUMBER_OBJECT, Math, true, false, 123, '90210'";
+
+var S = "var A = new Array("+args+")";
+eval(S);
+var R = Reverse(A);
+
+new TestCase( SECTION,
+	      S +";  A.reverse(); A.length",
+	      R.length,
+	      eval( S + "; A.reverse(); A.length") );
+
+CheckItems( R, A );
+
+var limit = 1000;
+var args = "";
+for (var i = 0; i < limit; i++ ) {
+  args += i +"";
+  if ( i + 1 < limit ) {
+    args += ",";
+  }
+}
+
+var S = "var A = new Array("+args+")";
+eval(S);
+var R = Reverse(A);
+
+new TestCase( SECTION,
+	      S +";  A.reverse(); A.length",
+	      R.length,
+	      eval( S + "; A.reverse(); A.length") );
+
+CheckItems( R, A );
+
+var S = "var MYOBJECT = new Object_1( \"void 0, 1, null, 2, \'\'\" )";
+eval(S);
+var R = Reverse( A );
+
+new TestCase( SECTION,
+	      S +";  A.reverse(); A.length",
+	      R.length,
+	      eval( S + "; A.reverse(); A.length") );
+
+CheckItems( R, A );
+
+test();
+
+function CheckItems( R, A ) {
+  for ( var i = 0; i < R.length; i++ ) {
+    new TestCase(
+      SECTION,
+      "A["+i+ "]",
+      R[i],
+      A[i] );
+  }
+}
+
+function Object_1( value ) {
+  this.array = value.split(",");
+  this.length = this.array.length;
+  for ( var i = 0; i < this.length; i++ ) {
+    this[i] = eval(this.array[i]);
+  }
+  this.join = Array.prototype.reverse;
+  this.getClass = Object.prototype.toString;
+}
+
+function Reverse( array ) {
+  var r2 = array.length;
+  var k = 0;
+  var r3 = Math.floor( r2/2 );
+  if ( r3 == k ) {
+    return array;
+  }
+
+  for ( k = 0;  k < r3; k++ ) {
+    var r6 = r2 - k - 1;
+//        var r7 = String( k );
+    var r7 = k;
+    var r8 = String( r6 );
+
+    var r9 = array[r7];
+    var r10 = array[r8];
+
+    array[r7] = r10;
+    array[r8] = r9;
+  }
+
+  return array;
+}
+
+function Iterate( array ) {
+  for ( var i = 0; i < array.length; i++ ) {
+//        print( i+": "+ array[String(i)] );
+  }
+}
+
+function Object_1( value ) {
+  this.array = value.split(",");
+  this.length = this.array.length;
+  for ( var i = 0; i < this.length; i++ ) {
+    this[i] = this.array[i];
+  }
+  this.reverse = Array.prototype.reverse;
+  this.getClass = Object.prototype.toString;
+}
diff --git a/js/src/tests/ecma/Array/15.4.4.4-2.js b/js/src/tests/ecma/Array/15.4.4.4-2.js
new file mode 100644
index 000000000..60ad9049f
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.4.4-2.js
@@ -0,0 +1,133 @@
+/* -*- tab-width: 2; 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:          15.4.4.3-1.js
+   ECMA Section:       15.4.4.3-1 Array.prototype.reverse()
+   Description:
+
+   The elements of the array are rearranged so as to reverse their order.
+   This object is returned as the result of the call.
+
+   1.   Call the [[Get]] method of this object with argument "length".
+   2.   Call ToUint32(Result(1)).
+   3.   Compute floor(Result(2)/2).
+   4.   Let k be 0.
+   5.   If k equals Result(3), return this object.
+   6.   Compute Result(2)k1.
+   7.   Call ToString(k).
+   8.   ToString(Result(6)).
+   9.   Call the [[Get]] method of this object with argument Result(7).
+   10.   Call the [[Get]] method of this object with argument Result(8).
+   11.   If this object has a property named by Result(8), go to step 12; but
+   if this object has no property named by Result(8), then go to either
+   step 12 or step 14, depending on the implementation.
+   12.   Call the [[Put]] method of this object with arguments Result(7) and
+   Result(10).
+   13.   Go to step 15.
+   14.   Call the [[Delete]] method on this object, providing Result(7) as the
+   name of the property to delete.
+   15.   If this object has a property named by Result(7), go to step 16; but if
+   this object has no property named by Result(7), then go to either step 16
+   or step 18, depending on the implementation.
+   16.   Call the [[Put]] method of this object with arguments Result(8) and
+   Result(9).
+   17.   Go to step 19.
+   18.   Call the [[Delete]] method on this object, providing Result(8) as the
+   name of the property to delete.
+   19.   Increase k by 1.
+   20.   Go to step 5.
+
+   Note that the reverse function is intentionally generic; it does not require
+   that its this value be an Array object. Therefore it can be transferred to other
+   kinds of objects for use as a method. Whether the reverse function can be applied
+   successfully to a host object is implementation dependent.
+
+   Note:   Array.prototype.reverse allows some flexibility in implementation
+   regarding array indices that have not been populated. This test covers the
+   cases in which unpopulated indices are not deleted, since the JavaScript
+   implementation does not delete uninitialzed indices.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.4.4.4-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Array.prototype.reverse()");
+
+var ARR_PROTOTYPE = Array.prototype;
+
+new TestCase( SECTION, "Array.prototype.reverse.length",           0,      Array.prototype.reverse.length );
+
+// length of array is 0
+new TestCase(   SECTION,
+		"var A = new Array();   A.reverse(); A.length",
+		0,
+		eval("var A = new Array();   A.reverse(); A.length") );
+
+test();
+
+function CheckItems( R, A ) {
+  for ( var i = 0; i < R.length; i++ ) {
+    new TestCase(
+      SECTION,
+      "A["+i+ "]",
+      R[i],
+      A[i] );
+  }
+}
+test();
+
+function Object_1( value ) {
+  this.array = value.split(",");
+  this.length = this.array.length;
+  for ( var i = 0; i < this.length; i++ ) {
+    this[i] = eval(this.array[i]);
+  }
+  this.join = Array.prototype.reverse;
+  this.getClass = Object.prototype.toString;
+}
+function Reverse( array ) {
+  var r2 = array.length;
+  var k = 0;
+  var r3 = Math.floor( r2/2 );
+  if ( r3 == k ) {
+    return array;
+  }
+
+  for ( k = 0;  k < r3; k++ ) {
+    var r6 = r2 - k - 1;
+//        var r7 = String( k );
+    var r7 = k;
+    var r8 = String( r6 );
+
+    var r9 = array[r7];
+    var r10 = array[r8];
+
+    array[r7] = r10;
+    array[r8] = r9;
+  }
+
+  return array;
+}
+function Iterate( array ) {
+  for ( var i = 0; i < array.length; i++ ) {
+//        print( i+": "+ array[String(i)] );
+  }
+}
+
+function Object_1( value ) {
+  this.array = value.split(",");
+  this.length = this.array.length;
+  for ( var i = 0; i < this.length; i++ ) {
+    this[i] = this.array[i];
+  }
+  this.reverse = Array.prototype.reverse;
+  this.getClass = Object.prototype.toString;
+}
diff --git a/js/src/tests/ecma/Array/15.4.4.5-1.js b/js/src/tests/ecma/Array/15.4.4.5-1.js
new file mode 100644
index 000000000..967e54715
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.4.5-1.js
@@ -0,0 +1,191 @@
+/* -*- tab-width: 2; 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:          15.4.4.5.js
+   ECMA Section:       Array.prototype.sort(comparefn)
+   Description:
+
+   This test file tests cases in which the compare function is not supplied.
+
+   The elements of this array are sorted. The sort is not necessarily stable.
+   If comparefn is provided, it should be a function that accepts two arguments
+   x and y and returns a negative value if x < y, zero if x = y, or a positive
+   value if x > y.
+
+   1.   Call the [[Get]] method of this object with argument "length".
+   2.   Call ToUint32(Result(1)).
+   1.  Perform an implementation-dependent sequence of calls to the
+   [[Get]] , [[Put]], and [[Delete]] methods of this object and
+   toSortCompare (described below), where the first argument for each call
+   to [[Get]], [[Put]] , or [[Delete]] is a nonnegative integer less
+   than Result(2) and where the arguments for calls to SortCompare are
+   results of previous calls to the [[Get]] method. After this sequence
+   is complete, this object must have the following two properties.
+   (1) There must be some mathematical permutation of the nonnegative
+   integers less than Result(2), such that for every nonnegative integer
+   j less than Result(2), if property old[j] existed, then new[(j)] is
+   exactly the same value as old[j],. but if property old[j] did not exist,
+   then new[(j)] either does not exist or exists with value undefined.
+   (2) If comparefn is not supplied or is a consistent comparison
+   function for the elements of this array, then for all nonnegative
+   integers j and k, each less than Result(2), if old[j] compares less
+   than old[k] (see SortCompare below), then (j) < (k). Here we use the
+   notation old[j] to refer to the hypothetical result of calling the [
+   [Get]] method of this object with argument j before this step is
+   executed, and the notation new[j] to refer to the hypothetical result
+   of calling the [[Get]] method of this object with argument j after this
+   step has been completely executed. A function is a consistent
+   comparison function for a set of values if (a) for any two of those
+   values (possibly the same value) considered as an ordered pair, it
+   always returns the same value when given that pair of values as its
+   two arguments, and the result of applying ToNumber to this value is
+   not NaN; (b) when considered as a relation, where the pair (x, y) is
+   considered to be in the relation if and only if applying the function
+   to x and y and then applying ToNumber to the result produces a
+   negative value, this relation is a partial order; and (c) when
+   considered as a different relation, where the pair (x, y) is considered
+   to be in the relation if and only if applying the function to x and y
+   and then applying ToNumber to the result produces a zero value (of either
+   sign), this relation is an equivalence relation. In this context, the
+   phrase "x compares less than y" means applying Result(2) to x and y and
+   then applying ToNumber to the result produces a negative value.
+   3.Return this object.
+
+   When the SortCompare operator is called with two arguments x and y, the following steps are taken:
+   1.If x and y are both undefined, return +0.
+   2.If x is undefined, return 1.
+   3.If y is undefined, return 1.
+   4.If the argument comparefn was not provided in the call to sort, go to step 7.
+   5.Call comparefn with arguments x and y.
+   6.Return Result(5).
+   7.Call ToString(x).
+   8.Call ToString(y).
+   9.If Result(7) < Result(8), return 1.
+   10.If Result(7) > Result(8), return 1.
+   11.Return +0.
+
+   Note that, because undefined always compared greater than any other value, undefined and nonexistent
+   property values always sort to the end of the result. It is implementation-dependent whether or not such
+   properties will exist or not at the end of the array when the sort is concluded.
+
+   Note that the sort function is intentionally generic; it does not require that its this value be an Array object.
+   Therefore it can be transferred to other kinds of objects for use as a method. Whether the sort function can be
+   applied successfully to a host object is implementation dependent .
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+
+var SECTION = "15.4.4.5-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array.prototype.sort(comparefn)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+var S = new Array();
+var item = 0;
+
+// array is empty.
+S[item++] = "var A = new Array()";
+
+// array contains one item
+S[item++] = "var A = new Array( true )";
+
+// length of array is 2
+S[item++] = "var A = new Array( true, false, new Boolean(true), new Boolean(false), 'true', 'false' )";
+
+S[item++] = "var A = new Array(); A[3] = 'undefined'; A[6] = null; A[8] = 'null'; A[0] = void 0";
+
+S[item] = "var A = new Array( ";
+
+var limit = 0x0061;
+for ( var i = 0x007A; i >= limit; i-- ) {
+  S[item] += "\'"+ String.fromCharCode(i) +"\'" ;
+  if ( i > limit ) {
+    S[item] += ",";
+  }
+}
+
+S[item] += ")";
+
+item++;
+
+for ( var i = 0; i < S.length; i++ ) {
+  CheckItems( S[i] );
+}
+
+test();
+
+function CheckItems( S ) {
+  eval( S );
+  var E = Sort( A );
+
+  new TestCase(   SECTION,
+		  S +";  A.sort(); A.length",
+		  E.length,
+		  eval( S + "; A.sort(); A.length") );
+
+  for ( var i = 0; i < E.length; i++ ) {
+    new TestCase(
+      SECTION,
+      "A["+i+ "].toString()",
+      E[i] +"",
+      A[i] +"");
+
+    if ( A[i] == void 0 && typeof A[i] == "undefined" ) {
+      new TestCase(
+	SECTION,
+	"typeof A["+i+ "]",
+	typeof E[i],
+	typeof A[i] );
+    }
+  }
+}
+function Object_1( value ) {
+  this.array = value.split(",");
+  this.length = this.array.length;
+  for ( var i = 0; i < this.length; i++ ) {
+    this[i] = eval(this.array[i]);
+  }
+  this.sort = Array.prototype.sort;
+  this.getClass = Object.prototype.toString;
+}
+function Sort( a ) {
+  for ( i = 0; i < a.length; i++ ) {
+    for ( j = i+1; j < a.length; j++ ) {
+      var lo = a[i];
+      var hi = a[j];
+      var c = Compare( lo, hi );
+      if ( c == 1 ) {
+	a[i] = hi;
+	a[j] = lo;
+      }
+    }
+  }
+  return a;
+}
+function Compare( x, y ) {
+  if ( x == void 0 && y == void 0  && typeof x == "undefined" && typeof y == "undefined" ) {
+    return +0;
+  }
+  if ( x == void 0  && typeof x == "undefined" ) {
+    return 1;
+  }
+  if ( y == void 0 && typeof y == "undefined" ) {
+    return -1;
+  }
+  x = String(x);
+  y = String(y);
+  if ( x < y ) {
+    return -1;
+  }
+  if ( x > y ) {
+    return 1;
+  }
+  return 0;
+}
diff --git a/js/src/tests/ecma/Array/15.4.4.5-2.js b/js/src/tests/ecma/Array/15.4.4.5-2.js
new file mode 100644
index 000000000..c242cddbb
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.4.5-2.js
@@ -0,0 +1,193 @@
+/* -*- tab-width: 2; 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:          15.4.4.5-2.js
+   ECMA Section:       Array.prototype.sort(comparefn)
+   Description:
+
+   This test file tests cases in which the compare function is supplied.
+   In this cases, the sort creates a reverse sort.
+
+   The elements of this array are sorted. The sort is not necessarily stable.
+   If comparefn is provided, it should be a function that accepts two arguments
+   x and y and returns a negative value if x < y, zero if x = y, or a positive
+   value if x > y.
+
+   1.   Call the [[Get]] method of this object with argument "length".
+   2.   Call ToUint32(Result(1)).
+   1.  Perform an implementation-dependent sequence of calls to the
+   [[Get]] , [[Put]], and [[Delete]] methods of this object and
+   toSortCompare (described below), where the first argument for each call
+   to [[Get]], [[Put]] , or [[Delete]] is a nonnegative integer less
+   than Result(2) and where the arguments for calls to SortCompare are
+   results of previous calls to the [[Get]] method. After this sequence
+   is complete, this object must have the following two properties.
+   (1) There must be some mathematical permutation of the nonnegative
+   integers less than Result(2), such that for every nonnegative integer
+   j less than Result(2), if property old[j] existed, then new[(j)] is
+   exactly the same value as old[j],. but if property old[j] did not exist,
+   then new[(j)] either does not exist or exists with value undefined.
+   (2) If comparefn is not supplied or is a consistent comparison
+   function for the elements of this array, then for all nonnegative
+   integers j and k, each less than Result(2), if old[j] compares less
+   than old[k] (see SortCompare below), then (j) < (k). Here we use the
+   notation old[j] to refer to the hypothetical result of calling the [
+   [Get]] method of this object with argument j before this step is
+   executed, and the notation new[j] to refer to the hypothetical result
+   of calling the [[Get]] method of this object with argument j after this
+   step has been completely executed. A function is a consistent
+   comparison function for a set of values if (a) for any two of those
+   values (possibly the same value) considered as an ordered pair, it
+   always returns the same value when given that pair of values as its
+   two arguments, and the result of applying ToNumber to this value is
+   not NaN; (b) when considered as a relation, where the pair (x, y) is
+   considered to be in the relation if and only if applying the function
+   to x and y and then applying ToNumber to the result produces a
+   negative value, this relation is a partial order; and (c) when
+   considered as a different relation, where the pair (x, y) is considered
+   to be in the relation if and only if applying the function to x and y
+   and then applying ToNumber to the result produces a zero value (of either
+   sign), this relation is an equivalence relation. In this context, the
+   phrase "x compares less than y" means applying Result(2) to x and y and
+   then applying ToNumber to the result produces a negative value.
+   3.Return this object.
+
+   When the SortCompare operator is called with two arguments x and y, the following steps are taken:
+   1.If x and y are both undefined, return +0.
+   2.If x is undefined, return 1.
+   3.If y is undefined, return 1.
+   4.If the argument comparefn was not provided in the call to sort, go to step 7.
+   5.Call comparefn with arguments x and y.
+   6.Return Result(5).
+   7.Call ToString(x).
+   8.Call ToString(y).
+   9.If Result(7) < Result(8), return 1.
+   10.If Result(7) > Result(8), return 1.
+   11.Return +0.
+
+   Note that, because undefined always compared greater than any other value, undefined and nonexistent
+   property values always sort to the end of the result. It is implementation-dependent whether or not such
+   properties will exist or not at the end of the array when the sort is concluded.
+
+   Note that the sort function is intentionally generic; it does not require that its this value be an Array object.
+   Therefore it can be transferred to other kinds of objects for use as a method. Whether the sort function can be
+   applied successfully to a host object is implementation dependent .
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+
+var SECTION = "15.4.4.5-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array.prototype.sort(comparefn)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var S = new Array();
+var item = 0;
+
+// array is empty.
+S[item++] = "var A = new Array()";
+
+// array contains one item
+S[item++] = "var A = new Array( true )";
+
+// length of array is 2
+S[item++] = "var A = new Array( true, false, new Boolean(true), new Boolean(false), 'true', 'false' )";
+
+S[item++] = "var A = new Array(); A[3] = 'undefined'; A[6] = null; A[8] = 'null'; A[0] = void 0";
+
+S[item] = "var A = new Array( ";
+
+var limit = 0x0061;
+for ( var i = 0x007A; i >= limit; i-- ) {
+  S[item] += "\'"+ String.fromCharCode(i) +"\'" ;
+  if ( i > limit ) {
+    S[item] += ",";
+  }
+}
+
+S[item] += ")";
+
+for ( var i = 0; i < S.length; i++ ) {
+  CheckItems( S[i] );
+}
+
+test();
+
+function CheckItems( S ) {
+  eval( S );
+  var E = Sort( A );
+
+  new TestCase(   SECTION,
+		  S +";  A.sort(Compare); A.length",
+		  E.length,
+		  eval( S + "; A.sort(Compare); A.length") );
+
+  for ( var i = 0; i < E.length; i++ ) {
+    new TestCase(
+      SECTION,
+      "A["+i+ "].toString()",
+      E[i] +"",
+      A[i] +"");
+
+    if ( A[i] == void 0 && typeof A[i] == "undefined" ) {
+      new TestCase(
+	SECTION,
+	"typeof A["+i+ "]",
+	typeof E[i],
+	typeof A[i] );
+    }
+  }
+}
+function Object_1( value ) {
+  this.array = value.split(",");
+  this.length = this.array.length;
+  for ( var i = 0; i < this.length; i++ ) {
+    this[i] = eval(this.array[i]);
+  }
+  this.sort = Array.prototype.sort;
+  this.getClass = Object.prototype.toString;
+}
+function Sort( a ) {
+  var r1 = a.length;
+  for ( i = 0; i < a.length; i++ ) {
+    for ( j = i+1; j < a.length; j++ ) {
+      var lo = a[i];
+      var hi = a[j];
+      var c = Compare( lo, hi );
+      if ( c == 1 ) {
+	a[i] = hi;
+	a[j] = lo;
+      }
+    }
+  }
+  return a;
+}
+function Compare( x, y ) {
+  if ( x == void 0 && y == void 0  && typeof x == "undefined" && typeof y == "undefined" ) {
+    return +0;
+  }
+  if ( x == void 0  && typeof x == "undefined" ) {
+    return 1;
+  }
+  if ( y == void 0 && typeof y == "undefined" ) {
+    return -1;
+  }
+  x = String(x);
+  y = String(y);
+  if ( x < y ) {
+    return 1;
+  }
+  if ( x > y ) {
+    return -1;
+  }
+  return 0;
+}
diff --git a/js/src/tests/ecma/Array/15.4.4.5-3.js b/js/src/tests/ecma/Array/15.4.4.5-3.js
new file mode 100644
index 000000000..5b69e33ec
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.4.5-3.js
@@ -0,0 +1,148 @@
+/* -*- tab-width: 2; 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:          15.4.4.5-3.js
+   ECMA Section:       Array.prototype.sort(comparefn)
+   Description:
+
+   This is a regression test for
+   http://scopus/bugsplat/show_bug.cgi?id=117144
+
+   Verify that sort is successfull, even if the sort compare function returns
+   a very large negative or positive value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+
+var SECTION = "15.4.4.5-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array.prototype.sort(comparefn)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var array = new Array();
+
+array[array.length] = new Date( TIME_2000 * Math.PI );
+array[array.length] = new Date( TIME_2000 * 10 );
+array[array.length] = new Date( TIME_1900 + TIME_1900  );
+array[array.length] = new Date(0);
+array[array.length] = new Date( TIME_2000 );
+array[array.length] = new Date( TIME_1900 + TIME_1900 +TIME_1900 );
+array[array.length] = new Date( TIME_1900 * Math.PI );
+array[array.length] = new Date( TIME_1900 * 10 );
+array[array.length] = new Date( TIME_1900 );
+array[array.length] = new Date( TIME_2000 + TIME_2000 );
+array[array.length] = new Date( 1899, 0, 1 );
+array[array.length] = new Date( 2000, 1, 29 );
+array[array.length] = new Date( 2000, 0, 1 );
+array[array.length] = new Date( 1999, 11, 31 );
+
+var testarr1 = new Array();
+clone( array, testarr1 );
+testarr1.sort( comparefn1 );
+
+var testarr2 = new Array();
+clone( array, testarr2 );
+testarr2.sort( comparefn2 );
+
+testarr3 = new Array();
+clone( array, testarr3 );
+testarr3.sort( comparefn3 );
+
+// when there's no sort function, sort sorts by the toString value of Date.
+
+var testarr4 = new Array();
+clone( array, testarr4 );
+testarr4.sort();
+
+var realarr = new Array();
+clone( array, realarr );
+realarr.sort( realsort );
+
+var stringarr = new Array();
+clone( array, stringarr );
+stringarr.sort( stringsort );
+
+for ( var i = 0; i < array.length; i++) {
+  new TestCase(
+    SECTION,
+    "testarr1["+i+"]",
+    realarr[i],
+    testarr1[i] );
+}
+
+for ( var i=0; i < array.length; i++) {
+  new TestCase(
+    SECTION,
+    "testarr2["+i+"]",
+    realarr[i],
+    testarr2[i] );
+}
+
+for ( var i=0; i < array.length; i++) {
+  new TestCase(
+    SECTION,
+    "testarr3["+i+"]",
+    realarr[i],
+    testarr3[i] );
+}
+
+for ( var i=0; i < array.length; i++) {
+  new TestCase(
+    SECTION,
+    "testarr4["+i+"]",
+    stringarr[i].toString(),
+    testarr4[i].toString() );
+}
+
+test();
+
+function comparefn1( x, y ) {
+  return x - y;
+}
+function comparefn2( x, y ) {
+  return x.valueOf() - y.valueOf();
+}
+function realsort( x, y ) {
+  return ( x.valueOf() == y.valueOf() ? 0 : ( x.valueOf() > y.valueOf() ? 1 : -1 ) );
+}
+function comparefn3( x, y ) {
+  return ( x == y ? 0 : ( x > y ? 1: -1 ) );
+}
+function clone( source, target ) {
+  for (i = 0; i < source.length; i++ ) {
+    target[i] = source[i];
+  }
+}
+function stringsort( x, y ) {
+  for ( var i = 0; i < x.toString().length; i++ ) {
+    var d = (x.toString()).charCodeAt(i) - (y.toString()).charCodeAt(i);
+    if ( d > 0 ) {
+      return 1;
+    } else {
+      if ( d < 0 ) {
+	return -1;
+      } else {
+	continue;
+      }
+    }
+
+    var d = x.length - y.length;
+
+    if  ( d > 0 ) {
+      return 1;
+    } else {
+      if ( d < 0 ) {
+	return -1;
+      }
+    }
+  }
+  return 0;
+}
diff --git a/js/src/tests/ecma/Array/15.4.4.js b/js/src/tests/ecma/Array/15.4.4.js
new file mode 100644
index 000000000..b3410d873
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.4.js
@@ -0,0 +1,40 @@
+/* -*- tab-width: 2; 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:          15.4.4.js
+   ECMA Section:       15.4.4 Properties of the Array Prototype Object
+   Description:        The value of the internal [[Prototype]] property of
+   the Array prototype object is the Object prototype
+   object.
+
+   Note that the Array prototype object is itself an
+   array; it has a length property (whose initial value
+   is (0) and the special [[Put]] method.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.4.4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the Array Prototype Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION,	"Array.prototype.length",   0,          Array.prototype.length );
+
+//  verify that prototype object is an Array object.
+new TestCase( SECTION,	"typeof Array.prototype",    "object",   typeof Array.prototype );
+
+new TestCase( SECTION,
+	      "Array.prototype.toString = Object.prototype.toString; Array.prototype.toString()",
+	      "[object Array]",
+	      eval("Array.prototype.toString = Object.prototype.toString; Array.prototype.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.5.1-1.js b/js/src/tests/ecma/Array/15.4.5.1-1.js
new file mode 100644
index 000000000..724710aa3
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.5.1-1.js
@@ -0,0 +1,138 @@
+/* -*- tab-width: 2; 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:          15.4.5.1-1.js
+   ECMA Section:       [[ Put]] (P, V)
+   Description:
+   Array objects use a variation of the [[Put]] method used for other native
+   ECMAScript objects (section 8.6.2.2).
+
+   Assume A is an Array object and P is a string.
+
+   When the [[Put]] method of A is called with property P and value V, the
+   following steps are taken:
+
+   1.  Call the [[CanPut]] method of A with name P.
+   2.  If Result(1) is false, return.
+   3.  If A doesn't have a property with name P, go to step 7.
+   4.  If P is "length", go to step 12.
+   5.  Set the value of property P of A to V.
+   6.  Go to step 8.
+   7.  Create a property with name P, set its value to V and give it empty
+   attributes.
+   8.  If P is not an array index, return.
+   9.  If A itself has a property (not an inherited property) named "length",
+   andToUint32(P) is less than the value of the length property of A, then
+   return.
+   10. Change (or set) the value of the length property of A to ToUint32(P)+1.
+   11. Return.
+   12. Compute ToUint32(V).
+   13. For every integer k that is less than the value of the length property
+   of A but not less than Result(12), if A itself has a property (not an
+   inherited property) named ToString(k), then delete that property.
+   14. Set the value of property P of A to Result(12).
+   15. Return.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.4.5.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array [[Put]] (P, V)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+// P is "length"
+
+new TestCase(   SECTION,
+		"var A = new Array(); A.length = 1000; A.length",
+		1000,
+		eval("var A = new Array(); A.length = 1000; A.length") );
+
+// A has Property P, and P is not length or an array index
+new TestCase(   SECTION,
+		"var A = new Array(1000); A.name = 'name of this array'; A.name",
+		'name of this array',
+		eval("var A = new Array(1000); A.name = 'name of this array'; A.name") );
+
+new TestCase(   SECTION,
+		"var A = new Array(1000); A.name = 'name of this array'; A.length",
+		1000,
+		eval("var A = new Array(1000); A.name = 'name of this array'; A.length") );
+
+
+// A has Property P, P is not length, P is an array index, and ToUint32(p) is less than the
+// value of length
+
+new TestCase(   SECTION,
+		"var A = new Array(1000); A[123] = 'hola'; A[123]",
+		'hola',
+		eval("var A = new Array(1000); A[123] = 'hola'; A[123]") );
+
+new TestCase(   SECTION,
+		"var A = new Array(1000); A[123] = 'hola'; A.length",
+		1000,
+		eval("var A = new Array(1000); A[123] = 'hola'; A.length") );
+
+
+for ( var i = 0X0020, TEST_STRING = "var A = new Array( " ; i < 0x00ff; i++ ) {
+  if (i === "u".charCodeAt(0) || i === "x".charCodeAt(0))
+    continue;
+  TEST_STRING += "\'\\"+ String.fromCharCode( i ) +"\'";
+  if ( i < 0x00FF - 1   ) {
+    TEST_STRING += ",";
+  } else {
+    TEST_STRING += ");"
+      }
+}
+
+var LENGTH = 0x00ff - 0x0020 - 2 /* "u"/"x" exclusions above */;
+
+new TestCase(   SECTION,
+		TEST_STRING +" A[150] = 'hello'; A[150]",
+		'hello',
+		eval( TEST_STRING + " A[150] = 'hello'; A[150]" ) );
+
+new TestCase(   SECTION,
+		TEST_STRING +" A[150] = 'hello'; A[150]",
+		LENGTH,
+		eval( TEST_STRING + " A[150] = 'hello'; A.length" ) );
+
+// A has Property P, P is not length, P is an array index, and ToUint32(p) is not less than the
+// value of length
+
+new TestCase(   SECTION,
+		"var A = new Array(); A[123] = true; A.length",
+		124,
+		eval("var A = new Array(); A[123] = true; A.length") );
+
+new TestCase(   SECTION,
+		"var A = new Array(0,1,2,3,4,5,6,7,8,9,10); A[15] ='15'; A.length",
+		16,
+		eval("var A = new Array(0,1,2,3,4,5,6,7,8,9,10); A[15] ='15'; A.length") );
+
+for ( var i = 0; i < A.length; i++ ) {
+  new TestCase( SECTION,
+		"var A = new Array(0,1,2,3,4,5,6,7,8,9,10); A[15] ='15'; A[" +i +"]",
+		(i <= 10) ? i : ( i == 15 ? '15' : void 0 ),
+		A[i] );
+}
+// P is not an array index, and P is not "length"
+
+new TestCase(   SECTION,
+		"var A = new Array(); A.join.length = 4; A.join.length",
+		1,
+		eval("var A = new Array(); A.join.length = 4; A.join.length") );
+
+new TestCase(   SECTION,
+		"var A = new Array(); A.join.length = 4; A.length",
+		0,
+		eval("var A = new Array(); A.join.length = 4; A.length") );
+
+test();
diff --git a/js/src/tests/ecma/Array/15.4.5.1-2.js b/js/src/tests/ecma/Array/15.4.5.1-2.js
new file mode 100644
index 000000000..6cb93fc3d
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.5.1-2.js
@@ -0,0 +1,118 @@
+/* -*- tab-width: 2; 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:          15.4.5.1-2.js
+   ECMA Section:       [[ Put]] (P, V)
+   Description:
+   Array objects use a variation of the [[Put]] method used for other native
+   ECMAScript objects (section 8.6.2.2).
+
+   Assume A is an Array object and P is a string.
+
+   When the [[Put]] method of A is called with property P and value V, the
+   following steps are taken:
+
+   1.  Call the [[CanPut]] method of A with name P.
+   2.  If Result(1) is false, return.
+   3.  If A doesn't have a property with name P, go to step 7.
+   4.  If P is "length", go to step 12.
+   5.  Set the value of property P of A to V.
+   6.  Go to step 8.
+   7.  Create a property with name P, set its value to V and give it empty
+   attributes.
+   8.  If P is not an array index, return.
+   9.  If A itself has a property (not an inherited property) named "length",
+   andToUint32(P) is less than the value of the length property of A, then
+   return.
+   10. Change (or set) the value of the length property of A to ToUint32(P)+1.
+   11. Return.
+   12. Compute ToUint32(V).
+   13. For every integer k that is less than the value of the length property
+   of A but not less than Result(12), if A itself has a property (not an
+   inherited property) named ToString(k), then delete that property.
+   14. Set the value of property P of A to Result(12).
+   15. Return.
+
+
+   These are gTestcases from Waldemar, detailed in
+   http://scopus.mcom.com/bugsplat/show_bug.cgi?id=123552
+
+   Author:             christine@netscape.com
+   Date:               15 June 1998
+*/
+
+var SECTION = "15.4.5.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array [[Put]] (P,V)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var a = new Array();
+
+AddCase( "3.00", "three" );
+AddCase( "00010", "eight" );
+AddCase( "37xyz", "thirty-five" );
+AddCase("5000000000", 5)
+  AddCase( "-2", -3 );
+
+new TestCase( SECTION,
+	      "a[10]",
+	      void 0,
+	      a[10] );
+
+new TestCase( SECTION,
+	      "a[3]",
+	      void 0,
+	      a[3] );
+
+a[4] = "four";
+
+new TestCase( SECTION,
+	      "a[4] = \"four\"; a[4]",
+	      "four",
+	      a[4] );
+
+new TestCase( SECTION,
+	      "a[\"4\"]",
+	      "four",
+	      a["4"] );
+
+new TestCase( SECTION,
+	      "a[\"4.00\"]",
+	      void 0,
+	      a["4.00"] );
+
+new TestCase( SECTION,
+	      "a.length",
+	      5,
+	      a.length );
+
+
+a["5000000000"] = 5;
+
+new TestCase( SECTION,
+	      "a[\"5000000000\"] = 5; a.length",
+	      5,
+	      a.length );
+
+new TestCase( SECTION,
+	      "a[\"-2\"] = -3; a.length",
+	      5,
+	      a.length );
+
+test();
+
+function AddCase ( arg, value ) {
+
+  a[arg] = value;
+
+  new TestCase( SECTION,
+		"a[\"" + arg + "\"] =  "+ value +"; a.length",
+		0,
+		a.length );
+}
diff --git a/js/src/tests/ecma/Array/15.4.5.2-1.js b/js/src/tests/ecma/Array/15.4.5.2-1.js
new file mode 100644
index 000000000..767c85c6f
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.5.2-1.js
@@ -0,0 +1,52 @@
+/* -*- tab-width: 2; 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:          15.4.5.2-1.js
+   ECMA Section:       Array.length
+   Description:
+   15.4.5.2 length
+   The length property of this Array object is always numerically greater
+   than the name of every property whose name is an array index.
+
+   The length property has the attributes { DontEnum, DontDelete }.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.4.5.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array.length";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"var A = new Array(); A.length",
+		0,
+		eval("var A = new Array(); A.length") );
+new TestCase(   SECTION,
+		"var A = new Array(); A[Math.pow(2,32)-2] = 'hi'; A.length",
+		Math.pow(2,32)-1,
+		eval("var A = new Array(); A[Math.pow(2,32)-2] = 'hi'; A.length") );
+new TestCase(   SECTION,
+		"var A = new Array(); A.length = 123; A.length",
+		123,
+		eval("var A = new Array(); A.length = 123; A.length") );
+new TestCase(   SECTION,
+		"var A = new Array(); A.length = 123; var PROPS = ''; for ( var p in A ) { PROPS += ( p == 'length' ? p : ''); } PROPS",
+		"",
+		eval("var A = new Array(); A.length = 123; var PROPS = ''; for ( var p in A ) { PROPS += ( p == 'length' ? p : ''); } PROPS") );
+new TestCase(   SECTION,
+		"var A = new Array(); A.length = 123; delete A.length",
+		false ,
+		eval("var A = new Array(); A.length = 123; delete A.length") );
+new TestCase(   SECTION,
+		"var A = new Array(); A.length = 123; delete A.length; A.length",
+		123,
+		eval("var A = new Array(); A.length = 123; delete A.length; A.length") );
+test();
+
diff --git a/js/src/tests/ecma/Array/15.4.5.2-2.js b/js/src/tests/ecma/Array/15.4.5.2-2.js
new file mode 100644
index 000000000..7a21410bb
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.5.2-2.js
@@ -0,0 +1,93 @@
+/* -*- tab-width: 2; 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:          15.4.5.2-2.js
+   ECMA Section:       Array.length
+   Description:
+   15.4.5.2 length
+   The length property of this Array object is always numerically greater
+   than the name of every property whose name is an array index.
+
+   The length property has the attributes { DontEnum, DontDelete }.
+
+   This test verifies that the Array.length property is not Read Only.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.4.5.2-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array.length";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addCase( new Array(), 0, Math.pow(2,14), Math.pow(2,14) );
+
+addCase( new Array(), 0, 1, 1 );
+
+addCase( new Array(Math.pow(2,12)), Math.pow(2,12), 0, 0 );
+addCase( new Array(Math.pow(2,13)), Math.pow(2,13), Math.pow(2,12), Math.pow(2,12) );
+addCase( new Array(Math.pow(2,12)), Math.pow(2,12), Math.pow(2,12), Math.pow(2,12) );
+addCase( new Array(Math.pow(2,14)), Math.pow(2,14), Math.pow(2,12), Math.pow(2,12) )
+
+// some tests where array is not empty
+// array is populated with strings
+  for ( var arg = "", i = 0; i < Math.pow(2,12); i++ ) {
+    arg +=  String(i) + ( i != Math.pow(2,12)-1 ? "," : "" );
+
+  }
+//      print(i +":"+arg);
+
+var a = eval( "new Array("+arg+")" );
+
+addCase( a, i, i, i );
+addCase( a, i, Math.pow(2,12)+i+1, Math.pow(2,12)+i+1, true );
+addCase( a, Math.pow(2,12)+5, 0, 0, true );
+
+test();
+
+function addCase( object, old_len, set_len, new_len, checkitems ) {
+  object.length = set_len;
+
+  new TestCase( SECTION,
+		"array = new Array("+ old_len+"); array.length = " + set_len +
+		"; array.length",
+		new_len,
+		object.length );
+
+  if ( checkitems ) {
+    // verify that items between old and newlen are all undefined
+    if ( new_len < old_len ) {
+      var passed = true;
+      for ( var i = new_len; i < old_len; i++ ) {
+	if ( object[i] != void 0 ) {
+	  passed = false;
+	}
+      }
+      new TestCase( SECTION,
+		    "verify that array items have been deleted",
+		    true,
+		    passed );
+    }
+    if ( new_len > old_len ) {
+      var passed = true;
+      for ( var i = old_len; i < new_len; i++ ) {
+	if ( object[i] != void 0 ) {
+	  passed = false;
+	}
+      }
+      new TestCase( SECTION,
+		    "verify that new items are undefined",
+		    true,
+		    passed );
+    }
+  }
+
+}
+
diff --git a/js/src/tests/ecma/Array/array-length-set-during-for-in.js b/js/src/tests/ecma/Array/array-length-set-during-for-in.js
new file mode 100644
index 000000000..83d476f7f
--- /dev/null
+++ b/js/src/tests/ecma/Array/array-length-set-during-for-in.js
@@ -0,0 +1,10 @@
+var a = [0, 1];
+var iterations = 0;
+for (var k in a) {
+  iterations++;
+  a.length = 1;
+}
+assertEq(iterations, 1);
+
+if (typeof reportCompare === "function")
+  reportCompare(true, true);
diff --git a/js/src/tests/ecma/Array/array-length-set-on-nonarray.js b/js/src/tests/ecma/Array/array-length-set-on-nonarray.js
new file mode 100644
index 000000000..bc47c7477
--- /dev/null
+++ b/js/src/tests/ecma/Array/array-length-set-on-nonarray.js
@@ -0,0 +1,26 @@
+// Any copyright is dedicated to the Public Domain.
+// http://creativecommons.org/licenses/publicdomain/
+
+//-----------------------------------------------------------------------------
+var BUGNUMBER = 548671;
+var summary =
+  "Don't use a shared-permanent inherited property to implement " +
+  "[].length or (function(){}).length";
+
+print(BUGNUMBER + ": " + summary);
+
+/**************
+ * BEGIN TEST *
+ **************/
+
+var a = [];
+a.p = 1;
+var x = Object.create(a);
+assertEq(x.length, 0);
+assertEq(x.p, 1);
+assertEq(a.length, 0);
+
+if (typeof reportCompare === "function")
+  reportCompare(true, true);
+
+print("All tests passed!");
diff --git a/js/src/tests/ecma/Array/browser.js b/js/src/tests/ecma/Array/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Array/browser.js
diff --git a/js/src/tests/ecma/Array/shell.js b/js/src/tests/ecma/Array/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Array/shell.js
diff --git a/js/src/tests/ecma/Boolean/15.6.1.js b/js/src/tests/ecma/Boolean/15.6.1.js
new file mode 100644
index 000000000..8725c978b
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.1.js
@@ -0,0 +1,62 @@
+/* -*- 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:      15.6.1.js
+   ECMA Section:   15.6.1 The Boolean Function
+   15.6.1.1 Boolean( value )
+   15.6.1.2 Boolean ()
+   Description:    Boolean( value ) should return a Boolean value
+   not a Boolean object) computed by
+   Boolean.toBooleanValue( value)
+
+   15.6.1.2 Boolean() returns false
+
+   Author:         christine@netscape.com
+   Date:           27 jun 1997
+
+
+   Data File Fields:
+   VALUE       Argument passed to the Boolean function
+   TYPE        typeof VALUE (not used, but helpful in understanding
+   the data file)
+   E_RETURN    Expected return value of Boolean( VALUE )
+*/
+var SECTION = "15.6.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Boolean constructor called as a function: Boolean( value ) and Boolean()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var array = new Array();
+var item = 0;
+
+new TestCase( SECTION,   "Boolean(1)",         true,   Boolean(1) );
+new TestCase( SECTION,   "Boolean(0)",         false,  Boolean(0) );
+new TestCase( SECTION,   "Boolean(-1)",        true,   Boolean(-1) );
+new TestCase( SECTION,   "Boolean('1')",       true,   Boolean("1") );
+new TestCase( SECTION,   "Boolean('0')",       true,   Boolean("0") );
+new TestCase( SECTION,   "Boolean('-1')",      true,   Boolean("-1") );
+new TestCase( SECTION,   "Boolean(true)",      true,   Boolean(true) );
+new TestCase( SECTION,   "Boolean(false)",     false,  Boolean(false) );
+
+new TestCase( SECTION,   "Boolean('true')",    true,   Boolean("true") );
+new TestCase( SECTION,   "Boolean('false')",   true,   Boolean("false") );
+new TestCase( SECTION,   "Boolean(null)",      false,  Boolean(null) );
+
+new TestCase( SECTION,   "Boolean(-Infinity)", true,   Boolean(Number.NEGATIVE_INFINITY) );
+new TestCase( SECTION,   "Boolean(NaN)",       false,  Boolean(Number.NaN) );
+new TestCase( SECTION,   "Boolean(void(0))",   false,  Boolean( void(0) ) );
+new TestCase( SECTION,   "Boolean(x=0)",       false,  Boolean( x=0 ) );
+new TestCase( SECTION,   "Boolean(x=1)",       true,   Boolean( x=1 ) );
+new TestCase( SECTION,   "Boolean(x=false)",   false,  Boolean( x=false ) );
+new TestCase( SECTION,   "Boolean(x=true)",    true,   Boolean( x=true ) );
+new TestCase( SECTION,   "Boolean(x=null)",    false,  Boolean( x=null ) );
+new TestCase( SECTION,   "Boolean()",          false,  Boolean() );
+//    array[item++] = new TestCase( SECTION,   "Boolean(var someVar)",     false,  Boolean( someVar ) );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.2.js b/js/src/tests/ecma/Boolean/15.6.2.js
new file mode 100644
index 000000000..781e39618
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.2.js
@@ -0,0 +1,127 @@
+/* -*- tab-width: 2; 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:          15.6.2.js
+   ECMA Section:       15.6.2 The Boolean Constructor
+   15.6.2.1 new Boolean( value )
+   15.6.2.2 new Boolean()
+
+   This test verifies that the Boolean constructor
+   initializes a new object (typeof should return
+   "object").  The prototype of the new object should
+   be Boolean.prototype.  The value of the object
+   should be ToBoolean( value ) (a boolean value).
+
+   Description:
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+
+*/
+var SECTION = "15.6.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "15.6.2 The Boolean Constructor; 15.6.2.1 new Boolean( value ); 15.6.2.2 new Boolean()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var array = new Array();
+var item = 0;
+
+new TestCase( SECTION,   "typeof (new Boolean(1))",         "object",            typeof (new Boolean(1)) );
+new TestCase( SECTION,   "(new Boolean(1)).constructor",    Boolean.prototype.constructor,   (new Boolean(1)).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean(1);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean(1);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean(1)).valueOf()",   true,       (new Boolean(1)).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean(1)",         "object",   typeof new Boolean(1) );
+new TestCase( SECTION,   "(new Boolean(0)).constructor",    Boolean.prototype.constructor,   (new Boolean(0)).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean(0);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean(0);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean(0)).valueOf()",   false,       (new Boolean(0)).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean(0)",         "object",   typeof new Boolean(0) );
+new TestCase( SECTION,   "(new Boolean(-1)).constructor",    Boolean.prototype.constructor,   (new Boolean(-1)).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean(-1);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean(-1);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean(-1)).valueOf()",   true,       (new Boolean(-1)).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean(-1)",         "object",   typeof new Boolean(-1) );
+new TestCase( SECTION,   "(new Boolean('1')).constructor",    Boolean.prototype.constructor,   (new Boolean('1')).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean('1');TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean('1');TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean('1')).valueOf()",   true,       (new Boolean('1')).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean('1')",         "object",   typeof new Boolean('1') );
+new TestCase( SECTION,   "(new Boolean('0')).constructor",    Boolean.prototype.constructor,   (new Boolean('0')).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean('0');TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean('0');TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean('0')).valueOf()",   true,       (new Boolean('0')).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean('0')",         "object",   typeof new Boolean('0') );
+new TestCase( SECTION,   "(new Boolean('-1')).constructor",    Boolean.prototype.constructor,   (new Boolean('-1')).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean('-1');TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean('-1');TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean('-1')).valueOf()",   true,       (new Boolean('-1')).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean('-1')",         "object",   typeof new Boolean('-1') );
+new TestCase( SECTION,   "(new Boolean(new Boolean(true))).constructor",    Boolean.prototype.constructor,   (new Boolean(new Boolean(true))).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean(new Boolean(true));TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean(new Boolean(true));TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean(new Boolean(true))).valueOf()",   true,       (new Boolean(new Boolean(true))).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean(new Boolean(true))",         "object",   typeof new Boolean(new Boolean(true)) );
+new TestCase( SECTION,   "(new Boolean(Number.NaN)).constructor",    Boolean.prototype.constructor,   (new Boolean(Number.NaN)).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean(Number.NaN);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean(Number.NaN);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean(Number.NaN)).valueOf()",   false,       (new Boolean(Number.NaN)).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean(Number.NaN)",         "object",   typeof new Boolean(Number.NaN) );
+new TestCase( SECTION,   "(new Boolean(null)).constructor",    Boolean.prototype.constructor,   (new Boolean(null)).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean(null);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean(null);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean(null)).valueOf()",   false,       (new Boolean(null)).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean(null)",         "object",   typeof new Boolean(null) );
+new TestCase( SECTION,   "(new Boolean(void 0)).constructor",    Boolean.prototype.constructor,   (new Boolean(void 0)).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean(void 0);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean(void 0);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean(void 0)).valueOf()",   false,       (new Boolean(void 0)).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean(void 0)",         "object",   typeof new Boolean(void 0) );
+new TestCase( SECTION,   "(new Boolean(Number.POSITIVE_INFINITY)).constructor",    Boolean.prototype.constructor,   (new Boolean(Number.POSITIVE_INFINITY)).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean(Number.POSITIVE_INFINITY);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean(Number.POSITIVE_INFINITY);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean(Number.POSITIVE_INFINITY)).valueOf()",   true,       (new Boolean(Number.POSITIVE_INFINITY)).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean(Number.POSITIVE_INFINITY)",         "object",   typeof new Boolean(Number.POSITIVE_INFINITY) );
+new TestCase( SECTION,   "(new Boolean(Number.NEGATIVE_INFINITY)).constructor",    Boolean.prototype.constructor,   (new Boolean(Number.NEGATIVE_INFINITY)).constructor );
+new TestCase( SECTION,
+	      "TESTBOOL=new Boolean(Number.NEGATIVE_INFINITY);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean(Number.NEGATIVE_INFINITY);TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( SECTION,   "(new Boolean(Number.NEGATIVE_INFINITY)).valueOf()",   true,       (new Boolean(Number.NEGATIVE_INFINITY)).valueOf() );
+new TestCase( SECTION,   "typeof new Boolean(Number.NEGATIVE_INFINITY)",         "object",   typeof new Boolean(Number.NEGATIVE_INFINITY) );
+new TestCase( SECTION,   "(new Boolean(Number.NEGATIVE_INFINITY)).constructor",    Boolean.prototype.constructor,   (new Boolean(Number.NEGATIVE_INFINITY)).constructor );
+new TestCase( "15.6.2.2",
+	      "TESTBOOL=new Boolean();TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()",
+	      "[object Boolean]",
+	      eval("TESTBOOL=new Boolean();TESTBOOL.toString=Object.prototype.toString;TESTBOOL.toString()") );
+new TestCase( "15.6.2.2",   "(new Boolean()).valueOf()",   false,       (new Boolean()).valueOf() );
+new TestCase( "15.6.2.2",   "typeof new Boolean()",        "object",    typeof new Boolean() );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.3.1-1.js b/js/src/tests/ecma/Boolean/15.6.3.1-1.js
new file mode 100644
index 000000000..5ab8d98c3
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.3.1-1.js
@@ -0,0 +1,38 @@
+/* -*- tab-width: 2; 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:          15.6.3.1-1.js
+   ECMA Section:       15.6.3 Boolean.prototype
+
+   Description:        The initial value of Boolean.prototype is the built-in
+   Boolean prototype object (15.6.4).
+
+   The property shall have the attributes [DontEnum,
+   DontDelete, ReadOnly ].
+
+   This tests the DontEnum property of Boolean.prototype
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+
+*/
+var SECTION = "15.6.3.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var array = new Array();
+var item = 0;
+
+new TestCase( SECTION,
+	      "var str='';for ( p in Boolean ) { str += p } str;",
+	      "",
+	      eval("var str='';for ( p in Boolean ) { str += p } str;") );
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.3.1-2.js b/js/src/tests/ecma/Boolean/15.6.3.1-2.js
new file mode 100644
index 000000000..ae9a52da5
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.3.1-2.js
@@ -0,0 +1,37 @@
+/* -*- tab-width: 2; 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:          15.6.3.1-2.js
+   ECMA Section:       15.6.3.1 Boolean.prototype
+
+   Description:        The initial valu eof Boolean.prototype is the built-in
+   Boolean prototype object (15.6.4).
+
+   The property shall have the attributes [DontEnum,
+   DontDelete, ReadOnly ].
+
+   This tests the DontDelete property of Boolean.prototype
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+
+*/
+var SECTION = "15.6.3.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype"
+  writeHeaderToLog( SECTION + TITLE );
+
+var array = new Array();
+var item = 0;
+
+new TestCase( SECTION,
+	      "delete( Boolean.prototype)",
+	      false,
+	      delete( Boolean.prototype) );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.3.1-3.js b/js/src/tests/ecma/Boolean/15.6.3.1-3.js
new file mode 100644
index 000000000..f682294f6
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.3.1-3.js
@@ -0,0 +1,37 @@
+/* -*- tab-width: 2; 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:          15.6.3.1-3.js
+   ECMA Section:       15.6.3.1 Boolean.prototype
+
+   Description:        The initial valu eof Boolean.prototype is the built-in
+   Boolean prototype object (15.6.4).
+
+   The property shall have the attributes [DontEnum,
+   DontDelete, ReadOnly ].
+
+   This tests the DontDelete property of Boolean.prototype
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+
+*/
+var SECTION = "15.6.3.1-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype"
+  writeHeaderToLog( SECTION + TITLE );
+
+var array = new Array();
+var item = 0;
+
+new TestCase( SECTION,
+	      "delete( Boolean.prototype); Boolean.prototype",
+	      Boolean.prototype,
+	      eval("delete( Boolean.prototype); Boolean.prototype") );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.3.1-4.js b/js/src/tests/ecma/Boolean/15.6.3.1-4.js
new file mode 100644
index 000000000..baca269f8
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.3.1-4.js
@@ -0,0 +1,41 @@
+/* -*- tab-width: 2; 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:          15.6.3.1-4.js
+   ECMA Section:       15.6.3.1 Properties of the Boolean Prototype Object
+
+   Description:        The initial value of Boolean.prototype is the built-in
+   Boolean prototype object (15.6.4).
+
+   The property shall have the attributes [DontEnum,
+   DontDelete, ReadOnly ].
+
+   This tests the ReadOnly property of Boolean.prototype
+
+   Author:             christine@netscape.com
+   Date:               30 september 1997
+
+*/
+var SECTION = "15.6.3.1-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype"
+  writeHeaderToLog( SECTION + TITLE );
+
+var BOOL_PROTO = Boolean.prototype;
+
+new TestCase( SECTION,
+	      "var BOOL_PROTO = Boolean.prototype; Boolean.prototype=null; Boolean.prototype == BOOL_PROTO",
+	      true,
+	      eval("var BOOL_PROTO = Boolean.prototype; Boolean.prototype=null; Boolean.prototype == BOOL_PROTO") );
+
+new TestCase( SECTION,
+	      "var BOOL_PROTO = Boolean.prototype; Boolean.prototype=null; Boolean.prototype == null",
+	      false,
+	      eval("var BOOL_PROTO = Boolean.prototype; Boolean.prototype=null; Boolean.prototype == null") );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.3.1.js b/js/src/tests/ecma/Boolean/15.6.3.1.js
new file mode 100644
index 000000000..b47524356
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.3.1.js
@@ -0,0 +1,35 @@
+/* -*- 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:          15.6.3.1.js
+   ECMA Section:       15.6.3.1 Boolean.prototype
+
+   Description:        The initial valu eof Boolean.prototype is the built-in
+   Boolean prototype object (15.6.4).
+
+   The property shall have the attributes [DontEnum,
+   DontDelete, ReadOnly ].
+
+   It has the internal [[Call]] and [[Construct]]
+   properties (not tested), and the length property.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+
+*/
+
+var SECTION = "15.6.3.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,  "Boolean.prototype.valueOf()",       false,   Boolean.prototype.valueOf() );
+new TestCase( SECTION,  "Boolean.length",          1,       Boolean.length );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4-1.js b/js/src/tests/ecma/Boolean/15.6.4-1.js
new file mode 100644
index 000000000..e1e53b5c2
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4-1.js
@@ -0,0 +1,38 @@
+/* -*- tab-width: 2; 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:          15.6.4-1.js
+   ECMA Section:       15.6.4 Properties of the Boolean Prototype Object
+
+   Description:
+   The Boolean prototype object is itself a Boolean object (its [[Class]] is
+   "Boolean") whose value is false.
+
+   The value of the internal [[Prototype]] property of the Boolean prototype object
+   is the Object prototype object (15.2.3.1).
+
+   Author:             christine@netscape.com
+   Date:               30 september 1997
+
+*/
+
+
+var VERSION = "ECMA_1"
+  startTest();
+var SECTION = "15.6.4-1";
+
+writeHeaderToLog( SECTION + " Properties of the Boolean Prototype Object");
+
+new TestCase( SECTION, "typeof Boolean.prototype == typeof( new Boolean )", true,          typeof Boolean.prototype == typeof( new Boolean ) );
+new TestCase( SECTION, "typeof( Boolean.prototype )",              "object",               typeof(Boolean.prototype) );
+new TestCase( SECTION,
+	      "Boolean.prototype.toString = Object.prototype.toString; Boolean.prototype.toString()",
+	      "[object Boolean]",
+	      eval("Boolean.prototype.toString = Object.prototype.toString; Boolean.prototype.toString()") );
+new TestCase( SECTION, "Boolean.prototype.valueOf()",               false,                  Boolean.prototype.valueOf() );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4.1.js b/js/src/tests/ecma/Boolean/15.6.4.1.js
new file mode 100644
index 000000000..d2cf73c9c
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.1.js
@@ -0,0 +1,28 @@
+/* -*- tab-width: 2; 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:          15.6.4.1.js
+   ECMA Section:       15.6.4.1 Boolean.prototype.constructor
+
+   Description:        The initial value of Boolean.prototype.constructor
+   is the built-in Boolean constructor.
+
+   Author:             christine@netscape.com
+   Date:               30 september 1997
+
+*/
+var SECTION = "15.6.4.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype.constructor"
+  writeHeaderToLog( SECTION + TITLE );
+
+new TestCase( SECTION,
+	      "( Boolean.prototype.constructor == Boolean )",
+	      true ,
+	      (Boolean.prototype.constructor == Boolean) );
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4.2-1.js b/js/src/tests/ecma/Boolean/15.6.4.2-1.js
new file mode 100644
index 000000000..f2f3e1a45
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.2-1.js
@@ -0,0 +1,63 @@
+/* -*- 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:          15.6.4.2.js
+   ECMA Section:       15.6.4.2-1 Boolean.prototype.toString()
+   Description:        If this boolean value is true, then the string "true"
+   is returned; otherwise this boolean value must be false,
+   and the string "false" is returned.
+
+   The toString function is not generic; it generates
+   a runtime error if its this value is not a Boolean
+   object.  Therefore it cannot be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+*/
+
+var SECTION = "15.6.4.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype.toString()"
+  writeHeaderToLog( SECTION + TITLE );
+
+
+new TestCase( SECTION,   "new Boolean(1)",       "true",   (new Boolean(1)).toString() );
+new TestCase( SECTION,   "new Boolean(0)",       "false",  (new Boolean(0)).toString() );
+new TestCase( SECTION,   "new Boolean(-1)",      "true",   (new Boolean(-1)).toString() );
+new TestCase( SECTION,   "new Boolean('1')",     "true",   (new Boolean("1")).toString() );
+new TestCase( SECTION,   "new Boolean('0')",     "true",   (new Boolean("0")).toString() );
+new TestCase( SECTION,   "new Boolean(true)",    "true",   (new Boolean(true)).toString() );
+new TestCase( SECTION,   "new Boolean(false)",   "false",  (new Boolean(false)).toString() );
+new TestCase( SECTION,   "new Boolean('true')",  "true",   (new Boolean('true')).toString() );
+new TestCase( SECTION,   "new Boolean('false')", "true",   (new Boolean('false')).toString() );
+
+new TestCase( SECTION,   "new Boolean('')",      "false",  (new Boolean('')).toString() );
+new TestCase( SECTION,   "new Boolean(null)",    "false",  (new Boolean(null)).toString() );
+new TestCase( SECTION,   "new Boolean(void(0))", "false",  (new Boolean(void(0))).toString() );
+new TestCase( SECTION,   "new Boolean(-Infinity)", "true", (new Boolean(Number.NEGATIVE_INFINITY)).toString() );
+new TestCase( SECTION,   "new Boolean(NaN)",     "false",  (new Boolean(Number.NaN)).toString() );
+new TestCase( SECTION,   "new Boolean()",        "false",  (new Boolean()).toString() );
+new TestCase( SECTION,   "new Boolean(x=1)",     "true",   (new Boolean(x=1)).toString() );
+new TestCase( SECTION,   "new Boolean(x=0)",     "false",  (new Boolean(x=0)).toString() );
+new TestCase( SECTION,   "new Boolean(x=false)", "false",  (new Boolean(x=false)).toString() );
+new TestCase( SECTION,   "new Boolean(x=true)",  "true",   (new Boolean(x=true)).toString() );
+new TestCase( SECTION,   "new Boolean(x=null)",  "false",  (new Boolean(x=null)).toString() );
+new TestCase( SECTION,   "new Boolean(x='')",    "false",  (new Boolean(x="")).toString() );
+new TestCase( SECTION,   "new Boolean(x=' ')",   "true",   (new Boolean(x=" ")).toString() );
+
+new TestCase( SECTION,   "new Boolean(new MyObject(true))",     "true",   (new Boolean(new MyObject(true))).toString() );
+new TestCase( SECTION,   "new Boolean(new MyObject(false))",    "true",   (new Boolean(new MyObject(false))).toString() );
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+  return this;
+}
diff --git a/js/src/tests/ecma/Boolean/15.6.4.2-2.js b/js/src/tests/ecma/Boolean/15.6.4.2-2.js
new file mode 100644
index 000000000..93c6ba4ba
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.2-2.js
@@ -0,0 +1,39 @@
+/* -*- tab-width: 2; 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:          15.6.4.2-2.js
+   ECMA Section:       15.6.4.2 Boolean.prototype.toString()
+   Description:        Returns this boolean value.
+
+   The toString function is not generic; it generates
+   a runtime error if its this value is not a Boolean
+   object.  Therefore it cannot be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+*/
+
+var SECTION = "15.6.4.2-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype.toString()"
+  writeHeaderToLog( SECTION + TITLE );
+
+new TestCase(   SECTION,
+		"tostr=Boolean.prototype.toString; x=new Boolean(); x.toString=tostr;x.toString()",
+		"false",
+		eval("tostr=Boolean.prototype.toString; x=new Boolean(); x.toString=tostr;x.toString()") );
+new TestCase(   SECTION,
+		"tostr=Boolean.prototype.toString; x=new Boolean(true); x.toString=tostr; x.toString()",
+		"true",
+		eval("tostr=Boolean.prototype.toString; x=new Boolean(true); x.toString=tostr; x.toString()") );
+new TestCase( SECTION,
+	      "tostr=Boolean.prototype.toString; x=new Boolean(false); x.toString=tostr;x.toString()",
+	      "false",
+	      eval("tostr=Boolean.prototype.toString; x=new Boolean(); x.toString=tostr;x.toString()") );
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4.2-3.js b/js/src/tests/ecma/Boolean/15.6.4.2-3.js
new file mode 100644
index 000000000..1dbb63af0
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.2-3.js
@@ -0,0 +1,31 @@
+/* -*- 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:          15.6.4.2-3.js
+   ECMA Section:       15.6.4.2 Boolean.prototype.toString()
+   Description:        Returns this boolean value.
+
+   The toString function is not generic; it generates
+   a runtime error if its this value is not a Boolean
+   object.  Therefore it cannot be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+*/
+
+
+var SECTION = "15.6.4.2-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype.toString()"
+  writeHeaderToLog( SECTION + TITLE );
+
+new TestCase( SECTION, "tostr=Boolean.prototype.toString; x=true; x.toString=tostr;x.toString()", "true", eval("tostr=Boolean.prototype.toString; x=true; x.toString=tostr;x.toString()") );
+new TestCase( SECTION, "tostr=Boolean.prototype.toString; x=false; x.toString=tostr;x.toString()", "false", eval("tostr=Boolean.prototype.toString; x=false; x.toString=tostr;x.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4.2-4-n.js b/js/src/tests/ecma/Boolean/15.6.4.2-4-n.js
new file mode 100644
index 000000000..3539a80c5
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.2-4-n.js
@@ -0,0 +1,35 @@
+/* -*- tab-width: 2; 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:          15.6.4.2-4.js
+   ECMA Section:       15.6.4.2 Boolean.prototype.toString()
+   Description:        Returns this boolean value.
+
+   The toString function is not generic; it generates
+   a runtime error if its this value is not a Boolean
+   object.  Therefore it cannot be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+*/
+
+var SECTION = "15.6.4.2-4-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype.toString()";
+writeHeaderToLog( SECTION +" "+ TITLE );
+
+DESCRIPTION = "tostr=Boolean.prototype.toString; x=new String( 'hello' ); x.toString=tostr; x.toString()";
+EXPECTED = "error";
+
+new TestCase(   SECTION,
+		"tostr=Boolean.prototype.toString; x=new String( 'hello' ); x.toString=tostr; x.toString()",
+		"error",
+		eval("tostr=Boolean.prototype.toString; x=new String( 'hello' ); x.toString=tostr; x.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4.3-1.js b/js/src/tests/ecma/Boolean/15.6.4.3-1.js
new file mode 100644
index 000000000..8f139f940
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.3-1.js
@@ -0,0 +1,54 @@
+/* -*- 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:          15.6.4.3.js
+   ECMA Section:       15.6.4.3 Boolean.prototype.valueOf()
+   Description:        Returns this boolean value.
+
+   The valueOf function is not generic; it generates
+   a runtime error if its this value is not a Boolean
+   object.  Therefore it cannot be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+*/
+
+var SECTION = "15.6.4.3-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype.valueOf()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,   "new Boolean(1)",       true,   (new Boolean(1)).valueOf() );
+
+new TestCase( SECTION,   "new Boolean(0)",       false,  (new Boolean(0)).valueOf() );
+new TestCase( SECTION,   "new Boolean(-1)",      true,   (new Boolean(-1)).valueOf() );
+new TestCase( SECTION,   "new Boolean('1')",     true,   (new Boolean("1")).valueOf() );
+new TestCase( SECTION,   "new Boolean('0')",     true,   (new Boolean("0")).valueOf() );
+new TestCase( SECTION,   "new Boolean(true)",    true,   (new Boolean(true)).valueOf() );
+new TestCase( SECTION,   "new Boolean(false)",   false,  (new Boolean(false)).valueOf() );
+new TestCase( SECTION,   "new Boolean('true')",  true,   (new Boolean("true")).valueOf() );
+new TestCase( SECTION,   "new Boolean('false')", true,   (new Boolean('false')).valueOf() );
+
+new TestCase( SECTION,   "new Boolean('')",      false,  (new Boolean('')).valueOf() );
+new TestCase( SECTION,   "new Boolean(null)",    false,  (new Boolean(null)).valueOf() );
+new TestCase( SECTION,   "new Boolean(void(0))", false,  (new Boolean(void(0))).valueOf() );
+new TestCase( SECTION,   "new Boolean(-Infinity)", true, (new Boolean(Number.NEGATIVE_INFINITY)).valueOf() );
+new TestCase( SECTION,   "new Boolean(NaN)",     false,  (new Boolean(Number.NaN)).valueOf() );
+new TestCase( SECTION,   "new Boolean()",        false,  (new Boolean()).valueOf() );
+
+new TestCase( SECTION,   "new Boolean(x=1)",     true,   (new Boolean(x=1)).valueOf() );
+new TestCase( SECTION,   "new Boolean(x=0)",     false,  (new Boolean(x=0)).valueOf() );
+new TestCase( SECTION,   "new Boolean(x=false)", false,  (new Boolean(x=false)).valueOf() );
+new TestCase( SECTION,   "new Boolean(x=true)",  true,   (new Boolean(x=true)).valueOf() );
+new TestCase( SECTION,   "new Boolean(x=null)",  false,  (new Boolean(x=null)).valueOf() );
+new TestCase( SECTION,   "new Boolean(x='')",    false,  (new Boolean(x="")).valueOf() );
+new TestCase( SECTION,   "new Boolean(x=' ')",   true,   (new Boolean(x=" ")).valueOf() );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4.3-2.js b/js/src/tests/ecma/Boolean/15.6.4.3-2.js
new file mode 100644
index 000000000..527524117
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.3-2.js
@@ -0,0 +1,33 @@
+/* -*- 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:          15.6.4.3-2.js
+   ECMA Section:       15.6.4.3 Boolean.prototype.valueOf()
+   Description:        Returns this boolean value.
+
+   The valueOf function is not generic; it generates
+   a runtime error if its this value is not a Boolean
+   object.  Therefore it cannot be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+*/
+
+var SECTION = "15.6.4.3-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype.valueOf()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION, "valof=Boolean.prototype.valueOf; x=new Boolean(); x.valueOf=valof;x.valueOf()", false, eval("valof=Boolean.prototype.valueOf; x=new Boolean(); x.valueOf=valof;x.valueOf()") );
+   
+new TestCase( SECTION, "valof=Boolean.prototype.valueOf; x=new Boolean(true); x.valueOf=valof;x.valueOf()", true, eval("valof=Boolean.prototype.valueOf; x=new Boolean(true); x.valueOf=valof;x.valueOf()") );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4.3-3.js b/js/src/tests/ecma/Boolean/15.6.4.3-3.js
new file mode 100644
index 000000000..06d7ecb84
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.3-3.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.6.4.3-3.js
+   ECMA Section:       15.6.4.3 Boolean.prototype.valueOf()
+   Description:        Returns this boolean value.
+
+   The valueOf function is not generic; it generates
+   a runtime error if its this value is not a Boolean
+   object.  Therefore it cannot be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+*/
+
+var SECTION = "15.6.4.3-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype.valueOf()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "x=true; x.valueOf=Boolean.prototype.valueOf;x.valueOf()",
+	      true,
+	      eval("x=true; x.valueOf=Boolean.prototype.valueOf;x.valueOf()") );
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4.3-4-n.js b/js/src/tests/ecma/Boolean/15.6.4.3-4-n.js
new file mode 100644
index 000000000..cdba1210c
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.3-4-n.js
@@ -0,0 +1,35 @@
+/* -*- tab-width: 2; 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:          15.6.4.3-4.js
+   ECMA Section:       15.6.4.3 Boolean.prototype.valueOf()
+   Description:        Returns this boolean value.
+
+   The valueOf function is not generic; it generates
+   a runtime error if its this value is not a Boolean
+   object.  Therefore it cannot be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+*/
+var SECTION = "15.6.4.3-4-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean.prototype.valueOf()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "valof=Boolean.prototype.valueOf; x=new String( 'hello' ); x.valueOf=valof;x.valueOf()"
+  EXPECTED = "error";
+
+new TestCase(   SECTION,
+		"valof=Boolean.prototype.valueOf; x=new String( 'hello' ); x.valueOf=valof;x.valueOf()",
+		"error",
+		eval("valof=Boolean.prototype.valueOf; x=new String( 'hello' ); x.valueOf=valof;x.valueOf()") );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4.3.js b/js/src/tests/ecma/Boolean/15.6.4.3.js
new file mode 100644
index 000000000..ca622ebb3
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.3.js
@@ -0,0 +1,49 @@
+/* -*- 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:          15.6.4.3.js
+   ECMA Section:       15.6.4.3 Boolean.prototype.valueOf()
+   Description:        Returns this boolean value.
+
+   The valueOf function is not generic; it generates
+   a runtime error if its this value is not a Boolean
+   object.  Therefore it cannot be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+*/
+
+
+
+new TestCase( "15.8.6.4",   "new Boolean(1)",       true,   (new Boolean(1)).valueOf() );
+
+new TestCase( "15.8.6.4",   "new Boolean(0)",       false,  (new Boolean(0)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(-1)",      true,   (new Boolean(-1)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean('1')",     true,   (new Boolean("1")).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean('0')",     true,   (new Boolean("0")).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(true)",    true,   (new Boolean(true)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(false)",   false,  (new Boolean(false)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean('true')",  true,   (new Boolean("true")).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean('false')", true,   (new Boolean('false')).valueOf() );
+
+new TestCase( "15.8.6.4",   "new Boolean('')",      false,  (new Boolean('')).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(null)",    false,  (new Boolean(null)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(void(0))", false,  (new Boolean(void(0))).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(-Infinity)", true, (new Boolean(Number.NEGATIVE_INFINITY)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(NaN)",     false,  (new Boolean(Number.NaN)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean()",        false,  (new Boolean()).valueOf() );
+
+new TestCase( "15.8.6.4",   "new Boolean(x=1)",     true,   (new Boolean(x=1)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(x=0)",     false,  (new Boolean(x=0)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(x=false)", false,  (new Boolean(x=false)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(x=true)",  true,   (new Boolean(x=true)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(x=null)",  false,  (new Boolean(x=null)).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(x='')",    false,  (new Boolean(x="")).valueOf() );
+new TestCase( "15.8.6.4",   "new Boolean(x=' ')",   true,   (new Boolean(x=" ")).valueOf() );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/15.6.4.js b/js/src/tests/ecma/Boolean/15.6.4.js
new file mode 100644
index 000000000..df98a67ee
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/15.6.4.js
@@ -0,0 +1,46 @@
+/* -*- tab-width: 2; 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:          15.6.4.js
+   ECMA Section:       Properties of the Boolean Prototype Object
+   Description:
+   The Boolean prototype object is itself a Boolean object (its [[Class]] is "
+   Boolean") whose value is false.
+
+   The value of the internal [[Prototype]] property of the Boolean prototype
+   object is the Object prototype object (15.2.3.1).
+
+   In following descriptions of functions that are properties of the Boolean
+   prototype object, the phrase "this Boolean object" refers to the object that
+   is the this value for the invocation of the function; it is an error if
+   this does not refer to an object for which the value of the internal
+   [[Class]] property is "Boolean". Also, the phrase "this boolean value"
+   refers to the boolean value represented by this Boolean object, that is,
+   the value of the internal [[Value]] property of this Boolean object.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.6.4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the Boolean Prototype Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Boolean.prototype == false",
+	      true,
+	      Boolean.prototype == false );
+
+new TestCase( SECTION,
+	      "Boolean.prototype.toString = Object.prototype.toString; Boolean.prototype.toString()",
+	      "[object Boolean]",
+	      eval("Boolean.prototype.toString = Object.prototype.toString; Boolean.prototype.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/Boolean/browser.js b/js/src/tests/ecma/Boolean/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/browser.js
diff --git a/js/src/tests/ecma/Boolean/shell.js b/js/src/tests/ecma/Boolean/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Boolean/shell.js
diff --git a/js/src/tests/ecma/Date/15.9.1.1-1.js b/js/src/tests/ecma/Date/15.9.1.1-1.js
new file mode 100644
index 000000000..08032ae4a
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.1.1-1.js
@@ -0,0 +1,61 @@
+/* -*- tab-width: 2; 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:          15.9.1.1-1.js
+   ECMA Section:       15.9.1.1 Time Range
+   Description:
+   - leap seconds are ignored
+   - assume 86400000 ms / day
+   - numbers range fom +/- 9,007,199,254,740,991
+   - ms precision for any instant that is within
+   approximately +/-285,616 years from 1 jan 1970
+   UTC
+   - range of times supported is -100,000,000 days
+   to 100,000,000 days from 1 jan 1970 12:00 am
+   - time supported is 8.64e5*10e8 milliseconds from
+   1 jan 1970 UTC  (+/-273972.6027397 years)
+
+   -   this test generates its own data -- it does not
+   read data from a file.
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+   Static variables:
+   FOUR_HUNDRED_YEARS
+
+*/
+
+//  every one hundred years contains:
+//    24 years with 366 days
+//
+//  every four hundred years contains:
+//    97 years with 366 days
+//   303 years with 365 days
+//
+//   86400000*365*97    =    3067372800000
+//  +86400000*366*303   =  + 9555408000000
+//                      =    1.26227808e+13
+var FOUR_HUNDRED_YEARS = 1.26227808e+13;
+var SECTION         =  "15.9.1.1-1";
+
+writeHeaderToLog("15.9.1.1 Time Range");
+
+var M_SECS;
+var CURRENT_YEAR;
+
+for ( M_SECS = 0, CURRENT_YEAR = 1970;
+      M_SECS < 8640000000000000;
+      M_SECS += FOUR_HUNDRED_YEARS, CURRENT_YEAR += 400 ) {
+
+  new TestCase( SECTION,  
+		"new Date("+M_SECS+")",
+		CURRENT_YEAR,
+		(new Date( M_SECS)).getUTCFullYear() );
+}
+
+test();
+
diff --git a/js/src/tests/ecma/Date/15.9.1.1-2.js b/js/src/tests/ecma/Date/15.9.1.1-2.js
new file mode 100644
index 000000000..3013265b5
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.1.1-2.js
@@ -0,0 +1,56 @@
+/* -*- tab-width: 2; 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:          15.9.1.1-2.js
+   ECMA Section:       15.9.1.1 Time Range
+   Description:
+   - leap seconds are ignored
+   - assume 86400000 ms / day
+   - numbers range fom +/- 9,007,199,254,740,991
+   - ms precision for any instant that is within
+   approximately +/-285,616 years from 1 jan 1970
+   UTC
+   - range of times supported is -100,000,000 days
+   to 100,000,000 days from 1 jan 1970 12:00 am
+   - time supported is 8.64e5*10e8 milliseconds from
+   1 jan 1970 UTC  (+/-273972.6027397 years)
+   Author:             christine@netscape.com
+   Date:               9 july 1997
+*/
+
+//  every one hundred years contains:
+//    24 years with 366 days
+//
+//  every four hundred years contains:
+//    97 years with 366 days
+//   303 years with 365 days
+//
+//   86400000*366*97  =    3067372800000
+//  +86400000*365*303 =  + 9555408000000
+//                    =    1.26227808e+13
+
+var FOUR_HUNDRED_YEARS = 1.26227808e+13;
+var SECTION         =  "15.9.1.1-2";
+
+writeHeaderToLog("15.9.1.1 Time Range");
+
+var M_SECS;
+var CURRENT_YEAR;
+
+for ( M_SECS = 0, CURRENT_YEAR = 1970;
+      M_SECS > -8640000000000000;
+      M_SECS -= FOUR_HUNDRED_YEARS, CURRENT_YEAR -= 400 ) {
+
+  new TestCase( SECTION,
+		"new Date("+M_SECS+")",
+		CURRENT_YEAR,
+		(new Date( M_SECS )).getUTCFullYear() );
+
+}
+
+test();
+
diff --git a/js/src/tests/ecma/Date/15.9.1.13-1.js b/js/src/tests/ecma/Date/15.9.1.13-1.js
new file mode 100644
index 000000000..ff52d93d5
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.1.13-1.js
@@ -0,0 +1,44 @@
+/* -*- 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:          15.9.1.13-1.js
+   ECMA Section:       15.9.1.1 MakeDate(day, time)
+   Description:
+
+   The operator MakeDate calculates a number of milliseconds from its
+   two arguments, which must be ECMAScript number values. This
+   operator functions as follows:
+
+   1. If day is not finite or time is not finite, return NaN.
+
+   2. Compute day * msPerDay + time.
+
+   3. Return Result(2).
+*/
+
+new TestCase( SECTION,
+              "MakeDate(Number.POSITIVE_INFINITY, 0)",
+              Number.NaN,
+              MakeDate(Number.POSITIVE_INFINITY, 0));
+
+new TestCase( SECTION,
+              "MakeDate(Number.NEGATIVE_INFINITY, 0)",
+              Number.NaN,
+              MakeDate(Number.NEGATIVE_INFINITY, 0));
+
+new TestCase( SECTION,
+              "MakeDate(0, Number.POSITIVE_INFINITY)",
+              Number.NaN,
+              MakeDate(0, Number.POSITIVE_INFINITY));
+
+new TestCase( SECTION,
+              "MakeDate(0, Number.NEGATIVE_INFINITY)",
+              Number.NaN,
+              MakeDate(0, Number.NEGATIVE_INFINITY));
+
+test();
+
diff --git a/js/src/tests/ecma/Date/15.9.2.1.js b/js/src/tests/ecma/Date/15.9.2.1.js
new file mode 100644
index 000000000..0d9ce106d
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.2.1.js
@@ -0,0 +1,140 @@
+/* -*- tab-width: 2; 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:          15.9.2.1.js
+   ECMA Section:       15.9.2.1 Date constructor used as a function
+   Date( year, month, date, hours, minutes, seconds, ms )
+   Description:        The arguments are accepted, but are completely ignored.
+   A string is created and returned as if by the
+   expression (new Date()).toString().
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var VERSION =   "ECMA_1";
+startTest();
+var SECTION =   "15.9.2.1";
+var TITLE =     "Date Constructor used as a function";
+var TYPEOF  =   "string";
+var TOLERANCE = 1000;
+
+writeHeaderToLog("15.9.2.1 The Date Constructor Called as a Function:  " +
+		 "Date( year, month, date, hours, minutes, seconds, ms )" );
+
+// allow up to 1 second difference due to possibility
+// the date may change by 1 second in between calls to Date
+
+var d1;
+var d2;
+
+// Dates around 1970
+
+d1 = new Date();
+d2 = Date.parse(Date(1970,0,1,0,0,0,0));
+new TestCase(SECTION, "Date(1970,0,1,0,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1969,11,31,15,59,59,999));
+new TestCase(SECTION, "Date(1969,11,31,15,59,59,999)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1969,11,31,16,0,0,0));
+new TestCase(SECTION, "Date(1969,11,31,16,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1969,11,31,16,0,0,1));
+new TestCase(SECTION, "Date(1969,11,31,16,0,0,1)", true, d2 - d1 <= 1000);
+
+// Dates around 2000
+d1 = new Date();
+d2 = Date.parse(Date(1999,11,15,59,59,999));
+new TestCase(SECTION, "Date(1999,11,15,59,59,999)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1999,11,16,0,0,0,0));
+new TestCase(SECTION, "Date(1999,11,16,0,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1999,11,31,23,59,59,999));
+new TestCase(SECTION, "Date(1999,11,31,23,59,59,999)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2000,0,0,0,0,0,0));
+new TestCase(SECTION, "Date(2000,0,1,0,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2000,0,0,0,0,0,1));
+new TestCase(SECTION, "Date(2000,0,1,0,0,0,1)", true, d2 - d1 <= 1000);
+
+// Dates around 1900
+
+d1 = new Date();
+d2 = Date.parse(Date(1899,11,31,23,59,59,999));
+new TestCase(SECTION, "Date(1899,11,31,23,59,59,999)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1900,0,1,0,0,0,0));
+new TestCase(SECTION, "Date(1900,0,1,0,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1900,0,1,0,0,0,1));
+new TestCase(SECTION, "Date(1900,0,1,0,0,0,1)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1899,11,31,16,0,0,0,0));
+new TestCase(SECTION, "Date(1899,11,31,16,0,0,0,0)", true, d2 - d1 <= 1000);
+
+// Dates around feb 29, 2000
+
+d1 = new Date();
+d2 = Date.parse(Date(2000,1,29,0,0,0,0));
+new TestCase(SECTION, "Date(2000,1,29,0,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2000,1,28,23,59,59,999));
+new TestCase(SECTION, "Date(2000,1,28,23,59,59,999)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2000,1,27,16,0,0,0));
+new TestCase(SECTION, "Date(2000,1,27,16,0,0,0)", true, d2 - d1 <= 1000);
+
+// Dates around jan 1, 2005
+d1 = new Date();
+d2 = Date.parse(Date(2004,11,31,23,59,59,999));
+new TestCase(SECTION, "Date(2004,11,31,23,59,59,999)",  true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2005,0,1,0,0,0,0));
+new TestCase(SECTION, "Date(2005,0,1,0,0,0,0)",  true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2005,0,1,0,0,0,1));
+new TestCase(SECTION, "Date(2005,0,1,0,0,0,1)",  true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2004,11,31,16,0,0,0,0));
+new TestCase(SECTION, "Date(2004,11,31,16,0,0,0,0)",  true, d2 - d1 <= 1000);
+
+// Dates around jan 1, 2032
+d1 = new Date();
+d2 = Date.parse(Date(2031,11,31,23,59,59,999));
+new TestCase(SECTION, "Date(2031,11,31,23,59,59,999)",  true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2032,0,1,0,0,0,0));
+new TestCase(SECTION, "Date(2032,0,1,0,0,0,0)",  true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2032,0,1,0,0,0,1));
+new TestCase(SECTION, "Date(2032,0,1,0,0,0,1)",  true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2031,11,31,16,0,0,0,0));
+new TestCase(SECTION, "Date(2031,11,31,16,0,0,0,0)",  true, d2 - d1 <= 1000);
+
+test();
diff --git a/js/src/tests/ecma/Date/15.9.2.2-1.js b/js/src/tests/ecma/Date/15.9.2.2-1.js
new file mode 100644
index 000000000..af786a91a
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.2.2-1.js
@@ -0,0 +1,52 @@
+/* -*- 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:          15.9.2.2.js
+   ECMA Section:       15.9.2.2 Date constructor used as a function
+   Date( year, month, date, hours, minutes, seconds )
+   Description:        The arguments are accepted, but are completely ignored.
+   A string is created and returned as if by the
+   expression (new Date()).toString().
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+var VERSION = 9706;
+startTest();
+var SECTION = "15.9.2.2";
+var TOLERANCE = 100;
+var TITLE = "The Date Constructor Called as a Function";
+
+writeHeaderToLog(SECTION+" "+TITLE );
+
+// allow up to 1 second difference due to possibility
+// the date may change by 1 second in between calls to Date
+
+var d1;
+var d2;
+
+// Dates around 1970
+
+d1 = new Date();
+d2 = Date.parse(Date(1970,0,1,0,0,0));
+new TestCase(SECTION, "Date(1970,0,1,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1969,11,31,15,59,59));
+new TestCase(SECTION, "Date(1969,11,31,15,59,59)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1969,11,31,16,0,0));
+new TestCase(SECTION, "Date(1969,11,31,16,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1969,11,31,16,0,1));
+new TestCase(SECTION, "Date(1969,11,31,16,0,1)", true, d2 - d1 <= 1000);
+
+test();
diff --git a/js/src/tests/ecma/Date/15.9.2.2-2.js b/js/src/tests/ecma/Date/15.9.2.2-2.js
new file mode 100644
index 000000000..6da589bcf
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.2.2-2.js
@@ -0,0 +1,55 @@
+/* -*- 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:          15.9.2.2.js
+   ECMA Section:       15.9.2.2 Date constructor used as a function
+   Date( year, month, date, hours, minutes, seconds )
+   Description:        The arguments are accepted, but are completely ignored.
+   A string is created and returned as if by the
+   expression (new Date()).toString().
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+var VERSION = 9706;
+startTest();
+var SECTION = "15.9.2.2";
+var TOLERANCE = 100;
+var TITLE = "The Date Constructor Called as a Function";
+
+writeHeaderToLog(SECTION+" "+TITLE );
+
+// allow up to 1 second difference due to possibility
+// the date may change by 1 second in between calls to Date
+
+var d1;
+var d2;
+
+// Dates around 2000
+d1 = new Date();
+d2 = Date.parse(Date(1999,11,15,59,59));
+new TestCase( SECTION, "Date(1999,11,15,59,59)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1999,11,16,0,0,0));
+new TestCase( SECTION, "Date(1999,11,16,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1999,11,31,23,59,59));
+new TestCase( SECTION, "Date(1999,11,31,23,59,59)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2000,0,0,0,0,0));
+new TestCase( SECTION, "Date(2000,0,1,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2000,0,0,0,0,1));
+new TestCase( SECTION, "Date(2000,0,1,0,0,1)", true, d2 - d1 <= 1000)
+
+test();
diff --git a/js/src/tests/ecma/Date/15.9.2.2-3.js b/js/src/tests/ecma/Date/15.9.2.2-3.js
new file mode 100644
index 000000000..36459b9b4
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.2.2-3.js
@@ -0,0 +1,52 @@
+/* -*- 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:          15.9.2.2.js
+   ECMA Section:       15.9.2.2 Date constructor used as a function
+   Date( year, month, date, hours, minutes, seconds )
+   Description:        The arguments are accepted, but are completely ignored.
+   A string is created and returned as if by the
+   expression (new Date()).toString().
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+var VERSION = 9706;
+startTest();
+var SECTION = "15.9.2.2";
+var TOLERANCE = 100;
+var TITLE = "The Date Constructor Called as a Function";
+
+writeHeaderToLog(SECTION+" "+TITLE );
+
+// allow up to 1 second difference due to possibility
+// the date may change by 1 second in between calls to Date
+
+var d1;
+var d2;
+
+// Dates around 1900
+
+d1 = new Date();
+d2 = Date.parse(Date(1899,11,31,23,59,59));
+new TestCase( SECTION, "Date(1899,11,31,23,59,59)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1900,0,1,0,0,0));
+new TestCase( SECTION, "Date(1900,0,1,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1900,0,1,0,0,1) );
+new TestCase( SECTION, "Date(1900,0,1,0,0,1)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(1899,11,31,16,0,0,0));
+new TestCase( SECTION, "Date(1899,11,31,16,0,0,0)", true, d2 - d1 <= 1000);
+
+test();
diff --git a/js/src/tests/ecma/Date/15.9.2.2-4.js b/js/src/tests/ecma/Date/15.9.2.2-4.js
new file mode 100644
index 000000000..b90651deb
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.2.2-4.js
@@ -0,0 +1,48 @@
+/* -*- 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:          15.9.2.2.js
+   ECMA Section:       15.9.2.2 Date constructor used as a function
+   Date( year, month, date, hours, minutes, seconds )
+   Description:        The arguments are accepted, but are completely ignored.
+   A string is created and returned as if by the
+   expression (new Date()).toString().
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+var VERSION = 9706;
+startTest();
+var SECTION = "15.9.2.2";
+var TOLERANCE = 100;
+var TITLE = "The Date Constructor Called as a Function";
+
+writeHeaderToLog(SECTION+" "+TITLE );
+
+// allow up to 1 second difference due to possibility
+// the date may change by 1 second in between calls to Date
+
+var d1;
+var d2;
+
+// Dates around feb 29, 2000
+
+d1 = new Date();
+d2 = Date.parse(Date(2000,1,29,0,0,0));
+new TestCase(SECTION, "Date(2000,1,29,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2000,1,28,23,59,59));
+new TestCase(SECTION, "Date(2000,1,28,23,59,59)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2000,1,27,16,0,0));
+new TestCase(SECTION, "Date(2000,1,27,16,0,0)", true, d2 - d1 <= 1000);
+
+test();
diff --git a/js/src/tests/ecma/Date/15.9.2.2-5.js b/js/src/tests/ecma/Date/15.9.2.2-5.js
new file mode 100644
index 000000000..48cb26135
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.2.2-5.js
@@ -0,0 +1,52 @@
+/* -*- 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:          15.9.2.2.js
+   ECMA Section:       15.9.2.2 Date constructor used as a function
+   Date( year, month, date, hours, minutes, seconds )
+   Description:        The arguments are accepted, but are completely ignored.
+   A string is created and returned as if by the
+   expression (new Date()).toString().
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+var VERSION = 9706;
+startTest();
+var SECTION = "15.9.2.2";
+var TOLERANCE = 100;
+var TITLE = "The Date Constructor Called as a Function";
+
+writeHeaderToLog(SECTION+" "+TITLE );
+
+// allow up to 1 second difference due to possibility
+// the date may change by 1 second in between calls to Date
+
+var d1;
+var d2;
+
+// Dates around jan 1, 2005
+
+d1 = new Date();
+d2 = Date.parse(Date(2004,11,31,23,59,59));
+new TestCase( SECTION, "Date(2004,11,31,23,59,59)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2005,0,1,0,0,0) );
+new TestCase( SECTION, "Date(2005,0,1,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2005,0,1,0,0,1) );
+new TestCase( SECTION, "Date(2005,0,1,0,0,1)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2004,11,31,16,0,0,0));
+new TestCase( SECTION, "Date(2004,11,31,16,0,0,0)", true, d2 - d1 <= 1000);
+
+test();
diff --git a/js/src/tests/ecma/Date/15.9.2.2-6.js b/js/src/tests/ecma/Date/15.9.2.2-6.js
new file mode 100644
index 000000000..619686e93
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.2.2-6.js
@@ -0,0 +1,51 @@
+/* -*- 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:          15.9.2.2.js
+   ECMA Section:       15.9.2.2 Date constructor used as a function
+   Date( year, month, date, hours, minutes, seconds )
+   Description:        The arguments are accepted, but are completely ignored.
+   A string is created and returned as if by the
+   expression (new Date()).toString().
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+var VERSION = 9706;
+startTest();
+var SECTION = "15.9.2.2";
+var TOLERANCE = 100;
+var TITLE = "The Date Constructor Called as a Function";
+
+writeHeaderToLog(SECTION+" "+TITLE );
+
+// allow up to 1 second difference due to possibility
+// the date may change by 1 second in between calls to Date
+
+var d1;
+var d2;
+
+// Dates around jan 1, 2032
+d1 = new Date();
+d2 = Date.parse(Date(2031,11,31,23,59,59));
+new TestCase(SECTION, "Date(2031,11,31,23,59,59)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2032,0,1,0,0,0));
+new TestCase(SECTION, "Date(2032,0,1,0,0,0)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2032,0,1,0,0,1));
+new TestCase(SECTION, "Date(2032,0,1,0,0,1)", true, d2 - d1 <= 1000);
+
+d1 = new Date();
+d2 = Date.parse(Date(2031,11,31,16,0,0,0));
+new TestCase(SECTION, "Date(2031,11,31,16,0,0,0)", true, d2 - d1 <= 1000);
+
+test();
diff --git a/js/src/tests/ecma/Date/15.9.3.1-1.js b/js/src/tests/ecma/Date/15.9.3.1-1.js
new file mode 100644
index 000000000..c5ecc19d0
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.1-1.js
@@ -0,0 +1,205 @@
+/* -*- tab-width: 2; 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:          15.9.3.1.js
+   ECMA Section:       15.9.3.1 new Date (year, month, date, hours, minutes, seconds, ms)
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial value of Date.prototype.
+
+   The [[Class]] property of the newly constructed object
+   is set as follows:
+   1. Call ToNumber(year)
+   2. Call ToNumber(month)
+   3. Call ToNumber(date)
+   4. Call ToNumber(hours)
+   5. Call ToNumber(minutes)
+   6. Call ToNumber(seconds)
+   7. Call ToNumber(ms)
+   8.  If Result(1) is NaN and 0 <= ToInteger(Result(1)) <=
+   99, Result(8) is 1900+ToInteger(Result(1)); otherwise,
+   Result(8) is Result(1)
+   9.  Compute MakeDay(Result(8), Result(2), Result(3)
+   10. Compute MakeTime(Result(4), Result(5), Result(6),
+   Result(7)
+   11. Compute MakeDate(Result(9), Result(10))
+   12. Set the [[Value]] property of the newly constructed
+   object to TimeClip(UTC(Result(11))).
+
+
+   This tests the returned value of a newly constructed
+   Date object.
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.9.3.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "new Date( year, month, date, hours, minutes, seconds, ms )";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// Dates around 1970
+
+addNewTestCase( new Date( 1969,11,31,15,59,59,999),
+		"new Date( 1969,11,31,15,59,59,999)",
+		[TIME_1970-1,1969,11,31,3,23,59,59,999,1969,11,31,3,15,59,59,999] );
+
+addNewTestCase( new Date( 1969,11,31,23,59,59,999),
+		"new Date( 1969,11,31,23,59,59,999)",
+		[TIME_1970-PST_ADJUST-1,1970,0,1,4,7,59,59,999,1969,11,31,3,23,59,59,999] );
+
+addNewTestCase( new Date( 1970,0,1,0,0,0,0),
+		"new Date( 1970,0,1,0,0,0,0)",
+		[TIME_1970-PST_ADJUST,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+addNewTestCase( new Date( 1969,11,31,16,0,0,0),
+		"new Date( 1969,11,31,16,0,0,0)",
+		[TIME_1970,1970,0,1,4,0,0,0,0,1969,11,31,3,16,0,0,0] );
+
+addNewTestCase( new Date(1969,12,1,0,0,0,0),
+		"new Date(1969,12,1,0,0,0,0)",
+		[TIME_1970-PST_ADJUST,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+addNewTestCase( new Date(1969,11,32,0,0,0,0),
+		"new Date(1969,11,32,0,0,0,0)",
+		[TIME_1970-PST_ADJUST,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+addNewTestCase( new Date(1969,11,31,24,0,0,0),
+		"new Date(1969,11,31,24,0,0,0)",
+		[TIME_1970-PST_ADJUST,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+addNewTestCase( new Date(1969,11,31,23,60,0,0),
+		"new Date(1969,11,31,23,60,0,0)",
+		[TIME_1970-PST_ADJUST,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+addNewTestCase( new Date(1969,11,31,23,59,60,0),
+		"new Date(1969,11,31,23,59,60,0)",
+		[TIME_1970-PST_ADJUST,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+addNewTestCase( new Date(1969,11,31,23,59,59,1000),
+		"new Date(1969,11,31,23,59,59,1000)",
+		[TIME_1970-PST_ADJUST,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+// Dates around 2000
+
+addNewTestCase( new Date( 1999,11,31,15,59,59,999),
+		"new Date( 1999,11,31,15,59,59,999)",
+		[TIME_2000-1,1999,11,31,5,23,59,59,999,1999,11,31,5,15,59,59,999] );
+
+addNewTestCase( new Date( 1999,11,31,16,0,0,0),
+		"new Date( 1999,11,31,16,0,0,0)",
+		[TIME_2000,2000,0,1,6,0,0,0,0,1999,11,31,5, 16,0,0,0] );
+
+addNewTestCase( new Date( 1999,11,31,23,59,59,999),
+		"new Date( 1999,11,31,23,59,59,999)",
+		[TIME_2000-PST_ADJUST-1,2000,0,1,6,7,59,59,999,1999,11,31,5,23,59,59,999] );
+
+addNewTestCase( new Date( 2000,0,1,0,0,0,0),
+		"new Date( 2000,0,1,0,0,0,0)",
+		[TIME_2000-PST_ADJUST,2000,0,1,6,8,0,0,0,2000,0,1,6,0,0,0,0] );
+
+addNewTestCase( new Date( 2000,0,1,0,0,0,1),
+		"new Date( 2000,0,1,0,0,0,1)",
+		[TIME_2000-PST_ADJUST+1,2000,0,1,6,8,0,0,1,2000,0,1,6,0,0,0,1] );
+
+// Dates around 29 Feb 2000
+
+addNewTestCase( new Date(2000,1,28,16,0,0,0),
+		"new Date(2000,1,28,16,0,0,0)",
+		[UTC_FEB_29_2000,2000,1,29,2,0,0,0,0,2000,1,28,1,16,0,0,0] );
+
+addNewTestCase( new Date(2000,1,29,0,0,0,0),
+		"new Date(2000,1,29,0,0,0,0)",
+		[UTC_FEB_29_2000-PST_ADJUST,2000,1,29,2,8,0,0,0,2000,1,29,2,0,0,0,0] );
+
+addNewTestCase( new Date(2000,1,28,24,0,0,0),
+		"new Date(2000,1,28,24,0,0,0)",
+		[UTC_FEB_29_2000-PST_ADJUST,2000,1,29,2,8,0,0,0,2000,1,29,2,0,0,0,0] );
+
+// Dates around 1900
+
+addNewTestCase( new Date(1899,11,31,16,0,0,0),
+		"new Date(1899,11,31,16,0,0,0)",
+		[TIME_1900,1900,0,1,1,0,0,0,0,1899,11,31,0,16,0,0,0] );
+
+addNewTestCase( new Date(1899,11,31,15,59,59,999),
+		"new Date(1899,11,31,15,59,59,999)",
+		[TIME_1900-1,1899,11,31,0,23,59,59,999,1899,11,31,0,15,59,59,999] );
+
+addNewTestCase( new Date(1899,11,31,23,59,59,999),
+		"new Date(1899,11,31,23,59,59,999)",
+		[TIME_1900-PST_ADJUST-1,1900,0,1,1,7,59,59,999,1899,11,31,0,23,59,59,999] );
+
+addNewTestCase( new Date(1900,0,1,0,0,0,0),
+		"new Date(1900,0,1,0,0,0,0)",
+		[TIME_1900-PST_ADJUST,1900,0,1,1,8,0,0,0,1900,0,1,1,0,0,0,0] );
+
+addNewTestCase( new Date(1900,0,1,0,0,0,1),
+		"new Date(1900,0,1,0,0,0,1)",
+		[TIME_1900-PST_ADJUST+1,1900,0,1,1,8,0,0,1,1900,0,1,1,0,0,0,1] );
+
+// Dates around 2005
+
+addNewTestCase( new Date(2005,0,1,0,0,0,0),
+		"new Date(2005,0,1,0,0,0,0)",
+		[UTC_JAN_1_2005-PST_ADJUST,2005,0,1,6,8,0,0,0,2005,0,1,6,0,0,0,0] );
+
+addNewTestCase( new Date(2004,11,31,16,0,0,0),
+		"new Date(2004,11,31,16,0,0,0)",
+		[UTC_JAN_1_2005,2005,0,1,6,0,0,0,0,2004,11,31,5,16,0,0,0] );
+
+test();
+
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray);
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR],  DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.3.1-2.js b/js/src/tests/ecma/Date/15.9.3.1-2.js
new file mode 100644
index 000000000..81a88e372
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.1-2.js
@@ -0,0 +1,118 @@
+/* -*- tab-width: 2; 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:          15.9.3.1.js
+   ECMA Section:       15.9.3.1 new Date (year, month, date, hours, minutes, seconds, ms)
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial value of Date.prototype.
+
+   The [[Class]] property of the newly constructed object
+   is set as follows:
+   1. Call ToNumber(year)
+   2. Call ToNumber(month)
+   3. Call ToNumber(date)
+   4. Call ToNumber(hours)
+   5. Call ToNumber(minutes)
+   6. Call ToNumber(seconds)
+   7. Call ToNumber(ms)
+   8.  If Result(1) is NaN and 0 <= ToInteger(Result(1)) <=
+   99, Result(8) is 1900+ToInteger(Result(1)); otherwise,
+   Result(8) is Result(1)
+   9.  Compute MakeDay(Result(8), Result(2), Result(3)
+   10. Compute MakeTime(Result(4), Result(5), Result(6),
+   Result(7)
+   11. Compute MakeDate(Result(9), Result(10))
+   12. Set the [[Value]] property of the newly constructed
+   object to TimeClip(UTC(Result(11))).
+
+
+   This tests the returned value of a newly constructed
+   Date object.
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.9.3.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "new Date( year, month, date, hours, minutes, seconds, ms )";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+// all the "ResultArrays" below are hard-coded to Pacific Standard Time values -
+
+// Dates around 2000
+
+addNewTestCase( new Date( 1999,11,31,15,59,59,999),
+		"new Date( 1999,11,31,15,59,59,999)",
+		[TIME_2000-1,1999,11,31,5,23,59,59,999,1999,11,31,5,15,59,59,999] );
+
+addNewTestCase( new Date( 1999,11,31,16,0,0,0),
+		"new Date( 1999,11,31,16,0,0,0)",
+		[TIME_2000,2000,0,1,6,0,0,0,0,1999,11,31,5, 16,0,0,0] );
+
+addNewTestCase( new Date( 1999,11,31,23,59,59,999),
+		"new Date( 1999,11,31,23,59,59,999)",
+		[TIME_2000-PST_ADJUST-1,2000,0,1,6,7,59,59,999,1999,11,31,5,23,59,59,999] );
+
+addNewTestCase( new Date( 2000,0,1,0,0,0,0),
+		"new Date( 2000,0,1,0,0,0,0)",
+		[TIME_2000-PST_ADJUST,2000,0,1,6,8,0,0,0,2000,0,1,6,0,0,0,0] );
+
+addNewTestCase( new Date( 2000,0,1,0,0,0,1),
+		"new Date( 2000,0,1,0,0,0,1)",
+		[TIME_2000-PST_ADJUST+1,2000,0,1,6,8,0,0,1,2000,0,1,6,0,0,0,1] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray);
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR],  DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.1-3.js b/js/src/tests/ecma/Date/15.9.3.1-3.js
new file mode 100644
index 000000000..2cca39586
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.1-3.js
@@ -0,0 +1,107 @@
+/* -*- tab-width: 2; 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:          15.9.3.1.js
+   ECMA Section:       15.9.3.1 new Date (year, month, date, hours, minutes, seconds, ms)
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial value of Date.prototype.
+
+   The [[Class]] property of the newly constructed object
+   is set as follows:
+   1. Call ToNumber(year)
+   2. Call ToNumber(month)
+   3. Call ToNumber(date)
+   4. Call ToNumber(hours)
+   5. Call ToNumber(minutes)
+   6. Call ToNumber(seconds)
+   7. Call ToNumber(ms)
+   8.  If Result(1) is NaN and 0 <= ToInteger(Result(1)) <=
+   99, Result(8) is 1900+ToInteger(Result(1)); otherwise,
+   Result(8) is Result(1)
+   9.  Compute MakeDay(Result(8), Result(2), Result(3)
+   10. Compute MakeTime(Result(4), Result(5), Result(6),
+   Result(7)
+   11. Compute MakeDate(Result(9), Result(10))
+   12. Set the [[Value]] property of the newly constructed
+   object to TimeClip(UTC(Result(11))).
+
+
+   This tests the returned value of a newly constructed
+   Date object.
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.9.3.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "new Date( year, month, date, hours, minutes, seconds, ms )";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// all the "ResultArrays" below are hard-coded to Pacific Standard Time values -
+addNewTestCase( new Date(2000,1,28,16,0,0,0),
+		"new Date(2000,1,28,16,0,0,0)",
+		[UTC_FEB_29_2000,2000,1,29,2,0,0,0,0,2000,1,28,1,16,0,0,0] );
+
+addNewTestCase( new Date(2000,1,29,0,0,0,0),
+		"new Date(2000,1,29,0,0,0,0)",
+		[UTC_FEB_29_2000 - PST_ADJUST,2000,1,29,2,8,0,0,0,2000,1,29,2,0,0,0,0] );
+
+addNewTestCase( new Date(2000,1,28,24,0,0,0),
+		"new Date(2000,1,28,24,0,0,0)",
+		[UTC_FEB_29_2000 - PST_ADJUST,2000,1,29,2,8,0,0,0,2000,1,29,2,0,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray);
+
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR],  DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.1-4.js b/js/src/tests/ecma/Date/15.9.3.1-4.js
new file mode 100644
index 000000000..4925dcf43
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.1-4.js
@@ -0,0 +1,117 @@
+/* -*- tab-width: 2; 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:          15.9.3.1.js
+   ECMA Section:       15.9.3.1 new Date (year, month, date, hours, minutes, seconds, ms)
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial value of Date.prototype.
+
+   The [[Class]] property of the newly constructed object
+   is set as follows:
+   1. Call ToNumber(year)
+   2. Call ToNumber(month)
+   3. Call ToNumber(date)
+   4. Call ToNumber(hours)
+   5. Call ToNumber(minutes)
+   6. Call ToNumber(seconds)
+   7. Call ToNumber(ms)
+   8.  If Result(1) is NaN and 0 <= ToInteger(Result(1)) <=
+   99, Result(8) is 1900+ToInteger(Result(1)); otherwise,
+   Result(8) is Result(1)
+   9.  Compute MakeDay(Result(8), Result(2), Result(3)
+   10. Compute MakeTime(Result(4), Result(5), Result(6),
+   Result(7)
+   11. Compute MakeDate(Result(9), Result(10))
+   12. Set the [[Value]] property of the newly constructed
+   object to TimeClip(UTC(Result(11))).
+
+
+   This tests the returned value of a newly constructed
+   Date object.
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.9.3.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "new Date( year, month, date, hours, minutes, seconds, ms )";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// all the "ResultArrays" below are hard-coded to Pacific Standard Time values -
+
+// Dates around 1900
+
+addNewTestCase( new Date(1899,11,31,16,0,0,0),
+		"new Date(1899,11,31,16,0,0,0)",
+		[TIME_1900,1900,0,1,1,0,0,0,0,1899,11,31,0,16,0,0,0] );
+
+addNewTestCase( new Date(1899,11,31,15,59,59,999),
+		"new Date(1899,11,31,15,59,59,999)",
+		[TIME_1900-1,1899,11,31,0,23,59,59,999,1899,11,31,0,15,59,59,999] );
+
+addNewTestCase( new Date(1899,11,31,23,59,59,999),
+		"new Date(1899,11,31,23,59,59,999)",
+		[TIME_1900-PST_ADJUST-1,1900,0,1,1,7,59,59,999,1899,11,31,0,23,59,59,999] );
+
+addNewTestCase( new Date(1900,0,1,0,0,0,0),
+		"new Date(1900,0,1,0,0,0,0)",
+		[TIME_1900-PST_ADJUST,1900,0,1,1,8,0,0,0,1900,0,1,1,0,0,0,0] );
+
+addNewTestCase( new Date(1900,0,1,0,0,0,1),
+		"new Date(1900,0,1,0,0,0,1)",
+		[TIME_1900-PST_ADJUST+1,1900,0,1,1,8,0,0,1,1900,0,1,1,0,0,0,1] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray);
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR],  DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.1-5.js b/js/src/tests/ecma/Date/15.9.3.1-5.js
new file mode 100644
index 000000000..51b997ef5
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.1-5.js
@@ -0,0 +1,106 @@
+/* -*- tab-width: 2; 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:          15.9.3.1.js
+   ECMA Section:       15.9.3.1 new Date (year, month, date, hours, minutes, seconds, ms)
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial value of Date.prototype.
+
+   The [[Class]] property of the newly constructed object
+   is set as follows:
+   1. Call ToNumber(year)
+   2. Call ToNumber(month)
+   3. Call ToNumber(date)
+   4. Call ToNumber(hours)
+   5. Call ToNumber(minutes)
+   6. Call ToNumber(seconds)
+   7. Call ToNumber(ms)
+   8.  If Result(1) is NaN and 0 <= ToInteger(Result(1)) <=
+   99, Result(8) is 1900+ToInteger(Result(1)); otherwise,
+   Result(8) is Result(1)
+   9.  Compute MakeDay(Result(8), Result(2), Result(3)
+   10. Compute MakeTime(Result(4), Result(5), Result(6),
+   Result(7)
+   11. Compute MakeDate(Result(9), Result(10))
+   12. Set the [[Value]] property of the newly constructed
+   object to TimeClip(UTC(Result(11))).
+
+
+   This tests the returned value of a newly constructed
+   Date object.
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.9.3.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "new Date( year, month, date, hours, minutes, seconds, ms )";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// all the "ResultArrays" below are hard-coded to Pacific Standard Time values -
+
+// Dates around 2005
+
+addNewTestCase( new Date(2005,0,1,0,0,0,0),
+		"new Date(2005,0,1,0,0,0,0)",
+		[UTC_JAN_1_2005-PST_ADJUST,2005,0,1,6,8,0,0,0,2005,0,1,6,0,0,0,0] );
+
+addNewTestCase( new Date(2004,11,31,16,0,0,0),
+		"new Date(2004,11,31,16,0,0,0)",
+		[UTC_JAN_1_2005,2005,0,1,6,0,0,0,0,2004,11,31,5,16,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray);
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR],  DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.3.2-1.js b/js/src/tests/ecma/Date/15.9.3.2-1.js
new file mode 100644
index 000000000..77661db32
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.2-1.js
@@ -0,0 +1,116 @@
+/* -*- tab-width: 2; 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:          15.9.3.1.js
+   ECMA Section:       15.9.3.1 new Date (year, month, date, hours, minutes, seconds, ms)
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial value of Date.prototype.
+
+   The [[Class]] property of the newly constructed object
+   is set as follows:
+   1. Call ToNumber(year)
+   2. Call ToNumber(month)
+   3. Call ToNumber(date)
+   4. Call ToNumber(hours)
+   5. Call ToNumber(minutes)
+   6. Call ToNumber(seconds)
+   7. Call ToNumber(ms)
+   8.  If Result(1)is NaN and 0 <= ToInteger(Result(1)) <=
+   99, Result(8) is 1900+ToInteger(Result(1)); otherwise,
+   Result(8) is Result(1)
+   9.  Compute MakeDay(Result(8), Result(2), Result(3)
+   10. Compute MakeTime(Result(4), Result(5), Result(6),
+   Result(7)
+   11. Compute MakeDate(Result(9), Result(10))
+   12. Set the [[Value]] property of the newly constructed
+   object to TimeClip(UTC(Result(11))).
+
+
+   This tests the returned value of a newly constructed
+   Date object.
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+//  for TCMS, the gTestcases array must be global.
+var SECTION = "15.9.3.1";
+var TITLE =   "Date( year, month, date, hours, minutes, seconds )";
+
+writeHeaderToLog( SECTION+" " +TITLE );
+
+// Dates around 1970
+
+addNewTestCase( new Date( 1969,11,31,15,59,59),
+		"new Date( 1969,11,31,15,59,59)",
+		[-1000,1969,11,31,3,23,59,59,0,1969,11,31,3,15,59,59,0] );
+
+addNewTestCase( new Date( 1969,11,31,16,0,0),
+		"new Date( 1969,11,31,16,0,0)",
+		[0,1970,0,1,4,0,0,0,0,1969,11,31,3,16,0,0,0] );
+
+addNewTestCase( new Date( 1969,11,31,23,59,59),
+		"new Date( 1969,11,31,23,59,59)",
+		[28799000,1970,0,1,4,7,59,59,0,1969,11,31,3,23,59,59,0] );
+
+addNewTestCase( new Date( 1970, 0, 1, 0, 0, 0),
+		"new Date( 1970, 0, 1, 0, 0, 0)",
+		[28800000,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+addNewTestCase( new Date( 1969,11,31,16,0,0),
+		"new Date( 1969,11,31,16,0,0)",
+		[0,1970,0,1,4,0,0,0,0,1969,11,31,3,16,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray);
+
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR],   DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.2-2.js b/js/src/tests/ecma/Date/15.9.3.2-2.js
new file mode 100644
index 000000000..ff2ea9872
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.2-2.js
@@ -0,0 +1,107 @@
+/* -*- tab-width: 2; 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:          15.9.3.1.js
+   ECMA Section:       15.9.3.1 new Date (year, month, date, hours, minutes, seconds, ms)
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial value of Date.prototype.
+
+   The [[Class]] property of the newly constructed object
+   is set as follows:
+   1. Call ToNumber(year)
+   2. Call ToNumber(month)
+   3. Call ToNumber(date)
+   4. Call ToNumber(hours)
+   5. Call ToNumber(minutes)
+   6. Call ToNumber(seconds)
+   7. Call ToNumber(ms)
+   8.  If Result(1)is NaN and 0 <= ToInteger(Result(1)) <=
+   99, Result(8) is 1900+ToInteger(Result(1)); otherwise,
+   Result(8) is Result(1)
+   9.  Compute MakeDay(Result(8), Result(2), Result(3)
+   10. Compute MakeTime(Result(4), Result(5), Result(6),
+   Result(7)
+   11. Compute MakeDate(Result(9), Result(10))
+   12. Set the [[Value]] property of the newly constructed
+   object to TimeClip(UTC(Result(11))).
+
+
+   This tests the returned value of a newly constructed
+   Date object.
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+//  for TCMS, the gTestcases array must be global.
+var SECTION = "15.9.3.1";
+var TITLE =   "Date( year, month, date, hours, minutes, seconds )";
+
+writeHeaderToLog( SECTION+" " +TITLE );
+
+// Dates around 2000
+
+addNewTestCase( new Date( 1999,11,31,15,59,59),
+		"new Date( 1999,11,31,15,59,59)",
+		[946684799000,1999,11,31,5,23,59,59,0,1999,11,31,5,15,59,59,0] );
+
+addNewTestCase( new Date( 1999,11,31,16,0,0),
+		"new Date( 1999,11,31,16,0,0)",
+		[946684800000,2000,0,1,6,0,0,0,0,1999,11,31,5, 16,0,0,0] );
+
+addNewTestCase( new Date( 2000,0,1,0,0,0),
+		"new Date( 2000,0,1,0,0,0)",
+		[946713600000,2000,0,1,6,8,0,0,0,2000,0,1,6,0,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray);
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR],   DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.2-3.js b/js/src/tests/ecma/Date/15.9.3.2-3.js
new file mode 100644
index 000000000..dee9cba13
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.2-3.js
@@ -0,0 +1,111 @@
+/* -*- tab-width: 2; 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:          15.9.3.1.js
+   ECMA Section:       15.9.3.1 new Date (year, month, date, hours, minutes, seconds, ms)
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial value of Date.prototype.
+
+   The [[Class]] property of the newly constructed object
+   is set as follows:
+   1. Call ToNumber(year)
+   2. Call ToNumber(month)
+   3. Call ToNumber(date)
+   4. Call ToNumber(hours)
+   5. Call ToNumber(minutes)
+   6. Call ToNumber(seconds)
+   7. Call ToNumber(ms)
+   8.  If Result(1)is NaN and 0 <= ToInteger(Result(1)) <=
+   99, Result(8) is 1900+ToInteger(Result(1)); otherwise,
+   Result(8) is Result(1)
+   9.  Compute MakeDay(Result(8), Result(2), Result(3)
+   10. Compute MakeTime(Result(4), Result(5), Result(6),
+   Result(7)
+   11. Compute MakeDate(Result(9), Result(10))
+   12. Set the [[Value]] property of the newly constructed
+   object to TimeClip(UTC(Result(11))).
+
+
+   This tests the returned value of a newly constructed
+   Date object.
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+//  for TCMS, the gTestcases array must be global.
+var SECTION = "15.9.3.1";
+var TITLE =   "Date( year, month, date, hours, minutes, seconds )";
+
+writeHeaderToLog( SECTION+" " +TITLE );
+
+// Dates around 1900
+
+addNewTestCase( new Date(1899,11,31,16,0,0),
+		"new Date(1899,11,31,16,0,0)",
+		[-2208988800000,1900,0,1,1,0,0,0,0,1899,11,31,0,16,0,0,0] );
+
+addNewTestCase( new Date(1899,11,31,15,59,59),
+		"new Date(1899,11,31,15,59,59)",
+		[-2208988801000,1899,11,31,0,23,59,59,0,1899,11,31,0,15,59,59,0] );
+
+addNewTestCase( new Date(1900,0,1,0,0,0),
+		"new Date(1900,0,1,0,0,0)",
+		[-2208960000000,1900,0,1,1,8,0,0,0,1900,0,1,1,0,0,0,0] );
+
+addNewTestCase( new Date(1900,0,1,0,0,1),
+		"new Date(1900,0,1,0,0,1)",
+		[-2208959999000,1900,0,1,1,8,0,1,0,1900,0,1,1,0,0,1,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray);
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR],   DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.2-4.js b/js/src/tests/ecma/Date/15.9.3.2-4.js
new file mode 100644
index 000000000..33c1d0c63
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.2-4.js
@@ -0,0 +1,108 @@
+/* -*- tab-width: 2; 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:          15.9.3.1.js
+   ECMA Section:       15.9.3.1 new Date (year, month, date, hours, minutes, seconds, ms)
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial value of Date.prototype.
+
+   The [[Class]] property of the newly constructed object
+   is set as follows:
+   1. Call ToNumber(year)
+   2. Call ToNumber(month)
+   3. Call ToNumber(date)
+   4. Call ToNumber(hours)
+   5. Call ToNumber(minutes)
+   6. Call ToNumber(seconds)
+   7. Call ToNumber(ms)
+   8.  If Result(1)is NaN and 0 <= ToInteger(Result(1)) <=
+   99, Result(8) is 1900+ToInteger(Result(1)); otherwise,
+   Result(8) is Result(1)
+   9.  Compute MakeDay(Result(8), Result(2), Result(3)
+   10. Compute MakeTime(Result(4), Result(5), Result(6),
+   Result(7)
+   11. Compute MakeDate(Result(9), Result(10))
+   12. Set the [[Value]] property of the newly constructed
+   object to TimeClip(UTC(Result(11))).
+
+
+   This tests the returned value of a newly constructed
+   Date object.
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+//  for TCMS, the gTestcases array must be global.
+var SECTION = "15.9.3.1";
+var TITLE =   "Date( year, month, date, hours, minutes, seconds )";
+
+writeHeaderToLog( SECTION+" " +TITLE );
+
+var PST_FEB_29_2000 = UTC_FEB_29_2000 + 8*msPerHour;
+
+// Dates around Feb 29, 2000
+addNewTestCase( new Date(2000,1,28,16,0,0,0),
+		"new Date(2000,1,28,16,0,0,0)",
+		[UTC_FEB_29_2000,2000,1,29,2,0,0,0,0,2000,1,28,1,16,0,0,0,0] );
+
+addNewTestCase( new Date(2000,1,29,0,0,0,0),
+		"new Date(2000,1,29,0,0,0,0)",
+		[PST_FEB_29_2000,2000,1,29,2,8,0,0,0,2000,1,29,2,0,0,0,0] );
+
+addNewTestCase( new Date(2000,1,29,24,0,0,0),
+		"new Date(2000,1,29,24,0,0,0)",
+		[PST_FEB_29_2000+msPerDay,2000,2,1,3,8,0,0,0,2000,2,1,3,0,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray);
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR],   DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.2-5.js b/js/src/tests/ecma/Date/15.9.3.2-5.js
new file mode 100644
index 000000000..17990faff
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.2-5.js
@@ -0,0 +1,105 @@
+/* -*- tab-width: 2; 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:          15.9.3.1.js
+   ECMA Section:       15.9.3.1 new Date (year, month, date, hours, minutes, seconds, ms)
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial value of Date.prototype.
+
+   The [[Class]] property of the newly constructed object
+   is set as follows:
+   1. Call ToNumber(year)
+   2. Call ToNumber(month)
+   3. Call ToNumber(date)
+   4. Call ToNumber(hours)
+   5. Call ToNumber(minutes)
+   6. Call ToNumber(seconds)
+   7. Call ToNumber(ms)
+   8.  If Result(1)is NaN and 0 <= ToInteger(Result(1)) <=
+   99, Result(8) is 1900+ToInteger(Result(1)); otherwise,
+   Result(8) is Result(1)
+   9.  Compute MakeDay(Result(8), Result(2), Result(3)
+   10. Compute MakeTime(Result(4), Result(5), Result(6),
+   Result(7)
+   11. Compute MakeDate(Result(9), Result(10))
+   12. Set the [[Value]] property of the newly constructed
+   object to TimeClip(UTC(Result(11))).
+
+
+   This tests the returned value of a newly constructed
+   Date object.
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+//  for TCMS, the gTestcases array must be global.
+var SECTION = "15.9.3.1";
+var TITLE =   "Date( year, month, date, hours, minutes, seconds )";
+
+writeHeaderToLog( SECTION+" " +TITLE );
+
+// Dates around Jan 1, 2005
+
+var PST_JAN_1_2005 = UTC_JAN_1_2005 + 8*msPerHour;
+
+addNewTestCase( new Date(2005,0,1,0,0,0,0),
+		"new Date(2005,0,1,0,0,0,0)",
+		[PST_JAN_1_2005,2005,0,1,6,8,0,0,0,2005,0,1,6,0,0,0,0] );
+
+addNewTestCase( new Date(2004,11,31,16,0,0,0),
+		"new Date(2004,11,31,16,0,0,0)",
+		[UTC_JAN_1_2005,2005,0,1,6,0,0,0,0,2004,11,31,5,16,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+//adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray);
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR],   DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.8-1.js b/js/src/tests/ecma/Date/15.9.3.8-1.js
new file mode 100644
index 000000000..beda72d41
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.8-1.js
@@ -0,0 +1,121 @@
+/* -*- tab-width: 2; 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:          15.9.3.8.js
+   ECMA Section:       15.9.3.8 The Date Constructor
+   new Date( value )
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial valiue of Date.prototype.
+
+   The [[Class]] property of the newly constructed object is
+   set to "Date".
+
+   The [[Value]] property of the newly constructed object is
+   set as follows:
+
+   1. Call ToPrimitive(value)
+   2. If Type( Result(1) ) is String, then go to step 5.
+   3. Let V be  ToNumber( Result(1) ).
+   4. Set the [[Value]] property of the newly constructed
+   object to TimeClip(V) and return.
+   5. Parse Result(1) as a date, in exactly the same manner
+   as for the parse method.  Let V be the time value for
+   this date.
+   6. Go to step 4.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+
+var VERSION = "ECMA_1";
+startTest();
+var SECTION = "15.9.3.8";
+var TYPEOF  = "object";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+
+//  for TCMS, the gTestcases array must be global.
+var gTc= 0;
+var TITLE = "Date constructor:  new Date( value )";
+var SECTION = "15.9.3.8";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION +" " + TITLE );
+
+// all the "ResultArrays" below are hard-coded to Pacific Standard Time values -
+var TZ_ADJUST = -TZ_PST * msPerHour;
+
+
+// Dates around 1970
+addNewTestCase( new Date(0),
+		"new Date(0)",
+		[0,1970,0,1,4,0,0,0,0,1969,11,31,3,16,0,0,0] );
+
+addNewTestCase( new Date(1),
+		"new Date(1)",
+		[1,1970,0,1,4,0,0,0,1,1969,11,31,3,16,0,0,1] );
+
+addNewTestCase( new Date(true),
+		"new Date(true)",
+		[1,1970,0,1,4,0,0,0,1,1969,11,31,3,16,0,0,1] );
+
+addNewTestCase( new Date(false),
+		"new Date(false)",
+		[0,1970,0,1,4,0,0,0,0,1969,11,31,3,16,0,0,0] );
+
+addNewTestCase( new Date( (new Date(0)).toString() ),
+		"new Date(\""+ (new Date(0)).toString()+"\" )",
+		[0,1970,0,1,4,0,0,0,0,1969,11,31,3,16,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray, 'msMode');
+
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR], DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.8-2.js b/js/src/tests/ecma/Date/15.9.3.8-2.js
new file mode 100644
index 000000000..a53f5ce13
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.8-2.js
@@ -0,0 +1,119 @@
+/* -*- tab-width: 2; 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:          15.9.3.8.js
+   ECMA Section:       15.9.3.8 The Date Constructor
+   new Date( value )
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial valiue of Date.prototype.
+
+   The [[Class]] property of the newly constructed object is
+   set to "Date".
+
+   The [[Value]] property of the newly constructed object is
+   set as follows:
+
+   1. Call ToPrimitive(value)
+   2. If Type( Result(1) ) is String, then go to step 5.
+   3. Let V be  ToNumber( Result(1) ).
+   4. Set the [[Value]] property of the newly constructed
+   object to TimeClip(V) and return.
+   5. Parse Result(1) as a date, in exactly the same manner
+   as for the parse method.  Let V be the time value for
+   this date.
+   6. Go to step 4.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+
+var VERSION = "ECMA_1";
+startTest();
+var SECTION = "15.9.3.8";
+var TYPEOF  = "object";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+
+//  for TCMS, the gTestcases array must be global.
+var gTc= 0;
+var TITLE = "Date constructor:  new Date( value )";
+var SECTION = "15.9.3.8";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION +" " + TITLE );
+
+// all the "ResultArrays" below are hard-coded to Pacific Standard Time values -
+var TZ_ADJUST =  -TZ_PST * msPerHour;
+
+addNewTestCase( new Date((new Date(0)).toUTCString()),
+		"new Date(\""+ (new Date(0)).toUTCString()+"\" )",
+		[0,1970,0,1,4,0,0,0,0,1969,11,31,3,16,0,0,0] );
+
+addNewTestCase( new Date((new Date(1)).toString()),
+		"new Date(\""+ (new Date(1)).toString()+"\" )",
+		[0,1970,0,1,4,0,0,0,0,1969,11,31,3,16,0,0,0] );
+
+addNewTestCase( new Date( TZ_ADJUST ),
+		"new Date(" + TZ_ADJUST+")",
+		[TZ_ADJUST,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+addNewTestCase( new Date((new Date(TZ_ADJUST)).toString()),
+		"new Date(\""+ (new Date(TZ_ADJUST)).toString()+"\")",
+		[TZ_ADJUST,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+
+addNewTestCase( new Date( (new Date(TZ_ADJUST)).toUTCString() ),
+		"new Date(\""+ (new Date(TZ_ADJUST)).toUTCString()+"\")",
+		[TZ_ADJUST,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray, 'msMode');
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR], DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.8-3.js b/js/src/tests/ecma/Date/15.9.3.8-3.js
new file mode 100644
index 000000000..fc3ba43e7
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.8-3.js
@@ -0,0 +1,126 @@
+/* -*- tab-width: 2; 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:          15.9.3.8.js
+   ECMA Section:       15.9.3.8 The Date Constructor
+   new Date( value )
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial valiue of Date.prototype.
+
+   The [[Class]] property of the newly constructed object is
+   set to "Date".
+
+   The [[Value]] property of the newly constructed object is
+   set as follows:
+
+   1. Call ToPrimitive(value)
+   2. If Type( Result(1) ) is String, then go to step 5.
+   3. Let V be  ToNumber( Result(1) ).
+   4. Set the [[Value]] property of the newly constructed
+   object to TimeClip(V) and return.
+   5. Parse Result(1) as a date, in exactly the same manner
+   as for the parse method.  Let V be the time value for
+   this date.
+   6. Go to step 4.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+
+var VERSION = "ECMA_1";
+startTest();
+var SECTION = "15.9.3.8";
+var TYPEOF  = "object";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+
+//  for TCMS, the gTestcases array must be global.
+var gTc= 0;
+var TITLE = "Date constructor:  new Date( value )";
+var SECTION = "15.9.3.8";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION +" " + TITLE );
+
+// all the "ResultArrays" below are hard-coded to Pacific Standard Time values -
+var TZ_ADJUST =  -TZ_PST * msPerHour;
+
+
+// Dates around 2000
+
+addNewTestCase( new Date(TIME_2000+TZ_ADJUST),
+		"new Date(" +(TIME_2000+TZ_ADJUST)+")",
+		[TIME_2000+TZ_ADJUST,2000,0,1,6,8,0,0,0,2000,0,1,6,0,0,0,0] );
+
+addNewTestCase( new Date(TIME_2000),
+		"new Date(" +TIME_2000+")",
+		[TIME_2000,2000,0,1,6,0,0,0,0,1999,11,31,5,16,0,0,0] );
+
+addNewTestCase( new Date( (new Date(TIME_2000+TZ_ADJUST)).toString()),
+		"new Date(\"" +(new Date(TIME_2000+TZ_ADJUST)).toString()+"\")",
+		[TIME_2000+TZ_ADJUST,2000,0,1,6,8,0,0,0,2000,0,1,6,0,0,0,0] );
+
+addNewTestCase( new Date((new Date(TIME_2000)).toString()),
+		"new Date(\"" +(new Date(TIME_2000)).toString()+"\")",
+		[TIME_2000,2000,0,1,6,0,0,0,0,1999,11,31,5,16,0,0,0] );
+
+
+addNewTestCase(  new Date( (new Date(TIME_2000+TZ_ADJUST)).toUTCString()),
+		 "new Date(\"" +(new Date(TIME_2000+TZ_ADJUST)).toUTCString()+"\")",
+		 [TIME_2000+TZ_ADJUST,2000,0,1,6,8,0,0,0,2000,0,1,6,0,0,0,0] );
+
+addNewTestCase( new Date( (new Date(TIME_2000)).toUTCString()),
+		"new Date(\"" +(new Date(TIME_2000)).toUTCString()+"\")",
+		[TIME_2000,2000,0,1,6,0,0,0,0,1999,11,31,5,16,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray, 'msMode');
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR], DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.8-4.js b/js/src/tests/ecma/Date/15.9.3.8-4.js
new file mode 100644
index 000000000..f28c6b65a
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.8-4.js
@@ -0,0 +1,127 @@
+/* -*- tab-width: 2; 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:          15.9.3.8.js
+   ECMA Section:       15.9.3.8 The Date Constructor
+   new Date( value )
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial valiue of Date.prototype.
+
+   The [[Class]] property of the newly constructed object is
+   set to "Date".
+
+   The [[Value]] property of the newly constructed object is
+   set as follows:
+
+   1. Call ToPrimitive(value)
+   2. If Type( Result(1) ) is String, then go to step 5.
+   3. Let V be  ToNumber( Result(1) ).
+   4. Set the [[Value]] property of the newly constructed
+   object to TimeClip(V) and return.
+   5. Parse Result(1) as a date, in exactly the same manner
+   as for the parse method.  Let V be the time value for
+   this date.
+   6. Go to step 4.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+
+var VERSION = "ECMA_1";
+startTest();
+var SECTION = "15.9.3.8";
+var TYPEOF  = "object";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+
+//  for TCMS, the gTestcases array must be global.
+var gTc= 0;
+var TITLE = "Date constructor:  new Date( value )";
+var SECTION = "15.9.3.8";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION +" " + TITLE );
+
+// all the "ResultArrays" below are hard-coded to Pacific Standard Time values -
+var TZ_ADJUST =  -TZ_PST * msPerHour;
+
+// Dates around Feb 29, 2000
+
+var PST_FEB_29_2000 = UTC_FEB_29_2000 + TZ_ADJUST;
+
+addNewTestCase( new Date(UTC_FEB_29_2000),
+		"new Date("+UTC_FEB_29_2000+")",
+		[UTC_FEB_29_2000,2000,1,29,2,0,0,0,0,2000,1,28,1,16,0,0,0] );
+
+addNewTestCase( new Date(PST_FEB_29_2000),
+		"new Date("+PST_FEB_29_2000+")",
+		[PST_FEB_29_2000,2000,1,29,2,8,0,0,0,2000,1,29,2,0,0,0,0] );
+
+addNewTestCase( new Date( (new Date(UTC_FEB_29_2000)).toString() ),
+		"new Date(\""+(new Date(UTC_FEB_29_2000)).toString()+"\")",
+		[UTC_FEB_29_2000,2000,1,29,2,0,0,0,0,2000,1,28,1,16,0,0,0] );
+
+addNewTestCase( new Date( (new Date(PST_FEB_29_2000)).toString() ),
+		"new Date(\""+(new Date(PST_FEB_29_2000)).toString()+"\")",
+		[PST_FEB_29_2000,2000,1,29,2,8,0,0,0,2000,1,29,2,0,0,0,0] );
+
+
+addNewTestCase( new Date( (new Date(UTC_FEB_29_2000)).toGMTString() ),
+		"new Date(\""+(new Date(UTC_FEB_29_2000)).toGMTString()+"\")",
+		[UTC_FEB_29_2000,2000,1,29,2,0,0,0,0,2000,1,28,1,16,0,0,0] );
+
+addNewTestCase( new Date( (new Date(PST_FEB_29_2000)).toGMTString() ),
+		"new Date(\""+(new Date(PST_FEB_29_2000)).toGMTString()+"\")",
+		[PST_FEB_29_2000,2000,1,29,2,8,0,0,0,2000,1,29,2,0,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray, 'msMode');
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR], DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.3.8-5.js b/js/src/tests/ecma/Date/15.9.3.8-5.js
new file mode 100644
index 000000000..126ccb3cb
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.3.8-5.js
@@ -0,0 +1,127 @@
+/* -*- tab-width: 2; 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:          15.9.3.8.js
+   ECMA Section:       15.9.3.8 The Date Constructor
+   new Date( value )
+   Description:        The [[Prototype]] property of the newly constructed
+   object is set to the original Date prototype object,
+   the one that is the initial valiue of Date.prototype.
+
+   The [[Class]] property of the newly constructed object is
+   set to "Date".
+
+   The [[Value]] property of the newly constructed object is
+   set as follows:
+
+   1. Call ToPrimitive(value)
+   2. If Type( Result(1) ) is String, then go to step 5.
+   3. Let V be  ToNumber( Result(1) ).
+   4. Set the [[Value]] property of the newly constructed
+   object to TimeClip(V) and return.
+   5. Parse Result(1) as a date, in exactly the same manner
+   as for the parse method.  Let V be the time value for
+   this date.
+   6. Go to step 4.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+   Version:            9706
+
+*/
+
+var VERSION = "ECMA_1";
+startTest();
+var SECTION = "15.9.3.8";
+var TYPEOF  = "object";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+
+
+//  for TCMS, the gTestcases array must be global.
+var gTc= 0;
+var TITLE = "Date constructor:  new Date( value )";
+var SECTION = "15.9.3.8";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION +" " + TITLE );
+
+// all the "ResultArrays" below are hard-coded to Pacific Standard Time values -
+var TZ_ADJUST =  -TZ_PST * msPerHour;
+
+
+// Dates around 1900
+
+var PST_1900 = TIME_1900 + 8*msPerHour;
+
+addNewTestCase( new Date( TIME_1900 ),
+		"new Date("+TIME_1900+")",
+		[TIME_1900,1900,0,1,1,0,0,0,0,1899,11,31,0,16,0,0,0] );
+
+addNewTestCase( new Date(PST_1900),
+		"new Date("+PST_1900+")",
+		[ PST_1900,1900,0,1,1,8,0,0,0,1900,0,1,1,0,0,0,0] );
+
+addNewTestCase( new Date( (new Date(TIME_1900)).toString() ),
+		"new Date(\""+(new Date(TIME_1900)).toString()+"\")",
+		[TIME_1900,1900,0,1,1,0,0,0,0,1899,11,31,0,16,0,0,0] );
+
+addNewTestCase( new Date( (new Date(PST_1900)).toString() ),
+		"new Date(\""+(new Date(PST_1900 )).toString()+"\")",
+		[ PST_1900,1900,0,1,1,8,0,0,0,1900,0,1,1,0,0,0,0] );
+
+addNewTestCase( new Date( (new Date(TIME_1900)).toUTCString() ),
+		"new Date(\""+(new Date(TIME_1900)).toUTCString()+"\")",
+		[TIME_1900,1900,0,1,1,0,0,0,0,1899,11,31,0,16,0,0,0] );
+
+addNewTestCase( new Date( (new Date(PST_1900)).toUTCString() ),
+		"new Date(\""+(new Date(PST_1900 )).toUTCString()+"\")",
+		[ PST_1900,1900,0,1,1,8,0,0,0,1900,0,1,1,0,0,0,0] );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  //adjust hard-coded ResultArray for tester's timezone instead of PST
+  adjustResultArray(ResultArray, 'msMode');
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      ResultArray[UTC_YEAR], DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         ResultArray[UTC_MONTH],  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          ResultArray[UTC_DATE],   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           ResultArray[UTC_DAY],    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         ResultArray[UTC_HOURS],  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       ResultArray[UTC_MINUTES],DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       ResultArray[UTC_SECONDS],DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  ResultArray[UTC_MS],     DateCase.getUTCMilliseconds() );
+  new TestCase( SECTION, DateString+".getFullYear()",         ResultArray[YEAR],       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            ResultArray[MONTH],      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             ResultArray[DATE],       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              ResultArray[DAY],        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            ResultArray[HOURS],      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          ResultArray[MINUTES],    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          ResultArray[SECONDS],    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     ResultArray[MS],         DateCase.getMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.4.2-1.js b/js/src/tests/ecma/Date/15.9.4.2-1.js
new file mode 100644
index 000000000..2ebd6725d
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.4.2-1.js
@@ -0,0 +1,48 @@
+/* -*- tab-width: 2; 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:
+ *  Reference:          http://bugzilla.mozilla.org/show_bug.cgi?id=4088
+ *  Description:        Date parsing gets 12:30 AM wrong.
+ *  New behavior:
+ *  js> d = new Date('1/1/1999 13:30 AM')
+ * Invalid Date
+ * js> d = new Date('1/1/1999 13:30 PM')
+ * Invalid Date
+ * js> d = new Date('1/1/1999 12:30 AM')
+ * Fri Jan 01 00:30:00 GMT-0800 (PST) 1999
+ * js> d = new Date('1/1/1999 12:30 PM')
+ * Fri Jan 01 12:30:00 GMT-0800 (PST) 1999
+ *  Author:             christine@netscape.com
+ */
+
+var SECTION = "15.9.4.2-1";       // provide a document reference (ie, ECMA section)
+var VERSION = "ECMA"; // Version of JavaScript or ECMA
+var TITLE   = "Regression Test for Date.parse";       // Provide ECMA section title or a description
+var BUGNUMBER = "http://bugzilla.mozilla.org/show_bug.cgi?id=4088";     // Provide URL to bugsplat or bugzilla report
+
+startTest();               // leave this alone
+
+AddTestCase( "new Date('1/1/1999 12:30 AM').toString()",
+	     new Date(1999,0,1,0,30).toString(),
+	     new Date('1/1/1999 12:30 AM').toString() );
+
+AddTestCase( "new Date('1/1/1999 12:30 PM').toString()",
+	     new Date( 1999,0,1,12,30 ).toString(),
+	     new Date('1/1/1999 12:30 PM').toString() );
+
+AddTestCase( "new Date('1/1/1999 13:30 AM')",
+	     "Invalid Date",
+	     new Date('1/1/1999 13:30 AM').toString() );
+
+
+AddTestCase( "new Date('1/1/1999 13:30 PM')",
+	     "Invalid Date",
+	     new Date('1/1/1999 13:30 PM').toString() );
+
+test();       // leave this alone.  this executes the test cases and
+// displays results.
diff --git a/js/src/tests/ecma/Date/15.9.4.2.js b/js/src/tests/ecma/Date/15.9.4.2.js
new file mode 100644
index 000000000..883fa621d
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.4.2.js
@@ -0,0 +1,157 @@
+/* -*- tab-width: 2; 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:          15.9.4.2.js
+   ECMA Section:       15.9.4.2 Date.parse()
+   Description:        The parse() function applies the to ToString() operator
+   to its argument and interprets the resulting string as
+   a date.  It returns a number, the UTC time value
+   corresponding to the date.
+
+   The string may be interpreted as a local time, a UTC
+   time, or a time in some other time zone, depending on
+   the contents of the string.
+
+   (need to test strings containing stuff with the time
+   zone specified, and verify that parse() returns the
+   correct GMT time)
+
+   so for any Date object x, all of these things should
+   be equal:
+
+   value                       tested in function:
+   x.valueOf()                 test_value()
+   Date.parse(x.toString())    test_tostring()
+   Date.parse(x.toGMTString()) test_togmt()
+
+   Date.parse(x.toLocaleString()) is not required to
+   produce the same number value as the preceding three
+   expressions.  in general the value produced by
+   Date.parse is implementation dependent when given any
+   string value that could not be produced in that
+   implementation by the toString or toGMTString method.
+
+   value                           tested in function:
+   Date.parse( x.toLocaleString()) test_tolocale()
+
+   Author:             christine@netscape.com
+   Date:               10 july 1997
+
+*/
+
+var VERSION = "ECMA_1";
+startTest();
+var SECTION = "15.9.4.2";
+var TITLE   = "Date.parse()";
+
+var TIME        = 0;
+var UTC_YEAR    = 1;
+var UTC_MONTH   = 2;
+var UTC_DATE    = 3;
+var UTC_DAY     = 4;
+var UTC_HOURS   = 5;
+var UTC_MINUTES = 6;
+var UTC_SECONDS = 7;
+var UTC_MS      = 8;
+
+var YEAR        = 9;
+var MONTH       = 10;
+var DATE        = 11;
+var DAY         = 12;
+var HOURS       = 13;
+var MINUTES     = 14;
+var SECONDS     = 15;
+var MS          = 16;
+var TYPEOF  = "object";
+
+//  for TCMS, the gTestcases array must be global.
+writeHeaderToLog("15.9.4.2 Date.parse()" );
+
+// Dates around 1970
+
+addNewTestCase( new Date(0),
+		"new Date(0)",
+		[0,1970,0,1,4,0,0,0,0,1969,11,31,3,16,0,0,0] );
+
+addNewTestCase( new Date(-1),
+		"new Date(-1)",
+		[-1,1969,11,31,3,23,59,59,999,1969,11,31,3,15,59,59,999] );
+addNewTestCase( new Date(28799999),
+		"new Date(28799999)",
+		[28799999,1970,0,1,4,7,59,59,999,1969,11,31,3,23,59,59,999] );
+addNewTestCase( new Date(28800000),
+		"new Date(28800000)",
+		[28800000,1970,0,1,4,8,0,0,0,1970,0,1,4,0,0,0,0] );
+
+// Dates around 2000
+
+addNewTestCase( new Date(946684799999),
+		"new Date(946684799999)",
+		[946684799999,1999,11,31,5,23,59,59,999,1999,11,31,5,15,59,59,999] );
+addNewTestCase( new Date(946713599999),
+		"new Date(946713599999)",
+		[946713599999,2000,0,1,6,7,59,59,999,1999,11,31,5,23,59,59,999] );
+addNewTestCase( new Date(946684800000),
+		"new Date(946684800000)",
+		[946684800000,2000,0,1,6,0,0,0,0,1999,11,31,5, 16,0,0,0] );
+addNewTestCase( new Date(946713600000),
+		"new Date(946713600000)",
+		[946713600000,2000,0,1,6,8,0,0,0,2000,0,1,6,0,0,0,0] );
+
+// Dates around 1900
+
+addNewTestCase( new Date(-2208988800000),
+		"new Date(-2208988800000)",
+		[-2208988800000,1900,0,1,1,0,0,0,0,1899,11,31,0,16,0,0,0] );
+
+addNewTestCase( new Date(-2208988800001),
+		"new Date(-2208988800001)",
+		[-2208988800001,1899,11,31,0,23,59,59,999,1899,11,31,0,15,59,59,999] );
+
+addNewTestCase( new Date(-2208960000001),
+		"new Date(-2208960000001)",
+		[-2208960000001,1900,0,1,1,7,59,59,0,1899,11,31,0,23,59,59,999] );
+addNewTestCase( new Date(-2208960000000),
+		"new Date(-2208960000000)",
+		[-2208960000000,1900,0,1,1,8,0,0,0,1900,0,1,1,0,0,0,0] );
+addNewTestCase( new Date(-2208959999999),
+		"new Date(-2208959999999)",
+		[-2208959999999,1900,0,1,1,8,0,0,1,1900,0,1,1,0,0,0,1] );
+
+// Dates around Feb 29, 2000
+
+var PST_FEB_29_2000 = UTC_FEB_29_2000 + 8*msPerHour;
+
+addNewTestCase( new Date(UTC_FEB_29_2000),
+		"new Date(" + UTC_FEB_29_2000 +")",
+		[UTC_FEB_29_2000,2000,0,1,6,0,0,0,0,1999,11,31,5,16,0,0,0] );
+addNewTestCase( new Date(PST_FEB_29_2000),
+		"new Date(" + PST_FEB_29_2000 +")",
+		[PST_FEB_29_2000,2000,0,1,6,8.0,0,0,2000,0,1,6,0,0,0,0]);
+
+// Dates around Jan 1 2005
+
+var PST_JAN_1_2005 = UTC_JAN_1_2005 + 8*msPerHour;
+
+addNewTestCase( new Date(UTC_JAN_1_2005),
+		"new Date("+ UTC_JAN_1_2005 +")",
+		[UTC_JAN_1_2005,2005,0,1,6,0,0,0,0,2004,11,31,5,16,0,0,0] );
+addNewTestCase( new Date(PST_JAN_1_2005),
+		"new Date("+ PST_JAN_1_2005 +")",
+		[PST_JAN_1_2005,2005,0,1,6,8,0,0,0,2005,0,1,6,0,0,0,0] );
+
+
+test();
+
+function addNewTestCase( DateCase, DateString, ResultArray ) {
+  DateCase = DateCase;
+
+  new TestCase( SECTION, DateString+".getTime()", ResultArray[TIME],       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()", ResultArray[TIME],       DateCase.valueOf() );
+  new TestCase( SECTION, "Date.parse(" + DateCase.toString() +")",    Math.floor(ResultArray[TIME]/1000)*1000,  Date.parse(DateCase.toString()) );
+  new TestCase( SECTION, "Date.parse(" + DateCase.toGMTString() +")", Math.floor(ResultArray[TIME]/1000)*1000,  Date.parse(DateCase.toGMTString()) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.4.3.js b/js/src/tests/ecma/Date/15.9.4.3.js
new file mode 100644
index 000000000..85abcf488
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.4.3.js
@@ -0,0 +1,151 @@
+/* -*- tab-width: 2; 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/. */
+
+
+var SECTION = "15.9.4.3";
+var TITLE = "Date.UTC( year, month, date, hours, minutes, seconds, ms )";
+
+// Dates around 1970
+
+addNewTestCase( Date.UTC( 1970,0,1,0,0,0,0),
+		"Date.UTC( 1970,0,1,0,0,0,0)",
+		utc(1970,0,1,0,0,0,0) );
+
+addNewTestCase( Date.UTC( 1969,11,31,23,59,59,999),
+		"Date.UTC( 1969,11,31,23,59,59,999)",
+		utc(1969,11,31,23,59,59,999) );
+addNewTestCase( Date.UTC( 1972,1,29,23,59,59,999),
+		"Date.UTC( 1972,1,29,23,59,59,999)",
+		utc(1972,1,29,23,59,59,999) );
+addNewTestCase( Date.UTC( 1972,2,1,23,59,59,999),
+		"Date.UTC( 1972,2,1,23,59,59,999)",
+		utc(1972,2,1,23,59,59,999) );
+addNewTestCase( Date.UTC( 1968,1,29,23,59,59,999),
+		"Date.UTC( 1968,1,29,23,59,59,999)",
+		utc(1968,1,29,23,59,59,999) );
+addNewTestCase( Date.UTC( 1968,2,1,23,59,59,999),
+		"Date.UTC( 1968,2,1,23,59,59,999)",
+		utc(1968,2,1,23,59,59,999) );
+addNewTestCase( Date.UTC( 1969,0,1,0,0,0,0),
+		"Date.UTC( 1969,0,1,0,0,0,0)",
+		utc(1969,0,1,0,0,0,0) );
+addNewTestCase( Date.UTC( 1969,11,31,23,59,59,1000),
+		"Date.UTC( 1969,11,31,23,59,59,1000)",
+		utc(1970,0,1,0,0,0,0) );
+addNewTestCase( Date.UTC( 1969,Number.NaN,31,23,59,59,999),
+		"Date.UTC( 1969,Number.NaN,31,23,59,59,999)",
+		utc(1969,Number.NaN,31,23,59,59,999) );
+
+// Dates around 2000
+
+addNewTestCase( Date.UTC( 1999,11,31,23,59,59,999),
+		"Date.UTC( 1999,11,31,23,59,59,999)",
+		utc(1999,11,31,23,59,59,999) );
+addNewTestCase( Date.UTC( 2000,0,1,0,0,0,0),
+		"Date.UTC( 2000,0,1,0,0,0,0)",
+		utc(2000,0,1,0,0,0,0) );
+
+// Dates around 1900
+addNewTestCase( Date.UTC( 1899,11,31,23,59,59,999),
+		"Date.UTC( 1899,11,31,23,59,59,999)",
+		utc(1899,11,31,23,59,59,999) );
+addNewTestCase( Date.UTC( 1900,0,1,0,0,0,0),
+		"Date.UTC( 1900,0,1,0,0,0,0)",
+		utc(1900,0,1,0,0,0,0) );
+addNewTestCase( Date.UTC( 1973,0,1,0,0,0,0),
+		"Date.UTC( 1973,0,1,0,0,0,0)",
+		utc(1973,0,1,0,0,0,0) );
+addNewTestCase( Date.UTC( 1776,6,4,12,36,13,111),
+		"Date.UTC( 1776,6,4,12,36,13,111)",
+		utc(1776,6,4,12,36,13,111) );
+addNewTestCase( Date.UTC( 2525,9,18,15,30,1,123),
+		"Date.UTC( 2525,9,18,15,30,1,123)",
+		utc(2525,9,18,15,30,1,123) );
+
+// Dates around 29 Feb 2000
+
+addNewTestCase( Date.UTC( 2000,1,29,0,0,0,0 ),
+		"Date.UTC( 2000,1,29,0,0,0,0 )",
+		utc(2000,1,29,0,0,0,0) );
+addNewTestCase( Date.UTC( 2000,1,29,8,0,0,0 ),
+		"Date.UTC( 2000,1,29,8,0,0,0 )",
+		utc(2000,1,29,8,0,0,0) );
+
+// Dates around 1 Jan 2005
+
+addNewTestCase( Date.UTC( 2005,0,1,0,0,0,0 ),
+		"Date.UTC( 2005,0,1,0,0,0,0 )",
+		utc(2005,0,1,0,0,0,0) );
+addNewTestCase( Date.UTC( 2004,11,31,16,0,0,0 ),
+		"Date.UTC( 2004,11,31,16,0,0,0 )",
+		utc(2004,11,31,16,0,0,0) );
+
+test();
+
+function addNewTestCase( DateCase, DateString, ExpectDate) {
+  DateCase = DateCase;
+
+  new TestCase( SECTION, DateString,         ExpectDate.value,       DateCase );
+  new TestCase( SECTION, DateString,         ExpectDate.value,       DateCase );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+
+function utc( year, month, date, hours, minutes, seconds, ms ) {
+  d = new MyDate();
+  d.year      = Number(year);
+
+  if (month)
+    d.month     = Number(month);
+  if (date)
+    d.date      = Number(date);
+  if (hours)
+    d.hours     = Number(hours);
+  if (minutes)
+    d.minutes   = Number(minutes);
+  if (seconds)
+    d.seconds   = Number(seconds);
+  if (ms)
+    d.ms        = Number(ms);
+
+  if ( isNaN(d.year) && 0 <= ToInteger(d.year) && d.year <= 99 ) {
+    d.year = 1900 + ToInteger(d.year);
+  }
+
+  if (isNaN(month) || isNaN(year) || isNaN(date) || isNaN(hours) ||
+      isNaN(minutes) || isNaN(seconds) || isNaN(ms) ) {
+    d.year = Number.NaN;
+    d.month = Number.NaN;
+    d.date = Number.NaN;
+    d.hours = Number.NaN;
+    d.minutes = Number.NaN;
+    d.seconds = Number.NaN;
+    d.ms = Number.NaN;
+    d.value = Number.NaN;
+    d.time = Number.NaN;
+    d.day =Number.NaN;
+    return d;
+  }
+
+  d.day = MakeDay( d.year, d.month, d.date );
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = (TimeClip( MakeDate(d.day,d.time)));
+
+  return d;
+}
+
+function UTCTime( t ) {
+  sign = ( t < 0 ) ? -1 : 1;
+  return ( (t +(TZ_DIFF*msPerHour)) );
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.5.1.js b/js/src/tests/ecma/Date/15.9.5.1.js
new file mode 100644
index 000000000..165637b58
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.1.js
@@ -0,0 +1,29 @@
+/* -*- tab-width: 2; 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:          15.9.5.1.js
+   ECMA Section:       15.9.5.1 Date.prototype.constructor
+   Description:
+   The initial value of Date.prototype.constructor is the built-in Date
+   constructor.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Date.prototype.constructor == Date",
+	      true,
+	      Date.prototype.constructor == Date );
+test();
diff --git a/js/src/tests/ecma/Date/15.9.5.10-1.js b/js/src/tests/ecma/Date/15.9.5.10-1.js
new file mode 100644
index 000000000..b4986599d
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-1.js
@@ -0,0 +1,51 @@
+/* -*- tab-width: 2; 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getDate()",
+	      NaN,
+	      (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getDate.length",
+	      0,
+	      Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-10.js b/js/src/tests/ecma/Date/15.9.5.10-10.js
new file mode 100644
index 000000000..a12c29c8e
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-10.js
@@ -0,0 +1,55 @@
+/* -*- tab-width: 2; 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// some daylight savings time cases
+
+var DST_START_1998 = GetDSTStart(TimeFromYear(1998));
+
+addTestCase( DST_START_1998+1 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getDate()",
+	      NaN,
+	      (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getDate.length",
+	      0,
+	      Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-11.js b/js/src/tests/ecma/Date/15.9.5.10-11.js
new file mode 100644
index 000000000..6dd84bd95
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-11.js
@@ -0,0 +1,55 @@
+/* -*- tab-width: 2; 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// some daylight savings time cases
+
+var DST_END_1998 = GetDSTEnd(TimeFromYear(1998));
+
+addTestCase( DST_END_1998 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getDate()",
+	      NaN,
+	      (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getDate.length",
+	      0,
+	      Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-12.js b/js/src/tests/ecma/Date/15.9.5.10-12.js
new file mode 100644
index 000000000..d572ea3ff
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-12.js
@@ -0,0 +1,55 @@
+/* -*- tab-width: 2; 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// some daylight savings time cases
+
+var DST_END_1998 = GetDSTEnd(TimeFromYear(1998));
+
+addTestCase( DST_END_1998-1 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getDate()",
+	      NaN,
+	      (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getDate.length",
+	      0,
+	      Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-13.js b/js/src/tests/ecma/Date/15.9.5.10-13.js
new file mode 100644
index 000000000..affe27e98
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-13.js
@@ -0,0 +1,55 @@
+/* -*- tab-width: 2; 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// some daylight savings time cases
+
+var DST_END_1998 = GetDSTEnd(TimeFromYear(1998));
+
+addTestCase( DST_END_1998+1 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getDate()",
+	      NaN,
+	      (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getDate.length",
+	      0,
+	      Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-2.js b/js/src/tests/ecma/Date/15.9.5.10-2.js
new file mode 100644
index 000000000..02a3c7030
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-2.js
@@ -0,0 +1,51 @@
+/* -*- 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_0000 );
+
+new TestCase( SECTION,
+              "(new Date(NaN)).getDate()",
+              NaN,
+              (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+              "Date.prototype.getDate.length",
+              0,
+              Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-3.js b/js/src/tests/ecma/Date/15.9.5.10-3.js
new file mode 100644
index 000000000..896b83e74
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-3.js
@@ -0,0 +1,51 @@
+/* -*- tab-width: 2; 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1970 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getDate()",
+	      NaN,
+	      (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getDate.length",
+	      0,
+	      Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-4.js b/js/src/tests/ecma/Date/15.9.5.10-4.js
new file mode 100644
index 000000000..030865f06
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-4.js
@@ -0,0 +1,51 @@
+/* -*- 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1900 );
+
+new TestCase( SECTION,
+              "(new Date(NaN)).getDate()",
+              NaN,
+              (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+              "Date.prototype.getDate.length",
+              0,
+              Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-5.js b/js/src/tests/ecma/Date/15.9.5.10-5.js
new file mode 100644
index 000000000..99e323a68
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-5.js
@@ -0,0 +1,51 @@
+/* -*- 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_2000 );
+
+new TestCase( SECTION,
+              "(new Date(NaN)).getDate()",
+              NaN,
+              (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+              "Date.prototype.getDate.length",
+              0,
+              Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-6.js b/js/src/tests/ecma/Date/15.9.5.10-6.js
new file mode 100644
index 000000000..c2c0da3f8
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-6.js
@@ -0,0 +1,51 @@
+/* -*- 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_FEB_29_2000 );
+
+new TestCase( SECTION,
+              "(new Date(NaN)).getDate()",
+              NaN,
+              (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+              "Date.prototype.getDate.length",
+              0,
+              Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-7.js b/js/src/tests/ecma/Date/15.9.5.10-7.js
new file mode 100644
index 000000000..57423d743
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-7.js
@@ -0,0 +1,51 @@
+/* -*- 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+              "(new Date(NaN)).getDate()",
+              NaN,
+              (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+              "Date.prototype.getDate.length",
+              0,
+              Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-8.js b/js/src/tests/ecma/Date/15.9.5.10-8.js
new file mode 100644
index 000000000..4c53da493
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-8.js
@@ -0,0 +1,55 @@
+/* -*- 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// some daylight savings time cases
+
+var DST_START_1998 = GetDSTStart(TimeFromYear(1998));
+
+addTestCase( DST_START_1998 );
+
+new TestCase( SECTION,
+              "(new Date(NaN)).getDate()",
+              NaN,
+              (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+              "Date.prototype.getDate.length",
+              0,
+              Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.10-9.js b/js/src/tests/ecma/Date/15.9.5.10-9.js
new file mode 100644
index 000000000..84e7f54b0
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.10-9.js
@@ -0,0 +1,55 @@
+/* -*- tab-width: 2; 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:          15.9.5.10.js
+   ECMA Section:       15.9.5.10
+   Description:        Date.prototype.getDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return DateFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// some daylight savings time cases
+
+var DST_START_1998 = GetDSTStart(TimeFromYear(1998));
+
+addTestCase( DST_START_1998-1 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getDate()",
+	      NaN,
+	      (new Date(NaN)).getDate() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getDate.length",
+	      0,
+	      Date.prototype.getDate.length );
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDate()",
+                  DateFromTime(LocalTime(d)),
+                  (new Date(d)).getDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.11-1.js b/js/src/tests/ecma/Date/15.9.5.11-1.js
new file mode 100644
index 000000000..5e0b98198
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.11-1.js
@@ -0,0 +1,42 @@
+/* -*- 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:          15.9.5.11.js
+   ECMA Section:       15.9.5.11
+   Description:        Date.prototype.getUTCDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   1.Return DateFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.11";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDate()",
+                  DateFromTime(d),
+                  (new Date(d)).getUTCDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.11-2.js b/js/src/tests/ecma/Date/15.9.5.11-2.js
new file mode 100644
index 000000000..87a5e0c36
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.11-2.js
@@ -0,0 +1,42 @@
+/* -*- 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:          15.9.5.11
+   ECMA Section:       15.9.5.11
+   Description:        Date.prototype.getUTCDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   1.Return DateFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.11";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_0000 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDate()",
+                  DateFromTime(d),
+                  (new Date(d)).getUTCDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.11-3.js b/js/src/tests/ecma/Date/15.9.5.11-3.js
new file mode 100644
index 000000000..4b7c5ba23
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.11-3.js
@@ -0,0 +1,42 @@
+/* -*- 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:          15.9.5.11.js
+   ECMA Section:       15.9.5.11
+   Description:        Date.prototype.getUTCDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   1.Return DateFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.11";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1970 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDate()",
+                  DateFromTime(d),
+                  (new Date(d)).getUTCDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.11-4.js b/js/src/tests/ecma/Date/15.9.5.11-4.js
new file mode 100644
index 000000000..4ea309249
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.11-4.js
@@ -0,0 +1,42 @@
+/* -*- 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:          15.9.5.11.js
+   ECMA Section:       15.9.5.11
+   Description:        Date.prototype.getUTCDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   1.Return DateFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.11";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1900 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDate()",
+                  DateFromTime(d),
+                  (new Date(d)).getUTCDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.11-5.js b/js/src/tests/ecma/Date/15.9.5.11-5.js
new file mode 100644
index 000000000..9d895effa
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.11-5.js
@@ -0,0 +1,42 @@
+/* -*- 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:          15.9.5.11.js
+   ECMA Section:       15.9.5.11
+   Description:        Date.prototype.getUTCDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   1.Return DateFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.11";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_2000 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDate()",
+                  DateFromTime(d),
+                  (new Date(d)).getUTCDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.11-6.js b/js/src/tests/ecma/Date/15.9.5.11-6.js
new file mode 100644
index 000000000..921929ca1
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.11-6.js
@@ -0,0 +1,42 @@
+/* -*- 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:          15.9.5.11.js
+   ECMA Section:       15.9.5.11
+   Description:        Date.prototype.getUTCDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   1.Return DateFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.11";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_FEB_29_2000 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDate()",
+                  DateFromTime(d),
+                  (new Date(d)).getUTCDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.11-7.js b/js/src/tests/ecma/Date/15.9.5.11-7.js
new file mode 100644
index 000000000..4b4e23acf
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.11-7.js
@@ -0,0 +1,42 @@
+/* -*- 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:          15.9.5.11.js
+   ECMA Section:       15.9.5.11
+   Description:        Date.prototype.getUTCDate
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   1.Return DateFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.11";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDate()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_JAN_1_2005 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDate()",
+                  DateFromTime(d),
+                  (new Date(d)).getUTCDate() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.12-1.js b/js/src/tests/ecma/Date/15.9.5.12-1.js
new file mode 100644
index 000000000..a6b07e18c
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.12-1.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15.9.5.12.js
+   ECMA Section:       15.9.5.12
+   Description:        Date.prototype.getDay
+
+
+   1.   Let t be this time value.
+   2.   If t is NaN, return NaN.
+   3.   Return WeekDay(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.12";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDay()",
+                  WeekDay((LocalTime(d))),
+                  (new Date(d)).getDay() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.12-2.js b/js/src/tests/ecma/Date/15.9.5.12-2.js
new file mode 100644
index 000000000..9aabb985d
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.12-2.js
@@ -0,0 +1,44 @@
+// |reftest| skip-if(!xulRuntime.shell&&xulRuntime.OS=="Linux"&&xulRuntime.XPCOMABI.match(/x86_64/)) -- bug xxx crash
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          15.9.5.12.js
+   ECMA Section:       15.9.5.12
+   Description:        Date.prototype.getDay
+
+
+   1.   Let t be this time value.
+   2.   If t is NaN, return NaN.
+   3.   Return WeekDay(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.12";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_0000 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDay()",
+                  WeekDay((LocalTime(d))),
+                  (new Date(d)).getDay() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.12-3.js b/js/src/tests/ecma/Date/15.9.5.12-3.js
new file mode 100644
index 000000000..4d824e002
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.12-3.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15.9.5.12.js
+   ECMA Section:       15.9.5.12
+   Description:        Date.prototype.getDay
+
+
+   1.   Let t be this time value.
+   2.   If t is NaN, return NaN.
+   3.   Return WeekDay(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.12";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1970 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDay()",
+                  WeekDay((LocalTime(d))),
+                  (new Date(d)).getDay() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.12-4.js b/js/src/tests/ecma/Date/15.9.5.12-4.js
new file mode 100644
index 000000000..93440fe70
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.12-4.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15.9.5.12.js
+   ECMA Section:       15.9.5.12
+   Description:        Date.prototype.getDay
+
+
+   1.   Let t be this time value.
+   2.   If t is NaN, return NaN.
+   3.   Return WeekDay(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.12";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1900 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDay()",
+                  WeekDay((LocalTime(d))),
+                  (new Date(d)).getDay() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.12-5.js b/js/src/tests/ecma/Date/15.9.5.12-5.js
new file mode 100644
index 000000000..2a8cd9842
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.12-5.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15.9.5.12.js
+   ECMA Section:       15.9.5.12
+   Description:        Date.prototype.getDay
+
+
+   1.   Let t be this time value.
+   2.   If t is NaN, return NaN.
+   3.   Return WeekDay(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.12";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_2000 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDay()",
+                  WeekDay((LocalTime(d))),
+                  (new Date(d)).getDay() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.12-6.js b/js/src/tests/ecma/Date/15.9.5.12-6.js
new file mode 100644
index 000000000..4f2b270a5
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.12-6.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15.9.5.12.js
+   ECMA Section:       15.9.5.12
+   Description:        Date.prototype.getDay
+
+
+   1.   Let t be this time value.
+   2.   If t is NaN, return NaN.
+   3.   Return WeekDay(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.12";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_FEB_29_2000 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDay()",
+                  WeekDay((LocalTime(d))),
+                  (new Date(d)).getDay() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.12-7.js b/js/src/tests/ecma/Date/15.9.5.12-7.js
new file mode 100644
index 000000000..7a0196a95
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.12-7.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15.9.5.12.js
+   ECMA Section:       15.9.5.12
+   Description:        Date.prototype.getDay
+
+
+   1.   Let t be this time value.
+   2.   If t is NaN, return NaN.
+   3.   Return WeekDay(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.12";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_JAN_1_2005 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getDay()",
+                  WeekDay((LocalTime(d))),
+                  (new Date(d)).getDay() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.12-8.js b/js/src/tests/ecma/Date/15.9.5.12-8.js
new file mode 100644
index 000000000..f832958ea
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.12-8.js
@@ -0,0 +1,37 @@
+/* -*- tab-width: 2; 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:          15.9.5.12
+   ECMA Section:       15.9.5.12
+   Description:        Date.prototype.getDay
+
+
+   1.   Let t be this time value.
+   2.   If t is NaN, return NaN.
+   3.   Return WeekDay(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.12";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getDay()",
+	      NaN,
+	      (new Date(NaN)).getDay() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getDay.length",
+	      0,
+	      Date.prototype.getDay.length );
+test();
diff --git a/js/src/tests/ecma/Date/15.9.5.13-1.js b/js/src/tests/ecma/Date/15.9.5.13-1.js
new file mode 100644
index 000000000..2fa44698d
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.13-1.js
@@ -0,0 +1,45 @@
+/* -*- 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:          15.9.5.13.js
+   ECMA Section:       15.9.5.13
+   Description:        Date.prototype.getUTCDay
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return WeekDay(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.13";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// get the current time
+var now = (new Date()).valueOf();
+
+addTestCase( now );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDay()",
+                  WeekDay((d)),
+                  (new Date(d)).getUTCDay() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.13-2.js b/js/src/tests/ecma/Date/15.9.5.13-2.js
new file mode 100644
index 000000000..02eca4ea2
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.13-2.js
@@ -0,0 +1,42 @@
+/* -*- 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:          15.9.5.13
+   ECMA Section:       15.9.5.13
+   Description:        Date.prototype.getUTCDay
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return WeekDay(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.13";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_0000 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDay()",
+                  WeekDay((d)),
+                  (new Date(d)).getUTCDay() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.13-3.js b/js/src/tests/ecma/Date/15.9.5.13-3.js
new file mode 100644
index 000000000..9370ceefc
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.13-3.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15.9.5.13.js
+   ECMA Section:       15.9.5.13
+   Description:        Date.prototype.getUTCDay
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return WeekDay(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.13";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1970 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDay()",
+                  WeekDay((d)),
+                  (new Date(d)).getUTCDay() );
+  }
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.5.13-4.js b/js/src/tests/ecma/Date/15.9.5.13-4.js
new file mode 100644
index 000000000..211f502fe
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.13-4.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15.9.5.13.js
+   ECMA Section:       15.9.5.13
+   Description:        Date.prototype.getUTCDay
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return WeekDay(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.13";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1900 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDay()",
+                  WeekDay((d)),
+                  (new Date(d)).getUTCDay() );
+  }
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.5.13-5.js b/js/src/tests/ecma/Date/15.9.5.13-5.js
new file mode 100644
index 000000000..d68e5b38e
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.13-5.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15.9.5.13.js
+   ECMA Section:       15.9.5.13
+   Description:        Date.prototype.getUTCDay
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return WeekDay(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.13";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_2000 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDay()",
+                  WeekDay((d)),
+                  (new Date(d)).getUTCDay() );
+  }
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.5.13-6.js b/js/src/tests/ecma/Date/15.9.5.13-6.js
new file mode 100644
index 000000000..34393527f
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.13-6.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15.9.5.13.js
+   ECMA Section:       15.9.5.13
+   Description:        Date.prototype.getUTCDay
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return WeekDay(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.13";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_FEB_29_2000 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDay()",
+                  WeekDay((d)),
+                  (new Date(d)).getUTCDay() );
+  }
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.5.13-7.js b/js/src/tests/ecma/Date/15.9.5.13-7.js
new file mode 100644
index 000000000..34c5d6b37
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.13-7.js
@@ -0,0 +1,42 @@
+/* -*- 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:          15.9.5.13.js
+   ECMA Section:       15.9.5.13
+   Description:        Date.prototype.getUTCDay
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return WeekDay(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.13";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_JAN_1_2005 );
+
+test();
+
+function addTestCase( t ) {
+  var start = TimeFromYear(YearFromTime(t));
+  var stop  = TimeFromYear(YearFromTime(t) + 1);
+
+  for (var d = start; d < stop; d += msPerDay)
+  {
+    new TestCase( SECTION,
+                  "(new Date("+d+")).getUTCDay()",
+                  WeekDay((d)),
+                  (new Date(d)).getUTCDay() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.13-8.js b/js/src/tests/ecma/Date/15.9.5.13-8.js
new file mode 100644
index 000000000..a73bd8e0c
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.13-8.js
@@ -0,0 +1,37 @@
+/* -*- 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:          15.9.5.13.js
+   ECMA Section:       15.9.5.13
+   Description:        Date.prototype.getUTCDay
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return WeekDay(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.13";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCDay()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+              "(new Date(NaN)).getUTCDay()",
+              NaN,
+              (new Date(NaN)).getUTCDay() );
+
+new TestCase( SECTION,
+              "Date.prototype.getUTCDay.length",
+              0,
+              Date.prototype.getUTCDay.length );
+
+test();
diff --git a/js/src/tests/ecma/Date/15.9.5.14.js b/js/src/tests/ecma/Date/15.9.5.14.js
new file mode 100644
index 000000000..65acda91d
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.14.js
@@ -0,0 +1,54 @@
+// |reftest| random
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          15.9.5.14.js
+   ECMA Section:       15.9.5.14
+   Description:        Date.prototype.getHours
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return HourFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.14";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getHours()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getHours()",
+	      NaN,
+	      (new Date(NaN)).getHours() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getHours.length",
+	      0,
+	      Date.prototype.getHours.length );
+test();
+
+function addTestCase( t ) {
+  for ( h = 0; h < 24; h+=4 ) {
+    t += msPerHour;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getHours()",
+		  HourFromTime((LocalTime(t))),
+		  (new Date(t)).getHours() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.15.js b/js/src/tests/ecma/Date/15.9.5.15.js
new file mode 100644
index 000000000..c32d815f7
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.15.js
@@ -0,0 +1,54 @@
+/* -*- tab-width: 2; 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:          15.9.5.15.js
+   ECMA Section:       15.9.5.15
+   Description:        Date.prototype.getUTCHours
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return HourFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.15";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCHours()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getUTCHours()",
+	      NaN,
+	      (new Date(NaN)).getUTCHours() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getUTCHours.length",
+	      0,
+	      Date.prototype.getUTCHours.length );
+test();
+
+function addTestCase( t ) {
+  for ( h = 0; h < 24; h+=3 ) {
+    t += msPerHour;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getUTCHours()",
+		  HourFromTime((t)),
+		  (new Date(t)).getUTCHours() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.16.js b/js/src/tests/ecma/Date/15.9.5.16.js
new file mode 100644
index 000000000..6168aac7f
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.16.js
@@ -0,0 +1,54 @@
+// |reftest| skip-if(!xulRuntime.shell&&xulRuntime.OS=="Linux"&&xulRuntime.XPCOMABI.match(/x86_64/)) -- bug xxx crash
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          15.9.5.16.js
+   ECMA Section:       15.9.5.16
+   Description:        Date.prototype.getMinutes
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return MinFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.16";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getMinutes()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getMinutes()",
+	      NaN,
+	      (new Date(NaN)).getMinutes() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getMinutes.length",
+	      0,
+	      Date.prototype.getMinutes.length );
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 60; m+=10 ) {
+    t += msPerMinute;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getMinutes()",
+		  MinFromTime((LocalTime(t))),
+		  (new Date(t)).getMinutes() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.17.js b/js/src/tests/ecma/Date/15.9.5.17.js
new file mode 100644
index 000000000..de10f047b
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.17.js
@@ -0,0 +1,54 @@
+/* -*- tab-width: 2; 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:          15.9.5.17.js
+   ECMA Section:       15.9.5.17
+   Description:        Date.prototype.getUTCMinutes
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return MinFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.17";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCMinutes()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getUTCMinutes()",
+	      NaN,
+	      (new Date(NaN)).getUTCMinutes() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getUTCMinutes.length",
+	      0,
+	      Date.prototype.getUTCMinutes.length );
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 60; m+=10 ) {
+    t += msPerMinute;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getUTCMinutes()",
+		  MinFromTime(t),
+		  (new Date(t)).getUTCMinutes() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.18.js b/js/src/tests/ecma/Date/15.9.5.18.js
new file mode 100644
index 000000000..7ed3c0c7f
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.18.js
@@ -0,0 +1,54 @@
+/* -*- tab-width: 2; 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:          15.9.5.18.js
+   ECMA Section:       15.9.5.18
+   Description:        Date.prototype.getSeconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return SecFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.18";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getSeconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getSeconds()",
+	      NaN,
+	      (new Date(NaN)).getSeconds() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getSeconds.length",
+	      0,
+	      Date.prototype.getSeconds.length );
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 60; m+=10 ) {
+    t += 1000;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getSeconds()",
+		  SecFromTime(LocalTime(t)),
+		  (new Date(t)).getSeconds() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.19.js b/js/src/tests/ecma/Date/15.9.5.19.js
new file mode 100644
index 000000000..3dae49f97
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.19.js
@@ -0,0 +1,54 @@
+/* -*- tab-width: 2; 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:          15.9.5.19.js
+   ECMA Section:       15.9.5.19
+   Description:        Date.prototype.getUTCSeconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return SecFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.19";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCSeconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getUTCSeconds()",
+	      NaN,
+	      (new Date(NaN)).getUTCSeconds() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getUTCSeconds.length",
+	      0,
+	      Date.prototype.getUTCSeconds.length );
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 60; m+=10 ) {
+    t += 1000;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getUTCSeconds()",
+		  SecFromTime(t),
+		  (new Date(t)).getUTCSeconds() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.2-1.js b/js/src/tests/ecma/Date/15.9.5.2-1.js
new file mode 100644
index 000000000..71c3568d0
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.2-1.js
@@ -0,0 +1,117 @@
+/* -*- tab-width: 2; 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:          15.9.5.2.js
+   ECMA Section:       15.9.5.2 Date.prototype.toString
+   Description:
+   This function returns a string value. The contents of the string are
+   implementation dependent, but are intended to represent the Date in a
+   convenient, human-readable form in the current time zone.
+
+   The toString function is not generic; it generates a runtime error if its
+   this value is not a Date object. Therefore it cannot be transferred to
+   other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.toString";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Date.prototype.toString.length",
+	      0,
+	      Date.prototype.toString.length );
+
+var now = new Date();
+
+// can't test the content of the string, but can verify that the string is
+// parsable by Date.parse
+
+new TestCase( SECTION,
+	      "Math.abs(Date.parse(now.toString()) - now.valueOf()) < 1000",
+	      true,
+	      Math.abs(Date.parse(now.toString()) - now.valueOf()) < 1000 );
+
+new TestCase( SECTION,
+	      "typeof now.toString()",
+	      "string",
+	      typeof now.toString() );
+// 1970
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date(0)).toString() )",
+	      0,
+	      Date.parse( (new Date(0)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+TZ_ADJUST+")).toString() )",
+	      TZ_ADJUST,
+	      Date.parse( (new Date(TZ_ADJUST)).toString() ) );
+
+// 1900
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+TIME_1900+")).toString() )",
+	      TIME_1900,
+	      Date.parse( (new Date(TIME_1900)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+TIME_1900 -TZ_ADJUST+")).toString() )",
+	      TIME_1900 -TZ_ADJUST,
+	      Date.parse( (new Date(TIME_1900 -TZ_ADJUST)).toString() ) );
+
+// 2000
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+TIME_2000+")).toString() )",
+	      TIME_2000,
+	      Date.parse( (new Date(TIME_2000)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+TIME_2000 -TZ_ADJUST+")).toString() )",
+	      TIME_2000 -TZ_ADJUST,
+	      Date.parse( (new Date(TIME_2000 -TZ_ADJUST)).toString() ) );
+
+// 29 Feb 2000
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+UTC_FEB_29_2000+")).toString() )",
+	      UTC_FEB_29_2000,
+	      Date.parse( (new Date(UTC_FEB_29_2000)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+(UTC_FEB_29_2000-1000)+")).toString() )",
+	      UTC_FEB_29_2000-1000,
+	      Date.parse( (new Date(UTC_FEB_29_2000-1000)).toString() ) );
+
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+(UTC_FEB_29_2000-TZ_ADJUST)+")).toString() )",
+	      UTC_FEB_29_2000-TZ_ADJUST,
+	      Date.parse( (new Date(UTC_FEB_29_2000-TZ_ADJUST)).toString() ) );
+// 2O05
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+UTC_JAN_1_2005+")).toString() )",
+	      UTC_JAN_1_2005,
+	      Date.parse( (new Date(UTC_JAN_1_2005)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+(UTC_JAN_1_2005-1000)+")).toString() )",
+	      UTC_JAN_1_2005-1000,
+	      Date.parse( (new Date(UTC_JAN_1_2005-1000)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+(UTC_JAN_1_2005-TZ_ADJUST)+")).toString() )",
+	      UTC_JAN_1_2005-TZ_ADJUST,
+	      Date.parse( (new Date(UTC_JAN_1_2005-TZ_ADJUST)).toString() ) );
+
+test();
diff --git a/js/src/tests/ecma/Date/15.9.5.2.js b/js/src/tests/ecma/Date/15.9.5.2.js
new file mode 100644
index 000000000..71c3568d0
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.2.js
@@ -0,0 +1,117 @@
+/* -*- tab-width: 2; 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:          15.9.5.2.js
+   ECMA Section:       15.9.5.2 Date.prototype.toString
+   Description:
+   This function returns a string value. The contents of the string are
+   implementation dependent, but are intended to represent the Date in a
+   convenient, human-readable form in the current time zone.
+
+   The toString function is not generic; it generates a runtime error if its
+   this value is not a Date object. Therefore it cannot be transferred to
+   other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.toString";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Date.prototype.toString.length",
+	      0,
+	      Date.prototype.toString.length );
+
+var now = new Date();
+
+// can't test the content of the string, but can verify that the string is
+// parsable by Date.parse
+
+new TestCase( SECTION,
+	      "Math.abs(Date.parse(now.toString()) - now.valueOf()) < 1000",
+	      true,
+	      Math.abs(Date.parse(now.toString()) - now.valueOf()) < 1000 );
+
+new TestCase( SECTION,
+	      "typeof now.toString()",
+	      "string",
+	      typeof now.toString() );
+// 1970
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date(0)).toString() )",
+	      0,
+	      Date.parse( (new Date(0)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+TZ_ADJUST+")).toString() )",
+	      TZ_ADJUST,
+	      Date.parse( (new Date(TZ_ADJUST)).toString() ) );
+
+// 1900
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+TIME_1900+")).toString() )",
+	      TIME_1900,
+	      Date.parse( (new Date(TIME_1900)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+TIME_1900 -TZ_ADJUST+")).toString() )",
+	      TIME_1900 -TZ_ADJUST,
+	      Date.parse( (new Date(TIME_1900 -TZ_ADJUST)).toString() ) );
+
+// 2000
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+TIME_2000+")).toString() )",
+	      TIME_2000,
+	      Date.parse( (new Date(TIME_2000)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+TIME_2000 -TZ_ADJUST+")).toString() )",
+	      TIME_2000 -TZ_ADJUST,
+	      Date.parse( (new Date(TIME_2000 -TZ_ADJUST)).toString() ) );
+
+// 29 Feb 2000
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+UTC_FEB_29_2000+")).toString() )",
+	      UTC_FEB_29_2000,
+	      Date.parse( (new Date(UTC_FEB_29_2000)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+(UTC_FEB_29_2000-1000)+")).toString() )",
+	      UTC_FEB_29_2000-1000,
+	      Date.parse( (new Date(UTC_FEB_29_2000-1000)).toString() ) );
+
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+(UTC_FEB_29_2000-TZ_ADJUST)+")).toString() )",
+	      UTC_FEB_29_2000-TZ_ADJUST,
+	      Date.parse( (new Date(UTC_FEB_29_2000-TZ_ADJUST)).toString() ) );
+// 2O05
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+UTC_JAN_1_2005+")).toString() )",
+	      UTC_JAN_1_2005,
+	      Date.parse( (new Date(UTC_JAN_1_2005)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+(UTC_JAN_1_2005-1000)+")).toString() )",
+	      UTC_JAN_1_2005-1000,
+	      Date.parse( (new Date(UTC_JAN_1_2005-1000)).toString() ) );
+
+new TestCase( SECTION,
+	      "Date.parse( (new Date("+(UTC_JAN_1_2005-TZ_ADJUST)+")).toString() )",
+	      UTC_JAN_1_2005-TZ_ADJUST,
+	      Date.parse( (new Date(UTC_JAN_1_2005-TZ_ADJUST)).toString() ) );
+
+test();
diff --git a/js/src/tests/ecma/Date/15.9.5.20.js b/js/src/tests/ecma/Date/15.9.5.20.js
new file mode 100644
index 000000000..07c0df789
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.20.js
@@ -0,0 +1,54 @@
+/* -*- tab-width: 2; 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:          15.9.5.20.js
+   ECMA Section:       15.9.5.20
+   Description:        Date.prototype.getMilliseconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return msFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.20";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getMilliseconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getMilliseconds()",
+	      NaN,
+	      (new Date(NaN)).getMilliseconds() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getMilliseconds.length",
+	      0,
+	      Date.prototype.getMilliseconds.length );
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 1000; m+=100 ) {
+    t++;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getMilliseconds()",
+		  msFromTime(LocalTime(t)),
+		  (new Date(t)).getMilliseconds() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.21-1.js b/js/src/tests/ecma/Date/15.9.5.21-1.js
new file mode 100644
index 000000000..d3e3730b1
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.21-1.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.9.5.21.js
+   ECMA Section:       15.9.5.21
+   Description:        Date.prototype.getUTCMilliseconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return msFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.21";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCMilliseconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+")).getUTCMilliseconds()",
+		msFromTime(t),
+		(new Date(t)).getUTCMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.21-2.js b/js/src/tests/ecma/Date/15.9.5.21-2.js
new file mode 100644
index 000000000..89aabb0b7
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.21-2.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.9.5.21.js
+   ECMA Section:       15.9.5.21
+   Description:        Date.prototype.getUTCMilliseconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return msFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.21";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCMilliseconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_0000 );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+")).getUTCMilliseconds()",
+		msFromTime(t),
+		(new Date(t)).getUTCMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.21-3.js b/js/src/tests/ecma/Date/15.9.5.21-3.js
new file mode 100644
index 000000000..7df5193ba
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.21-3.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.9.5.21.js
+   ECMA Section:       15.9.5.21
+   Description:        Date.prototype.getUTCMilliseconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return msFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.21";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCMilliseconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1970 );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+")).getUTCMilliseconds()",
+		msFromTime(t),
+		(new Date(t)).getUTCMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.21-4.js b/js/src/tests/ecma/Date/15.9.5.21-4.js
new file mode 100644
index 000000000..1d07d04d5
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.21-4.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.9.5.21.js
+   ECMA Section:       15.9.5.21
+   Description:        Date.prototype.getUTCMilliseconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return msFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.21";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCMilliseconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1900 );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+")).getUTCMilliseconds()",
+		msFromTime(t),
+		(new Date(t)).getUTCMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.21-5.js b/js/src/tests/ecma/Date/15.9.5.21-5.js
new file mode 100644
index 000000000..e4c1874b3
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.21-5.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.9.5.21.js
+   ECMA Section:       15.9.5.21
+   Description:        Date.prototype.getUTCMilliseconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return msFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.21";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCMilliseconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_2000 );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+")).getUTCMilliseconds()",
+		msFromTime(t),
+		(new Date(t)).getUTCMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.21-6.js b/js/src/tests/ecma/Date/15.9.5.21-6.js
new file mode 100644
index 000000000..0949dbfc0
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.21-6.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.9.5.21.js
+   ECMA Section:       15.9.5.21
+   Description:        Date.prototype.getUTCMilliseconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return msFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.21";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCMilliseconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_FEB_29_2000 );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+")).getUTCMilliseconds()",
+		msFromTime(t),
+		(new Date(t)).getUTCMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.21-7.js b/js/src/tests/ecma/Date/15.9.5.21-7.js
new file mode 100644
index 000000000..7998231fb
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.21-7.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.9.5.21.js
+   ECMA Section:       15.9.5.21
+   Description:        Date.prototype.getUTCMilliseconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return msFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.21";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCMilliseconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_JAN_1_2005 );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+")).getUTCMilliseconds()",
+		msFromTime(t),
+		(new Date(t)).getUTCMilliseconds() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.21-8.js b/js/src/tests/ecma/Date/15.9.5.21-8.js
new file mode 100644
index 000000000..6f5218c49
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.21-8.js
@@ -0,0 +1,37 @@
+/* -*- tab-width: 2; 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:          15.9.5.21.js
+   ECMA Section:       15.9.5.21
+   Description:        Date.prototype.getUTCMilliseconds
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return msFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.21";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCMilliseconds()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getUTCMilliseconds()",
+	      NaN,
+	      (new Date(NaN)).getUTCMilliseconds() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getUTCMilliseconds.length",
+	      0,
+	      Date.prototype.getUTCMilliseconds.length );
+test();
+
diff --git a/js/src/tests/ecma/Date/15.9.5.22-1.js b/js/src/tests/ecma/Date/15.9.5.22-1.js
new file mode 100644
index 000000000..6286efcb6
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.22-1.js
@@ -0,0 +1,55 @@
+/* -*- tab-width: 2; 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:          15.9.5.22.js
+   ECMA Section:       15.9.5.22
+   Description:        Date.prototype.getTimezoneOffset
+
+   Returns the difference between local time and UTC time in minutes.
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return (t - LocalTime(t)) / msPerMinute.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.22";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getTimezoneOffset()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getTimezoneOffset()",
+	      NaN,
+	      (new Date(NaN)).getTimezoneOffset() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getTimezoneOffset.length",
+	      0,
+	      Date.prototype.getTimezoneOffset.length );
+
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 1000; m+=100 ) {
+    t++;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getTimezoneOffset()",
+		  (t - LocalTime(t)) / msPerMinute,
+		  (new Date(t)).getTimezoneOffset() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.22-2.js b/js/src/tests/ecma/Date/15.9.5.22-2.js
new file mode 100644
index 000000000..92fbc6fc6
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.22-2.js
@@ -0,0 +1,40 @@
+/* -*- tab-width: 2; 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:          15.9.5.22.js
+   ECMA Section:       15.9.5.22
+   Description:        Date.prototype.getTimezoneOffset
+
+   Returns the difference between local time and UTC time in minutes.
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return (t - LocalTime(t)) / msPerMinute.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.22";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getTimezoneOffset()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_0000 );
+
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 1000; m+=100 ) {
+    t++;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getTimezoneOffset()",
+		  (t - LocalTime(t)) / msPerMinute,
+		  (new Date(t)).getTimezoneOffset() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.22-3.js b/js/src/tests/ecma/Date/15.9.5.22-3.js
new file mode 100644
index 000000000..f56b01788
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.22-3.js
@@ -0,0 +1,40 @@
+/* -*- tab-width: 2; 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:          15.9.5.22.js
+   ECMA Section:       15.9.5.22
+   Description:        Date.prototype.getTimezoneOffset
+
+   Returns the difference between local time and UTC time in minutes.
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return (t - LocalTime(t)) / msPerMinute.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.22";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getTimezoneOffset()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1970 );
+
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 1000; m+=100 ) {
+    t++;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getTimezoneOffset()",
+		  (t - LocalTime(t)) / msPerMinute,
+		  (new Date(t)).getTimezoneOffset() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.22-4.js b/js/src/tests/ecma/Date/15.9.5.22-4.js
new file mode 100644
index 000000000..dba2ade9f
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.22-4.js
@@ -0,0 +1,40 @@
+/* -*- tab-width: 2; 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:          15.9.5.22.js
+   ECMA Section:       15.9.5.22
+   Description:        Date.prototype.getTimezoneOffset
+
+   Returns the difference between local time and UTC time in minutes.
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return (t - LocalTime(t)) / msPerMinute.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.22";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getTimezoneOffset()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_1900 );
+
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 1000; m+=100 ) {
+    t++;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getTimezoneOffset()",
+		  (t - LocalTime(t)) / msPerMinute,
+		  (new Date(t)).getTimezoneOffset() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.22-5.js b/js/src/tests/ecma/Date/15.9.5.22-5.js
new file mode 100644
index 000000000..5b087fef8
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.22-5.js
@@ -0,0 +1,40 @@
+/* -*- tab-width: 2; 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:          15.9.5.22.js
+   ECMA Section:       15.9.5.22
+   Description:        Date.prototype.getTimezoneOffset
+
+   Returns the difference between local time and UTC time in minutes.
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return (t - LocalTime(t)) / msPerMinute.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.22";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getTimezoneOffset()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_2000 );
+
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 1000; m+=100 ) {
+    t++;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getTimezoneOffset()",
+		  (t - LocalTime(t)) / msPerMinute,
+		  (new Date(t)).getTimezoneOffset() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.22-6.js b/js/src/tests/ecma/Date/15.9.5.22-6.js
new file mode 100644
index 000000000..65cd5808c
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.22-6.js
@@ -0,0 +1,40 @@
+/* -*- tab-width: 2; 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:          15.9.5.22.js
+   ECMA Section:       15.9.5.22
+   Description:        Date.prototype.getTimezoneOffset
+
+   Returns the difference between local time and UTC time in minutes.
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return (t - LocalTime(t)) / msPerMinute.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.22";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getTimezoneOffset()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_FEB_29_2000 );
+
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 1000; m+=100 ) {
+    t++;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getTimezoneOffset()",
+		  (t - LocalTime(t)) / msPerMinute,
+		  (new Date(t)).getTimezoneOffset() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.22-7.js b/js/src/tests/ecma/Date/15.9.5.22-7.js
new file mode 100644
index 000000000..e2c5dcd97
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.22-7.js
@@ -0,0 +1,40 @@
+/* -*- tab-width: 2; 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:          15.9.5.22.js
+   ECMA Section:       15.9.5.22
+   Description:        Date.prototype.getTimezoneOffset
+
+   Returns the difference between local time and UTC time in minutes.
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return (t - LocalTime(t)) / msPerMinute.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.22";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getTimezoneOffset()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( UTC_JAN_1_2005 );
+
+test();
+
+function addTestCase( t ) {
+  for ( m = 0; m <= 1000; m+=100 ) {
+    t++;
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getTimezoneOffset()",
+		  (t - LocalTime(t)) / msPerMinute,
+		  (new Date(t)).getTimezoneOffset() );
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.22-8.js b/js/src/tests/ecma/Date/15.9.5.22-8.js
new file mode 100644
index 000000000..d12feca52
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.22-8.js
@@ -0,0 +1,38 @@
+/* -*- tab-width: 2; 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:          15.9.5.22.js
+   ECMA Section:       15.9.5.22
+   Description:        Date.prototype.getTimezoneOffset
+
+   Returns the difference between local time and UTC time in minutes.
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return (t - LocalTime(t)) / msPerMinute.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.22";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getTimezoneOffset()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getTimezoneOffset()",
+	      NaN,
+	      (new Date(NaN)).getTimezoneOffset() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getTimezoneOffset.length",
+	      0,
+	      Date.prototype.getTimezoneOffset.length );
+test();
+
diff --git a/js/src/tests/ecma/Date/15.9.5.23-1.js b/js/src/tests/ecma/Date/15.9.5.23-1.js
new file mode 100644
index 000000000..b9922f7fb
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-1.js
@@ -0,0 +1,105 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-1.js
+   ECMA Section:       15.9.5.23 Date.prototype.setTime(time)
+   Description:
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.9.5.23-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " Date.prototype.setTime(time)");
+
+var now = "now";
+addTestCase( 0, 0 );
+
+test();
+
+function addTestCase( startTime, setTime ) {
+  if ( startTime == "now" ) {
+    DateCase = new Date();
+  } else {
+    DateCase = new Date( startTime );
+  }
+
+  DateCase.setTime( setTime );
+  var DateString = "var d = new Date("+startTime+"); d.setTime("+setTime+"); d" ;
+  var UTCDate   = UTCDateFromTime ( Number(setTime) );
+  var LocalDate = LocalDateFromTime( Number(setTime) );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,      DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,      DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,       DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,      DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,       DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,        DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,      DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,    DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,    DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,         DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,     DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,    DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,     DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,      DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,    DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,  DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,  DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,       DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d       = new MyDate();
+  d.year      = YearFromTime(t);
+  d.month     = MonthFromTime(t);
+  d.date      = DateFromTime(t);
+  d.hours     = HourFromTime(t);
+  d.minutes   = MinFromTime(t);
+  d.seconds   = SecFromTime(t);
+  d.ms        = msFromTime(t);
+  d.time      = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value     = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day       = WeekDay( d.value );
+  return (d);
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.5.23-10.js b/js/src/tests/ecma/Date/15.9.5.23-10.js
new file mode 100644
index 000000000..3a44b25f5
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-10.js
@@ -0,0 +1,105 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-1.js
+   ECMA Section:       15.9.5.23 Date.prototype.setTime(time)
+   Description:
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.9.5.23-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " Date.prototype.setTime(time)");
+
+var now = "now";
+addTestCase( now, -2208988800000 );
+
+test();
+
+function addTestCase( startTime, setTime ) {
+  if ( startTime == "now" ) {
+    DateCase = new Date();
+  } else {
+    DateCase = new Date( startTime );
+  }
+
+  DateCase.setTime( setTime );
+  var DateString = "var d = new Date("+startTime+"); d.setTime("+setTime+"); d" ;
+  var UTCDate   = UTCDateFromTime ( Number(setTime) );
+  var LocalDate = LocalDateFromTime( Number(setTime) );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,      DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,      DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,       DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,      DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,       DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,        DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,      DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,    DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,    DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,         DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,     DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,    DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,     DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,      DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,    DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,  DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,  DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,       DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d       = new MyDate();
+  d.year      = YearFromTime(t);
+  d.month     = MonthFromTime(t);
+  d.date      = DateFromTime(t);
+  d.hours     = HourFromTime(t);
+  d.minutes   = MinFromTime(t);
+  d.seconds   = SecFromTime(t);
+  d.ms        = msFromTime(t);
+  d.time      = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value     = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day       = WeekDay( d.value );
+  return (d);
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.5.23-11.js b/js/src/tests/ecma/Date/15.9.5.23-11.js
new file mode 100644
index 000000000..b3e73eef2
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-11.js
@@ -0,0 +1,106 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-1.js
+   ECMA Section:       15.9.5.23 Date.prototype.setTime(time)
+   Description:
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.9.5.23-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " Date.prototype.setTime(time)");
+
+var now = "now";
+addTestCase( now, -86400000 );
+
+test();
+
+
+function addTestCase( startTime, setTime ) {
+  if ( startTime == "now" ) {
+    DateCase = new Date();
+  } else {
+    DateCase = new Date( startTime );
+  }
+
+  DateCase.setTime( setTime );
+  var DateString = "var d = new Date("+startTime+"); d.setTime("+setTime+"); d" ;
+  var UTCDate   = UTCDateFromTime ( Number(setTime) );
+  var LocalDate = LocalDateFromTime( Number(setTime) );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,      DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,      DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,       DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,      DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,       DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,        DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,      DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,    DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,    DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,         DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,     DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,    DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,     DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,      DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,    DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,  DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,  DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,       DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d       = new MyDate();
+  d.year      = YearFromTime(t);
+  d.month     = MonthFromTime(t);
+  d.date      = DateFromTime(t);
+  d.hours     = HourFromTime(t);
+  d.minutes   = MinFromTime(t);
+  d.seconds   = SecFromTime(t);
+  d.ms        = msFromTime(t);
+  d.time      = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value     = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day       = WeekDay( d.value );
+  return (d);
+}
+
+
diff --git a/js/src/tests/ecma/Date/15.9.5.23-12.js b/js/src/tests/ecma/Date/15.9.5.23-12.js
new file mode 100644
index 000000000..9bfcc39f3
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-12.js
@@ -0,0 +1,103 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-1.js
+   ECMA Section:       15.9.5.23 Date.prototype.setTime(time)
+   Description:
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.9.5.23-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " Date.prototype.setTime(time)");
+
+var now = "now";
+addTestCase( now, 946684800000 );
+
+test();
+
+function addTestCase( startTime, setTime ) {
+  if ( startTime == "now" ) {
+    DateCase = new Date();
+  } else {
+    DateCase = new Date( startTime );
+  }
+
+  DateCase.setTime( setTime );
+  var DateString = "var d = new Date("+startTime+"); d.setTime("+setTime+"); d" ;
+  var UTCDate   = UTCDateFromTime ( Number(setTime) );
+  var LocalDate = LocalDateFromTime( Number(setTime) );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,      DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,      DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,       DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,      DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,       DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,        DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,      DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,    DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,    DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,         DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,     DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,    DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,     DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,      DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,    DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,  DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,  DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,       DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d       = new MyDate();
+  d.year      = YearFromTime(t);
+  d.month     = MonthFromTime(t);
+  d.date      = DateFromTime(t);
+  d.hours     = HourFromTime(t);
+  d.minutes   = MinFromTime(t);
+  d.seconds   = SecFromTime(t);
+  d.ms        = msFromTime(t);
+  d.time      = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value     = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day       = WeekDay( d.value );
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-13.js b/js/src/tests/ecma/Date/15.9.5.23-13.js
new file mode 100644
index 000000000..1165a6f0a
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-13.js
@@ -0,0 +1,103 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-1.js
+   ECMA Section:       15.9.5.23 Date.prototype.setTime(time)
+   Description:
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.9.5.23-13";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " Date.prototype.setTime(time)");
+
+var now = "now";
+addTestCase( now, -2208988800000 );
+
+test();
+
+function addTestCase( startTime, setTime ) {
+  if ( startTime == "now" ) {
+    DateCase = new Date();
+  } else {
+    DateCase = new Date( startTime );
+  }
+
+  DateCase.setTime( setTime );
+  var DateString = "var d = new Date("+startTime+"); d.setTime("+setTime+"); d" ;
+  var UTCDate   = UTCDateFromTime ( Number(setTime) );
+  var LocalDate = LocalDateFromTime( Number(setTime) );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,      DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,      DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,       DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,      DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,       DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,        DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,      DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,    DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,    DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,         DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,     DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,    DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,     DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,      DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,    DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,  DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,  DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,       DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d       = new MyDate();
+  d.year      = YearFromTime(t);
+  d.month     = MonthFromTime(t);
+  d.date      = DateFromTime(t);
+  d.hours     = HourFromTime(t);
+  d.minutes   = MinFromTime(t);
+  d.seconds   = SecFromTime(t);
+  d.ms        = msFromTime(t);
+  d.time      = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value     = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day       = WeekDay( d.value );
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-14.js b/js/src/tests/ecma/Date/15.9.5.23-14.js
new file mode 100644
index 000000000..61f3842cb
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-14.js
@@ -0,0 +1,103 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-1.js
+   ECMA Section:       15.9.5.23 Date.prototype.setTime(time)
+   Description:
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.9.5.23-14";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " Date.prototype.setTime(time)");
+
+var now = "now";
+addTestCase( now, 946684800000 );
+
+test();
+
+function addTestCase( startTime, setTime ) {
+  if ( startTime == "now" ) {
+    DateCase = new Date();
+  } else {
+    DateCase = new Date( startTime );
+  }
+
+  DateCase.setTime( setTime );
+  var DateString = "var d = new Date("+startTime+"); d.setTime("+setTime+"); d" ;
+  var UTCDate   = UTCDateFromTime ( Number(setTime) );
+  var LocalDate = LocalDateFromTime( Number(setTime) );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,      DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,      DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,       DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,      DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,       DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,        DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,      DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,    DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,    DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,         DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,     DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,    DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,     DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,      DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,    DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,  DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,  DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,       DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d       = new MyDate();
+  d.year      = YearFromTime(t);
+  d.month     = MonthFromTime(t);
+  d.date      = DateFromTime(t);
+  d.hours     = HourFromTime(t);
+  d.minutes   = MinFromTime(t);
+  d.seconds   = SecFromTime(t);
+  d.ms        = msFromTime(t);
+  d.time      = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value     = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day       = WeekDay( d.value );
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-15.js b/js/src/tests/ecma/Date/15.9.5.23-15.js
new file mode 100644
index 000000000..58efd6c90
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-15.js
@@ -0,0 +1,103 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-1.js
+   ECMA Section:       15.9.5.23 Date.prototype.setTime(time)
+   Description:
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.9.5.23-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " Date.prototype.setTime(time)");
+
+var now = "now";
+addTestCase( now, 0 );
+
+test();
+
+function addTestCase( startTime, setTime ) {
+  if ( startTime == "now" ) {
+    DateCase = new Date();
+  } else {
+    DateCase = new Date( startTime );
+  }
+
+  DateCase.setTime( setTime );
+  var DateString = "var d = new Date("+startTime+"); d.setTime("+setTime+"); d" ;
+  var UTCDate   = UTCDateFromTime ( Number(setTime) );
+  var LocalDate = LocalDateFromTime( Number(setTime) );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,      DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,      DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,       DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,      DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,       DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,        DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,      DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,    DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,    DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,         DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,     DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,    DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,     DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,      DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,    DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,  DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,  DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,       DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d       = new MyDate();
+  d.year      = YearFromTime(t);
+  d.month     = MonthFromTime(t);
+  d.date      = DateFromTime(t);
+  d.hours     = HourFromTime(t);
+  d.minutes   = MinFromTime(t);
+  d.seconds   = SecFromTime(t);
+  d.ms        = msFromTime(t);
+  d.time      = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value     = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day       = WeekDay( d.value );
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-16.js b/js/src/tests/ecma/Date/15.9.5.23-16.js
new file mode 100644
index 000000000..fad28d3d6
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-16.js
@@ -0,0 +1,103 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-1.js
+   ECMA Section:       15.9.5.23 Date.prototype.setTime(time)
+   Description:
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.9.5.23-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " Date.prototype.setTime(time)");
+
+var now = "now";
+addTestCase( now, String( TIME_1900 ) );
+
+test();
+
+function addTestCase( startTime, setTime ) {
+  if ( startTime == "now" ) {
+    DateCase = new Date();
+  } else {
+    DateCase = new Date( startTime );
+  }
+
+  DateCase.setTime( setTime );
+  var DateString = "var d = new Date("+startTime+"); d.setTime("+setTime+"); d" ;
+  var UTCDate   = UTCDateFromTime ( Number(setTime) );
+  var LocalDate = LocalDateFromTime( Number(setTime) );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,      DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,      DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,       DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,      DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,       DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,        DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,      DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,    DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,    DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,         DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,     DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,    DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,     DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,      DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,    DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,  DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,  DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,       DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d       = new MyDate();
+  d.year      = YearFromTime(t);
+  d.month     = MonthFromTime(t);
+  d.date      = DateFromTime(t);
+  d.hours     = HourFromTime(t);
+  d.minutes   = MinFromTime(t);
+  d.seconds   = SecFromTime(t);
+  d.ms        = msFromTime(t);
+  d.time      = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value     = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day       = WeekDay( d.value );
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-17.js b/js/src/tests/ecma/Date/15.9.5.23-17.js
new file mode 100644
index 000000000..24e328af0
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-17.js
@@ -0,0 +1,103 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-1.js
+   ECMA Section:       15.9.5.23 Date.prototype.setTime(time)
+   Description:
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.9.5.23-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " Date.prototype.setTime(time)");
+
+var now = "now";
+addTestCase( now, String( TZ_DIFF* msPerHour ) );
+
+test();
+
+function addTestCase( startTime, setTime ) {
+  if ( startTime == "now" ) {
+    DateCase = new Date();
+  } else {
+    DateCase = new Date( startTime );
+  }
+
+  DateCase.setTime( setTime );
+  var DateString = "var d = new Date("+startTime+"); d.setTime("+setTime+"); d" ;
+  var UTCDate   = UTCDateFromTime ( Number(setTime) );
+  var LocalDate = LocalDateFromTime( Number(setTime) );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,      DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,      DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,       DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,      DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,       DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,        DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,      DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,    DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,    DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,         DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,     DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,    DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,     DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,      DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,    DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,  DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,  DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,       DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d       = new MyDate();
+  d.year      = YearFromTime(t);
+  d.month     = MonthFromTime(t);
+  d.date      = DateFromTime(t);
+  d.hours     = HourFromTime(t);
+  d.minutes   = MinFromTime(t);
+  d.seconds   = SecFromTime(t);
+  d.ms        = msFromTime(t);
+  d.time      = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value     = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day       = WeekDay( d.value );
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-18.js b/js/src/tests/ecma/Date/15.9.5.23-18.js
new file mode 100644
index 000000000..27523980e
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-18.js
@@ -0,0 +1,103 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-1.js
+   ECMA Section:       15.9.5.23 Date.prototype.setTime(time)
+   Description:
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.9.5.23-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " Date.prototype.setTime(time)");
+
+var now = "now";
+addTestCase( now, String( TIME_2000 ) );
+
+test();
+
+function addTestCase( startTime, setTime ) {
+  if ( startTime == "now" ) {
+    DateCase = new Date();
+  } else {
+    DateCase = new Date( startTime );
+  }
+
+  DateCase.setTime( setTime );
+  var DateString = "var d = new Date("+startTime+"); d.setTime("+setTime+"); d" ;
+  var UTCDate   = UTCDateFromTime ( Number(setTime) );
+  var LocalDate = LocalDateFromTime( Number(setTime) );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,      DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,      DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,       DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,      DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,       DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,        DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,      DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,    DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,    DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,         DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,     DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,    DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,     DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,      DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,    DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,  DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,  DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,       DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d       = new MyDate();
+  d.year      = YearFromTime(t);
+  d.month     = MonthFromTime(t);
+  d.date      = DateFromTime(t);
+  d.hours     = HourFromTime(t);
+  d.minutes   = MinFromTime(t);
+  d.seconds   = SecFromTime(t);
+  d.ms        = msFromTime(t);
+  d.time      = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value     = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day       = WeekDay( d.value );
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-2.js b/js/src/tests/ecma/Date/15.9.5.23-2.js
new file mode 100644
index 000000000..2204ef413
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-2.js
@@ -0,0 +1,75 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-2.js
+   ECMA Section:       15.9.5.23
+   Description:        Date.prototype.setTime
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.23-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+test_times = new Array( TIME_NOW, TIME_1970, TIME_1900, TIME_2000 );
+
+for ( var j = 0; j < test_times.length; j++ ) {
+  addTestCase( new Date(TIME_NOW), test_times[j] );
+}
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).setTime()",
+	      NaN,
+	      (new Date(NaN)).setTime() );
+
+new TestCase( SECTION,
+	      "Date.prototype.setTime.length",
+	      1,
+	      Date.prototype.setTime.length );
+test();
+
+function addTestCase( d, t ) {
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+t+")",
+		t,
+		d.setTime(t) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1.1)+")",
+		TimeClip(t+1.1),
+		d.setTime(t+1.1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1)+")",
+		t+1,
+		d.setTime(t+1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-1)+")",
+		t-1,
+		d.setTime(t-1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-TZ_ADJUST)+")",
+		t-TZ_ADJUST,
+		d.setTime(t-TZ_ADJUST) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+TZ_ADJUST)+")",
+		t+TZ_ADJUST,
+		d.setTime(t+TZ_ADJUST) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-3-n.js b/js/src/tests/ecma/Date/15.9.5.23-3-n.js
new file mode 100644
index 000000000..e395c8e10
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-3-n.js
@@ -0,0 +1,45 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-3-n.js
+   ECMA Section:       15.9.5.23
+   Description:        Date.prototype.setTime
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.23-3-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var MYDATE = new MyDate(TIME_1970);
+
+DESCRIPTION = "MYDATE.setTime(TIME_2000)";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "MYDATE.setTime(TIME_2000)",
+	      "error",
+	      eval("MYDATE.setTime(TIME_2000)") );
+
+test();
+
+function MyDate(value) {
+  this.value = value;
+  this.setTime = Date.prototype.setTime;
+  return this;
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-4.js b/js/src/tests/ecma/Date/15.9.5.23-4.js
new file mode 100644
index 000000000..824f033ed
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-4.js
@@ -0,0 +1,78 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-2.js
+   ECMA Section:       15.9.5.23
+   Description:        Date.prototype.setTime
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.23-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+test_times = new Array( TIME_NOW, TIME_0000, TIME_1970, TIME_1900, TIME_2000,
+			UTC_FEB_29_2000, UTC_JAN_1_2005 );
+
+
+for ( var j = 0; j < test_times.length; j++ ) {
+  addTestCase( new Date(TIME_0000), test_times[j] );
+}
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).setTime()",
+	      NaN,
+	      (new Date(NaN)).setTime() );
+
+new TestCase( SECTION,
+	      "Date.prototype.setTime.length",
+	      1,
+	      Date.prototype.setTime.length );
+test();
+
+function addTestCase( d, t ) {
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+t+")",
+		t,
+		d.setTime(t) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1.1)+")",
+		TimeClip(t+1.1),
+		d.setTime(t+1.1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1)+")",
+		t+1,
+		d.setTime(t+1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-1)+")",
+		t-1,
+		d.setTime(t-1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-TZ_ADJUST)+")",
+		t-TZ_ADJUST,
+		d.setTime(t-TZ_ADJUST) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+TZ_ADJUST)+")",
+		t+TZ_ADJUST,
+		d.setTime(t+TZ_ADJUST) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-5.js b/js/src/tests/ecma/Date/15.9.5.23-5.js
new file mode 100644
index 000000000..0ac39ad42
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-5.js
@@ -0,0 +1,79 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-2.js
+   ECMA Section:       15.9.5.23
+   Description:        Date.prototype.setTime
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.23-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+test_times = new Array( TIME_NOW, TIME_0000, TIME_1970, TIME_1900, TIME_2000,
+			UTC_FEB_29_2000, UTC_JAN_1_2005 );
+
+
+for ( var j = 0; j < test_times.length; j++ ) {
+  addTestCase( new Date(TIME_1970), test_times[j] );
+}
+
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).setTime()",
+	      NaN,
+	      (new Date(NaN)).setTime() );
+
+new TestCase( SECTION,
+	      "Date.prototype.setTime.length",
+	      1,
+	      Date.prototype.setTime.length );
+test();
+
+function addTestCase( d, t ) {
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+t+")",
+		t,
+		d.setTime(t) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1.1)+")",
+		TimeClip(t+1.1),
+		d.setTime(t+1.1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1)+")",
+		t+1,
+		d.setTime(t+1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-1)+")",
+		t-1,
+		d.setTime(t-1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-TZ_ADJUST)+")",
+		t-TZ_ADJUST,
+		d.setTime(t-TZ_ADJUST) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+TZ_ADJUST)+")",
+		t+TZ_ADJUST,
+		d.setTime(t+TZ_ADJUST) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-6.js b/js/src/tests/ecma/Date/15.9.5.23-6.js
new file mode 100644
index 000000000..a7af7438b
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-6.js
@@ -0,0 +1,78 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-2.js
+   ECMA Section:       15.9.5.23
+   Description:        Date.prototype.setTime
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.23-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+test_times = new Array( TIME_NOW, TIME_0000, TIME_1970, TIME_1900, TIME_2000,
+			UTC_FEB_29_2000, UTC_JAN_1_2005 );
+
+
+for ( var j = 0; j < test_times.length; j++ ) {
+  addTestCase( new Date(TIME_1900), test_times[j] );
+}
+
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).setTime()",
+	      NaN,
+	      (new Date(NaN)).setTime() );
+
+new TestCase( SECTION,
+	      "Date.prototype.setTime.length",
+	      1,
+	      Date.prototype.setTime.length );
+test();
+function addTestCase( d, t ) {
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+t+")",
+		t,
+		d.setTime(t) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1.1)+")",
+		TimeClip(t+1.1),
+		d.setTime(t+1.1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1)+")",
+		t+1,
+		d.setTime(t+1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-1)+")",
+		t-1,
+		d.setTime(t-1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-TZ_ADJUST)+")",
+		t-TZ_ADJUST,
+		d.setTime(t-TZ_ADJUST) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+TZ_ADJUST)+")",
+		t+TZ_ADJUST,
+		d.setTime(t+TZ_ADJUST) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-7.js b/js/src/tests/ecma/Date/15.9.5.23-7.js
new file mode 100644
index 000000000..4e09d7cb7
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-7.js
@@ -0,0 +1,79 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-2.js
+   ECMA Section:       15.9.5.23
+   Description:        Date.prototype.setTime
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.23-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+test_times = new Array( TIME_NOW, TIME_0000, TIME_1970, TIME_1900, TIME_2000,
+			UTC_FEB_29_2000, UTC_JAN_1_2005 );
+
+
+for ( var j = 0; j < test_times.length; j++ ) {
+  addTestCase( new Date(TIME_2000), test_times[j] );
+}
+
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).setTime()",
+	      NaN,
+	      (new Date(NaN)).setTime() );
+
+new TestCase( SECTION,
+	      "Date.prototype.setTime.length",
+	      1,
+	      Date.prototype.setTime.length );
+test();
+
+function addTestCase( d, t ) {
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+t+")",
+		t,
+		d.setTime(t) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1.1)+")",
+		TimeClip(t+1.1),
+		d.setTime(t+1.1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1)+")",
+		t+1,
+		d.setTime(t+1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-1)+")",
+		t-1,
+		d.setTime(t-1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-TZ_ADJUST)+")",
+		t-TZ_ADJUST,
+		d.setTime(t-TZ_ADJUST) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+TZ_ADJUST)+")",
+		t+TZ_ADJUST,
+		d.setTime(t+TZ_ADJUST) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-8.js b/js/src/tests/ecma/Date/15.9.5.23-8.js
new file mode 100644
index 000000000..4de029f6c
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-8.js
@@ -0,0 +1,69 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-2.js
+   ECMA Section:       15.9.5.23
+   Description:        Date.prototype.setTime
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.23-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+test_times = new Array( TIME_NOW, TIME_0000, TIME_1970, TIME_1900, TIME_2000,
+			UTC_FEB_29_2000, UTC_JAN_1_2005 );
+
+
+for ( var j = 0; j < test_times.length; j++ ) {
+  addTestCase( new Date(UTC_FEB_29_2000), test_times[j] );
+}
+
+test();
+
+function addTestCase( d, t ) {
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+t+")",
+		t,
+		d.setTime(t) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1.1)+")",
+		TimeClip(t+1.1),
+		d.setTime(t+1.1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1)+")",
+		t+1,
+		d.setTime(t+1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-1)+")",
+		t-1,
+		d.setTime(t-1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-TZ_ADJUST)+")",
+		t-TZ_ADJUST,
+		d.setTime(t-TZ_ADJUST) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+TZ_ADJUST)+")",
+		t+TZ_ADJUST,
+		d.setTime(t+TZ_ADJUST) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.23-9.js b/js/src/tests/ecma/Date/15.9.5.23-9.js
new file mode 100644
index 000000000..2288bb59f
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.23-9.js
@@ -0,0 +1,69 @@
+/* -*- tab-width: 2; 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:          15.9.5.23-2.js
+   ECMA Section:       15.9.5.23
+   Description:        Date.prototype.setTime
+
+   1.  If the this value is not a Date object, generate a runtime error.
+   2.  Call ToNumber(time).
+   3.  Call TimeClip(Result(1)).
+   4.  Set the [[Value]] property of the this value to Result(2).
+   5.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.23-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.setTime()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+test_times = new Array( TIME_NOW, TIME_0000, TIME_1970, TIME_1900, TIME_2000,
+			UTC_FEB_29_2000, UTC_JAN_1_2005 );
+
+
+for ( var j = 0; j < test_times.length; j++ ) {
+  addTestCase( new Date(UTC_JAN_1_2005), test_times[j] );
+}
+
+test();
+
+function addTestCase( d, t ) {
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+t+")",
+		t,
+		d.setTime(t) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1.1)+")",
+		TimeClip(t+1.1),
+		d.setTime(t+1.1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+1)+")",
+		t+1,
+		d.setTime(t+1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-1)+")",
+		t-1,
+		d.setTime(t-1) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t-TZ_ADJUST)+")",
+		t-TZ_ADJUST,
+		d.setTime(t-TZ_ADJUST) );
+
+  new TestCase( SECTION,
+		"( "+d+" ).setTime("+(t+TZ_ADJUST)+")",
+		t+TZ_ADJUST,
+		d.setTime(t+TZ_ADJUST) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.24-1.js b/js/src/tests/ecma/Date/15.9.5.24-1.js
new file mode 100644
index 000000000..627b8cfac
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.24-1.js
@@ -0,0 +1,101 @@
+/* -*- tab-width: 2; 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:          15.9.5.24-1.js
+   ECMA Section:       15.9.5.24 Date.prototype.setTime(time)
+   Description:
+   1.      If the this value is not a Date object, generate a runtime error.
+   2.      Call ToNumber(time).
+   3.      Call TimeClip(Result(1)).
+   4.      Set the [[Value]] property of the this value to Result(2).
+   5.      Return the value of the [[Value]] property of the this value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var TITLE = "Date.prototype.setTime"
+  var SECTION = "15.9.5.24-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setMilliseconds(ms)");
+
+
+addTestCase( 0, 0 );
+
+test();
+
+function addTestCase( startms, newms ) {
+
+  var DateCase = new Date( startms );
+  DateCase.setMilliseconds( newms );
+  var DateString = "var date = new Date("+ startms +"); date.setMilliseconds("+ newms +"); date";
+  var localms = UTC( Number(newms) + LocalTime( Number(startms) ) );
+  var UTCDate = UTCDateFromTime( localms );
+  var LocalDate = LocalDateFromTime( localms );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.24-2.js b/js/src/tests/ecma/Date/15.9.5.24-2.js
new file mode 100644
index 000000000..27bd97f4b
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.24-2.js
@@ -0,0 +1,101 @@
+/* -*- tab-width: 2; 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:          15.9.5.24-1.js
+   ECMA Section:       15.9.5.24 Date.prototype.setTime(time)
+   Description:
+   1.      If the this value is not a Date object, generate a runtime error.
+   2.      Call ToNumber(time).
+   3.      Call TimeClip(Result(1)).
+   4.      Set the [[Value]] property of the this value to Result(2).
+   5.      Return the value of the [[Value]] property of the this value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var TITLE = "Date.prototype.setTime"
+  var SECTION = "15.9.5.24-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setMilliseconds(ms)");
+
+
+addTestCase( 0, -86400000 );
+
+test();
+
+function addTestCase( startms, newms ) {
+
+  var DateCase = new Date( startms );
+  DateCase.setMilliseconds( newms );
+  var DateString = "var date = new Date("+ startms +"); date.setMilliseconds("+ newms +"); date";
+  var localms = UTC( Number(newms) + LocalTime( Number(startms) ) );
+  var UTCDate = UTCDateFromTime( localms );
+  var LocalDate = LocalDateFromTime( localms );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.24-3.js b/js/src/tests/ecma/Date/15.9.5.24-3.js
new file mode 100644
index 000000000..e8d8ddb62
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.24-3.js
@@ -0,0 +1,101 @@
+/* -*- tab-width: 2; 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:          15.9.5.24-1.js
+   ECMA Section:       15.9.5.24 Date.prototype.setTime(time)
+   Description:
+   1.      If the this value is not a Date object, generate a runtime error.
+   2.      Call ToNumber(time).
+   3.      Call TimeClip(Result(1)).
+   4.      Set the [[Value]] property of the this value to Result(2).
+   5.      Return the value of the [[Value]] property of the this value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var TITLE = "Date.prototype.setTime"
+  var SECTION = "15.9.5.24-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setMilliseconds(ms)");
+
+
+addTestCase( 0, -2208988800000 );
+
+test();
+
+function addTestCase( startms, newms ) {
+
+  var DateCase = new Date( startms );
+  DateCase.setMilliseconds( newms );
+  var DateString = "var date = new Date("+ startms +"); date.setMilliseconds("+ newms +"); date";
+  var localms = UTC( Number(newms) + LocalTime( Number(startms) ) );
+  var UTCDate = UTCDateFromTime( localms );
+  var LocalDate = LocalDateFromTime( localms );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.24-4.js b/js/src/tests/ecma/Date/15.9.5.24-4.js
new file mode 100644
index 000000000..58ed41448
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.24-4.js
@@ -0,0 +1,101 @@
+/* -*- tab-width: 2; 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:          15.9.5.24-1.js
+   ECMA Section:       15.9.5.24 Date.prototype.setTime(time)
+   Description:
+   1.      If the this value is not a Date object, generate a runtime error.
+   2.      Call ToNumber(time).
+   3.      Call TimeClip(Result(1)).
+   4.      Set the [[Value]] property of the this value to Result(2).
+   5.      Return the value of the [[Value]] property of the this value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var TITLE = "Date.prototype.setTime"
+  var SECTION = "15.9.5.24-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setMilliseconds(ms)");
+
+
+addTestCase( 0, 946684800000 );
+
+test();
+
+function addTestCase( startms, newms ) {
+
+  var DateCase = new Date( startms );
+  DateCase.setMilliseconds( newms );
+  var DateString = "var date = new Date("+ startms +"); date.setMilliseconds("+ newms +"); date";
+  var localms = UTC( Number(newms) + LocalTime( Number(startms) ) );
+  var UTCDate = UTCDateFromTime( localms );
+  var LocalDate = LocalDateFromTime( localms );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.24-5.js b/js/src/tests/ecma/Date/15.9.5.24-5.js
new file mode 100644
index 000000000..1107ab9e8
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.24-5.js
@@ -0,0 +1,101 @@
+/* -*- tab-width: 2; 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:          15.9.5.24-1.js
+   ECMA Section:       15.9.5.24 Date.prototype.setTime(time)
+   Description:
+   1.      If the this value is not a Date object, generate a runtime error.
+   2.      Call ToNumber(time).
+   3.      Call TimeClip(Result(1)).
+   4.      Set the [[Value]] property of the this value to Result(2).
+   5.      Return the value of the [[Value]] property of the this value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var TITLE = "Date.prototype.setTime"
+  var SECTION = "15.9.5.24-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setMilliseconds(ms)");
+
+
+addTestCase( 0, "0" );
+
+test();
+
+function addTestCase( startms, newms ) {
+
+  var DateCase = new Date( startms );
+  DateCase.setMilliseconds( newms );
+  var DateString = "var date = new Date("+ startms +"); date.setMilliseconds("+ newms +"); date";
+  var localms = UTC( Number(newms) + LocalTime( Number(startms) ) );
+  var UTCDate = UTCDateFromTime( localms );
+  var LocalDate = LocalDateFromTime( localms );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.24-6.js b/js/src/tests/ecma/Date/15.9.5.24-6.js
new file mode 100644
index 000000000..0375cb19f
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.24-6.js
@@ -0,0 +1,101 @@
+/* -*- tab-width: 2; 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:          15.9.5.24-1.js
+   ECMA Section:       15.9.5.24 Date.prototype.setTime(time)
+   Description:
+   1.      If the this value is not a Date object, generate a runtime error.
+   2.      Call ToNumber(time).
+   3.      Call TimeClip(Result(1)).
+   4.      Set the [[Value]] property of the this value to Result(2).
+   5.      Return the value of the [[Value]] property of the this value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var TITLE = "Date.prototype.setTime"
+  var SECTION = "15.9.5.24-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setMilliseconds(ms)");
+
+
+addTestCase( 0, "-2208988800000" );
+
+test();
+
+function addTestCase( startms, newms ) {
+
+  var DateCase = new Date( startms );
+  DateCase.setMilliseconds( newms );
+  var DateString = "var date = new Date("+ startms +"); date.setMilliseconds("+ newms +"); date";
+  var localms = UTC( Number(newms) + LocalTime( Number(startms) ) );
+  var UTCDate = UTCDateFromTime( localms );
+  var LocalDate = LocalDateFromTime( localms );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.24-7.js b/js/src/tests/ecma/Date/15.9.5.24-7.js
new file mode 100644
index 000000000..171786cf3
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.24-7.js
@@ -0,0 +1,101 @@
+/* -*- tab-width: 2; 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:          15.9.5.24-1.js
+   ECMA Section:       15.9.5.24 Date.prototype.setTime(time)
+   Description:
+   1.      If the this value is not a Date object, generate a runtime error.
+   2.      Call ToNumber(time).
+   3.      Call TimeClip(Result(1)).
+   4.      Set the [[Value]] property of the this value to Result(2).
+   5.      Return the value of the [[Value]] property of the this value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var TITLE = "Date.prototype.setTime"
+  var SECTION = "15.9.5.24-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setMilliseconds(ms)");
+
+
+addTestCase( 0, "-86400000" );
+
+test();
+
+function addTestCase( startms, newms ) {
+
+  var DateCase = new Date( startms );
+  DateCase.setMilliseconds( newms );
+  var DateString = "var date = new Date("+ startms +"); date.setMilliseconds("+ newms +"); date";
+  var localms = UTC( Number(newms) + LocalTime( Number(startms) ) );
+  var UTCDate = UTCDateFromTime( localms );
+  var LocalDate = LocalDateFromTime( localms );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.24-8.js b/js/src/tests/ecma/Date/15.9.5.24-8.js
new file mode 100644
index 000000000..96a07b68a
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.24-8.js
@@ -0,0 +1,100 @@
+/* -*- tab-width: 2; 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:          15.9.5.24-1.js
+   ECMA Section:       15.9.5.24 Date.prototype.setTime(time)
+   Description:
+   1.      If the this value is not a Date object, generate a runtime error.
+   2.      Call ToNumber(time).
+   3.      Call TimeClip(Result(1)).
+   4.      Set the [[Value]] property of the this value to Result(2).
+   5.      Return the value of the [[Value]] property of the this value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var TITLE = "Date.prototype.setTime"
+  var SECTION = "15.9.5.24-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setMilliseconds(ms)");
+
+addTestCase( 0, "946684800000" );
+
+test();
+
+function addTestCase( startms, newms ) {
+
+  var DateCase = new Date( startms );
+  DateCase.setMilliseconds( newms );
+  var DateString = "var date = new Date("+ startms +"); date.setMilliseconds("+ newms +"); date";
+  var localms = UTC( Number(newms) + LocalTime( Number(startms) ) );
+  var UTCDate = UTCDateFromTime( localms );
+  var LocalDate = LocalDateFromTime( localms );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.25-1.js b/js/src/tests/ecma/Date/15.9.5.25-1.js
new file mode 100644
index 000000000..d6f7e9d79
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.25-1.js
@@ -0,0 +1,140 @@
+/* -*- tab-width: 2; 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:          15.9.5.25-1.js
+   ECMA Section:       15.9.5.25 Date.prototype.setUTCMilliseconds(ms)
+   Description:
+   1.  Let t be this time value.
+   2.  Call ToNumber(ms).
+   3.  Compute MakeTime(HourFromTime(t), MinFromTime(t), SecFromTime(t), Result(2)).
+   4.  Compute MakeDate(Day(t), Result(3)).
+   5.  Set the [[Value]] property of the this value to TimeClip(Result(4)).
+   6.  Return the value of the [[Value]] property of the this value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.25-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setUTCMilliseconds(ms)");
+
+addNewTestCase( 0, 0, "TDATE = new Date(0);(TDATE).setUTCMilliseconds(0);TDATE",
+		UTCDateFromTime(SetUTCMilliseconds(0,0)),
+		LocalDateFromTime(SetUTCMilliseconds(0,0)) );
+addNewTestCase( 28800000,999,
+		"TDATE = new Date(28800000);(TDATE).setUTCMilliseconds(999);TDATE",
+		UTCDateFromTime(SetUTCMilliseconds(28800000,999)),
+		LocalDateFromTime(SetUTCMilliseconds(28800000,999)) );
+addNewTestCase( 28800000,-28800000,
+		"TDATE = new Date(28800000);(TDATE).setUTCMilliseconds(-28800000);TDATE",
+		UTCDateFromTime(SetUTCMilliseconds(28800000,-28800000)),
+		LocalDateFromTime(SetUTCMilliseconds(28800000,-28800000)) );
+addNewTestCase( 946684800000,1234567,
+		"TDATE = new Date(946684800000);(TDATE).setUTCMilliseconds(1234567);TDATE",
+		UTCDateFromTime(SetUTCMilliseconds(946684800000,1234567)),
+		LocalDateFromTime(SetUTCMilliseconds(946684800000,1234567)) );
+addNewTestCase( 946684800000, 123456789,
+		"TDATE = new Date(946684800000);(TDATE).setUTCMilliseconds(123456789);TDATE",
+		UTCDateFromTime(SetUTCMilliseconds(946684800000,123456789)),
+		LocalDateFromTime(SetUTCMilliseconds(946684800000,123456789)) );
+
+addNewTestCase( -2208988800000,123456789,
+		"TDATE = new Date(-2208988800000);(TDATE).setUTCMilliseconds(123456789);TDATE",
+		UTCDateFromTime(SetUTCMilliseconds(-2208988800000,123456789)),
+		LocalDateFromTime(SetUTCMilliseconds(-2208988800000,123456789)) );
+
+addNewTestCase( -2208988800000,123456,
+		"TDATE = new Date(-2208988800000);(TDATE).setUTCMilliseconds(123456);TDATE",
+		UTCDateFromTime(SetUTCMilliseconds(-2208988800000,123456)),
+		LocalDateFromTime(SetUTCMilliseconds(-2208988800000,123456)) );
+
+addNewTestCase( -2208988800000,-123456,
+		"TDATE = new Date(-2208988800000);(TDATE).setUTCMilliseconds(-123456);TDATE",
+		UTCDateFromTime(SetUTCMilliseconds(-2208988800000,-123456)),
+		LocalDateFromTime(SetUTCMilliseconds(-2208988800000,-123456)) );
+
+addNewTestCase( 0,-999,
+		"TDATE = new Date(0);(TDATE).setUTCMilliseconds(-999);TDATE",
+		UTCDateFromTime(SetUTCMilliseconds(0,-999)),
+		LocalDateFromTime(SetUTCMilliseconds(0,-999)) );
+
+test();
+
+function addNewTestCase( initialTime, ms, DateString, UTCDate, LocalDate) {
+  DateCase = new Date(initialTime);
+  DateCase.setUTCMilliseconds(ms);
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+
+function SetUTCMilliseconds( T, MS ) {
+  T = Number( T );
+  TIME = MakeTime(    HourFromTime(T),
+		      MinFromTime(T),
+		      SecFromTime(T),
+		      MS );
+  return( MakeDate( Day(T), TIME ));
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.26-1.js b/js/src/tests/ecma/Date/15.9.5.26-1.js
new file mode 100644
index 000000000..f9c6c6eb3
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.26-1.js
@@ -0,0 +1,149 @@
+/* -*- tab-width: 2; 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:          15.9.5.26-1.js
+       ECMA Section:       15.9.5.26 Date.prototype.setSeconds(sec [,ms])
+       Description:
+
+       If ms is not specified, this behaves as if ms were specified with the
+       value getMilliseconds( ).
+
+       1.  Let t be the result of LocalTime(this time value).
+       2.  Call ToNumber(sec).
+       3.  If ms is not specified, compute msFromTime(t); otherwise, call
+       ToNumber(ms).
+       4.  Compute MakeTime(HourFromTime(t), MinFromTime(t), Result(2),
+       Result(3)).
+       5.  Compute UTC(MakeDate(Day(t), Result(4))).
+       6.  Set the [[Value]] property of the this value to TimeClip(Result(5)).
+       7.  Return the value of the [[Value]] property of the this value.
+
+       Author:             christine@netscape.com
+       Date:               12 november 1997
+*/
+var SECTION = "15.9.5.26-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setSeconds(sec [,ms] )");
+
+addNewTestCase( 0, 0, 0,
+		"TDATE = new Date(0);(TDATE).setSeconds(0,0);TDATE",
+		UTCDateFromTime(SetSeconds(0,0,0)),
+		LocalDateFromTime(SetSeconds(0,0,0)) );
+
+addNewTestCase( 28800000,59,999,
+		"TDATE = new Date(28800000);(TDATE).setSeconds(59,999);TDATE",
+		UTCDateFromTime(SetSeconds(28800000,59,999)),
+		LocalDateFromTime(SetSeconds(28800000,59,999)) );
+
+addNewTestCase( 28800000,999,999,
+		"TDATE = new Date(28800000);(TDATE).setSeconds(999,999);TDATE",
+		UTCDateFromTime(SetSeconds(28800000,999,999)),
+		LocalDateFromTime(SetSeconds(28800000,999,999)) );
+
+addNewTestCase( 28800000,999, void 0,
+		"TDATE = new Date(28800000);(TDATE).setSeconds(999);TDATE",
+		UTCDateFromTime(SetSeconds(28800000,999,0)),
+		LocalDateFromTime(SetSeconds(28800000,999,0)) );
+
+addNewTestCase( 28800000,-28800, void 0,
+		"TDATE = new Date(28800000);(TDATE).setSeconds(-28800);TDATE",
+		UTCDateFromTime(SetSeconds(28800000,-28800)),
+		LocalDateFromTime(SetSeconds(28800000,-28800)) );
+
+addNewTestCase( 946684800000,1234567,void 0,
+		"TDATE = new Date(946684800000);(TDATE).setSeconds(1234567);TDATE",
+		UTCDateFromTime(SetSeconds(946684800000,1234567)),
+		LocalDateFromTime(SetSeconds(946684800000,1234567)) );
+
+addNewTestCase( -2208988800000,59,999,
+		"TDATE = new Date(-2208988800000);(TDATE).setSeconds(59,999);TDATE",
+		UTCDateFromTime(SetSeconds(-2208988800000,59,999)),
+		LocalDateFromTime(SetSeconds(-2208988800000,59,999)) );
+
+test();
+
+function addNewTestCase( startTime, sec, ms, DateString,UTCDate, LocalDate) {
+  DateCase = new Date( startTime );
+  if ( ms != void 0 ) {
+    DateCase.setSeconds( sec, ms );
+  } else {
+    DateCase.setSeconds( sec );
+  }
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetSeconds( t, s, m ) {
+  var MS   = ( m == void 0 ) ? msFromTime(t) : Number( m );
+  var TIME = LocalTime( t );
+  var SEC  = Number(s);
+  var RESULT4 = MakeTime( HourFromTime( TIME ),
+			  MinFromTime( TIME ),
+			  SEC,
+			  MS );
+  var UTC_TIME = UTC(MakeDate(Day(TIME), RESULT4));
+  return ( TimeClip(UTC_TIME) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.27-1.js b/js/src/tests/ecma/Date/15.9.5.27-1.js
new file mode 100644
index 000000000..bb7a99a3b
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.27-1.js
@@ -0,0 +1,149 @@
+/* -*- tab-width: 2; 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:          15.9.5.27-1.js
+   ECMA Section:       15.9.5.27 Date.prototype.setUTCSeconds(sec [,ms])
+   Description:
+
+   If ms is not specified, this behaves as if ms were specified with the
+   value getUTCMilliseconds( ).
+
+   1.  Let t be this time value.
+   2.  Call ToNumber(sec).
+   3.  If ms is not specified, compute msFromTime(t); otherwise, call
+   ToNumber(ms)
+   4.  Compute MakeTime(HourFromTime(t), MinFromTime(t), Result(2), Result(3))
+   5.  Compute MakeDate(Day(t), Result(4)).
+   6.  Set the [[Value]] property of the this value to TimeClip(Result(5)).
+   7.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.27-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setUTCSeconds(sec [,ms] )");
+
+addNewTestCase( 0, 0, 0, "TDATE = new Date(0);(TDATE).setUTCSeconds(0,0);TDATE",
+		UTCDateFromTime(SetUTCSeconds(0,0,0)),
+		LocalDateFromTime(SetUTCSeconds(0,0,0)) );
+
+addNewTestCase( 28800000,59,999,
+		"TDATE = new Date(28800000);(TDATE).setUTCSeconds(59,999);TDATE",
+		UTCDateFromTime(SetUTCSeconds(28800000,59,999)),
+		LocalDateFromTime(SetUTCSeconds(28800000,59,999)) );
+
+addNewTestCase( 28800000,999,999,
+		"TDATE = new Date(28800000);(TDATE).setUTCSeconds(999,999);TDATE",
+		UTCDateFromTime(SetUTCSeconds(28800000,999,999)),
+		LocalDateFromTime(SetUTCSeconds(28800000,999,999)) );
+
+addNewTestCase( 28800000, 999, void 0,
+		"TDATE = new Date(28800000);(TDATE).setUTCSeconds(999);TDATE",
+		UTCDateFromTime(SetUTCSeconds(28800000,999,0)),
+		LocalDateFromTime(SetUTCSeconds(28800000,999,0)) );
+
+addNewTestCase( 28800000, -28800, void 0,
+		"TDATE = new Date(28800000);(TDATE).setUTCSeconds(-28800);TDATE",
+		UTCDateFromTime(SetUTCSeconds(28800000,-28800)),
+		LocalDateFromTime(SetUTCSeconds(28800000,-28800)) );
+
+addNewTestCase( 946684800000, 1234567, void 0,
+		"TDATE = new Date(946684800000);(TDATE).setUTCSeconds(1234567);TDATE",
+		UTCDateFromTime(SetUTCSeconds(946684800000,1234567)),
+		LocalDateFromTime(SetUTCSeconds(946684800000,1234567)) );
+
+addNewTestCase( -2208988800000,59,999,
+		"TDATE = new Date(-2208988800000);(TDATE).setUTCSeconds(59,999);TDATE",
+		UTCDateFromTime(SetUTCSeconds(-2208988800000,59,999)),
+		LocalDateFromTime(SetUTCSeconds(-2208988800000,59,999)) );
+
+test();
+
+function addNewTestCase( startTime, sec, ms, DateString, UTCDate, LocalDate) {
+  DateCase = new Date( startTime );
+  if ( ms == void 0) {
+    DateCase.setSeconds( sec );
+  } else {
+    DateCase.setSeconds( sec, ms );
+  }
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+
+function SetUTCSeconds( t, s, m ) {
+  var TIME = t;
+  var SEC  = Number(s);
+  var MS   = ( m == void 0 ) ? msFromTime(TIME) : Number( m );
+  var RESULT4 = MakeTime( HourFromTime( TIME ),
+			  MinFromTime( TIME ),
+			  SEC,
+			  MS );
+  return ( TimeClip(MakeDate(Day(TIME), RESULT4)) );
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.5.28-1.js b/js/src/tests/ecma/Date/15.9.5.28-1.js
new file mode 100644
index 000000000..4bbc0251d
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.28-1.js
@@ -0,0 +1,163 @@
+// |reftest| random-if(Android)
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          15.9.5.28-1.js
+   ECMA Section:       15.9.5.28 Date.prototype.setMinutes(min [, sec [, ms ]] )
+   Description:
+   If sec is not specified, this behaves as if sec were specified with the
+   value getSeconds ( ).
+
+   If ms is not specified, this behaves as if ms were specified with the
+   value getMilliseconds( ).
+
+   1.  Let t be the result of LocalTime(this time value).
+   2.  Call ToNumber(min).
+   3.  If sec is not specified, compute SecFromTime(t); otherwise, call ToNumber(sec).
+   4.  If ms is not specified, compute msFromTime(t); otherwise, call ToNumber(ms).
+   5.  Compute MakeTime(HourFromTime(t), Result(2), Result(3), Result(4)).
+   6.  Compute UTC(MakeDate(Day(t), Result(5))).
+   7.  Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.28-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setMinutes(sec [,ms] )");
+
+addNewTestCase( 0, 0, void 0, void 0,
+		"TDATE = new Date(0);(TDATE).setMinutes(0);TDATE",
+		UTCDateFromTime(SetMinutes(0,0,0,0)),
+		LocalDateFromTime(SetMinutes(0,0,0,0)) );
+
+addNewTestCase( 28800000, 59, 59, void 0,
+		"TDATE = new Date(28800000);(TDATE).setMinutes(59,59);TDATE",
+		UTCDateFromTime(SetMinutes(28800000,59,59)),
+		LocalDateFromTime(SetMinutes(28800000,59,59)) );
+
+addNewTestCase( 28800000, 59, 59, 999,
+		"TDATE = new Date(28800000);(TDATE).setMinutes(59,59,999);TDATE",
+		UTCDateFromTime(SetMinutes(28800000,59,59,999)),
+		LocalDateFromTime(SetMinutes(28800000,59,59,999)) );
+
+addNewTestCase( 28800000, 59, void 0, void 0,
+		"TDATE = new Date(28800000);(TDATE).setMinutes(59);TDATE",
+		UTCDateFromTime(SetMinutes(28800000,59,0)),
+		LocalDateFromTime(SetMinutes(28800000,59,0)) );
+
+addNewTestCase( 28800000, -480, void 0, void 0,
+		"TDATE = new Date(28800000);(TDATE).setMinutes(-480);TDATE",
+		UTCDateFromTime(SetMinutes(28800000,-480)),
+		LocalDateFromTime(SetMinutes(28800000,-480)) );
+
+addNewTestCase( 946684800000, 1234567, void 0, void 0,
+		"TDATE = new Date(946684800000);(TDATE).setMinutes(1234567);TDATE",
+		UTCDateFromTime(SetMinutes(946684800000,1234567)),
+		LocalDateFromTime(SetMinutes(946684800000,1234567)) );
+
+addNewTestCase( -2208988800000,59, 59, void 0,
+		"TDATE = new Date(-2208988800000);(TDATE).setMinutes(59,59);TDATE",
+		UTCDateFromTime(SetMinutes(-2208988800000,59,59)),
+		LocalDateFromTime(SetMinutes(-2208988800000,59,59)) );
+
+addNewTestCase( -2208988800000, 59, 59, 999,
+		"TDATE = new Date(-2208988800000);(TDATE).setMinutes(59,59,999);TDATE",
+		UTCDateFromTime(SetMinutes(-2208988800000,59,59,999)),
+		LocalDateFromTime(SetMinutes(-2208988800000,59,59,999)) );
+
+test();
+
+function addNewTestCase( time, min, sec, ms, DateString, UTCDate, LocalDate) {
+  DateCase = new Date( time );
+
+  if ( sec == void 0 ) {
+    DateCase.setMinutes( min );
+  } else {
+    if ( ms == void 0 ) {
+      DateCase.setMinutes( min, sec );
+    } else {
+      DateCase.setMinutes( min, sec, ms );
+    }
+  }
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+
+function SetMinutes( t, min, sec, ms ) {
+  var TIME = LocalTime(t);
+  var MIN =  Number(min);
+  var SEC  = ( sec == void 0) ? SecFromTime(TIME) : Number(sec);
+  var MS   = ( ms == void 0 ) ? msFromTime(TIME)  : Number(ms);
+  var RESULT5 = MakeTime( HourFromTime( TIME ),
+			  MIN,
+			  SEC,
+			  MS );
+  return ( TimeClip(UTC( MakeDate(Day(TIME),RESULT5))) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.29-1.js b/js/src/tests/ecma/Date/15.9.5.29-1.js
new file mode 100644
index 000000000..172e95a72
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.29-1.js
@@ -0,0 +1,158 @@
+// |reftest| random-if(Android)
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          15.9.5.29-1.js
+   ECMA Section:       15.9.5.29 Date.prototype.setUTCMinutes(min [, sec [, ms ]] )
+   Description:
+   If sec is not specified, this behaves as if sec were specified with the
+   value getUTCSeconds ( ).
+
+   If ms is not specified, this behaves as if ms were specified with the value
+   getUTCMilliseconds( ).
+
+   1.  Let t be this time value.
+   2.  Call ToNumber(min).
+   3.  If sec is not specified, compute SecFromTime(t); otherwise, call
+   ToNumber(sec).
+   4.  If ms is not specified, compute msFromTime(t); otherwise, call
+   ToNumber(ms).
+   5.  Compute MakeTime(HourFromTime(t), Result(2), Result(3), Result(4)).
+   6.  Compute MakeDate(Day(t), Result(5)).
+   7.  Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.29-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setUTCMinutes( min [, sec, ms] )");
+
+addNewTestCase( 0, 0, void 0, void 0,
+		"TDATE = new Date(0);(TDATE).setUTCMinutes(0);TDATE",
+		UTCDateFromTime(SetUTCMinutes(0,0,0,0)),
+		LocalDateFromTime(SetUTCMinutes(0,0,0,0)) );
+
+addNewTestCase( 28800000, 59, 59, void 0,
+		"TDATE = new Date(28800000);(TDATE).setUTCMinutes(59,59);TDATE",
+		UTCDateFromTime(SetUTCMinutes(28800000,59,59)),
+		LocalDateFromTime(SetUTCMinutes(28800000,59,59)) );
+
+addNewTestCase( 28800000, 59, 59, 999,
+		"TDATE = new Date(28800000);(TDATE).setUTCMinutes(59,59,999);TDATE",
+		UTCDateFromTime(SetUTCMinutes(28800000,59,59,999)),
+		LocalDateFromTime(SetUTCMinutes(28800000,59,59,999)) );
+
+addNewTestCase( 28800000, 59, void 0, void 0,
+		"TDATE = new Date(28800000);(TDATE).setUTCMinutes(59);TDATE",
+		UTCDateFromTime(SetUTCMinutes(28800000,59)),
+		LocalDateFromTime(SetUTCMinutes(28800000,59)) );
+
+addNewTestCase( 28800000, -480, 0, 0,
+		"TDATE = new Date(28800000);(TDATE).setUTCMinutes(-480);TDATE",
+		UTCDateFromTime(SetUTCMinutes(28800000,-480)),
+		LocalDateFromTime(SetUTCMinutes(28800000,-480)) );
+
+addNewTestCase( 946684800000, 1234567, void 0, void 0,
+		"TDATE = new Date(946684800000);(TDATE).setUTCMinutes(1234567);TDATE",
+		UTCDateFromTime(SetUTCMinutes(946684800000,1234567)),
+		LocalDateFromTime(SetUTCMinutes(946684800000,1234567)) );
+
+addNewTestCase( -2208988800000, 59, 999, void 0,
+		"TDATE = new Date(-2208988800000);(TDATE).setUTCMinutes(59,999);TDATE",
+		UTCDateFromTime(SetUTCMinutes(-2208988800000,59,999)),
+		LocalDateFromTime(SetUTCMinutes(-2208988800000,59,999)) );
+
+test();
+
+function addNewTestCase( time, min, sec, ms, DateString, UTCDate, LocalDate) {
+  var DateCase = new Date( time );
+
+  if ( sec == void 0 ) {
+    DateCase.setUTCMinutes( min );
+  } else {
+    if ( ms == void 0 ) {
+      DateCase.setUTCMinutes( min, sec );
+    } else {
+      DateCase.setUTCMinutes( min, sec, ms );
+    }
+  }
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetUTCMinutes( t, min, sec, ms ) {
+  var TIME = t;
+  var MIN =  Number(min);
+  var SEC  = ( sec == void 0) ? SecFromTime(TIME) : Number(sec);
+  var MS   = ( ms == void 0 ) ? msFromTime(TIME)  : Number(ms);
+  var RESULT5 = MakeTime( HourFromTime( TIME ),
+			  MIN,
+			  SEC,
+			  MS );
+  return ( TimeClip(MakeDate(Day(TIME),RESULT5)) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.3-1-n.js b/js/src/tests/ecma/Date/15.9.5.3-1-n.js
new file mode 100644
index 000000000..3bcc3af20
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.3-1-n.js
@@ -0,0 +1,46 @@
+/* -*- tab-width: 2; 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:          15.9.5.3-1.js
+   ECMA Section:       15.9.5.3-1 Date.prototype.valueOf
+   Description:
+
+   The valueOf function returns a number, which is this time value.
+
+   The valueOf function is not generic; it generates a runtime error if
+   its this value is not a Date object.  Therefore it cannot be transferred
+   to other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.3-1-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.valueOf";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var OBJ = new MyObject( new Date(0) );
+
+DESCRIPTION = "var OBJ = new MyObject( new Date(0) ); OBJ.valueOf()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "var OBJ = new MyObject( new Date(0) ); OBJ.valueOf()",
+	      "error",
+	      eval("OBJ.valueOf()") );
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.valueOf = Date.prototype.valueOf;
+//  The following line causes an infinte loop
+//    this.toString = new Function( "return this+\"\";");
+  return this;
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.3-2.js b/js/src/tests/ecma/Date/15.9.5.3-2.js
new file mode 100644
index 000000000..bc46a27bb
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.3-2.js
@@ -0,0 +1,70 @@
+/* -*- tab-width: 2; 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:          15.9.5.3-2.js
+   ECMA Section:       15.9.5.3-2 Date.prototype.valueOf
+   Description:
+
+   The valueOf function returns a number, which is this time value.
+
+   The valueOf function is not generic; it generates a runtime error if
+   its this value is not a Date object.  Therefore it cannot be transferred
+   to other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.3-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.valueOf";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+").valueOf()",
+		t,
+		(new Date(t)).valueOf() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t+1)+").valueOf()",
+		t+1,
+		(new Date(t+1)).valueOf() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t-1)+").valueOf()",
+		t-1,
+		(new Date(t-1)).valueOf() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t-TZ_ADJUST)+").valueOf()",
+		t-TZ_ADJUST,
+		(new Date(t-TZ_ADJUST)).valueOf() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t+TZ_ADJUST)+").valueOf()",
+		t+TZ_ADJUST,
+		(new Date(t+TZ_ADJUST)).valueOf() );
+}
+
+function MyObject( value ) {
+  this.value = value;
+  this.valueOf = Date.prototype.valueOf;
+  this.toString = new Function( "return this+\"\";");
+  return this;
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.30-1.js b/js/src/tests/ecma/Date/15.9.5.30-1.js
new file mode 100644
index 000000000..4461ee36c
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.30-1.js
@@ -0,0 +1,158 @@
+/* -*- tab-width: 2; 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:          15.9.5.30-1.js
+   ECMA Section:       15.9.5.30 Date.prototype.setHours(hour [, min [, sec [, ms ]]] )
+   Description:
+   If min is not specified, this behaves as if min were specified with the
+   value getMinutes( ). If sec is not specified, this behaves as if sec were
+   specified with the value getSeconds ( ). If ms is not specified, this
+   behaves as if ms were specified with the value getMilliseconds( ).
+
+   1.  Let t be the result of LocalTime(this time value).
+   2.  Call ToNumber(hour).
+   3.  If min is not specified, compute MinFromTime(t); otherwise, call
+   ToNumber(min).
+   4.  If sec is not specified, compute SecFromTime(t); otherwise, call
+   ToNumber(sec).
+   5.  If ms is not specified, compute msFromTime(t); otherwise, call
+   ToNumber(ms).
+   6.  Compute MakeTime(Result(2), Result(3), Result(4), Result(5)).
+   7.  Compute UTC(MakeDate(Day(t), Result(6))).
+   8.  Set the [[Value]] property of the this value to TimeClip(Result(7)).
+   9.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.30-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setHours( hour [, min, sec, ms] )");
+
+addNewTestCase( 0,0,0,0,void 0,
+		"TDATE = new Date(0);(TDATE).setHours(0);TDATE" );
+
+addNewTestCase( 28800000, 23, 59, 999,void 0,
+		"TDATE = new Date(28800000);(TDATE).setHours(23,59,999);TDATE" );
+
+addNewTestCase( 28800000, 999, 999, void 0, void 0,
+		"TDATE = new Date(28800000);(TDATE).setHours(999,999);TDATE" );
+
+addNewTestCase( 28800000,999,0, void 0, void 0,
+		"TDATE = new Date(28800000);(TDATE).setHours(999);TDATE" );
+
+addNewTestCase( 28800000,-8, void 0, void 0, void 0,
+		"TDATE = new Date(28800000);(TDATE).setHours(-8);TDATE" );
+
+addNewTestCase( 946684800000,8760, void 0, void 0, void 0,
+                "TDATE = new Date(946684800000);(TDATE).setHours(8760);TDATE" );
+
+addNewTestCase( TIME_2000 - msPerDay, 23, 59, 59, 999,
+		"d = new Date( " + (TIME_2000-msPerDay) +"); d.setHours(23,59,59,999)" );
+
+addNewTestCase( TIME_2000 - msPerDay, 23, 59, 59, 1000,
+		"d = new Date( " + (TIME_2000-msPerDay) +"); d.setHours(23,59,59,1000)" );
+
+test();
+
+function addNewTestCase( time, hours, min, sec, ms, DateString) {
+  var UTCDate =   UTCDateFromTime( SetHours( time, hours, min, sec, ms ));
+  var LocalDate = LocalDateFromTime( SetHours( time, hours, min, sec, ms ));
+
+  var DateCase = new Date( time );
+
+  if ( min == void 0 ) {
+    DateCase.setHours( hours );
+  } else {
+    if ( sec == void 0 ) {
+      DateCase.setHours( hours, min );
+    } else {
+      if ( ms == void 0 ) {
+	DateCase.setHours( hours, min, sec );
+      } else {
+	DateCase.setHours( hours, min, sec, ms );
+      }
+    }
+  }
+
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.day = WeekDay( t );
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+
+  return (d);
+}
+function SetHours( t, hour, min, sec, ms ) {
+  var TIME = LocalTime(t);
+  var HOUR = Number(hour);
+  var MIN =  ( min == void 0) ? MinFromTime(TIME) : Number(min);
+  var SEC  = ( sec == void 0) ? SecFromTime(TIME) : Number(sec);
+  var MS   = ( ms == void 0 ) ? msFromTime(TIME)  : Number(ms);
+  var RESULT6 = MakeTime( HOUR,
+			  MIN,
+			  SEC,
+			  MS );
+  var UTC_TIME = UTC(  MakeDate(Day(TIME), RESULT6) );
+  return ( TimeClip(UTC_TIME) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.31-1.js b/js/src/tests/ecma/Date/15.9.5.31-1.js
new file mode 100644
index 000000000..d9eda4022
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.31-1.js
@@ -0,0 +1,188 @@
+/* -*- 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:          15.9.5.31-1.js
+
+   ECMA Section:      
+   15.9.5.31 Date.prototype.setUTCHours(hour [, min [, sec [, ms ]]] )
+
+   Description:
+
+   If min is not specified, this behaves as if min were specified with
+   the value getUTCMinutes( ).  If sec is not specified, this behaves
+   as if sec were specified with the value getUTCSeconds ( ).  If ms
+   is not specified, this behaves as if ms were specified with the
+   value getUTCMilliseconds( ).
+
+   1.Let t be this time value.
+   2.Call ToNumber(hour).
+   3.If min is not specified, compute MinFromTime(t);
+   otherwise, call ToNumber(min).
+   4.If sec is not specified, compute SecFromTime(t);
+   otherwise, call ToNumber(sec).
+   5.If ms is not specified, compute msFromTime(t);
+   otherwise, call ToNumber(ms).
+   6.Compute MakeTime(Result(2), Result(3), Result(4), Result(5)).
+   7.Compute MakeDate(Day(t), Result(6)).
+   8.Set the [[Value]] property of the this value to TimeClip(Result(7)).
+
+   1.Return the value of the [[Value]] property of the this value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.31-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog(SECTION +
+                 " Date.prototype.setUTCHours(hour [, min [, sec [, ms ]]] )");
+
+addNewTestCase( 0, 0, void 0, void 0, void 0,
+                "TDATE = new Date(0);(TDATE).setUTCHours(0);TDATE",
+                UTCDateFromTime(SetUTCHours(0,0,0,0)),
+                LocalDateFromTime(SetUTCHours(0,0,0,0)) );
+
+addNewTestCase( 28800000, 23, 59, 999, void 0,
+                "TDATE = new Date(28800000);(TDATE).setUTCHours(23,59,999);TDATE",
+                UTCDateFromTime(SetUTCHours(28800000,23,59,999)),
+                LocalDateFromTime(SetUTCHours(28800000,23,59,999)) );
+
+addNewTestCase( 28800000,999,999, void 0, void 0,
+                "TDATE = new Date(28800000);(TDATE).setUTCHours(999,999);TDATE",
+                UTCDateFromTime(SetUTCHours(28800000,999,999)),
+                LocalDateFromTime(SetUTCHours(28800000,999,999)) );
+
+addNewTestCase( 28800000, 999, void 0, void 0, void 0,
+                "TDATE = new Date(28800000);(TDATE).setUTCHours(999);TDATE",
+                UTCDateFromTime(SetUTCHours(28800000,999,0)),
+                LocalDateFromTime(SetUTCHours(28800000,999,0)) );
+
+addNewTestCase( 28800000, -8670, void 0, void 0, void 0,
+                "TDATE = new Date(28800000);(TDATE).setUTCHours(-8670);TDATE",
+                UTCDateFromTime(SetUTCHours(28800000,-8670)),
+                LocalDateFromTime(SetUTCHours(28800000,-8670)) );
+
+// modify hours to remove dst ambiguity
+addNewTestCase( 946684800000, 1235567, void 0, void 0, void 0,
+                "TDATE = new Date(946684800000);(TDATE).setUTCHours(1235567);TDATE",
+                UTCDateFromTime(SetUTCHours(946684800000,1235567)),
+                LocalDateFromTime(SetUTCHours(946684800000,1235567)) );
+
+addNewTestCase( -2208988800000, 59, 999, void 0, void 0,
+                "TDATE = new Date(-2208988800000);(TDATE).setUTCHours(59,999);TDATE",
+                UTCDateFromTime(SetUTCHours(-2208988800000,59,999)),
+                LocalDateFromTime(SetUTCHours(-2208988800000,59,999)) );
+
+test();
+
+function addNewTestCase( time, hours, min, sec, ms, DateString, UTCDate, LocalDate) {
+
+  DateCase = new Date(time);
+  if ( min == void 0 ) {
+    DateCase.setUTCHours( hours );
+  } else {
+    if ( sec == void 0 ) {
+      DateCase.setUTCHours( hours, min );
+    } else {
+      if ( ms == void 0 ) {
+        DateCase.setUTCHours( hours, min, sec );
+      } else {
+        DateCase.setUTCHours( hours, min, sec, ms );
+      }
+    }
+  }
+
+  new TestCase( SECTION, DateString+".getTime()",            UTCDate.value,
+                DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",            UTCDate.value,
+                DateCase.valueOf() );
+  new TestCase( SECTION, DateString+".getUTCFullYear()",     UTCDate.year,
+                DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",        UTCDate.month,
+                DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",         UTCDate.date,
+                DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",          UTCDate.day,
+                DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",        UTCDate.hours,
+                DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",      UTCDate.minutes,
+                DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",      UTCDate.seconds,
+                DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()", UTCDate.ms,
+                DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",        LocalDate.year,
+                DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",           LocalDate.month,
+                DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",            LocalDate.date,
+                DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",             LocalDate.day,
+                DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",           LocalDate.hours,
+                DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",         LocalDate.minutes,
+                DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",         LocalDate.seconds,
+                DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",    LocalDate.ms,
+                DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+                DateString+".toString=Object.prototype.toString;" +
+                DateString+".toString()",
+                "[object Date]",
+                DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetUTCHours( t, hour, min, sec, ms ) {
+  var TIME = t;
+  var HOUR = Number(hour);
+  var MIN =  ( min == void 0) ? MinFromTime(TIME) : Number(min);
+  var SEC  = ( sec == void 0) ? SecFromTime(TIME) : Number(sec);
+  var MS   = ( ms == void 0 ) ? msFromTime(TIME)  : Number(ms);
+  var RESULT6 = MakeTime( HOUR,
+                          MIN,
+                          SEC,
+                          MS );
+  return ( TimeClip(MakeDate(Day(TIME), RESULT6)) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.32-1.js b/js/src/tests/ecma/Date/15.9.5.32-1.js
new file mode 100644
index 000000000..3e68178a0
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.32-1.js
@@ -0,0 +1,107 @@
+/* -*- tab-width: 2; 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:          15.9.5.32-1.js
+   ECMA Section:       15.9.5.32 Date.prototype.setDate(date)
+   Description:
+   1.  Let t be the result of LocalTime(this time value).
+   2.  Call ToNumber(date).
+   3.  Compute MakeDay(YearFromTime(t), MonthFromTime(t), Result(2)).
+   4.  Compute UTC(MakeDate(Result(3), TimeWithinDay(t))).
+   5.  Set the [[Value]] property of the this value to TimeClip(Result(4)).
+   6.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.32-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setDate(date) ");
+
+addNewTestCase( 0, 1,
+		"TDATE = new Date(0);(TDATE).setDate(1);TDATE" );
+
+test();
+
+function addNewTestCase( t, d, DateString ) {
+  var DateCase = new Date( t );
+  DateCase.setDate( d );
+
+  var UTCDate = UTCDateFromTime(SetDate(t, d));
+  var LocalDate=LocalDateFromTime(SetDate(t,d));
+
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+
+function SetDate( t, date ) {
+  var T       = LocalTime( t );
+  var DATE    = Number( date );
+  var RESULT3 = MakeDay(YearFromTime(T), MonthFromTime(T), DATE );
+  var UTC_DATE = UTC( MakeDate(RESULT3, TimeWithinDay(T)) );
+  return ( TimeClip(UTC_DATE) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.33-1.js b/js/src/tests/ecma/Date/15.9.5.33-1.js
new file mode 100644
index 000000000..cf46d3a61
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.33-1.js
@@ -0,0 +1,111 @@
+/* -*- tab-width: 2; 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:          15.9.5.33-1.js
+   ECMA Section:       15.9.5.33 Date.prototype.setUTCDate(date)
+   Description:
+   1.  Let t be this time value.
+   2.  Call ToNumber(date).
+   3.  Compute MakeDay(YearFromTime(t), MonthFromTime(t), Result(2)).
+   4.  Compute MakeDate(Result(3), TimeWithinDay(t)).
+   5.  Set the [[Value]] property of the this value to TimeClip(Result(4)).
+   6.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.33-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setUTCDate(date) ");
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCDate(31);TDATE",
+		UTCDateFromTime(SetUTCDate(0,31)),
+		LocalDateFromTime(SetUTCDate(0,31)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCDate(1);TDATE",
+		UTCDateFromTime(SetUTCDate(0,1)),
+		LocalDateFromTime(SetUTCDate(0,1)) );
+
+addNewTestCase( "TDATE = new Date(86400000);(TDATE).setUTCDate(1);TDATE",
+		UTCDateFromTime(SetUTCDate(86400000,1)),
+		LocalDateFromTime(SetUTCDate(86400000,1)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetUTCDate( t, date ) {
+  var T       = t;
+  var DATE    = Number( date );
+  var RESULT3 = MakeDay(YearFromTime(T), MonthFromTime(T), DATE );
+  return ( TimeClip(MakeDate(RESULT3, TimeWithinDay(t))) );
+}
+
diff --git a/js/src/tests/ecma/Date/15.9.5.34-1.js b/js/src/tests/ecma/Date/15.9.5.34-1.js
new file mode 100644
index 000000000..8e18482cf
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.34-1.js
@@ -0,0 +1,149 @@
+// |reftest| random
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          15.9.5.34-1.js
+   ECMA Section:       15.9.5.34 Date.prototype.setMonth(mon [, date ] )
+   Description:
+   If date is not specified, this behaves as if date were specified with the
+   value getDate( ).
+
+   1.  Let t be the result of LocalTime(this time value).
+   2.  Call ToNumber(date).
+   3.  If date is not specified, compute DateFromTime(t); otherwise, call ToNumber(date).
+   4.  Compute MakeDay(YearFromTime(t), Result(2), Result(3)).
+   5.  Compute UTC(MakeDate(Result(4), TimeWithinDay(t))).
+   6.  Set the [[Value]] property of the this value to TimeClip(Result(5)).
+   7.  Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.34-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setMonth(mon [, date ] )");
+
+getFunctionCases();
+
+// regression test for http://scopus.mcom.com/bugsplat/show_bug.cgi?id=112404
+d = new Date(0);
+d.setMonth(1,1,1,1,1,1);
+
+addNewTestCase(
+  "TDATE = new Date(0); TDATE.setMonth(1,1,1,1,1,1); TDATE",
+  UTCDateFromTime(SetMonth(0,1,1)),
+  LocalDateFromTime(SetMonth(0,1,1)) );
+
+
+// whatever today is
+
+addNewTestCase( "TDATE = new Date(TIME_NOW); (TDATE).setMonth(11,31); TDATE",
+		UTCDateFromTime(SetMonth(TIME_NOW,11,31)),
+		LocalDateFromTime(SetMonth(TIME_NOW,11,31)) );
+
+// 1970
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setMonth(0,1);TDATE",
+		UTCDateFromTime(SetMonth(0,0,1)),
+		LocalDateFromTime(SetMonth(0,0,1)) );
+
+addNewTestCase( "TDATE = new Date("+TIME_1900+"); "+
+		"(TDATE).setMonth(11,31); TDATE",
+		UTCDateFromTime( SetMonth(TIME_1900,11,31) ),
+		LocalDateFromTime( SetMonth(TIME_1900,11,31) ) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function getFunctionCases() {
+  // some tests for all functions
+  new TestCase(
+    SECTION,
+    "Date.prototype.setMonth.length",
+    2,
+    Date.prototype.setMonth.length );
+
+  new TestCase(
+    SECTION,
+    "typeof Date.prototype.setMonth",
+    "function",
+    typeof Date.prototype.setMonth );
+
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetMonth( t, mon, date ) {
+  var TIME = LocalTime(t);
+  var MONTH = Number( mon );
+  var DATE = ( date == void 0 ) ? DateFromTime(TIME) : Number( date );
+  var DAY = MakeDay( YearFromTime(TIME), MONTH, DATE );
+  return ( TimeClip (UTC(MakeDate( DAY, TimeWithinDay(TIME) ))) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.35-1.js b/js/src/tests/ecma/Date/15.9.5.35-1.js
new file mode 100644
index 000000000..68a0d7a3e
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.35-1.js
@@ -0,0 +1,106 @@
+// |reftest| random-if(Android)
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          15.9.5.35-1.js
+   ECMA Section:       15.9.5.35 Date.prototype.setUTCMonth(mon [,date])
+   Description:
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.35-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setUTCMonth(mon [,date] ) ");
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCMonth(0);TDATE",
+                UTCDateFromTime(SetUTCMonth(0,0)),
+                LocalDateFromTime(SetUTCMonth(0,0)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCMonth(11);TDATE",
+                UTCDateFromTime(SetUTCMonth(0,11)),
+                LocalDateFromTime(SetUTCMonth(0,11)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCMonth(5,4);TDATE",
+                UTCDateFromTime(SetUTCMonth(0,5,4)),
+                LocalDateFromTime(SetUTCMonth(0,5,4)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,        DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,       DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,        DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,         DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,       DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,     DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,     DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,          DateCase.getUTCMilliseconds() );
+   
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+                DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+                "[object Date]",
+                DateCase.toString() );
+}
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetUTCMonth( t, month, date ) {
+  var T       = t;
+  var MONTH   = Number( month );
+  var DATE    = ( date == void 0) ? DateFromTime(T) : Number( date );
+
+  var RESULT4 = MakeDay(YearFromTime(T), MONTH, DATE );
+  var RESULT5 = MakeDate( RESULT4, TimeWithinDay(T));
+
+  return ( TimeClip(RESULT5) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.36-1.js b/js/src/tests/ecma/Date/15.9.5.36-1.js
new file mode 100644
index 000000000..5722c8d7e
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.36-1.js
@@ -0,0 +1,131 @@
+/* -*- tab-width: 2; 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:          15.9.5.36-1.js
+   ECMA Section:       15.9.5.36 Date.prototype.setFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getMonth( ). If date is not specified, this behaves as if date were
+   specified with the value getDate( ).
+
+   1.   Let t be the result of LocalTime(this time value); but if this time
+   value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute UTC(MakeDate(Result(5), TimeWithinDay(t))).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added test cases for Year 2000 Compatilibity Testing.
+
+*/
+var SECTION = "15.9.5.36-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setFullYear(year [, mon [, date ]] )");
+
+
+// 1969
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1969);TDATE",
+		UTCDateFromTime(SetFullYear(0,1969)),
+		LocalDateFromTime(SetFullYear(0,1969)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1969,11);TDATE",
+		UTCDateFromTime(SetFullYear(0,1969,11)),
+		LocalDateFromTime(SetFullYear(0,1969,11)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1969,11,31);TDATE",
+		UTCDateFromTime(SetFullYear(0,1969,11,31)),
+		LocalDateFromTime(SetFullYear(0,1969,11,31)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetFullYear( t, year, mon, date ) {
+  var T = ( isNaN(t) ) ? 0 : LocalTime(t) ;
+  var YEAR = Number( year );
+  var MONTH = ( mon == void 0 ) ? MonthFromTime(T) : Number( mon );
+  var DATE = ( date == void 0 ) ? DateFromTime(T)  : Number( date );
+
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+  var UTC_DATE = UTC(MakeDate( DAY, TimeWithinDay(T)));
+
+  return ( TimeClip(UTC_DATE) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.36-2.js b/js/src/tests/ecma/Date/15.9.5.36-2.js
new file mode 100644
index 000000000..c963c7d79
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.36-2.js
@@ -0,0 +1,130 @@
+/* -*- tab-width: 2; 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:          15.9.5.36-1.js
+   ECMA Section:       15.9.5.36 Date.prototype.setFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getMonth( ). If date is not specified, this behaves as if date were
+   specified with the value getDate( ).
+
+   1.   Let t be the result of LocalTime(this time value); but if this time
+   value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute UTC(MakeDate(Result(5), TimeWithinDay(t))).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added test cases for Year 2000 Compatilibity Testing.
+
+*/
+var SECTION = "15.9.5.36-2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setFullYear(year [, mon [, date ]] )");
+
+// 1970
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1970);TDATE",
+		UTCDateFromTime(SetFullYear(0,1970)),
+		LocalDateFromTime(SetFullYear(0,1970)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1970,0);TDATE",
+		UTCDateFromTime(SetFullYear(0,1970,0)),
+		LocalDateFromTime(SetFullYear(0,1970,0)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1970,0,1);TDATE",
+		UTCDateFromTime(SetFullYear(0,1970,0,1)),
+		LocalDateFromTime(SetFullYear(0,1970,0,1)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetFullYear( t, year, mon, date ) {
+  var T = ( isNaN(t) ) ? 0 : LocalTime(t) ;
+  var YEAR = Number( year );
+  var MONTH = ( mon == void 0 ) ? MonthFromTime(T) : Number( mon );
+  var DATE = ( date == void 0 ) ? DateFromTime(T)  : Number( date );
+
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+  var UTC_DATE = UTC(MakeDate( DAY, TimeWithinDay(T)));
+
+  return ( TimeClip(UTC_DATE) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.36-3.js b/js/src/tests/ecma/Date/15.9.5.36-3.js
new file mode 100644
index 000000000..b217b6ea8
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.36-3.js
@@ -0,0 +1,129 @@
+/* -*- tab-width: 2; 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:          15.9.5.36-1.js
+   ECMA Section:       15.9.5.36 Date.prototype.setFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getMonth( ). If date is not specified, this behaves as if date were
+   specified with the value getDate( ).
+
+   1.   Let t be the result of LocalTime(this time value); but if this time
+   value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute UTC(MakeDate(Result(5), TimeWithinDay(t))).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added test cases for Year 2000 Compatilibity Testing.
+
+*/
+var SECTION = "15.9.5.36-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setFullYear(year [, mon [, date ]] )");
+
+// 1971
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1971);TDATE",
+		UTCDateFromTime(SetFullYear(0,1971)),
+		LocalDateFromTime(SetFullYear(0,1971)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1971,0);TDATE",
+		UTCDateFromTime(SetFullYear(0,1971,0)),
+		LocalDateFromTime(SetFullYear(0,1971,0)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1971,0,1);TDATE",
+		UTCDateFromTime(SetFullYear(0,1971,0,1)),
+		LocalDateFromTime(SetFullYear(0,1971,0,1)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetFullYear( t, year, mon, date ) {
+  var T = ( isNaN(t) ) ? 0 : LocalTime(t) ;
+  var YEAR = Number( year );
+  var MONTH = ( mon == void 0 ) ? MonthFromTime(T) : Number( mon );
+  var DATE = ( date == void 0 ) ? DateFromTime(T)  : Number( date );
+
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+  var UTC_DATE = UTC(MakeDate( DAY, TimeWithinDay(T)));
+
+  return ( TimeClip(UTC_DATE) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.36-4.js b/js/src/tests/ecma/Date/15.9.5.36-4.js
new file mode 100644
index 000000000..178e02260
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.36-4.js
@@ -0,0 +1,129 @@
+/* -*- tab-width: 2; 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:          15.9.5.36-1.js
+   ECMA Section:       15.9.5.36 Date.prototype.setFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getMonth( ). If date is not specified, this behaves as if date were
+   specified with the value getDate( ).
+
+   1.   Let t be the result of LocalTime(this time value); but if this time
+   value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute UTC(MakeDate(Result(5), TimeWithinDay(t))).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added test cases for Year 2000 Compatilibity Testing.
+
+*/
+var SECTION = "15.9.5.36-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setFullYear(year [, mon [, date ]] )");
+
+// 1999
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1999);TDATE",
+		UTCDateFromTime(SetFullYear(0,1999)),
+		LocalDateFromTime(SetFullYear(0,1999)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1999,11);TDATE",
+		UTCDateFromTime(SetFullYear(0,1999,11)),
+		LocalDateFromTime(SetFullYear(0,1999,11)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(1999,11,31);TDATE",
+		UTCDateFromTime(SetFullYear(0,1999,11,31)),
+		LocalDateFromTime(SetFullYear(0,1999,11,31)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetFullYear( t, year, mon, date ) {
+  var T = ( isNaN(t) ) ? 0 : LocalTime(t) ;
+  var YEAR = Number( year );
+  var MONTH = ( mon == void 0 ) ? MonthFromTime(T) : Number( mon );
+  var DATE = ( date == void 0 ) ? DateFromTime(T)  : Number( date );
+
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+  var UTC_DATE = UTC(MakeDate( DAY, TimeWithinDay(T)));
+
+  return ( TimeClip(UTC_DATE) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.36-5.js b/js/src/tests/ecma/Date/15.9.5.36-5.js
new file mode 100644
index 000000000..e55cac094
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.36-5.js
@@ -0,0 +1,129 @@
+/* -*- tab-width: 2; 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:          15.9.5.36-1.js
+   ECMA Section:       15.9.5.36 Date.prototype.setFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getMonth( ). If date is not specified, this behaves as if date were
+   specified with the value getDate( ).
+
+   1.   Let t be the result of LocalTime(this time value); but if this time
+   value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute UTC(MakeDate(Result(5), TimeWithinDay(t))).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added test cases for Year 2000 Compatilibity Testing.
+
+*/
+var SECTION = "15.9.5.36-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setFullYear(year [, mon [, date ]] )");
+
+// 2000
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(2000);TDATE",
+		UTCDateFromTime(SetFullYear(0,2000)),
+		LocalDateFromTime(SetFullYear(0,2000)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(2000,0);TDATE",
+		UTCDateFromTime(SetFullYear(0,2000,0)),
+		LocalDateFromTime(SetFullYear(0,2000,0)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(2000,0,1);TDATE",
+		UTCDateFromTime(SetFullYear(0,2000,0,1)),
+		LocalDateFromTime(SetFullYear(0,2000,0,1)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetFullYear( t, year, mon, date ) {
+  var T = ( isNaN(t) ) ? 0 : LocalTime(t) ;
+  var YEAR = Number( year );
+  var MONTH = ( mon == void 0 ) ? MonthFromTime(T) : Number( mon );
+  var DATE = ( date == void 0 ) ? DateFromTime(T)  : Number( date );
+
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+  var UTC_DATE = UTC(MakeDate( DAY, TimeWithinDay(T)));
+
+  return ( TimeClip(UTC_DATE) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.36-6.js b/js/src/tests/ecma/Date/15.9.5.36-6.js
new file mode 100644
index 000000000..3985e4fff
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.36-6.js
@@ -0,0 +1,129 @@
+/* -*- tab-width: 2; 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:          15.9.5.36-1.js
+   ECMA Section:       15.9.5.36 Date.prototype.setFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getMonth( ). If date is not specified, this behaves as if date were
+   specified with the value getDate( ).
+
+   1.   Let t be the result of LocalTime(this time value); but if this time
+   value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute UTC(MakeDate(Result(5), TimeWithinDay(t))).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added test cases for Year 2000 Compatilibity Testing.
+
+*/
+var SECTION = "15.9.5.36-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setFullYear(year [, mon [, date ]] )");
+
+// feb 29, 2000
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(2000);TDATE",
+		UTCDateFromTime(SetFullYear(0,2000)),
+		LocalDateFromTime(SetFullYear(0,2000)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(2000,1);TDATE",
+		UTCDateFromTime(SetFullYear(0,2000,1)),
+		LocalDateFromTime(SetFullYear(0,2000,1)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(2000,1,29);TDATE",
+		UTCDateFromTime(SetFullYear(0,2000,1,29)),
+		LocalDateFromTime(SetFullYear(0,2000,1,29)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetFullYear( t, year, mon, date ) {
+  var T = ( isNaN(t) ) ? 0 : LocalTime(t) ;
+  var YEAR = Number( year );
+  var MONTH = ( mon == void 0 ) ? MonthFromTime(T) : Number( mon );
+  var DATE = ( date == void 0 ) ? DateFromTime(T)  : Number( date );
+
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+  var UTC_DATE = UTC(MakeDate( DAY, TimeWithinDay(T)));
+
+  return ( TimeClip(UTC_DATE) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.36-7.js b/js/src/tests/ecma/Date/15.9.5.36-7.js
new file mode 100644
index 000000000..31ba9b130
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.36-7.js
@@ -0,0 +1,129 @@
+/* -*- tab-width: 2; 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:          15.9.5.36-1.js
+   ECMA Section:       15.9.5.36 Date.prototype.setFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getMonth( ). If date is not specified, this behaves as if date were
+   specified with the value getDate( ).
+
+   1.   Let t be the result of LocalTime(this time value); but if this time
+   value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute UTC(MakeDate(Result(5), TimeWithinDay(t))).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added test cases for Year 2000 Compatilibity Testing.
+
+*/
+var SECTION = "15.9.5.36-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setFullYear(year [, mon [, date ]] )");
+
+// Jan 1, 2005
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(2005);TDATE",
+		UTCDateFromTime(SetFullYear(0,2005)),
+		LocalDateFromTime(SetFullYear(0,2005)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(2005,0);TDATE",
+		UTCDateFromTime(SetFullYear(0,2005,0)),
+		LocalDateFromTime(SetFullYear(0,2005,0)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setFullYear(2005,0,1);TDATE",
+		UTCDateFromTime(SetFullYear(0,2005,0,1)),
+		LocalDateFromTime(SetFullYear(0,2005,0,1)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetFullYear( t, year, mon, date ) {
+  var T = ( isNaN(t) ) ? 0 : LocalTime(t) ;
+  var YEAR = Number( year );
+  var MONTH = ( mon == void 0 ) ? MonthFromTime(T) : Number( mon );
+  var DATE = ( date == void 0 ) ? DateFromTime(T)  : Number( date );
+
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+  var UTC_DATE = UTC(MakeDate( DAY, TimeWithinDay(T)));
+
+  return ( TimeClip(UTC_DATE) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.37-1.js b/js/src/tests/ecma/Date/15.9.5.37-1.js
new file mode 100644
index 000000000..6200e79e8
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.37-1.js
@@ -0,0 +1,139 @@
+/* -*- tab-width: 2; 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:          15.9.5.37-1.js
+   ECMA Section:       15.9.5.37 Date.prototype.setUTCFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getUTCMonth( ).  If date is not specified, this behaves as if date
+   were specified with the value getUTCDate( ).
+
+   1.   Let t be this time value; but if this time value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute MakeDate(Result(5), TimeWithinDay(t)).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added some Year 2000 test cases.
+*/
+var SECTION = "15.9.5.37-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setUTCFullYear(year [, mon [, date ]] )");
+
+
+// Dates around 1970
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCFullYear(1970);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,1970)),
+		LocalDateFromTime(SetUTCFullYear(0,1970)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCFullYear(1971);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,1971)),
+		LocalDateFromTime(SetUTCFullYear(0,1971)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCFullYear(1972);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,1972)),
+		LocalDateFromTime(SetUTCFullYear(0,1972)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCFullYear(1968);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,1968)),
+		LocalDateFromTime(SetUTCFullYear(0,1968)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCFullYear(1969);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,1969)),
+		LocalDateFromTime(SetUTCFullYear(0,1969)) );
+
+addNewTestCase( "TDATE = new Date(0);(TDATE).setUTCFullYear(1969);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,1969)),
+		LocalDateFromTime(SetUTCFullYear(0,1969)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetUTCFullYear( t, year, mon, date ) {
+  var T = ( t != t ) ? 0 : t;
+  var YEAR = Number(year);
+  var MONTH = ( mon == void 0 ) ?     MonthFromTime(T) : Number( mon );
+  var DATE  = ( date == void 0 ) ?    DateFromTime(T)  : Number( date );
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+
+  return ( TimeClip(MakeDate(DAY, TimeWithinDay(T))) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.37-2.js b/js/src/tests/ecma/Date/15.9.5.37-2.js
new file mode 100644
index 000000000..db5e4ee48
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.37-2.js
@@ -0,0 +1,127 @@
+/* -*- tab-width: 2; 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:          15.9.5.37-1.js
+   ECMA Section:       15.9.5.37 Date.prototype.setUTCFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getUTCMonth( ).  If date is not specified, this behaves as if date
+   were specified with the value getUTCDate( ).
+
+   1.   Let t be this time value; but if this time value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute MakeDate(Result(5), TimeWithinDay(t)).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added some Year 2000 test cases.
+*/
+var SECTION = "15.9.5.37-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setUTCFullYear(year [, mon [, date ]] )");
+
+
+// Dates around 2000
+
+addNewTestCase( "TDATE = new Date(0); TDATE.setUTCFullYear(2000);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,2000)),
+		LocalDateFromTime(SetUTCFullYear(0,2000)) );
+
+addNewTestCase( "TDATE = new Date(0); TDATE.setUTCFullYear(2001);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,2001)),
+		LocalDateFromTime(SetUTCFullYear(0,2001)) );
+
+addNewTestCase( "TDATE = new Date(0); TDATE.setUTCFullYear(1999);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,1999)),
+		LocalDateFromTime(SetUTCFullYear(0,1999)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetUTCFullYear( t, year, mon, date ) {
+  var T = ( t != t ) ? 0 : t;
+  var YEAR = Number(year);
+  var MONTH = ( mon == void 0 ) ?     MonthFromTime(T) : Number( mon );
+  var DATE  = ( date == void 0 ) ?    DateFromTime(T)  : Number( date );
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+
+  return ( TimeClip(MakeDate(DAY, TimeWithinDay(T))) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.37-3.js b/js/src/tests/ecma/Date/15.9.5.37-3.js
new file mode 100644
index 000000000..e0bfd3941
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.37-3.js
@@ -0,0 +1,130 @@
+/* -*- tab-width: 2; 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:          15.9.5.37-1.js
+   ECMA Section:       15.9.5.37 Date.prototype.setUTCFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getUTCMonth( ).  If date is not specified, this behaves as if date
+   were specified with the value getUTCDate( ).
+
+   1.   Let t be this time value; but if this time value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute MakeDate(Result(5), TimeWithinDay(t)).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added some Year 2000 test cases.
+*/
+var SECTION = "15.9.5.37-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setUTCFullYear(year [, mon [, date ]] )");
+
+
+// Dates around 29 February 2000
+
+var UTC_FEB_29_1972 = TIME_1970 + TimeInYear(1970) + TimeInYear(1971) +
+  31*msPerDay + 28*msPerDay;
+
+var PST_FEB_29_1972 = UTC_FEB_29_1972 - TZ_DIFF * msPerHour;
+
+addNewTestCase( "TDATE = new Date("+UTC_FEB_29_1972+"); "+
+		"TDATE.setUTCFullYear(2000);TDATE",
+		UTCDateFromTime(SetUTCFullYear(UTC_FEB_29_1972,2000)),
+		LocalDateFromTime(SetUTCFullYear(UTC_FEB_29_1972,2000)) );
+
+addNewTestCase( "TDATE = new Date("+PST_FEB_29_1972+"); "+
+		"TDATE.setUTCFullYear(2000);TDATE",
+		UTCDateFromTime(SetUTCFullYear(PST_FEB_29_1972,2000)),
+		LocalDateFromTime(SetUTCFullYear(PST_FEB_29_1972,2000)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetUTCFullYear( t, year, mon, date ) {
+  var T = ( t != t ) ? 0 : t;
+  var YEAR = Number(year);
+  var MONTH = ( mon == void 0 ) ?     MonthFromTime(T) : Number( mon );
+  var DATE  = ( date == void 0 ) ?    DateFromTime(T)  : Number( date );
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+
+  return ( TimeClip(MakeDate(DAY, TimeWithinDay(T))) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.37-4.js b/js/src/tests/ecma/Date/15.9.5.37-4.js
new file mode 100644
index 000000000..6d87d2f41
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.37-4.js
@@ -0,0 +1,129 @@
+/* -*- tab-width: 2; 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:          15.9.5.37-1.js
+   ECMA Section:       15.9.5.37 Date.prototype.setUTCFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getUTCMonth( ).  If date is not specified, this behaves as if date
+   were specified with the value getUTCDate( ).
+
+   1.   Let t be this time value; but if this time value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute MakeDate(Result(5), TimeWithinDay(t)).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added some Year 2000 test cases.
+*/
+var SECTION = "15.9.5.37-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setUTCFullYear(year [, mon [, date ]] )");
+
+// Dates around 2005
+
+addNewTestCase( "TDATE = new Date(0); TDATE.setUTCFullYear(2005);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,2005)),
+		LocalDateFromTime(SetUTCFullYear(0,2005)) );
+
+addNewTestCase( "TDATE = new Date(0); TDATE.setUTCFullYear(2004);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,2004)),
+		LocalDateFromTime(SetUTCFullYear(0,2004)) );
+
+addNewTestCase( "TDATE = new Date(0); TDATE.setUTCFullYear(2006);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,2006)),
+		LocalDateFromTime(SetUTCFullYear(0,2006)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+
+//    fixed_year = ( ExpectDate.year >=1900 || ExpectDate.year < 2000 ) ? ExpectDate.year - 1900 : ExpectDate.year;
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetUTCFullYear( t, year, mon, date ) {
+  var T = ( t != t ) ? 0 : t;
+  var YEAR = Number(year);
+  var MONTH = ( mon == void 0 ) ?     MonthFromTime(T) : Number( mon );
+  var DATE  = ( date == void 0 ) ?    DateFromTime(T)  : Number( date );
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+
+  return ( TimeClip(MakeDate(DAY, TimeWithinDay(T))) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.37-5.js b/js/src/tests/ecma/Date/15.9.5.37-5.js
new file mode 100644
index 000000000..c7889f246
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.37-5.js
@@ -0,0 +1,125 @@
+/* -*- tab-width: 2; 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:          15.9.5.37-1.js
+   ECMA Section:       15.9.5.37 Date.prototype.setUTCFullYear(year [, mon [, date ]] )
+   Description:
+
+   If mon is not specified, this behaves as if mon were specified with the
+   value getUTCMonth( ).  If date is not specified, this behaves as if date
+   were specified with the value getUTCDate( ).
+
+   1.   Let t be this time value; but if this time value is NaN, let t be +0.
+   2.   Call ToNumber(year).
+   3.   If mon is not specified, compute MonthFromTime(t); otherwise, call
+   ToNumber(mon).
+   4.   If date is not specified, compute DateFromTime(t); otherwise, call
+   ToNumber(date).
+   5.   Compute MakeDay(Result(2), Result(3), Result(4)).
+   6.   Compute MakeDate(Result(5), TimeWithinDay(t)).
+   7.   Set the [[Value]] property of the this value to TimeClip(Result(6)).
+   8.   Return the value of the [[Value]] property of the this value.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+   Added some Year 2000 test cases.
+*/
+var SECTION = "15.9.5.37-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Date.prototype.setUTCFullYear(year [, mon [, date ]] )");
+
+// Dates around 1900
+addNewTestCase( "TDATE = new Date(0); TDATE.setUTCFullYear(1900);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,1900)),
+		LocalDateFromTime(SetUTCFullYear(0,1900)) );
+
+addNewTestCase( "TDATE = new Date(0); TDATE.setUTCFullYear(1899);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,1899)),
+		LocalDateFromTime(SetUTCFullYear(0,1899)) );
+
+addNewTestCase( "TDATE = new Date(0); TDATE.setUTCFullYear(1901);TDATE",
+		UTCDateFromTime(SetUTCFullYear(0,1901)),
+		LocalDateFromTime(SetUTCFullYear(0,1901)) );
+
+test();
+
+function addNewTestCase( DateString, UTCDate, LocalDate) {
+  DateCase = eval( DateString );
+
+  new TestCase( SECTION, DateString+".getTime()",             UTCDate.value,       DateCase.getTime() );
+  new TestCase( SECTION, DateString+".valueOf()",             UTCDate.value,       DateCase.valueOf() );
+
+  new TestCase( SECTION, DateString+".getUTCFullYear()",      UTCDate.year,    DateCase.getUTCFullYear() );
+  new TestCase( SECTION, DateString+".getUTCMonth()",         UTCDate.month,  DateCase.getUTCMonth() );
+  new TestCase( SECTION, DateString+".getUTCDate()",          UTCDate.date,   DateCase.getUTCDate() );
+  new TestCase( SECTION, DateString+".getUTCDay()",           UTCDate.day,    DateCase.getUTCDay() );
+  new TestCase( SECTION, DateString+".getUTCHours()",         UTCDate.hours,  DateCase.getUTCHours() );
+  new TestCase( SECTION, DateString+".getUTCMinutes()",       UTCDate.minutes,DateCase.getUTCMinutes() );
+  new TestCase( SECTION, DateString+".getUTCSeconds()",       UTCDate.seconds,DateCase.getUTCSeconds() );
+  new TestCase( SECTION, DateString+".getUTCMilliseconds()",  UTCDate.ms,     DateCase.getUTCMilliseconds() );
+
+  new TestCase( SECTION, DateString+".getFullYear()",         LocalDate.year,       DateCase.getFullYear() );
+  new TestCase( SECTION, DateString+".getMonth()",            LocalDate.month,      DateCase.getMonth() );
+  new TestCase( SECTION, DateString+".getDate()",             LocalDate.date,       DateCase.getDate() );
+  new TestCase( SECTION, DateString+".getDay()",              LocalDate.day,        DateCase.getDay() );
+  new TestCase( SECTION, DateString+".getHours()",            LocalDate.hours,      DateCase.getHours() );
+  new TestCase( SECTION, DateString+".getMinutes()",          LocalDate.minutes,    DateCase.getMinutes() );
+  new TestCase( SECTION, DateString+".getSeconds()",          LocalDate.seconds,    DateCase.getSeconds() );
+  new TestCase( SECTION, DateString+".getMilliseconds()",     LocalDate.ms,         DateCase.getMilliseconds() );
+
+  DateCase.toString = Object.prototype.toString;
+
+  new TestCase( SECTION,
+		DateString+".toString=Object.prototype.toString;"+DateString+".toString()",
+		"[object Date]",
+		DateCase.toString() );
+}
+
+function MyDate() {
+  this.year = 0;
+  this.month = 0;
+  this.date = 0;
+  this.hours = 0;
+  this.minutes = 0;
+  this.seconds = 0;
+  this.ms = 0;
+}
+function LocalDateFromTime(t) {
+  t = LocalTime(t);
+  return ( MyDateFromTime(t) );
+}
+function UTCDateFromTime(t) {
+  return ( MyDateFromTime(t) );
+}
+function MyDateFromTime( t ) {
+  var d = new MyDate();
+  d.year = YearFromTime(t);
+  d.month = MonthFromTime(t);
+  d.date = DateFromTime(t);
+  d.hours = HourFromTime(t);
+  d.minutes = MinFromTime(t);
+  d.seconds = SecFromTime(t);
+  d.ms = msFromTime(t);
+
+  d.time = MakeTime( d.hours, d.minutes, d.seconds, d.ms );
+  d.value = TimeClip( MakeDate( MakeDay( d.year, d.month, d.date ), d.time ) );
+  d.day = WeekDay( d.value );
+
+  return (d);
+}
+function SetUTCFullYear( t, year, mon, date ) {
+  var T = ( t != t ) ? 0 : t;
+  var YEAR = Number(year);
+  var MONTH = ( mon == void 0 ) ?     MonthFromTime(T) : Number( mon );
+  var DATE  = ( date == void 0 ) ?    DateFromTime(T)  : Number( date );
+  var DAY = MakeDay( YEAR, MONTH, DATE );
+
+  return ( TimeClip(MakeDate(DAY, TimeWithinDay(T))) );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.4-1.js b/js/src/tests/ecma/Date/15.9.5.4-1.js
new file mode 100644
index 000000000..9ed4be4cb
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.4-1.js
@@ -0,0 +1,59 @@
+/* -*- tab-width: 2; 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:          15.9.5.4-1.js
+   ECMA Section:       15.9.5.4-1 Date.prototype.getTime
+   Description:
+
+   1.  If the this value is not an object whose [[Class]] property is "Date",
+   generate a runtime error.
+   2.  Return this time value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.9.5.4-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getTime";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+").getTime()",
+		t,
+		(new Date(t)).getTime() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t+1)+").getTime()",
+		t+1,
+		(new Date(t+1)).getTime() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t-1)+").getTime()",
+		t-1,
+		(new Date(t-1)).getTime() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t-TZ_ADJUST)+").getTime()",
+		t-TZ_ADJUST,
+		(new Date(t-TZ_ADJUST)).getTime() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t+TZ_ADJUST)+").getTime()",
+		t+TZ_ADJUST,
+		(new Date(t+TZ_ADJUST)).getTime() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.4-2-n.js b/js/src/tests/ecma/Date/15.9.5.4-2-n.js
new file mode 100644
index 000000000..4f08cd7b6
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.4-2-n.js
@@ -0,0 +1,42 @@
+/* -*- tab-width: 2; 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:          15.9.5.4-2-n.js
+   ECMA Section:       15.9.5.4-1 Date.prototype.getTime
+   Description:
+
+   1.  If the this value is not an object whose [[Class]] property is "Date",
+   generate a runtime error.
+   2.  Return this time value.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+
+var SECTION = "15.9.5.4-2-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getTime";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var MYDATE = new MyDate( TIME_2000 );
+
+DESCRIPTION = "MYDATE.getTime()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "MYDATE.getTime()",
+	      "error",
+	      eval("MYDATE.getTime()") );
+
+test();
+
+function MyDate( value ) {
+  this.value = value;
+  this.getTime = Date.prototype.getTime;
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.5.js b/js/src/tests/ecma/Date/15.9.5.5.js
new file mode 100644
index 000000000..0bf476f03
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.5.js
@@ -0,0 +1,78 @@
+/* -*- tab-width: 2; 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:          15.9.5.5.js
+   ECMA Section:       15.9.5.5
+   Description:        Date.prototype.getYear
+
+   This function is specified here for backwards compatibility only. The
+   function getFullYear is much to be preferred for nearly all purposes,
+   because it avoids the "year 2000 problem."
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return YearFromTime(LocalTime(t)) 1900.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.5";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getYear()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getYear()",
+	      NaN,
+	      (new Date(NaN)).getYear() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getYear.length",
+	      0,
+	      Date.prototype.getYear.length );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+")).getYear()",
+		GetYear(YearFromTime(LocalTime(t))),
+		(new Date(t)).getYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t+1)+")).getYear()",
+		GetYear(YearFromTime(LocalTime(t+1))),
+		(new Date(t+1)).getYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t-1)+")).getYear()",
+		GetYear(YearFromTime(LocalTime(t-1))),
+		(new Date(t-1)).getYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t-TZ_ADJUST)+")).getYear()",
+		GetYear(YearFromTime(LocalTime(t-TZ_ADJUST))),
+		(new Date(t-TZ_ADJUST)).getYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t+TZ_ADJUST)+")).getYear()",
+		GetYear(YearFromTime(LocalTime(t+TZ_ADJUST))),
+		(new Date(t+TZ_ADJUST)).getYear() );
+}
+function GetYear( year ) {
+  return year - 1900;
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.6.js b/js/src/tests/ecma/Date/15.9.5.6.js
new file mode 100644
index 000000000..9c53381cb
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.6.js
@@ -0,0 +1,70 @@
+/* -*- tab-width: 2; 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:          15.9.5.6.js
+   ECMA Section:       15.9.5.6
+   Description:        Date.prototype.getFullYear
+
+   1.   Let t be this time value.
+   2.   If t is NaN, return NaN.
+   3.   Return YearFromTime(LocalTime(t)).
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.6";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getFullYear()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getFullYear()",
+	      NaN,
+	      (new Date(NaN)).getFullYear() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getFullYear.length",
+	      0,
+	      Date.prototype.getFullYear.length );
+
+test();
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+")).getFullYear()",
+		YearFromTime(LocalTime(t)),
+		(new Date(t)).getFullYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t+1)+")).getFullYear()",
+		YearFromTime(LocalTime(t+1)),
+		(new Date(t+1)).getFullYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t-1)+")).getFullYear()",
+		YearFromTime(LocalTime(t-1)),
+		(new Date(t-1)).getFullYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t-TZ_ADJUST)+")).getFullYear()",
+		YearFromTime(LocalTime(t-TZ_ADJUST)),
+		(new Date(t-TZ_ADJUST)).getFullYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t+TZ_ADJUST)+")).getFullYear()",
+		YearFromTime(LocalTime(t+TZ_ADJUST)),
+		(new Date(t+TZ_ADJUST)).getFullYear() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.7.js b/js/src/tests/ecma/Date/15.9.5.7.js
new file mode 100644
index 000000000..f1a8d6cba
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.7.js
@@ -0,0 +1,71 @@
+/* -*- tab-width: 2; 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:          15.9.5.7.js
+   ECMA Section:       15.9.5.7
+   Description:        Date.prototype.getUTCFullYear
+
+   1.Let t be this time value.
+   2.If t is NaN, return NaN.
+   3.Return YearFromTime(t).
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.7";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCFullYear()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getUTCFullYear()",
+	      NaN,
+	      (new Date(NaN)).getUTCFullYear() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getUTCFullYear.length",
+	      0,
+	      Date.prototype.getUTCFullYear.length );
+
+test();
+
+function addTestCase( t ) {
+  new TestCase( SECTION,
+		"(new Date("+t+")).getUTCFullYear()",
+		YearFromTime(t),
+		(new Date(t)).getUTCFullYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t+1)+")).getUTCFullYear()",
+		YearFromTime(t+1),
+		(new Date(t+1)).getUTCFullYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t-1)+")).getUTCFullYear()",
+		YearFromTime(t-1),
+		(new Date(t-1)).getUTCFullYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t-TZ_ADJUST)+")).getUTCFullYear()",
+		YearFromTime(t-TZ_ADJUST),
+		(new Date(t-TZ_ADJUST)).getUTCFullYear() );
+
+  new TestCase( SECTION,
+		"(new Date("+(t+TZ_ADJUST)+")).getUTCFullYear()",
+		YearFromTime(t+TZ_ADJUST),
+		(new Date(t+TZ_ADJUST)).getUTCFullYear() );
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.8.js b/js/src/tests/ecma/Date/15.9.5.8.js
new file mode 100644
index 000000000..620272578
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.8.js
@@ -0,0 +1,80 @@
+// |reftest| random-if(Android)
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          15.9.5.8.js
+   ECMA Section:       15.9.5.8
+   Description:        Date.prototype.getMonth
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return MonthFromTime(LocalTime(t)).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.8";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getMonth()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+              "(new Date(NaN)).getMonth()",
+              NaN,
+              (new Date(NaN)).getMonth() );
+
+new TestCase( SECTION,
+              "Date.prototype.getMonth.length",
+              0,
+              Date.prototype.getMonth.length );
+test();
+
+function addTestCase( t ) {
+  var leap = InLeapYear(t);
+
+  for ( var m = 0; m < 12; m++ ) {
+
+    t += TimeInMonth(m, leap);
+
+    new TestCase( SECTION,
+                  "(new Date("+t+")).getMonth()",
+                  MonthFromTime(LocalTime(t)),
+                  (new Date(t)).getMonth() );
+
+    new TestCase( SECTION,
+                  "(new Date("+(t+1)+")).getMonth()",
+                  MonthFromTime(LocalTime(t+1)),
+                  (new Date(t+1)).getMonth() );
+
+    new TestCase( SECTION,
+                  "(new Date("+(t-1)+")).getMonth()",
+                  MonthFromTime(LocalTime(t-1)),
+                  (new Date(t-1)).getMonth() );
+
+    new TestCase( SECTION,
+                  "(new Date("+(t-TZ_ADJUST)+")).getMonth()",
+                  MonthFromTime(LocalTime(t-TZ_ADJUST)),
+                  (new Date(t-TZ_ADJUST)).getMonth() );
+
+    new TestCase( SECTION,
+                  "(new Date("+(t+TZ_ADJUST)+")).getMonth()",
+                  MonthFromTime(LocalTime(t+TZ_ADJUST)),
+                  (new Date(t+TZ_ADJUST)).getMonth() );
+
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.9.js b/js/src/tests/ecma/Date/15.9.5.9.js
new file mode 100644
index 000000000..32adbbfed
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.9.js
@@ -0,0 +1,80 @@
+// |reftest| skip-if(Android) -- bug 686143, skip temporarily to see what happens to the frequency and location of Android timeouts
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          15.9.5.9.js
+   ECMA Section:       15.9.5.9
+   Description:        Date.prototype.getUTCMonth
+
+   1.  Let t be this time value.
+   2.  If t is NaN, return NaN.
+   3.  Return MonthFromTime(t).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5.9";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Date.prototype.getUTCMonth()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+addTestCase( TIME_NOW );
+addTestCase( TIME_0000 );
+addTestCase( TIME_1970 );
+addTestCase( TIME_1900 );
+addTestCase( TIME_2000 );
+addTestCase( UTC_FEB_29_2000 );
+addTestCase( UTC_JAN_1_2005 );
+
+new TestCase( SECTION,
+	      "(new Date(NaN)).getUTCMonth()",
+	      NaN,
+	      (new Date(NaN)).getUTCMonth() );
+
+new TestCase( SECTION,
+	      "Date.prototype.getUTCMonth.length",
+	      0,
+	      Date.prototype.getUTCMonth.length );
+test();
+
+function addTestCase( t ) {
+  var leap = InLeapYear(t);
+
+  for ( var m = 0; m < 12; m++ ) {
+
+    t += TimeInMonth(m, leap);
+
+    new TestCase( SECTION,
+		  "(new Date("+t+")).getUTCMonth()",
+		  MonthFromTime(t),
+		  (new Date(t)).getUTCMonth() );
+
+    new TestCase( SECTION,
+		  "(new Date("+(t+1)+")).getUTCMonth()",
+		  MonthFromTime(t+1),
+		  (new Date(t+1)).getUTCMonth() );
+
+    new TestCase( SECTION,
+		  "(new Date("+(t-1)+")).getUTCMonth()",
+		  MonthFromTime(t-1),
+		  (new Date(t-1)).getUTCMonth() );
+
+    new TestCase( SECTION,
+		  "(new Date("+(t-TZ_ADJUST)+")).getUTCMonth()",
+		  MonthFromTime(t-TZ_ADJUST),
+		  (new Date(t-TZ_ADJUST)).getUTCMonth() );
+
+    new TestCase( SECTION,
+		  "(new Date("+(t+TZ_ADJUST)+")).getUTCMonth()",
+		  MonthFromTime(t+TZ_ADJUST),
+		  (new Date(t+TZ_ADJUST)).getUTCMonth() );
+
+  }
+}
diff --git a/js/src/tests/ecma/Date/15.9.5.js b/js/src/tests/ecma/Date/15.9.5.js
new file mode 100644
index 000000000..e53ed2d5c
--- /dev/null
+++ b/js/src/tests/ecma/Date/15.9.5.js
@@ -0,0 +1,52 @@
+/* -*- tab-width: 2; 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:          15.9.5.js
+   ECMA Section:       15.9.5 Properties of the Date prototype object
+   Description:
+
+   The Date prototype object is itself a Date object (its [[Class]] is
+   "Date") whose value is NaN.
+
+   The value of the internal [[Prototype]] property of the Date prototype
+   object is the Object prototype object (15.2.3.1).
+
+   In following descriptions of functions that are properties of the Date
+   prototype object, the phrase "this Date object" refers to the object that
+   is the this value for the invocation of the function; it is an error if
+   this does not refer to an object for which the value of the internal
+   [[Class]] property is "Date". Also, the phrase "this time value" refers
+   to the number value for the time represented by this Date object, that is,
+   the value of the internal [[Value]] property of this Date object.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.9.5";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the Date Prototype Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+Date.prototype.getClass = Object.prototype.toString;
+
+new TestCase( SECTION,
+	      "Date.prototype.getClass",
+	      "[object Object]",
+	      Date.prototype.getClass() );
+new TestCase( SECTION,
+	      "Date.prototype.valueOf()",
+	      "TypeError",
+	      (function() { try { Date.prototype.valueOf() } catch (e) { return e.constructor.name; } })());
+new TestCase( SECTION,
+          "Date.prototype.__proto__ == Object.prototype",
+          true,
+          Date.prototype.__proto__ == Object.prototype );
+test();
diff --git a/js/src/tests/ecma/Date/browser.js b/js/src/tests/ecma/Date/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Date/browser.js
diff --git a/js/src/tests/ecma/Date/dst-offset-caching-1-of-8.js b/js/src/tests/ecma/Date/dst-offset-caching-1-of-8.js
new file mode 100644
index 000000000..95a88e9a9
--- /dev/null
+++ b/js/src/tests/ecma/Date/dst-offset-caching-1-of-8.js
@@ -0,0 +1,6 @@
+// |reftest| slow
+/*
+ * Any copyright is dedicated to the Public Domain.
+ * http://creativecommons.org/licenses/publicdomain/
+ */
+runDSTOffsetCachingTestsFraction(1, 8);
diff --git a/js/src/tests/ecma/Date/dst-offset-caching-2-of-8.js b/js/src/tests/ecma/Date/dst-offset-caching-2-of-8.js
new file mode 100644
index 000000000..0810f9117
--- /dev/null
+++ b/js/src/tests/ecma/Date/dst-offset-caching-2-of-8.js
@@ -0,0 +1,6 @@
+// |reftest| slow
+/*
+ * Any copyright is dedicated to the Public Domain.
+ * http://creativecommons.org/licenses/publicdomain/
+ */
+runDSTOffsetCachingTestsFraction(2, 8);
diff --git a/js/src/tests/ecma/Date/dst-offset-caching-3-of-8.js b/js/src/tests/ecma/Date/dst-offset-caching-3-of-8.js
new file mode 100644
index 000000000..a70559afa
--- /dev/null
+++ b/js/src/tests/ecma/Date/dst-offset-caching-3-of-8.js
@@ -0,0 +1,6 @@
+// |reftest| slow
+/*
+ * Any copyright is dedicated to the Public Domain.
+ * http://creativecommons.org/licenses/publicdomain/
+ */
+runDSTOffsetCachingTestsFraction(3, 8);
diff --git a/js/src/tests/ecma/Date/dst-offset-caching-4-of-8.js b/js/src/tests/ecma/Date/dst-offset-caching-4-of-8.js
new file mode 100644
index 000000000..3bda28d61
--- /dev/null
+++ b/js/src/tests/ecma/Date/dst-offset-caching-4-of-8.js
@@ -0,0 +1,6 @@
+// |reftest| slow
+/*
+ * Any copyright is dedicated to the Public Domain.
+ * http://creativecommons.org/licenses/publicdomain/
+ */
+runDSTOffsetCachingTestsFraction(4, 8);
diff --git a/js/src/tests/ecma/Date/dst-offset-caching-5-of-8.js b/js/src/tests/ecma/Date/dst-offset-caching-5-of-8.js
new file mode 100644
index 000000000..a15692ff0
--- /dev/null
+++ b/js/src/tests/ecma/Date/dst-offset-caching-5-of-8.js
@@ -0,0 +1,6 @@
+// |reftest| slow
+/*
+ * Any copyright is dedicated to the Public Domain.
+ * http://creativecommons.org/licenses/publicdomain/
+ */
+runDSTOffsetCachingTestsFraction(5, 8);
diff --git a/js/src/tests/ecma/Date/dst-offset-caching-6-of-8.js b/js/src/tests/ecma/Date/dst-offset-caching-6-of-8.js
new file mode 100644
index 000000000..d2ce8e90c
--- /dev/null
+++ b/js/src/tests/ecma/Date/dst-offset-caching-6-of-8.js
@@ -0,0 +1,6 @@
+// |reftest| slow
+/*
+ * Any copyright is dedicated to the Public Domain.
+ * http://creativecommons.org/licenses/publicdomain/
+ */
+runDSTOffsetCachingTestsFraction(6, 8);
diff --git a/js/src/tests/ecma/Date/dst-offset-caching-7-of-8.js b/js/src/tests/ecma/Date/dst-offset-caching-7-of-8.js
new file mode 100644
index 000000000..aaa560c20
--- /dev/null
+++ b/js/src/tests/ecma/Date/dst-offset-caching-7-of-8.js
@@ -0,0 +1,6 @@
+// |reftest| slow
+/*
+ * Any copyright is dedicated to the Public Domain.
+ * http://creativecommons.org/licenses/publicdomain/
+ */
+runDSTOffsetCachingTestsFraction(7, 8);
diff --git a/js/src/tests/ecma/Date/dst-offset-caching-8-of-8.js b/js/src/tests/ecma/Date/dst-offset-caching-8-of-8.js
new file mode 100644
index 000000000..30a6f781b
--- /dev/null
+++ b/js/src/tests/ecma/Date/dst-offset-caching-8-of-8.js
@@ -0,0 +1,6 @@
+// |reftest| slow
+/*
+ * Any copyright is dedicated to the Public Domain.
+ * http://creativecommons.org/licenses/publicdomain/
+ */
+runDSTOffsetCachingTestsFraction(8, 8);
diff --git a/js/src/tests/ecma/Date/shell.js b/js/src/tests/ecma/Date/shell.js
new file mode 100644
index 000000000..fc78d24b7
--- /dev/null
+++ b/js/src/tests/ecma/Date/shell.js
@@ -0,0 +1,149 @@
+
+var BUGNUMBER;
+var summary;
+
+function runDSTOffsetCachingTestsFraction(part, parts)
+{
+  BUGNUMBER = 563938;
+  summary = 'Cache DST offsets to improve SunSpider score';
+
+  print(BUGNUMBER + ": " + summary);
+
+  var MAX_UNIX_TIMET = 2145859200;
+  var RANGE_EXPANSION_AMOUNT = 30 * 24 * 60 * 60;
+
+  /**
+   * Computes the time zone offset in minutes at the given timestamp.
+   */
+  function tzOffsetFromUnixTimestamp(timestamp)
+  {
+    var d = new Date(NaN);
+    d.setTime(timestamp); // local slot = NaN, UTC slot = timestamp
+    return d.getTimezoneOffset(); // get UTC, calculate local => diff in minutes
+  }
+
+  /**
+   * Clear the DST offset cache, leaving it initialized to include a timestamp
+   * completely unlike the provided one (i.e. one very, very far away in time
+   * from it).  Thus an immediately following lookup for the provided timestamp
+   * will cache-miss and compute a clean value.
+   */
+  function clearDSTOffsetCache(undesiredTimestamp)
+  {
+    var opposite = (undesiredTimestamp + MAX_UNIX_TIMET / 2) % MAX_UNIX_TIMET;
+
+    // Generic purge to known, but not necessarily desired, state
+    tzOffsetFromUnixTimestamp(0);
+    tzOffsetFromUnixTimestamp(MAX_UNIX_TIMET);
+
+    // Purge to desired state.  Cycle 2x in case opposite or undesiredTimestamp
+    // is close to 0 or MAX_UNIX_TIMET.
+    tzOffsetFromUnixTimestamp(opposite);
+    tzOffsetFromUnixTimestamp(undesiredTimestamp);
+    tzOffsetFromUnixTimestamp(opposite);
+    tzOffsetFromUnixTimestamp(undesiredTimestamp);
+  }
+
+  function computeCanonicalTZOffset(timestamp)
+  {
+    clearDSTOffsetCache(timestamp);
+    return tzOffsetFromUnixTimestamp(timestamp);
+  }
+
+  var TEST_TIMESTAMPS_SECONDS =
+    [
+     // Special-ish timestamps
+     0,
+     RANGE_EXPANSION_AMOUNT,
+     MAX_UNIX_TIMET,
+    ];
+
+  var ONE_DAY = 24 * 60 * 60;
+  var EIGHTY_THREE_HOURS = 83 * 60 * 60;
+  var NINETY_EIGHT_HOURS = 98 * 60 * 60;
+  function nextIncrement(i)
+  {
+    return i === EIGHTY_THREE_HOURS ? NINETY_EIGHT_HOURS : EIGHTY_THREE_HOURS;
+  }
+
+  // Now add a long sequence of non-special timestamps, from a fixed range, that
+  // overlaps a DST change by "a bit" on each side.  67 days should be enough
+  // displacement that we can occasionally exercise the implementation's
+  // thirty-day expansion and the DST-offset-change logic.  Use two different
+  // increments just to be safe and catch something a single increment might not.
+  var DST_CHANGE_DATE = 1268553600; // March 14, 2010
+  for (var t = DST_CHANGE_DATE - 67 * ONE_DAY,
+           i = nextIncrement(NINETY_EIGHT_HOURS),
+           end = DST_CHANGE_DATE + 67 * ONE_DAY;
+       t < end;
+       i = nextIncrement(i), t += i)
+  {
+    TEST_TIMESTAMPS_SECONDS.push(t);
+  }
+
+  var TEST_TIMESTAMPS =
+    TEST_TIMESTAMPS_SECONDS.map(function(v) { return v * 1000; });
+
+  /**************
+   * BEGIN TEST *
+   **************/
+
+  // Compute the correct time zone offsets for all timestamps to be tested.
+  var CORRECT_TZOFFSETS = TEST_TIMESTAMPS.map(computeCanonicalTZOffset);
+
+  // Intentionally and knowingly invoking every single logic path in the cache
+  // isn't easy for a human to get right (and know he's gotten it right), so
+  // let's do it the easy way: exhaustively try all possible four-date sequences
+  // selecting from our array of possible timestamps.
+
+  var sz = TEST_TIMESTAMPS.length;
+  var start = Math.floor((part - 1) / parts * sz);
+  var end = Math.floor(part / parts * sz);
+
+  print("Exhaustively testing timestamps " +
+        "[" + start + ", " + end + ") of " + sz + "...");
+
+  try
+  {
+    for (var i = start; i < end; i++)
+    {
+      print("Testing timestamp " + i + "...");
+
+      var t1 = TEST_TIMESTAMPS[i];
+      for (var j = 0; j < sz; j++)
+      {
+        var t2 = TEST_TIMESTAMPS[j];
+        for (var k = 0; k < sz; k++)
+        {
+          var t3 = TEST_TIMESTAMPS[k];
+          for (var w = 0; w < sz; w++)
+          {
+            var t4 = TEST_TIMESTAMPS[w];
+
+            clearDSTOffsetCache(t1);
+
+            var tzo1 = tzOffsetFromUnixTimestamp(t1);
+            var tzo2 = tzOffsetFromUnixTimestamp(t2);
+            var tzo3 = tzOffsetFromUnixTimestamp(t3);
+            var tzo4 = tzOffsetFromUnixTimestamp(t4);
+
+            assertEq(tzo1, CORRECT_TZOFFSETS[i]);
+            assertEq(tzo2, CORRECT_TZOFFSETS[j]);
+            assertEq(tzo3, CORRECT_TZOFFSETS[k]);
+            assertEq(tzo4, CORRECT_TZOFFSETS[w]);
+          }
+        }
+      }
+    }
+  }
+  catch (e)
+  {
+    assertEq(true, false,
+             "Error when testing with timestamps " +
+             i + ", " + j + ", " + k + ", " + w +
+             " (" + t1 + ", " + t2 + ", " + t3 + ", " + t4 + ")!");
+  }
+
+  reportCompare(true, true);
+  print("All tests passed!");
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.3-1.js b/js/src/tests/ecma/ExecutionContexts/10.1.3-1.js
new file mode 100644
index 000000000..f493858fa
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.3-1.js
@@ -0,0 +1,73 @@
+/* -*- 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:          10.1.3-1.js
+   ECMA Section:       10.1.3
+   Description:
+
+   For each formal parameter, as defined in the FormalParameterList, create
+   a property of the variable object whose name is the Identifier and whose
+   attributes are determined by the type of code. The values of the
+   parameters are supplied by the caller. If the caller supplies fewer
+   parameter values than there are formal parameters, the extra formal
+   parameters have value undefined. If two or more formal parameters share
+   the same name, hence the same property, the corresponding property is
+   given the value that was supplied for the last parameter with this name.
+   If the value of this last parameter was not supplied by the caller,
+   the value of the corresponding property is undefined.
+
+
+   http://scopus.mcom.com/bugsplat/show_bug.cgi?id=104191
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "10.1.3-1";
+var VERSION = "ECMA_1";
+var TITLE   = "Variable Instantiation:  Formal Parameters";
+var BUGNUMBER="104191";
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var myfun1 = new Function( "a", "a", "return a" );
+var myfun2 = new Function( "a", "b", "a", "return a" );
+
+function myfun3(a, b, a) {
+  return a;
+}
+
+// myfun1, myfun2, myfun3 tostring
+
+
+new TestCase(
+  SECTION,
+  String(myfun2) +"; myfun2(2,4,8)",
+  8,
+  myfun2(2,4,8) );
+
+new TestCase(
+  SECTION,
+  "myfun2(2,4)",
+  void 0,
+  myfun2(2,4));
+
+new TestCase(
+  SECTION,
+  String(myfun3) +"; myfun3(2,4,8)",
+  8,
+  myfun3(2,4,8) );
+
+new TestCase(
+  SECTION,
+  "myfun3(2,4)",
+  void 0,
+  myfun3(2,4) );
+
+test();
+
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.3-2.js b/js/src/tests/ecma/ExecutionContexts/10.1.3-2.js
new file mode 100644
index 000000000..c18d9b783
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.3-2.js
@@ -0,0 +1,39 @@
+/* -*- 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:          10.1.3-1.js
+   ECMA Section:       10.1.3
+   Description:
+
+   Author:             mozilla@florian.loitsch.com
+   Date:               27 July 2005
+*/
+
+var SECTION = "10.1.3-2";
+var VERSION = "ECMA_1";
+var TITLE   = "Variable Instantiation:  Function Declarations";
+var BUGNUMBER="299639";
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+function f(g)
+{
+  function g() {
+    return "g";
+  };
+  return g;
+}
+
+new TestCase(
+  SECTION,
+  "typeof f(\"parameter\")",
+  "function",
+  typeof f("parameter") );
+
+test();
+
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.3.js b/js/src/tests/ecma/ExecutionContexts/10.1.3.js
new file mode 100644
index 000000000..897a5b370
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.3.js
@@ -0,0 +1,136 @@
+/* -*- tab-width: 2; 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:          10.1.3.js
+   ECMA Section:       10.1.3.js Variable Instantiation
+   Description:
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+
+var SECTION = "10.1.3";
+var VERSION = "ECMA_1";
+var TITLE   = "Variable instantiation";
+var BUGNUMBER = "20256";
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+   
+// overriding a variable or function name with a function should succeed
+    
+new TestCase(SECTION,
+	     "function t() { return \"first\" };" +
+	     "function t() { return \"second\" };t() ",
+	     "second",
+	     eval("function t() { return \"first\" };" +
+		  "function t() { return \"second\" };t()"));
+
+   
+new TestCase(SECTION,
+	     "var t; function t(){}; typeof(t)",
+	     "function",
+	     eval("var t; function t(){}; typeof(t)"));
+
+
+// formal parameter tests
+    
+new TestCase(SECTION,
+	     "function t1(a,b) { return b; }; t1( 4 );",
+	     void 0,
+	     eval("function t1(a,b) { return b; }; t1( 4 );") );
+   
+new TestCase(SECTION,
+	     "function t1(a,b) { return a; }; t1(4);",
+	     4,
+	     eval("function t1(a,b) { return a; }; t1(4)"));
+    
+new TestCase(SECTION,
+	     "function t1(a,b) { return a; }; t1();",
+	     void 0,
+	     eval("function t1(a,b) { return a; }; t1()"));
+   
+new TestCase(SECTION,
+	     "function t1(a,b) { return a; }; t1(1,2,4);",
+	     1,
+	     eval("function t1(a,b) { return a; }; t1(1,2,4)"));
+/*
+   
+new TestCase(SECTION, "function t1(a,a) { return a; }; t1( 4 );",
+void 0,
+eval("function t1(a,a) { return a; }; t1( 4 )"));
+    
+new TestCase(SECTION,
+"function t1(a,a) { return a; }; t1( 1,2 );",
+2,
+eval("function t1(a,a) { return a; }; t1( 1,2 )"));
+*/
+// variable declarations
+   
+new TestCase(SECTION,
+	     "function t1(a,b) { return a; }; t1( false, true );",
+	     false,
+	     eval("function t1(a,b) { return a; }; t1( false, true );"));
+   
+new TestCase(SECTION,
+	     "function t1(a,b) { return b; }; t1( false, true );",
+	     true,
+	     eval("function t1(a,b) { return b; }; t1( false, true );"));
+   
+new TestCase(SECTION,
+	     "function t1(a,b) { return a+b; }; t1( 4, 2 );",
+	     6,
+	     eval("function t1(a,b) { return a+b; }; t1( 4, 2 );"));
+   
+new TestCase(SECTION,
+	     "function t1(a,b) { return a+b; }; t1( 4 );",
+	     Number.NaN,
+	     eval("function t1(a,b) { return a+b; }; t1( 4 );"));
+
+// overriding a function name with a variable should fail
+   
+new TestCase(SECTION,
+	     "function t() { return 'function' };" +
+	     "var t = 'variable'; typeof(t)",
+	     "string",
+	     eval("function t() { return 'function' };" +
+		  "var t = 'variable'; typeof(t)"));
+
+// function as a constructor
+   
+new TestCase(SECTION,
+	     "function t1(a,b) { var a = b; return a; } t1(1,3);",
+	     3,
+	     eval("function t1(a, b){ var a = b; return a;}; t1(1,3)"));
+   
+new TestCase(SECTION,
+	     "function t2(a,b) { this.a = b;  } x  = new t2(1,3); x.a",
+	     3,
+	     eval("function t2(a,b) { this.a = b; };" +
+		  "x = new t2(1,3); x.a"));
+   
+new TestCase(SECTION,
+	     "function t2(a,b) { this.a = a;  } x  = new t2(1,3); x.a",
+	     1,
+	     eval("function t2(a,b) { this.a = a; };" +
+		  "x = new t2(1,3); x.a"));
+   
+new TestCase(SECTION,
+	     "function t2(a,b) { this.a = b; this.b = a; } " +
+	     "x = new t2(1,3);x.a;",
+	     3,
+	     eval("function t2(a,b) { this.a = b; this.b = a; };" +
+		  "x = new t2(1,3);x.a;"));
+   
+new TestCase(SECTION,
+	     "function t2(a,b) { this.a = b; this.b = a; }" +
+	     "x = new t2(1,3);x.b;",
+	     1,
+	     eval("function t2(a,b) { this.a = b; this.b = a; };" +
+		  "x = new t2(1,3);x.b;") );
+
+test();
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.4-1.js b/js/src/tests/ecma/ExecutionContexts/10.1.4-1.js
new file mode 100644
index 000000000..95e41bfce
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.4-1.js
@@ -0,0 +1,76 @@
+/* -*- 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:          10.1.4-1.js
+   ECMA Section:       10.1.4 Scope Chain and Identifier Resolution
+   Description:
+   Every execution context has associated with it a scope chain. This is
+   logically a list of objects that are searched when binding an Identifier.
+   When control enters an execution context, the scope chain is created and
+   is populated with an initial set of objects, depending on the type of
+   code. When control leaves the execution context, the scope chain is
+   destroyed.
+
+   During execution, the scope chain of the execution context is affected
+   only by WithStatement. When execution enters a with block, the object
+   specified in the with statement is added to the front of the scope chain.
+   When execution leaves a with block, whether normally or via a break or
+   continue statement, the object is removed from the scope chain. The object
+   being removed will always be the first object in the scope chain.
+
+   During execution, the syntactic production PrimaryExpression : Identifier
+   is evaluated using the following algorithm:
+
+   1.  Get the next object in the scope chain. If there isn't one, go to step 5.
+   2.  Call the [[HasProperty]] method of Result(l), passing the Identifier as
+   the property.
+   3.  If Result(2) is true, return a value of type Reference whose base object
+   is Result(l) and whose property name is the Identifier.
+   4.  Go to step 1.
+   5.  Return a value of type Reference whose base object is null and whose
+   property name is the Identifier.
+   The result of binding an identifier is always a value of type Reference with
+   its member name component equal to the identifier string.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.1.4-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Scope Chain and Identifier Resolution");
+
+new TestCase( "SECTION", "with MyObject, eval should return square of " );
+
+test();
+
+function test() {
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+
+    var MYOBJECT = new MyObject();
+    var INPUT = 2;
+    gTestcases[gTc].description += "( " + INPUT +" )" ;
+
+    with ( MYOBJECT ) {
+      gTestcases[gTc].actual = eval( INPUT );
+      gTestcases[gTc].expect = Math.pow(INPUT,2);
+    }
+
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +" = "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : "wrong value ";
+  }
+  return ( gTestcases );
+}
+
+function MyObject() {
+  this.eval = new Function( "x", "return(Math.pow(Number(x),2))" );
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.4-10.js b/js/src/tests/ecma/ExecutionContexts/10.1.4-10.js
new file mode 100644
index 000000000..ea6a4299b
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.4-10.js
@@ -0,0 +1,70 @@
+/* -*- 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:          10.1.4-10.js
+   ECMA Section:       10.1.4 Scope Chain and Identifier Resolution
+   Description:
+   Every execution context has associated with it a scope chain. This is
+   logically a list of objects that are searched when binding an Identifier.
+   When control enters an execution context, the scope chain is created and
+   is populated with an initial set of objects, depending on the type of
+   code. When control leaves the execution context, the scope chain is
+   destroyed.
+
+   During execution, the scope chain of the execution context is affected
+   only by WithStatement. When execution enters a with block, the object
+   specified in the with statement is added to the front of the scope chain.
+   When execution leaves a with block, whether normally or via a break or
+   continue statement, the object is removed from the scope chain. The object
+   being removed will always be the first object in the scope chain.
+
+   During execution, the syntactic production PrimaryExpression : Identifier
+   is evaluated using the following algorithm:
+
+   1.  Get the next object in the scope chain. If there isn't one, go to step 5.
+   2.  Call the [[HasProperty]] method of Result(l), passing the Identifier as
+   the property.
+   3.  If Result(2) is true, return a value of type Reference whose base object
+   is Result(l) and whose property name is the Identifier.
+   4.  Go to step 1.
+   5.  Return a value of type Reference whose base object is null and whose
+   property name is the Identifier.
+   The result of binding an identifier is always a value of type Reference with
+   its member name component equal to the identifier string.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.1.4-10";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Scope Chain and Identifier Resolution");
+
+new TestCase( "SECTION", "MYOBJECT.toString()" );
+
+test();
+
+function test() {
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+    var VALUE = 12345;
+    var MYOBJECT = new Number( VALUE );
+
+    with ( MYOBJECT ) {
+      gTestcases[gTc].actual = toString();
+      gTestcases[gTc].expect = String(VALUE);
+    }
+
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +" = "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : "wrong value ";
+  }
+  return ( gTestcases );
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.4-2.js b/js/src/tests/ecma/ExecutionContexts/10.1.4-2.js
new file mode 100644
index 000000000..b2af20a9f
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.4-2.js
@@ -0,0 +1,78 @@
+/* -*- tab-width: 2; 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:          10.1.4-1.js
+   ECMA Section:       10.1.4 Scope Chain and Identifier Resolution
+   Description:
+   Every execution context has associated with it a scope chain. This is
+   logically a list of objects that are searched when binding an Identifier.
+   When control enters an execution context, the scope chain is created and
+   is populated with an initial set of objects, depending on the type of
+   code. When control leaves the execution context, the scope chain is
+   destroyed.
+
+   During execution, the scope chain of the execution context is affected
+   only by WithStatement. When execution enters a with block, the object
+   specified in the with statement is added to the front of the scope chain.
+   When execution leaves a with block, whether normally or via a break or
+   continue statement, the object is removed from the scope chain. The object
+   being removed will always be the first object in the scope chain.
+
+   During execution, the syntactic production PrimaryExpression : Identifier
+   is evaluated using the following algorithm:
+
+   1.  Get the next object in the scope chain. If there isn't one, go to step 5.
+   2.  Call the [[HasProperty]] method of Result(l), passing the Identifier as
+   the property.
+   3.  If Result(2) is true, return a value of type Reference whose base object
+   is Result(l) and whose property name is the Identifier.
+   4.  Go to step 1.
+   5.  Return a value of type Reference whose base object is null and whose
+   property name is the Identifier.
+   The result of binding an identifier is always a value of type Reference with
+   its member name component equal to the identifier string.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.1.4-2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Scope Chain and Identifier Resolution");
+
+new TestCase( "SECTION", "with MyObject, eval should return square of " );
+
+test();
+
+function test() {
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+
+    var MYOBJECT = new MyObject();
+    var INPUT = 2;
+    gTestcases[gTc].description += "( "+INPUT +" )" ;
+
+    with ( this ) {
+      with ( MYOBJECT ) {
+	gTestcases[gTc].actual = eval( INPUT );
+	gTestcases[gTc].expect = Math.pow(INPUT,2);
+      }
+    }
+
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +" = "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : "wrong value ";
+  }
+  return ( gTestcases );
+}
+
+function MyObject() {
+  this.eval = new Function( "x", "return(Math.pow(Number(x),2))" );
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.4-3.js b/js/src/tests/ecma/ExecutionContexts/10.1.4-3.js
new file mode 100644
index 000000000..52326ea19
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.4-3.js
@@ -0,0 +1,76 @@
+/* -*- tab-width: 2; 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:          10.1.4-1.js
+   ECMA Section:       10.1.4 Scope Chain and Identifier Resolution
+   Description:
+   Every execution context has associated with it a scope chain. This is
+   logically a list of objects that are searched when binding an Identifier.
+   When control enters an execution context, the scope chain is created and
+   is populated with an initial set of objects, depending on the type of
+   code. When control leaves the execution context, the scope chain is
+   destroyed.
+
+   During execution, the scope chain of the execution context is affected
+   only by WithStatement. When execution enters a with block, the object
+   specified in the with statement is added to the front of the scope chain.
+   When execution leaves a with block, whether normally or via a break or
+   continue statement, the object is removed from the scope chain. The object
+   being removed will always be the first object in the scope chain.
+
+   During execution, the syntactic production PrimaryExpression : Identifier
+   is evaluated using the following algorithm:
+
+   1.  Get the next object in the scope chain. If there isn't one, go to step 5.
+   2.  Call the [[HasProperty]] method of Result(l), passing the Identifier as
+   the property.
+   3.  If Result(2) is true, return a value of type Reference whose base object
+   is Result(l) and whose property name is the Identifier.
+   4.  Go to step 1.
+   5.  Return a value of type Reference whose base object is null and whose
+   property name is the Identifier.
+   The result of binding an identifier is always a value of type Reference with
+   its member name component equal to the identifier string.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.1.4-3";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Scope Chain and Identifier Resolution");
+
+new TestCase( "SECTION",
+	      "with MyObject, eval should be [object Global].eval " );
+
+test();
+
+function test() {
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+
+    var MYOBJECT = new MyObject();
+    var INPUT = 2;
+    gTestcases[gTc].description += ( INPUT +"" );
+
+    with ( MYOBJECT ) {
+      eval( INPUT );
+    }
+
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +" = "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : "wrong value ";
+  }
+  return ( gTestcases );
+}
+
+function MyObject() {
+  this.eval = new Function( "x", "return(Math.pow(Number(x),2))" );
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.4-4.js b/js/src/tests/ecma/ExecutionContexts/10.1.4-4.js
new file mode 100644
index 000000000..0d6636b77
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.4-4.js
@@ -0,0 +1,78 @@
+/* -*- tab-width: 2; 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:          10.1.4-1.js
+   ECMA Section:       10.1.4 Scope Chain and Identifier Resolution
+   Description:
+   Every execution context has associated with it a scope chain. This is
+   logically a list of objects that are searched when binding an Identifier.
+   When control enters an execution context, the scope chain is created and
+   is populated with an initial set of objects, depending on the type of
+   code. When control leaves the execution context, the scope chain is
+   destroyed.
+
+   During execution, the scope chain of the execution context is affected
+   only by WithStatement. When execution enters a with block, the object
+   specified in the with statement is added to the front of the scope chain.
+   When execution leaves a with block, whether normally or via a break or
+   continue statement, the object is removed from the scope chain. The object
+   being removed will always be the first object in the scope chain.
+
+   During execution, the syntactic production PrimaryExpression : Identifier
+   is evaluated using the following algorithm:
+
+   1.  Get the next object in the scope chain. If there isn't one, go to step 5.
+   2.  Call the [[HasProperty]] method of Result(l), passing the Identifier as
+   the property.
+   3.  If Result(2) is true, return a value of type Reference whose base object
+   is Result(l) and whose property name is the Identifier.
+   4.  Go to step 1.
+   5.  Return a value of type Reference whose base object is null and whose
+   property name is the Identifier.
+   The result of binding an identifier is always a value of type Reference with
+   its member name component equal to the identifier string.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.1.4-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Scope Chain and Identifier Resolution");
+
+new TestCase( "SECTION",
+	      "with MyObject, eval should be [object Global].eval " );
+test();
+
+function test() {
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+
+    var MYOBJECT = new MyObject();
+    var INPUT = 2;
+    gTestcases[gTc].description += ( INPUT +"" );
+
+    with ( MYOBJECT ) {
+      eval( INPUT );
+    }
+
+    gTestcases[gTc].actual = eval( INPUT );
+    gTestcases[gTc].expect = INPUT;
+
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +" = "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : "wrong value ";
+  }
+  return ( gTestcases );
+}
+
+function MyObject() {
+  this.eval = new Function( "x", "return(Math.pow(Number(x),2))" );
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.4-5.js b/js/src/tests/ecma/ExecutionContexts/10.1.4-5.js
new file mode 100644
index 000000000..aaa446093
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.4-5.js
@@ -0,0 +1,77 @@
+/* -*- tab-width: 2; 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:          10.1.4-1.js
+   ECMA Section:       10.1.4 Scope Chain and Identifier Resolution
+   Description:
+   Every execution context has associated with it a scope chain. This is
+   logically a list of objects that are searched when binding an Identifier.
+   When control enters an execution context, the scope chain is created and
+   is populated with an initial set of objects, depending on the type of
+   code. When control leaves the execution context, the scope chain is
+   destroyed.
+
+   During execution, the scope chain of the execution context is affected
+   only by WithStatement. When execution enters a with block, the object
+   specified in the with statement is added to the front of the scope chain.
+   When execution leaves a with block, whether normally or via a break or
+   continue statement, the object is removed from the scope chain. The object
+   being removed will always be the first object in the scope chain.
+
+   During execution, the syntactic production PrimaryExpression : Identifier
+   is evaluated using the following algorithm:
+
+   1.  Get the next object in the scope chain. If there isn't one, go to step 5.
+   2.  Call the [[HasProperty]] method of Result(l), passing the Identifier as
+   the property.
+   3.  If Result(2) is true, return a value of type Reference whose base object
+   is Result(l) and whose property name is the Identifier.
+   4.  Go to step 1.
+   5.  Return a value of type Reference whose base object is null and whose
+   property name is the Identifier.
+   The result of binding an identifier is always a value of type Reference with
+   its member name component equal to the identifier string.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.1.4-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Scope Chain and Identifier Resolution");
+
+new TestCase( "SECTION",
+	      "with MyObject, eval should be [object Global].eval " );
+test();
+
+function test() {
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+
+    var MYOBJECT = new MyObject();
+    var INPUT = 2;
+    gTestcases[gTc].description += ( INPUT +"" );
+
+    with ( MYOBJECT ) {
+      eval = null;
+    }
+
+    gTestcases[gTc].actual = eval( INPUT );
+    gTestcases[gTc].expect = INPUT;
+
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +" = "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : "wrong value ";
+  }
+  return ( gTestcases );
+}
+function MyObject() {
+  this.eval = new Function( "x", "return(Math.pow(Number(x),2))" );
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.4-6.js b/js/src/tests/ecma/ExecutionContexts/10.1.4-6.js
new file mode 100644
index 000000000..d5b13812e
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.4-6.js
@@ -0,0 +1,66 @@
+/* -*- tab-width: 2; 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:          10.1.4-1.js
+   ECMA Section:       10.1.4 Scope Chain and Identifier Resolution
+   Description:
+   Every execution context has associated with it a scope chain. This is
+   logically a list of objects that are searched when binding an Identifier.
+   When control enters an execution context, the scope chain is created and
+   is populated with an initial set of objects, depending on the type of
+   code. When control leaves the execution context, the scope chain is
+   destroyed.
+
+   During execution, the scope chain of the execution context is affected
+   only by WithStatement. When execution enters a with block, the object
+   specified in the with statement is added to the front of the scope chain.
+   When execution leaves a with block, whether normally or via a break or
+   continue statement, the object is removed from the scope chain. The object
+   being removed will always be the first object in the scope chain.
+
+   During execution, the syntactic production PrimaryExpression : Identifier
+   is evaluated using the following algorithm:
+
+   1.  Get the next object in the scope chain. If there isn't one, go to step 5.
+   2.  Call the [[HasProperty]] method of Result(l), passing the Identifier as
+   the property.
+   3.  If Result(2) is true, return a value of type Reference whose base object
+   is Result(l) and whose property name is the Identifier.
+   4.  Go to step 1.
+   5.  Return a value of type Reference whose base object is null and whose
+   property name is the Identifier.
+   The result of binding an identifier is always a value of type Reference with
+   its member name component equal to the identifier string.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.1.4-6";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Scope Chain and Identifier Resolution");
+
+
+var testcase = new TestCase( "SECTION",
+			     "with MyObject, eval should be [object Global].eval " );
+
+var MYOBJECT = new MyObject();
+var INPUT = 2;
+testcase.description += ( INPUT +"" );
+
+with ( MYOBJECT ) {
+  ;
+}
+testcase.actual = eval( INPUT );
+testcase.expect = INPUT;
+
+test();
+
+
+function MyObject() {
+  this.eval = new Function( "x", "return(Math.pow(Number(x),2))" );
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.4-7.js b/js/src/tests/ecma/ExecutionContexts/10.1.4-7.js
new file mode 100644
index 000000000..5b3aa3adf
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.4-7.js
@@ -0,0 +1,77 @@
+/* -*- tab-width: 2; 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:          10.1.4-7.js
+   ECMA Section:       10.1.4 Scope Chain and Identifier Resolution
+   Description:
+   Every execution context has associated with it a scope chain. This is
+   logically a list of objects that are searched when binding an Identifier.
+   When control enters an execution context, the scope chain is created and
+   is populated with an initial set of objects, depending on the type of
+   code. When control leaves the execution context, the scope chain is
+   destroyed.
+
+   During execution, the scope chain of the execution context is affected
+   only by WithStatement. When execution enters a with block, the object
+   specified in the with statement is added to the front of the scope chain.
+   When execution leaves a with block, whether normally or via a break or
+   continue statement, the object is removed from the scope chain. The object
+   being removed will always be the first object in the scope chain.
+
+   During execution, the syntactic production PrimaryExpression : Identifier
+   is evaluated using the following algorithm:
+
+   1.  Get the next object in the scope chain. If there isn't one, go to step 5.
+   2.  Call the [[HasProperty]] method of Result(l), passing the Identifier as
+   the property.
+   3.  If Result(2) is true, return a value of type Reference whose base object
+   is Result(l) and whose property name is the Identifier.
+   4.  Go to step 1.
+   5.  Return a value of type Reference whose base object is null and whose
+   property name is the Identifier.
+   The result of binding an identifier is always a value of type Reference with
+   its member name component equal to the identifier string.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.1.4-7";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Scope Chain and Identifier Resolution");
+
+new TestCase( "SECTION",
+	      "with MyObject, eval should be [object Global].eval " );
+test();
+
+function test() {
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+
+    var MYOBJECT = new MyObject();
+    var INPUT = 2;
+    gTestcases[gTc].description += ( INPUT +"" );
+
+    with ( MYOBJECT ) {
+      delete( eval );
+      gTestcases[gTc].actual = eval( INPUT );
+      gTestcases[gTc].expect = INPUT;
+    }
+
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +" = "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : "wrong value ";
+  }
+  return ( gTestcases );
+}
+
+function MyObject() {
+  this.eval = new Function( "x", "return(Math.pow(Number(x),2))" );
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.4-8.js b/js/src/tests/ecma/ExecutionContexts/10.1.4-8.js
new file mode 100644
index 000000000..583708199
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.4-8.js
@@ -0,0 +1,78 @@
+/* -*- tab-width: 2; 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:          10.1.4-1.js
+   ECMA Section:       10.1.4 Scope Chain and Identifier Resolution
+   Description:
+   Every execution context has associated with it a scope chain. This is
+   logically a list of objects that are searched when binding an Identifier.
+   When control enters an execution context, the scope chain is created and
+   is populated with an initial set of objects, depending on the type of
+   code. When control leaves the execution context, the scope chain is
+   destroyed.
+
+   During execution, the scope chain of the execution context is affected
+   only by WithStatement. When execution enters a with block, the object
+   specified in the with statement is added to the front of the scope chain.
+   When execution leaves a with block, whether normally or via a break or
+   continue statement, the object is removed from the scope chain. The object
+   being removed will always be the first object in the scope chain.
+
+   During execution, the syntactic production PrimaryExpression : Identifier
+   is evaluated using the following algorithm:
+
+   1.  Get the next object in the scope chain. If there isn't one, go to step 5.
+   2.  Call the [[HasProperty]] method of Result(l), passing the Identifier as
+   the property.
+   3.  If Result(2) is true, return a value of type Reference whose base object
+   is Result(l) and whose property name is the Identifier.
+   4.  Go to step 1.
+   5.  Return a value of type Reference whose base object is null and whose
+   property name is the Identifier.
+   The result of binding an identifier is always a value of type Reference with
+   its member name component equal to the identifier string.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.1.4-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Scope Chain and Identifier Resolution");
+
+new TestCase( "SECTION",
+	      "with MyObject, eval should cube INPUT:  " );
+test();
+
+function test() {
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+
+    var MYOBJECT = new MyObject();
+    var INPUT = 2;
+    gTestcases[gTc].description += ( INPUT +"" );
+
+    with ( MYOBJECT ) {
+      eval = new Function ( "x", "return(Math.pow(Number(x),3))" );
+
+      gTestcases[gTc].actual = eval( INPUT );
+      gTestcases[gTc].expect = Math.pow(INPUT,3);
+    }
+
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +" = "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : "wrong value ";
+  }
+  return ( gTestcases );
+}
+
+function MyObject() {
+  this.eval = new Function( "x", "return(Math.pow(Number(x),2))" );
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.5-1.js b/js/src/tests/ecma/ExecutionContexts/10.1.5-1.js
new file mode 100644
index 000000000..17dae58b1
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.5-1.js
@@ -0,0 +1,84 @@
+/* -*- 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:          10.1.5-1.js
+   ECMA Section:       10.1.5 Global Object
+   Description:
+   There is a unique global object which is created before control enters
+   any execution context. Initially the global object has the following
+   properties:
+
+   Built-in objects such as Math, String, Date, parseInt, etc. These have
+   attributes { DontEnum }.
+
+   Additional host defined properties. This may include a property whose
+   value is the global object itself, for example window in HTML.
+
+   As control enters execution contexts, and as ECMAScript code is executed,
+   additional properties may be added to the global object and the initial
+   properties may be changed.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.5.1-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Global Object");
+
+
+new TestCase( "SECTION", "Global Code check" );
+
+if ( Object == null ) {
+  gTestcases[0].reason += " Object == null" ;
+}
+if ( Function == null ) {
+  gTestcases[0].reason += " Function == null";
+}
+if ( String == null ) {
+  gTestcases[0].reason += " String == null";
+}
+if ( Array == null ) {
+  gTestcases[0].reason += " Array == null";
+}
+if ( Number == null ) {
+  gTestcases[0].reason += " Function == null";
+}
+if ( Math == null ) {
+  gTestcases[0].reason += " Math == null";
+}
+if ( Boolean == null ) {
+  gTestcases[0].reason += " Boolean == null";
+}
+if ( Date  == null ) {
+  gTestcases[0].reason += " Date == null";
+}
+/*
+  if ( NaN == null ) {
+  gTestcases[0].reason += " NaN == null";
+  }
+  if ( Infinity == null ) {
+  gTestcases[0].reason += " Infinity == null";
+  }
+*/
+if ( eval == null ) {
+  gTestcases[0].reason += " eval == null";
+}
+if ( parseInt == null ) {
+  gTestcases[0].reason += " parseInt == null";
+}
+
+if ( gTestcases[0].reason != "" ) {
+  gTestcases[0].actual = "fail";
+} else {
+  gTestcases[0].actual = "pass";
+}
+gTestcases[0].expect = "pass";
+
+test();
+
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.5-2.js b/js/src/tests/ecma/ExecutionContexts/10.1.5-2.js
new file mode 100644
index 000000000..e27c7b03b
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.5-2.js
@@ -0,0 +1,66 @@
+/* -*- 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:          10.1.5-2.js
+   ECMA Section:       10.1.5 Global Object
+   Description:
+   There is a unique global object which is created before control enters
+   any execution context. Initially the global object has the following
+   properties:
+
+   Built-in objects such as Math, String, Date, parseInt, etc. These have
+   attributes { DontEnum }.
+
+   Additional host defined properties. This may include a property whose
+   value is the global object itself, for example window in HTML.
+
+   As control enters execution contexts, and as ECMAScript code is executed,
+   additional properties may be added to the global object and the initial
+   properties may be changed.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.5.1-2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Global Object");
+
+new TestCase( "SECTION", "Eval Code check" );
+
+var EVAL_STRING = 'if ( Object == null ) { gTestcases[0].reason += " Object == null" ; }' +
+  'if ( Function == null ) { gTestcases[0].reason += " Function == null"; }' +
+  'if ( String == null ) { gTestcases[0].reason += " String == null"; }'   +
+  'if ( Array == null ) { gTestcases[0].reason += " Array == null"; }'     +
+  'if ( Number == null ) { gTestcases[0].reason += " Function == null";}'  +
+  'if ( Math == null ) { gTestcases[0].reason += " Math == null"; }'       +
+  'if ( Boolean == null ) { gTestcases[0].reason += " Boolean == null"; }' +
+  'if ( Date  == null ) { gTestcases[0].reason += " Date == null"; }'      +
+  'if ( eval == null ) { gTestcases[0].reason += " eval == null"; }'       +
+  'if ( parseInt == null ) { gTestcases[0].reason += " parseInt == null"; }' ;
+
+eval( EVAL_STRING );
+
+/*
+  if ( NaN == null ) {
+  gTestcases[0].reason += " NaN == null";
+  }
+  if ( Infinity == null ) {
+  gTestcases[0].reason += " Infinity == null";
+  }
+*/
+
+if ( gTestcases[0].reason != "" ) {
+  gTestcases[0].actual = "fail";
+} else {
+  gTestcases[0].actual = "pass";
+}
+gTestcases[0].expect = "pass";
+
+test();
+
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.5-3.js b/js/src/tests/ecma/ExecutionContexts/10.1.5-3.js
new file mode 100644
index 000000000..20121f7a3
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.5-3.js
@@ -0,0 +1,95 @@
+/* -*- 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:          10.1.5-3.js
+   ECMA Section:       10.1.5 Global Object
+   Description:
+   There is a unique global object which is created before control enters
+   any execution context. Initially the global object has the following
+   properties:
+
+   Built-in objects such as Math, String, Date, parseInt, etc. These have
+   attributes { DontEnum }.
+
+   Additional host defined properties. This may include a property whose
+   value is the global object itself, for example window in HTML.
+
+   As control enters execution contexts, and as ECMAScript code is executed,
+   additional properties may be added to the global object and the initial
+   properties may be changed.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.5.1-3";
+var VERSION = "ECMA_1";
+startTest();
+writeHeaderToLog( SECTION + " Global Object");
+
+new TestCase( "SECTION", "Function Code check" );
+
+test();
+
+function test() {
+  if ( Object == null ) {
+    gTestcases[0].reason += " Object == null" ;
+  }
+  if ( Function == null ) {
+    gTestcases[0].reason += " Function == null";
+  }
+  if ( String == null ) {
+    gTestcases[0].reason += " String == null";
+  }
+  if ( Array == null ) {
+    gTestcases[0].reason += " Array == null";
+  }
+  if ( Number == null ) {
+    gTestcases[0].reason += " Function == null";
+  }
+  if ( Math == null ) {
+    gTestcases[0].reason += " Math == null";
+  }
+  if ( Boolean == null ) {
+    gTestcases[0].reason += " Boolean == null";
+  }
+  if ( Date  == null ) {
+    gTestcases[0].reason += " Date == null";
+  }
+/*
+  if ( NaN == null ) {
+  gTestcases[0].reason += " NaN == null";
+  }
+  if ( Infinity == null ) {
+  gTestcases[0].reason += " Infinity == null";
+  }
+*/
+  if ( eval == null ) {
+    gTestcases[0].reason += " eval == null";
+  }
+  if ( parseInt == null ) {
+    gTestcases[0].reason += " parseInt == null";
+  }
+
+  if ( gTestcases[0].reason != "" ) {
+    gTestcases[0].actual = "fail";
+  } else {
+    gTestcases[0].actual = "pass";
+  }
+  gTestcases[0].expect = "pass";
+
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +" = "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : "wrong value ";
+  }
+  return ( gTestcases );
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.5-4.js b/js/src/tests/ecma/ExecutionContexts/10.1.5-4.js
new file mode 100644
index 000000000..14d2c248a
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.5-4.js
@@ -0,0 +1,57 @@
+/* -*- 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:          10.1.5-4.js
+   ECMA Section:       10.1.5 Global Object
+   Description:
+   There is a unique global object which is created before control enters
+   any execution context. Initially the global object has the following
+   properties:
+
+   Built-in objects such as Math, String, Date, parseInt, etc. These have
+   attributes { DontEnum }.
+
+   Additional host defined properties. This may include a property whose
+   value is the global object itself, for example window in HTML.
+
+   As control enters execution contexts, and as ECMAScript code is executed,
+   additional properties may be added to the global object and the initial
+   properties may be changed.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.5.1-4";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Global Object");
+
+new TestCase( "SECTION", "Anonymous Code check" );
+
+
+var EVAL_STRING = 'if ( Object == null ) { gTestcases[0].reason += " Object == null" ; }' +
+  'if ( Function == null ) { gTestcases[0].reason += " Function == null"; }' +
+  'if ( String == null ) { gTestcases[0].reason += " String == null"; }'   +
+  'if ( Array == null ) { gTestcases[0].reason += " Array == null"; }'     +
+  'if ( Number == null ) { gTestcases[0].reason += " Function == null";}'  +
+  'if ( Math == null ) { gTestcases[0].reason += " Math == null"; }'       +
+  'if ( Boolean == null ) { gTestcases[0].reason += " Boolean == null"; }' +
+  'if ( Date  == null ) { gTestcases[0].reason += " Date == null"; }'      +
+  'if ( eval == null ) { gTestcases[0].reason += " eval == null"; }'       +
+  'if ( parseInt == null ) { gTestcases[0].reason += " parseInt == null"; }' ;
+
+var NEW_FUNCTION = new Function( EVAL_STRING );
+
+if ( gTestcases[0].reason != "" ) {
+  gTestcases[0].actual = "fail";
+} else {
+  gTestcases[0].actual = "pass";
+}
+gTestcases[0].expect = "pass";
+
+test();
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.8-2.js b/js/src/tests/ecma/ExecutionContexts/10.1.8-2.js
new file mode 100644
index 000000000..27762b493
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.8-2.js
@@ -0,0 +1,86 @@
+/* -*- tab-width: 2; 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:          10.1.8-2
+   ECMA Section:       Arguments Object
+   Description:
+
+   When control enters an execution context for declared function code,
+   anonymous code, or implementation-supplied code, an arguments object is
+   created and initialized as follows:
+
+   The [[Prototype]] of the arguments object is to the original Object
+   prototype object, the one that is the initial value of Object.prototype
+   (section 15.2.3.1).
+
+   A property is created with name callee and property attributes {DontEnum}.
+   The initial value of this property is the function object being executed.
+   This allows anonymous functions to be recursive.
+
+   A property is created with name length and property attributes {DontEnum}.
+   The initial value of this property is the number of actual parameter values
+   supplied by the caller.
+
+   For each non-negative integer, iarg, less than the value of the length
+   property, a property is created with name ToString(iarg) and property
+   attributes { DontEnum }. The initial value of this property is the value
+   of the corresponding actual parameter supplied by the caller. The first
+   actual parameter value corresponds to iarg = 0, the second to iarg = 1 and
+   so on. In the case when iarg is less than the number of formal parameters
+   for the function object, this property shares its value with the
+   corresponding property of the activation object. This means that changing
+   this property changes the corresponding property of the activation object
+   and vice versa. The value sharing mechanism depends on the implementation.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "10.1.8-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Arguments Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  Tests for anonymous functions
+
+var GetCallee       = new Function( "var c = arguments.callee; return c" );
+var GetArguments    = new Function( "var a = arguments; return a" );
+var GetLength       = new Function( "var l = arguments.length; return l" );
+
+var ARG_STRING = "value of the argument property";
+
+new TestCase( SECTION,
+	      "GetCallee()",
+	      GetCallee,
+	      GetCallee() );
+
+var LIMIT = 100;
+
+for ( var i = 0, args = "" ; i < LIMIT; i++ ) {
+  args += String(i) + ( i+1 < LIMIT ? "," : "" );
+
+}
+
+var LENGTH = eval( "GetLength("+ args +")" );
+
+new TestCase( SECTION,
+	      "GetLength("+args+")",
+	      100,
+	      LENGTH );
+
+var ARGUMENTS = eval( "GetArguments( " +args+")" );
+
+for ( var i = 0; i < 100; i++ ) {
+  new TestCase( SECTION,
+		"GetArguments("+args+")["+i+"]",
+		i,
+		ARGUMENTS[i] );
+}
+
+test();
diff --git a/js/src/tests/ecma/ExecutionContexts/10.1.8-3.js b/js/src/tests/ecma/ExecutionContexts/10.1.8-3.js
new file mode 100644
index 000000000..a928c2915
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.1.8-3.js
@@ -0,0 +1,31 @@
+/* -*- 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:          10.1.8-3
+   ECMA Section:       Arguments Object
+   Description:
+
+   The [[Prototype]] of the arguments object is to the original Object
+   prototype object, the one that is the initial value of Object.prototype
+   (section 15.2.3.1).
+
+   ...
+
+   Test that "typeof arguments" is thus "object".
+
+*/
+
+var SECTION = "10.1.8-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Arguments Object";
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var expected = "object";
+var actual = (function () { return typeof arguments; })();
+reportCompare(expected, actual, "typeof arguments == object");
+
diff --git a/js/src/tests/ecma/ExecutionContexts/10.2.1.js b/js/src/tests/ecma/ExecutionContexts/10.2.1.js
new file mode 100644
index 000000000..e67971531
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.2.1.js
@@ -0,0 +1,51 @@
+/* -*- tab-width: 2; 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:          10.2.1.js
+   ECMA Section:       10.2.1 Global Code
+   Description:
+
+   The scope chain is created and initialized to contain the global object and
+   no others.
+
+   Variable instantiation is performed using the global object as the variable
+   object and using empty property attributes.
+
+   The this value is the global object.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "10.2.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Global Code";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var THIS = this;
+
+new TestCase( SECTION,
+	      "this +''",
+	      GLOBAL,
+	      THIS + "" );
+
+var GLOBAL_PROPERTIES = new Array();
+var i = 0;
+
+for ( p in this ) {
+  GLOBAL_PROPERTIES[i++] = p;
+}
+
+for ( i = 0; i < GLOBAL_PROPERTIES.length; i++ ) {
+  new TestCase( SECTION,
+		GLOBAL_PROPERTIES[i] +" == void 0",
+		false,
+		eval("GLOBAL_PROPERTIES["+i+"] == void 0"));
+}
+
+test();
diff --git a/js/src/tests/ecma/ExecutionContexts/10.2.2-1.js b/js/src/tests/ecma/ExecutionContexts/10.2.2-1.js
new file mode 100644
index 000000000..c41ad46b3
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.2.2-1.js
@@ -0,0 +1,89 @@
+// |reftest| skip-if(Android) -- bug - nsIDOMWindow.crypto throws NS_ERROR_NOT_IMPLEMENTED on Android
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          10.2.2-1.js
+   ECMA Section:       10.2.2 Eval Code
+   Description:
+
+   When control enters an execution context for eval code, the previous
+   active execution context, referred to as the calling context, is used to
+   determine the scope chain, the variable object, and the this value. If
+   there is no calling context, then initializing the scope chain, variable
+   instantiation, and determination of the this value are performed just as
+   for global code.
+
+   The scope chain is initialized to contain the same objects, in the same
+   order, as the calling context's scope chain.  This includes objects added
+   to the calling context's scope chain by WithStatement.
+
+   Variable instantiation is performed using the calling context's variable
+   object and using empty property attributes.
+
+   The this value is the same as the this value of the calling context.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "10.2.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Eval Code";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var THIS = eval("this");
+
+new TestCase( SECTION,
+	      "this +''",
+	      GLOBAL,
+	      THIS + "" );
+
+var GLOBAL_PROPERTIES = new Array();
+var i = 0;
+
+for ( p in THIS ) {
+  GLOBAL_PROPERTIES[i++] = p;
+}
+
+for ( i = 0; i < GLOBAL_PROPERTIES.length; i++ ) {
+  new TestCase( SECTION,
+		GLOBAL_PROPERTIES[i] +" == THIS["+GLOBAL_PROPERTIES[i]+"]",
+		true,
+		eval(GLOBAL_PROPERTIES[i]) == eval( "THIS[GLOBAL_PROPERTIES[i]]") );
+}
+
+//  this in eval statements is the same as this value of the calling context
+
+var RESULT = THIS == this;
+
+new TestCase( SECTION,
+	      "eval( 'this == THIS' )",
+	      true,
+	      RESULT );
+
+var RESULT = THIS +'';
+
+new TestCase( SECTION,
+	      "eval( 'this + \"\"' )",
+	      GLOBAL,
+	      RESULT );
+
+
+new TestCase( SECTION,
+	      "eval( 'this == THIS' )",
+	      true,
+	      eval( "this == THIS" ) );
+
+new TestCase( SECTION,
+	      "eval( 'this + \"\"' )",
+	      GLOBAL,
+	      eval( "this +''") );
+
+
+test();
diff --git a/js/src/tests/ecma/ExecutionContexts/10.2.2-2.js b/js/src/tests/ecma/ExecutionContexts/10.2.2-2.js
new file mode 100644
index 000000000..fbcd522c6
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.2.2-2.js
@@ -0,0 +1,100 @@
+// |reftest| skip-if(Android) -- bug - nsIDOMWindow.crypto throws NS_ERROR_NOT_IMPLEMENTED on Android
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          10.2.2-2.js
+   ECMA Section:       10.2.2 Eval Code
+   Description:
+
+   When control enters an execution context for eval code, the previous
+   active execution context, referred to as the calling context, is used to
+   determine the scope chain, the variable object, and the this value. If
+   there is no calling context, then initializing the scope chain, variable
+   instantiation, and determination of the this value are performed just as
+   for global code.
+
+   The scope chain is initialized to contain the same objects, in the same
+   order, as the calling context's scope chain.  This includes objects added
+   to the calling context's scope chain by WithStatement.
+
+   Variable instantiation is performed using the calling context's variable
+   object and using empty property attributes.
+
+   The this value is the same as the this value of the calling context.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "10.2.2-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Eval Code";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  Test Objects
+
+var OBJECT = new MyObject( "hello" );
+var GLOBAL_PROPERTIES = new Array();
+var i = 0;
+
+for ( p in this ) {
+  GLOBAL_PROPERTIES[i++] = p;
+}
+
+with ( OBJECT ) {
+  var THIS = this;
+  new TestCase( SECTION,
+		"eval( 'this == THIS' )",                 
+		true,              
+		eval("this == THIS") );
+  new TestCase( SECTION,
+		"this in a with() block",                 
+		GLOBAL, 
+		this+"" );
+  new TestCase( SECTION,
+		"new MyObject('hello').value",            
+		"hello",           
+		value );
+  new TestCase( SECTION,
+		"eval(new MyObject('hello').value)",      
+		"hello",           
+		eval("value") );
+  new TestCase( SECTION,
+		"new MyObject('hello').getClass()",       
+		"[object Object]", 
+		getClass() );
+  new TestCase( SECTION,
+		"eval(new MyObject('hello').getClass())", 
+		"[object Object]", 
+		eval("getClass()") );
+  new TestCase( SECTION,
+		"eval(new MyObject('hello').toString())", 
+		"hello", 
+		eval("toString()") );
+  new TestCase( SECTION,
+		"eval('getClass') == Object.prototype.toString", 
+		true, 
+		eval("getClass") == Object.prototype.toString );
+
+  for ( i = 0; i < GLOBAL_PROPERTIES.length; i++ ) {
+    new TestCase( SECTION, GLOBAL_PROPERTIES[i] +
+		  " == THIS["+GLOBAL_PROPERTIES[i]+"]", true,
+		  eval(GLOBAL_PROPERTIES[i]) == eval( "THIS[GLOBAL_PROPERTIES[i]]") );
+  }
+
+}
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.getClass = Object.prototype.toString;
+  this.toString = new Function( "return this.value+''" );
+  return this;
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.2.3-1.js b/js/src/tests/ecma/ExecutionContexts/10.2.3-1.js
new file mode 100644
index 000000000..e7dd029f5
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.2.3-1.js
@@ -0,0 +1,52 @@
+/* -*- tab-width: 2; 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:          10.2.3-1.js
+   ECMA Section:       10.2.3 Function and Anonymous Code
+   Description:
+
+   The scope chain is initialized to contain the activation object followed
+   by the global object. Variable instantiation is performed using the
+   activation by the global object. Variable instantiation is performed using
+   the activation object as the variable object and using property attributes
+   { DontDelete }. The caller provides the this value. If the this value
+   provided by the caller is not an object (including the case where it is
+   null), then the this value is the global object.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "10.2.3-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Eval Code";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var o = new MyObject("hello")
+
+  new TestCase( SECTION,
+		"var o = new MyObject('hello'); o.THIS == x",
+		true,
+		o.THIS == o );
+
+var o = MyFunction();
+
+new TestCase( SECTION,
+	      "var o = MyFunction(); o == this",
+	      true,
+	      o == this );
+
+test();
+
+function MyFunction( value ) {
+  return this;
+}
+function MyObject( value ) {
+  this.THIS = this;
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/10.2.3-2.js b/js/src/tests/ecma/ExecutionContexts/10.2.3-2.js
new file mode 100644
index 000000000..389be93cc
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/10.2.3-2.js
@@ -0,0 +1,58 @@
+/* -*- tab-width: 2; 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:          10.2.3-2.js
+   ECMA Section:       10.2.3 Function and Anonymous Code
+   Description:
+
+   The scope chain is initialized to contain the activation object followed
+   by the global object. Variable instantiation is performed using the
+   activation by the global object. Variable instantiation is performed using
+   the activation object as the variable object and using property attributes
+   { DontDelete }. The caller provides the this value. If the this value
+   provided by the caller is not an object (including the case where it is
+   null), then the this value is the global object.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "10.2.3-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function and Anonymous Code";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var o = new MyObject("hello");
+
+new TestCase( SECTION,
+	      "MyFunction(\"PASSED!\")",
+	      "PASSED!",
+	      MyFunction("PASSED!") );
+
+var o = MyFunction();
+
+new TestCase( SECTION,
+	      "MyOtherFunction(true);",
+	      false,
+	      MyOtherFunction(true) );
+
+test();
+
+function MyFunction( value ) {
+  var x = value;
+  delete x;
+  return x;
+}
+function MyOtherFunction(value) {
+  var x = value;
+  return delete x;
+}
+function MyObject( value ) {
+  this.THIS = this;
+}
diff --git a/js/src/tests/ecma/ExecutionContexts/browser.js b/js/src/tests/ecma/ExecutionContexts/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/browser.js
diff --git a/js/src/tests/ecma/ExecutionContexts/shell.js b/js/src/tests/ecma/ExecutionContexts/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/ExecutionContexts/shell.js
diff --git a/js/src/tests/ecma/Expressions/11.1.1.js b/js/src/tests/ecma/Expressions/11.1.1.js
new file mode 100644
index 000000000..f1310ac8b
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.1.1.js
@@ -0,0 +1,103 @@
+/* -*- tab-width: 2; 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:          11.1.1.js
+   ECMA Section:       11.1.1 The this keyword
+   Description:
+
+   The this keyword evaluates to the this value of the execution context.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.1.1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The this keyword");
+
+var GLOBAL_OBJECT = this.toString();
+
+// this in global code and eval(this) in global code should return the global object.
+
+new TestCase( SECTION,
+	      "Global Code: this.toString()",
+	      GLOBAL_OBJECT,
+	      this.toString() );
+
+new TestCase( SECTION,
+	      "Global Code:  eval('this.toString()')",
+	      GLOBAL_OBJECT,
+	      eval('this.toString()') );
+
+// this in anonymous code called as a function should return the global object.
+
+new TestCase( SECTION,
+	      "Anonymous Code: var MYFUNC = new Function('return this.toString()'); MYFUNC()",
+	      GLOBAL_OBJECT,
+	      eval("var MYFUNC = new Function('return this.toString()'); MYFUNC()") );
+
+// eval( this ) in anonymous code called as a function should return that function's activation object
+
+new TestCase( SECTION,
+	      "Anonymous Code: var MYFUNC = new Function('return (eval(\"this.toString()\")'); (MYFUNC()).toString()",
+	      GLOBAL_OBJECT,
+	      eval("var MYFUNC = new Function('return eval(\"this.toString()\")'); (MYFUNC()).toString()") );
+
+// this and eval( this ) in anonymous code called as a constructor should return the object
+
+new TestCase( SECTION,
+	      "Anonymous Code: var MYFUNC = new Function('this.THIS = this'); ((new MYFUNC()).THIS).toString()",
+	      "[object Object]",
+	      eval("var MYFUNC = new Function('this.THIS = this'); ((new MYFUNC()).THIS).toString()") );
+
+new TestCase( SECTION,
+	      "Anonymous Code: var MYFUNC = new Function('this.THIS = this'); var FUN1 = new MYFUNC(); FUN1.THIS == FUN1",
+	      true,
+	      eval("var MYFUNC = new Function('this.THIS = this'); var FUN1 = new MYFUNC(); FUN1.THIS == FUN1") );
+
+new TestCase( SECTION,
+	      "Anonymous Code: var MYFUNC = new Function('this.THIS = eval(\"this\")'); ((new MYFUNC().THIS).toString()",
+	      "[object Object]",
+	      eval("var MYFUNC = new Function('this.THIS = eval(\"this\")'); ((new MYFUNC()).THIS).toString()") );
+
+new TestCase( SECTION,
+	      "Anonymous Code: var MYFUNC = new Function('this.THIS = eval(\"this\")'); var FUN1 = new MYFUNC(); FUN1.THIS == FUN1",
+	      true,
+	      eval("var MYFUNC = new Function('this.THIS = eval(\"this\")'); var FUN1 = new MYFUNC(); FUN1.THIS == FUN1") );
+
+// this and eval(this) in function code called as a function should return the global object.
+new TestCase( SECTION,
+	      "Function Code:  ReturnThis()",
+	      GLOBAL_OBJECT,
+	      ReturnThis() );
+
+new TestCase( SECTION,
+	      "Function Code:  ReturnEvalThis()",
+	      GLOBAL_OBJECT,
+	      ReturnEvalThis() );
+
+//  this and eval(this) in function code called as a contructor should return the object.
+new TestCase( SECTION,
+	      "var MYOBJECT = new ReturnThis(); MYOBJECT.toString()",
+	      "[object Object]",
+	      eval("var MYOBJECT = new ReturnThis(); MYOBJECT.toString()") );
+
+new TestCase( SECTION,
+	      "var MYOBJECT = new ReturnEvalThis(); MYOBJECT.toString()",
+	      "[object Object]",
+	      eval("var MYOBJECT = new ReturnEvalThis(); MYOBJECT.toString()") );
+
+test();
+
+function ReturnThis() {
+  return this.toString();
+}
+
+function ReturnEvalThis() {
+  return( eval("this.toString()") );
+}
diff --git a/js/src/tests/ecma/Expressions/11.10-1.js b/js/src/tests/ecma/Expressions/11.10-1.js
new file mode 100644
index 000000000..a9926f27b
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.10-1.js
@@ -0,0 +1,236 @@
+/* -*- tab-width: 2; 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:          11.10-1.js
+   ECMA Section:       11.10-1 Binary Bitwise Operators:  &
+   Description:
+   Semantics
+
+   The production A : A @ B, where @ is one of the bitwise operators in the
+   productions &, ^, | , is evaluated as follows:
+
+   1.  Evaluate A.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate B.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToInt32(Result(2)).
+   6.  Call ToInt32(Result(4)).
+   7.  Apply the bitwise operator @ to Result(5) and Result(6). The result is
+   a signed 32 bit integer.
+   8.  Return Result(7).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.10-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Binary Bitwise Operators:  &");
+
+var shiftexp = 0;
+var addexp = 0;
+
+//    for ( shiftpow = 0; shiftpow < 33; shiftpow++ ) {
+for ( shiftpow = 0; shiftpow < 1; shiftpow++ ) {
+  shiftexp += Math.pow( 2, shiftpow );
+
+  for ( addpow = 0; addpow < 33; addpow++ ) {
+    addexp += Math.pow(2, addpow);
+
+    new TestCase( SECTION,
+		  shiftexp + " & " + addexp,
+		  And( shiftexp, addexp ),
+		  shiftexp & addexp );
+  }
+}
+
+test();
+
+function ToInteger( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( n != n ) {
+    return 0;
+  }
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
+    return n;
+  }
+  return ( sign * Math.floor(Math.abs(n)) );
+}
+function ToInt32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
+  n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
+
+  return ( n );
+}
+function ToUint32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+  n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+  if ( n < 0 ){
+    n += Math.pow(2,32);
+  }
+
+  return ( n );
+}
+function ToUint16( n ) {
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
+
+  if (n <0) {
+    n += Math.pow(2,16);
+  }
+
+  return ( n );
+}
+function Mask( b, n ) {
+  b = ToUint32BitString( b );
+  b = b.substring( b.length - n );
+  b = ToUint32Decimal( b );
+  return ( b );
+}
+function ToUint32BitString( n ) {
+  var b = "";
+  for ( p = 31; p >=0; p-- ) {
+    if ( n >= Math.pow(2,p) ) {
+      b += "1";
+      n -= Math.pow(2,p);
+    } else {
+      b += "0";
+    }
+  }
+  return b;
+}
+function ToInt32BitString( n ) {
+  var b = "";
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  b += ( sign == 1 ) ? "0" : "1";
+
+  for ( p = 30; p >=0; p-- ) {
+    if ( (sign == 1 ) ? sign * n >= Math.pow(2,p) : sign * n > Math.pow(2,p) ) {
+      b += ( sign == 1 ) ? "1" : "0";
+      n -= sign * Math.pow( 2, p );
+    } else {
+      b += ( sign == 1 ) ? "0" : "1";
+    }
+  }
+
+  return b;
+}
+function ToInt32Decimal( bin ) {
+  var r = 0;
+  var sign;
+
+  if ( Number(bin.charAt(0)) == 0 ) {
+    sign = 1;
+    r = 0;
+  } else {
+    sign = -1;
+    r = -(Math.pow(2,31));
+  }
+
+  for ( var j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+  }
+
+  return r;
+}
+function ToUint32Decimal( bin ) {
+  var r = 0;
+
+
+  for ( l = bin.length; l < 32; l++ ) {
+    bin = "0" + bin;
+  }
+
+  for ( j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+
+  }
+
+  return r;
+}
+function And( s, a ) {
+  s = ToInt32( s );
+  a = ToInt32( a );
+
+  var bs = ToInt32BitString( s );
+  var ba = ToInt32BitString( a );
+
+  var result = "";
+
+  for ( var bit = 0; bit < bs.length; bit++ ) {
+    if ( bs.charAt(bit) == "1" && ba.charAt(bit) == "1" ) {
+      result += "1";
+    } else {
+      result += "0";
+    }
+  }
+  return ToInt32Decimal(result);
+}
+function Xor( s, a ) {
+  s = ToInt32( s );
+  a = ToInt32( a );
+
+  var bs = ToInt32BitString( s );
+  var ba = ToInt32BitString( a );
+
+  var result = "";
+
+  for ( var bit = 0; bit < bs.length; bit++ ) {
+    if ( (bs.charAt(bit) == "1" && ba.charAt(bit) == "0") ||
+	 (bs.charAt(bit) == "0" && ba.charAt(bit) == "1")
+      ) {
+      result += "1";
+    } else {
+      result += "0";
+    }
+  }
+
+  return ToInt32Decimal(result);
+}
+function Or( s, a ) {
+  s = ToInt32( s );
+  a = ToInt32( a );
+
+  var bs = ToInt32BitString( s );
+  var ba = ToInt32BitString( a );
+
+  var result = "";
+
+  for ( var bit = 0; bit < bs.length; bit++ ) {
+    if ( bs.charAt(bit) == "1" || ba.charAt(bit) == "1" ) {
+      result += "1";
+    } else {
+      result += "0";
+    }
+  }
+
+  return ToInt32Decimal(result);
+}
diff --git a/js/src/tests/ecma/Expressions/11.10-2.js b/js/src/tests/ecma/Expressions/11.10-2.js
new file mode 100644
index 000000000..144392f89
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.10-2.js
@@ -0,0 +1,235 @@
+/* -*- tab-width: 2; 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:          11.10-2.js
+   ECMA Section:       11.10-2 Binary Bitwise Operators:  |
+   Description:
+   Semantics
+
+   The production A : A @ B, where @ is one of the bitwise operators in the
+   productions &, ^, | , is evaluated as follows:
+
+   1.  Evaluate A.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate B.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToInt32(Result(2)).
+   6.  Call ToInt32(Result(4)).
+   7.  Apply the bitwise operator @ to Result(5) and Result(6). The result is
+   a signed 32 bit integer.
+   8.  Return Result(7).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.10-2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Binary Bitwise Operators:  |");
+
+var shiftexp = 0;
+var addexp = 0;
+
+for ( shiftpow = 0; shiftpow < 33; shiftpow++ ) {
+  shiftexp += Math.pow( 2, shiftpow );
+
+  for ( addpow = 0; addpow < 33; addpow++ ) {
+    addexp += Math.pow(2, addpow);
+
+    new TestCase( SECTION,
+		  shiftexp + " | " + addexp,
+		  Or( shiftexp, addexp ),
+		  shiftexp | addexp );
+  }
+}
+
+test();
+
+function ToInteger( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( n != n ) {
+    return 0;
+  }
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
+    return n;
+  }
+  return ( sign * Math.floor(Math.abs(n)) );
+}
+function ToInt32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
+  n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
+
+  return ( n );
+}
+function ToUint32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+  n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+  if ( n < 0 ){
+    n += Math.pow(2,32);
+  }
+
+  return ( n );
+}
+function ToUint16( n ) {
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
+
+  if (n <0) {
+    n += Math.pow(2,16);
+  }
+
+  return ( n );
+}
+function Mask( b, n ) {
+  b = ToUint32BitString( b );
+  b = b.substring( b.length - n );
+  b = ToUint32Decimal( b );
+  return ( b );
+}
+function ToUint32BitString( n ) {
+  var b = "";
+  for ( p = 31; p >=0; p-- ) {
+    if ( n >= Math.pow(2,p) ) {
+      b += "1";
+      n -= Math.pow(2,p);
+    } else {
+      b += "0";
+    }
+  }
+  return b;
+}
+function ToInt32BitString( n ) {
+  var b = "";
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  b += ( sign == 1 ) ? "0" : "1";
+
+  for ( p = 30; p >=0; p-- ) {
+    if ( (sign == 1 ) ? sign * n >= Math.pow(2,p) : sign * n > Math.pow(2,p) ) {
+      b += ( sign == 1 ) ? "1" : "0";
+      n -= sign * Math.pow( 2, p );
+    } else {
+      b += ( sign == 1 ) ? "0" : "1";
+    }
+  }
+
+  return b;
+}
+function ToInt32Decimal( bin ) {
+  var r = 0;
+  var sign;
+
+  if ( Number(bin.charAt(0)) == 0 ) {
+    sign = 1;
+    r = 0;
+  } else {
+    sign = -1;
+    r = -(Math.pow(2,31));
+  }
+
+  for ( var j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+  }
+
+  return r;
+}
+function ToUint32Decimal( bin ) {
+  var r = 0;
+
+
+  for ( l = bin.length; l < 32; l++ ) {
+    bin = "0" + bin;
+  }
+
+  for ( j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+
+  }
+
+  return r;
+}
+function And( s, a ) {
+  s = ToInt32( s );
+  a = ToInt32( a );
+
+  var bs = ToInt32BitString( s );
+  var ba = ToInt32BitString( a );
+
+  var result = "";
+
+  for ( var bit = 0; bit < bs.length; bit++ ) {
+    if ( bs.charAt(bit) == "1" && ba.charAt(bit) == "1" ) {
+      result += "1";
+    } else {
+      result += "0";
+    }
+  }
+  return ToInt32Decimal(result);
+}
+function Xor( s, a ) {
+  s = ToInt32( s );
+  a = ToInt32( a );
+
+  var bs = ToInt32BitString( s );
+  var ba = ToInt32BitString( a );
+
+  var result = "";
+
+  for ( var bit = 0; bit < bs.length; bit++ ) {
+    if ( (bs.charAt(bit) == "1" && ba.charAt(bit) == "0") ||
+	 (bs.charAt(bit) == "0" && ba.charAt(bit) == "1")
+      ) {
+      result += "1";
+    } else {
+      result += "0";
+    }
+  }
+
+  return ToInt32Decimal(result);
+}
+function Or( s, a ) {
+  s = ToInt32( s );
+  a = ToInt32( a );
+
+  var bs = ToInt32BitString( s );
+  var ba = ToInt32BitString( a );
+
+  var result = "";
+
+  for ( var bit = 0; bit < bs.length; bit++ ) {
+    if ( bs.charAt(bit) == "1" || ba.charAt(bit) == "1" ) {
+      result += "1";
+    } else {
+      result += "0";
+    }
+  }
+
+  return ToInt32Decimal(result);
+}
diff --git a/js/src/tests/ecma/Expressions/11.10-3.js b/js/src/tests/ecma/Expressions/11.10-3.js
new file mode 100644
index 000000000..5ebb186a3
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.10-3.js
@@ -0,0 +1,234 @@
+/* -*- tab-width: 2; 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:          11.10-3.js
+   ECMA Section:       11.10-3 Binary Bitwise Operators:  ^
+   Description:
+   Semantics
+
+   The production A : A @ B, where @ is one of the bitwise operators in the
+   productions &, ^, | , is evaluated as follows:
+
+   1.  Evaluate A.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate B.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToInt32(Result(2)).
+   6.  Call ToInt32(Result(4)).
+   7.  Apply the bitwise operator @ to Result(5) and Result(6). The result is
+   a signed 32 bit integer.
+   8.  Return Result(7).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.10-3";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Binary Bitwise Operators:  ^");
+
+var shiftexp = 0;
+var addexp = 0;
+
+for ( shiftpow = 0; shiftpow < 33; shiftpow++ ) {
+  shiftexp += Math.pow( 2, shiftpow );
+
+  for ( addpow = 0; addpow < 33; addpow++ ) {
+    addexp += Math.pow(2, addpow);
+
+    new TestCase( SECTION,
+		  shiftexp + " ^ " + addexp,
+		  Xor( shiftexp, addexp ),
+		  shiftexp ^ addexp );
+  }
+}
+
+test();
+
+function ToInteger( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( n != n ) {
+    return 0;
+  }
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
+    return n;
+  }
+  return ( sign * Math.floor(Math.abs(n)) );
+}
+function ToInt32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
+  n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
+
+  return ( n );
+}
+function ToUint32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+  n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+  if ( n < 0 ){
+    n += Math.pow(2,32);
+  }
+
+  return ( n );
+}
+function ToUint16( n ) {
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
+
+  if (n <0) {
+    n += Math.pow(2,16);
+  }
+
+  return ( n );
+}
+function Mask( b, n ) {
+  b = ToUint32BitString( b );
+  b = b.substring( b.length - n );
+  b = ToUint32Decimal( b );
+  return ( b );
+}
+function ToUint32BitString( n ) {
+  var b = "";
+  for ( p = 31; p >=0; p-- ) {
+    if ( n >= Math.pow(2,p) ) {
+      b += "1";
+      n -= Math.pow(2,p);
+    } else {
+      b += "0";
+    }
+  }
+  return b;
+}
+function ToInt32BitString( n ) {
+  var b = "";
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  b += ( sign == 1 ) ? "0" : "1";
+
+  for ( p = 30; p >=0; p-- ) {
+    if ( (sign == 1 ) ? sign * n >= Math.pow(2,p) : sign * n > Math.pow(2,p) ) {
+      b += ( sign == 1 ) ? "1" : "0";
+      n -= sign * Math.pow( 2, p );
+    } else {
+      b += ( sign == 1 ) ? "0" : "1";
+    }
+  }
+
+  return b;
+}
+function ToInt32Decimal( bin ) {
+  var r = 0;
+  var sign;
+
+  if ( Number(bin.charAt(0)) == 0 ) {
+    sign = 1;
+    r = 0;
+  } else {
+    sign = -1;
+    r = -(Math.pow(2,31));
+  }
+
+  for ( var j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+  }
+
+  return r;
+}
+function ToUint32Decimal( bin ) {
+  var r = 0;
+
+  for ( l = bin.length; l < 32; l++ ) {
+    bin = "0" + bin;
+  }
+
+  for ( j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+
+  }
+
+  return r;
+}
+function And( s, a ) {
+  s = ToInt32( s );
+  a = ToInt32( a );
+
+  var bs = ToInt32BitString( s );
+  var ba = ToInt32BitString( a );
+
+  var result = "";
+
+  for ( var bit = 0; bit < bs.length; bit++ ) {
+    if ( bs.charAt(bit) == "1" && ba.charAt(bit) == "1" ) {
+      result += "1";
+    } else {
+      result += "0";
+    }
+  }
+  return ToInt32Decimal(result);
+}
+function Xor( s, a ) {
+  s = ToInt32( s );
+  a = ToInt32( a );
+
+  var bs = ToInt32BitString( s );
+  var ba = ToInt32BitString( a );
+
+  var result = "";
+
+  for ( var bit = 0; bit < bs.length; bit++ ) {
+    if ( (bs.charAt(bit) == "1" && ba.charAt(bit) == "0") ||
+	 (bs.charAt(bit) == "0" && ba.charAt(bit) == "1")
+      ) {
+      result += "1";
+    } else {
+      result += "0";
+    }
+  }
+
+  return ToInt32Decimal(result);
+}
+function Or( s, a ) {
+  s = ToInt32( s );
+  a = ToInt32( a );
+
+  var bs = ToInt32BitString( s );
+  var ba = ToInt32BitString( a );
+
+  var result = "";
+
+  for ( var bit = 0; bit < bs.length; bit++ ) {
+    if ( bs.charAt(bit) == "1" || ba.charAt(bit) == "1" ) {
+      result += "1";
+    } else {
+      result += "0";
+    }
+  }
+
+  return ToInt32Decimal(result);
+}
diff --git a/js/src/tests/ecma/Expressions/11.12-1.js b/js/src/tests/ecma/Expressions/11.12-1.js
new file mode 100644
index 000000000..8c2441208
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.12-1.js
@@ -0,0 +1,76 @@
+/* -*- 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:          11.12.js
+   ECMA Section:       11.12 Conditional Operator
+   Description:
+   Logi
+
+   calORExpression ? AssignmentExpression : AssignmentExpression
+
+   Semantics
+
+   The production ConditionalExpression :
+   LogicalORExpression ? AssignmentExpression : AssignmentExpression
+   is evaluated as follows:
+
+   1.  Evaluate LogicalORExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToBoolean(Result(2)).
+   4.  If Result(3) is false, go to step 8.
+   5.  Evaluate the first AssignmentExpression.
+   6.  Call GetValue(Result(5)).
+   7.  Return Result(6).
+   8.  Evaluate the second AssignmentExpression.
+   9.  Call GetValue(Result(8)).
+   10.  Return Result(9).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.12";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Conditional operator( ? : )");
+
+new TestCase( SECTION,   
+              "true ? 'PASSED' : 'FAILED'",    
+              "PASSED",      
+              (true?"PASSED":"FAILED"));
+
+new TestCase( SECTION,   
+              "false ? 'FAILED' : 'PASSED'",    
+              "PASSED",     
+              (false?"FAILED":"PASSED"));
+
+new TestCase( SECTION,   
+              "1 ? 'PASSED' : 'FAILED'",    
+              "PASSED",         
+              (true?"PASSED":"FAILED"));
+
+new TestCase( SECTION,   
+              "0 ? 'FAILED' : 'PASSED'",    
+              "PASSED",         
+              (false?"FAILED":"PASSED"));
+
+new TestCase( SECTION,   
+              "-1 ? 'PASSED' : 'FAILED'",    
+              "PASSED",         
+              (true?"PASSED":"FAILED"));
+
+new TestCase( SECTION,   
+              "NaN ? 'FAILED' : 'PASSED'",    
+              "PASSED",         
+              (Number.NaN?"FAILED":"PASSED"));
+
+new TestCase( SECTION,   
+              "var VAR = true ? , : 'FAILED'",
+              "PASSED",          
+              (VAR = true ? "PASSED" : "FAILED") );
+
+test();
diff --git a/js/src/tests/ecma/Expressions/11.12-2-n.js b/js/src/tests/ecma/Expressions/11.12-2-n.js
new file mode 100644
index 000000000..f4f22f2aa
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.12-2-n.js
@@ -0,0 +1,40 @@
+/* -*- 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:          11.12-2-n.js
+   ECMA Section:       11.12
+   Description:
+
+   The grammar for a ConditionalExpression in ECMAScript is a little bit
+   different from that in C and Java, which each allow the second
+   subexpression to be an Expression but restrict the third expression to
+   be a ConditionalExpression.  The motivation for this difference in
+   ECMAScript is to allow an assignment expression to be governed by either
+   arm of a conditional and to eliminate the confusing and fairly useless
+   case of a comma expression as the center expression.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.12-2-n";
+var VERSION = "ECMA_1";
+startTest();
+writeHeaderToLog( SECTION + " Conditional operator ( ? : )");
+
+// the following expression should be an error in JS.
+
+DESCRIPTION = "var MYVAR =  true ? 'EXPR1', 'EXPR2' : 'EXPR3'; MYVAR";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+              "var MYVAR =  true ? 'EXPR1', 'EXPR2' : 'EXPR3'; MYVAR",
+              "error",
+              eval("var MYVAR =  true ? 'EXPR1', 'EXPR2' : 'EXPR3'; MYVAR") );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.12-3.js b/js/src/tests/ecma/Expressions/11.12-3.js
new file mode 100644
index 000000000..e7c9f6098
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.12-3.js
@@ -0,0 +1,37 @@
+/* -*- tab-width: 2; 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:          11.12-3.js
+   ECMA Section:       11.12
+   Description:
+
+   The grammar for a ConditionalExpression in ECMAScript is a little bit
+   different from that in C and Java, which each allow the second
+   subexpression to be an Expression but restrict the third expression to
+   be a ConditionalExpression.  The motivation for this difference in
+   ECMAScript is to allow an assignment expression to be governed by either
+   arm of a conditional and to eliminate the confusing and fairly useless
+   case of a comma expression as the center expression.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.12-3";
+var VERSION = "ECMA_1";
+startTest();
+writeHeaderToLog( SECTION + " Conditional operator ( ? : )");
+
+// the following expression should NOT be an error in JS.
+
+new TestCase( SECTION,
+	      "var MYVAR =  true ? ('FAIL1', 'PASSED') : 'FAIL2'; MYVAR",
+	      "PASSED",
+	      eval("var MYVAR =  true ? ('FAIL1', 'PASSED') : 'FAIL2'; MYVAR"));
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.12-4.js b/js/src/tests/ecma/Expressions/11.12-4.js
new file mode 100644
index 000000000..b99b02293
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.12-4.js
@@ -0,0 +1,37 @@
+/* -*- tab-width: 2; 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:          11.12-4.js
+   ECMA Section:       11.12
+   Description:
+
+   The grammar for a ConditionalExpression in ECMAScript is a little bit
+   different from that in C and Java, which each allow the second
+   subexpression to be an Expression but restrict the third expression to
+   be a ConditionalExpression.  The motivation for this difference in
+   ECMAScript is to allow an assignment expression to be governed by either
+   arm of a conditional and to eliminate the confusing and fairly useless
+   case of a comma expression as the center expression.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.12-4";
+var VERSION = "ECMA_1";
+startTest();
+writeHeaderToLog( SECTION + " Conditional operator ( ? : )");
+
+// the following expression should NOT be an error in JS.
+
+new TestCase( SECTION,
+	      "true ? MYVAR1 = 'PASSED' : MYVAR1 = 'FAILED'; MYVAR1",
+	      "PASSED",
+	      eval("true ? MYVAR1 = 'PASSED' : MYVAR1 = 'FAILED'; MYVAR1") );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.13.1.js b/js/src/tests/ecma/Expressions/11.13.1.js
new file mode 100644
index 000000000..2048af1c0
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.13.1.js
@@ -0,0 +1,38 @@
+/* -*- 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:          11.13.1.js
+   ECMA Section:       11.13.1 Simple assignment
+   Description:
+
+   11.13.1 Simple Assignment ( = )
+
+   The production AssignmentExpression :
+   LeftHandSideExpression = AssignmentExpression is evaluated as follows:
+
+   1.  Evaluate LeftHandSideExpression.
+   2.  Evaluate AssignmentExpression.
+   3.  Call GetValue(Result(2)).
+   4.  Call PutValue(Result(1), Result(3)).
+   5.  Return Result(3).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.13.1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Simple Assignment ( = )");
+
+new TestCase( SECTION,   
+              "SOMEVAR = true",    
+              true,  
+              SOMEVAR = true );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.13.2-1.js b/js/src/tests/ecma/Expressions/11.13.2-1.js
new file mode 100644
index 000000000..5d0fe096d
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.13.2-1.js
@@ -0,0 +1,197 @@
+/* -*- 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:          11.13.2-1.js
+   ECMA Section:       11.13.2 Compound Assignment: *=
+   Description:
+
+   *= /= %= += -= <<= >>= >>>= &= ^= |=
+
+   11.13.2 Compound assignment ( op= )
+
+   The production AssignmentExpression :
+   LeftHandSideExpression @ = AssignmentExpression, where @ represents one of
+   the operators indicated above, is evaluated as follows:
+
+   1.  Evaluate LeftHandSideExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate AssignmentExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Apply operator @ to Result(2) and Result(4).
+   6.  Call PutValue(Result(1), Result(5)).
+   7.  Return Result(5).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.13.2-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Compound Assignment: *=");
+
+
+// NaN cases
+
+new TestCase( SECTION,   
+              "VAR1 = NaN; VAR2=1; VAR1 *= VAR2",      
+              Number.NaN,
+              eval("VAR1 = Number.NaN; VAR2=1; VAR1 *= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = NaN; VAR2=1; VAR1 *= VAR2; VAR1",
+              Number.NaN,
+              eval("VAR1 = Number.NaN; VAR2=1; VAR1 *= VAR2; VAR1") );
+
+// number cases
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2=1; VAR1 *= VAR2",        
+              0,         
+              eval("VAR1 = 0; VAR2=1; VAR1 *= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2=1; VAR1 *= VAR2;VAR1",   
+              0,         
+              eval("VAR1 = 0; VAR2=1; VAR1 *= VAR2;VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0xFF; VAR2 = 0xA, VAR1 *= VAR2",
+              2550,     
+              eval("VAR1 = 0XFF; VAR2 = 0XA, VAR1 *= VAR2") );
+
+// special multiplication cases
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= Infinity; VAR1 *= VAR2",   
+              Number.NaN,     
+              eval("VAR1 = 0; VAR2 = Number.POSITIVE_INFINITY; VAR1 *= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= Infinity; VAR1 *= VAR2",  
+              Number.NaN,     
+              eval("VAR1 = -0; VAR2 = Number.POSITIVE_INFINITY; VAR1 *= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= -Infinity; VAR1 *= VAR2", 
+              Number.NaN,     
+              eval("VAR1 = -0; VAR2 = Number.NEGATIVE_INFINITY; VAR1 *= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= -Infinity; VAR1 *= VAR2",  
+              Number.NaN,     
+              eval("VAR1 = 0; VAR2 = Number.NEGATIVE_INFINITY; VAR1 *= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= Infinity; VAR2 *= VAR1",   
+              Number.NaN,     
+              eval("VAR1 = 0; VAR2 = Number.POSITIVE_INFINITY; VAR2 *= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= Infinity; VAR2 *= VAR1",  
+              Number.NaN,     
+              eval("VAR1 = -0; VAR2 = Number.POSITIVE_INFINITY; VAR2 *= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= -Infinity; VAR2 *= VAR1", 
+              Number.NaN,     
+              eval("VAR1 = -0; VAR2 = Number.NEGATIVE_INFINITY; VAR2 *= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= -Infinity; VAR2 *= VAR1",  
+              Number.NaN,     
+              eval("VAR1 = 0; VAR2 = Number.NEGATIVE_INFINITY; VAR2 *= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = Infinity; VAR2= Infinity; VAR1 *= VAR2",  
+              Number.POSITIVE_INFINITY,     
+              eval("VAR1 = Number.POSITIVE_INFINITY; VAR2 = Number.POSITIVE_INFINITY; VAR1 *= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = Infinity; VAR2= -Infinity; VAR1 *= VAR2", 
+              Number.NEGATIVE_INFINITY,     
+              eval("VAR1 = Number.POSITIVE_INFINITY; VAR2 = Number.NEGATIVE_INFINITY; VAR1 *= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 =-Infinity; VAR2= Infinity; VAR1 *= VAR2",  
+              Number.NEGATIVE_INFINITY,     
+              eval("VAR1 = Number.NEGATIVE_INFINITY; VAR2 = Number.POSITIVE_INFINITY; VAR1 *= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 =-Infinity; VAR2=-Infinity; VAR1 *= VAR2",  
+              Number.POSITIVE_INFINITY,     
+              eval("VAR1 = Number.NEGATIVE_INFINITY; VAR2 = Number.NEGATIVE_INFINITY; VAR1 *= VAR2; VAR1") );
+
+// string cases
+new TestCase( SECTION,   
+              "VAR1 = 10; VAR2 = '255', VAR1 *= VAR2",
+              2550,      
+              eval("VAR1 = 10; VAR2 = '255', VAR1 *= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = '255'; VAR2 = 10, VAR1 *= VAR2",
+              2550,      
+              eval("VAR1 = '255'; VAR2 = 10, VAR1 *= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 10; VAR2 = '0XFF', VAR1 *= VAR2",
+              2550,      
+              eval("VAR1 = 10; VAR2 = '0XFF', VAR1 *= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = '0xFF'; VAR2 = 0xA, VAR1 *= VAR2",
+              2550,     
+              eval("VAR1 = '0XFF'; VAR2 = 0XA, VAR1 *= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = '10'; VAR2 = '255', VAR1 *= VAR2",
+              2550,     
+              eval("VAR1 = '10'; VAR2 = '255', VAR1 *= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = '10'; VAR2 = '0XFF', VAR1 *= VAR2",
+              2550,    
+              eval("VAR1 = '10'; VAR2 = '0XFF', VAR1 *= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = '0xFF'; VAR2 = 0xA, VAR1 *= VAR2",
+              2550,     
+              eval("VAR1 = '0XFF'; VAR2 = 0XA, VAR1 *= VAR2") );
+
+// boolean cases
+new TestCase( SECTION,   
+              "VAR1 = true; VAR2 = false; VAR1 *= VAR2",   
+              0,     
+              eval("VAR1 = true; VAR2 = false; VAR1 *= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = true; VAR2 = true; VAR1 *= VAR2",   
+              1,     
+              eval("VAR1 = true; VAR2 = true; VAR1 *= VAR2") );
+
+// object cases
+new TestCase( SECTION,   
+              "VAR1 = new Boolean(true); VAR2 = 10; VAR1 *= VAR2;VAR1",   
+              10,     
+              eval("VAR1 = new Boolean(true); VAR2 = 10; VAR1 *= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = new Number(11); VAR2 = 10; VAR1 *= VAR2; VAR1",   
+              110,     
+              eval("VAR1 = new Number(11); VAR2 = 10; VAR1 *= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = new Number(11); VAR2 = new Number(10); VAR1 *= VAR2",   
+              110,     
+              eval("VAR1 = new Number(11); VAR2 = new Number(10); VAR1 *= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = new String('15'); VAR2 = new String('0xF'); VAR1 *= VAR2",   
+              225,     
+              eval("VAR1 = String('15'); VAR2 = new String('0xF'); VAR1 *= VAR2") );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.13.2-2.js b/js/src/tests/ecma/Expressions/11.13.2-2.js
new file mode 100644
index 000000000..9e0e071a5
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.13.2-2.js
@@ -0,0 +1,219 @@
+/* -*- 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:          11.13.2-2js
+   ECMA Section:       11.13.2 Compound Assignment: /=
+   Description:
+
+   *= /= %= += -= <<= >>= >>>= &= ^= |=
+
+   11.13.2 Compound assignment ( op= )
+
+   The production AssignmentExpression :
+   LeftHandSideExpression @ = AssignmentExpression, where @ represents one of
+   the operators indicated above, is evaluated as follows:
+
+   1.  Evaluate LeftHandSideExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate AssignmentExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Apply operator @ to Result(2) and Result(4).
+   6.  Call PutValue(Result(1), Result(5)).
+   7.  Return Result(5).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.13.2-2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Compound Assignment: /=");
+
+
+// NaN cases
+
+new TestCase( SECTION,   
+              "VAR1 = NaN; VAR2=1; VAR1 /= VAR2",      
+              Number.NaN,
+              eval("VAR1 = Number.NaN; VAR2=1; VAR1 /= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = NaN; VAR2=1; VAR1 /= VAR2; VAR1",
+              Number.NaN,
+              eval("VAR1 = Number.NaN; VAR2=1; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = NaN; VAR2=0; VAR1 /= VAR2",      
+              Number.NaN,
+              eval("VAR1 = Number.NaN; VAR2=0; VAR1 /= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = NaN; VAR2=0; VAR1 /= VAR2; VAR1",
+              Number.NaN,
+              eval("VAR1 = Number.NaN; VAR2=0; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2=NaN; VAR1 /= VAR2",      
+              Number.NaN,
+              eval("VAR1 = 0; VAR2=Number.NaN; VAR1 /= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2=NaN; VAR1 /= VAR2; VAR1",
+              Number.NaN,
+              eval("VAR1 = 0; VAR2=Number.NaN; VAR1 /= VAR2; VAR1") );
+
+// number cases
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2=1; VAR1 /= VAR2",        
+              0,         
+              eval("VAR1 = 0; VAR2=1; VAR1 /= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2=1; VAR1 /= VAR2;VAR1",   
+              0,         
+              eval("VAR1 = 0; VAR2=1; VAR1 /= VAR2;VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0xFF; VAR2 = 0xA, VAR1 /= VAR2",
+              25.5,     
+              eval("VAR1 = 0XFF; VAR2 = 0XA, VAR1 /= VAR2") );
+
+// special division cases
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= Infinity; VAR1 /= VAR2",   
+              0,     
+              eval("VAR1 = 0; VAR2 = Number.POSITIVE_INFINITY; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= Infinity; VAR1 /= VAR2",  
+              0,     
+              eval("VAR1 = -0; VAR2 = Number.POSITIVE_INFINITY; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= -Infinity; VAR1 /= VAR2", 
+              0,     
+              eval("VAR1 = -0; VAR2 = Number.NEGATIVE_INFINITY; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= -Infinity; VAR1 /= VAR2",  
+              0,     
+              eval("VAR1 = 0; VAR2 = Number.NEGATIVE_INFINITY; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= Infinity; VAR2 /= VAR1",   
+              Number.POSITIVE_INFINITY,     
+              eval("VAR1 = 0; VAR2 = Number.POSITIVE_INFINITY; VAR2 /= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= Infinity; VAR2 /= VAR1",  
+              Number.NEGATIVE_INFINITY,     
+              eval("VAR1 = -0; VAR2 = Number.POSITIVE_INFINITY; VAR2 /= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= -Infinity; VAR2 /= VAR1", 
+              Number.POSITIVE_INFINITY,     
+              eval("VAR1 = -0; VAR2 = Number.NEGATIVE_INFINITY; VAR2 /= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= -Infinity; VAR2 /= VAR1",  
+              Number.NEGATIVE_INFINITY,     
+              eval("VAR1 = 0; VAR2 = Number.NEGATIVE_INFINITY; VAR2 /= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = Infinity; VAR2= Infinity; VAR1 /= VAR2",  
+              Number.NaN,     
+              eval("VAR1 = Number.POSITIVE_INFINITY; VAR2 = Number.POSITIVE_INFINITY; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = Infinity; VAR2= -Infinity; VAR1 /= VAR2", 
+              Number.NaN,     
+              eval("VAR1 = Number.POSITIVE_INFINITY; VAR2 = Number.NEGATIVE_INFINITY; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 =-Infinity; VAR2= Infinity; VAR1 /= VAR2",  
+              Number.NaN,     
+              eval("VAR1 = Number.NEGATIVE_INFINITY; VAR2 = Number.POSITIVE_INFINITY; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 =-Infinity; VAR2=-Infinity; VAR1 /= VAR2",  
+              Number.NaN,     
+              eval("VAR1 = Number.NEGATIVE_INFINITY; VAR2 = Number.NEGATIVE_INFINITY; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= 0; VAR1 /= VAR2",   
+              Number.NaN,     
+              eval("VAR1 = 0; VAR2 = 0; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= -0; VAR1 /= VAR2",  
+              Number.NaN,    
+              eval("VAR1 = 0; VAR2 = -0; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= 0; VAR1 /= VAR2",  
+              Number.NaN,     
+              eval("VAR1 = -0; VAR2 = 0; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= -0; VAR1 /= VAR2", 
+              Number.NaN,     
+              eval("VAR1 = -0; VAR2 = -0; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 1; VAR2= 0; VAR1 /= VAR2",   
+              Number.POSITIVE_INFINITY,     
+              eval("VAR1 = 1; VAR2 = 0; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 1; VAR2= -0; VAR1 /= VAR2",  
+              Number.NEGATIVE_INFINITY,     
+              eval("VAR1 = 1; VAR2 = -0; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -1; VAR2= 0; VAR1 /= VAR2",  
+              Number.NEGATIVE_INFINITY,     
+              eval("VAR1 = -1; VAR2 = 0; VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -1; VAR2= -0; VAR1 /= VAR2", 
+              Number.POSITIVE_INFINITY,     
+              eval("VAR1 = -1; VAR2 = -0; VAR1 /= VAR2; VAR1") );
+
+// string cases
+new TestCase( SECTION,   
+              "VAR1 = 1000; VAR2 = '10', VAR1 /= VAR2; VAR1",
+              100,      
+              eval("VAR1 = 1000; VAR2 = '10', VAR1 /= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = '1000'; VAR2 = 10, VAR1 /= VAR2; VAR1",
+              100,      
+              eval("VAR1 = '1000'; VAR2 = 10, VAR1 /= VAR2; VAR1") );
+/*
+  new TestCase( SECTION,    "VAR1 = 10; VAR2 = '0XFF', VAR1 /= VAR2", 2550,       eval("VAR1 = 10; VAR2 = '0XFF', VAR1 /= VAR2") );
+  new TestCase( SECTION,    "VAR1 = '0xFF'; VAR2 = 0xA, VAR1 /= VAR2", 2550,      eval("VAR1 = '0XFF'; VAR2 = 0XA, VAR1 /= VAR2") );
+
+  new TestCase( SECTION,    "VAR1 = '10'; VAR2 = '255', VAR1 /= VAR2", 2550,      eval("VAR1 = '10'; VAR2 = '255', VAR1 /= VAR2") );
+  new TestCase( SECTION,    "VAR1 = '10'; VAR2 = '0XFF', VAR1 /= VAR2", 2550,     eval("VAR1 = '10'; VAR2 = '0XFF', VAR1 /= VAR2") );
+  new TestCase( SECTION,    "VAR1 = '0xFF'; VAR2 = 0xA, VAR1 /= VAR2", 2550,      eval("VAR1 = '0XFF'; VAR2 = 0XA, VAR1 /= VAR2") );
+
+  // boolean cases
+  new TestCase( SECTION,    "VAR1 = true; VAR2 = false; VAR1 /= VAR2",    0,      eval("VAR1 = true; VAR2 = false; VAR1 /= VAR2") );
+  new TestCase( SECTION,    "VAR1 = true; VAR2 = true; VAR1 /= VAR2",    1,      eval("VAR1 = true; VAR2 = true; VAR1 /= VAR2") );
+
+  // object cases
+  new TestCase( SECTION,    "VAR1 = new Boolean(true); VAR2 = 10; VAR1 /= VAR2;VAR1",    10,      eval("VAR1 = new Boolean(true); VAR2 = 10; VAR1 /= VAR2; VAR1") );
+  new TestCase( SECTION,    "VAR1 = new Number(11); VAR2 = 10; VAR1 /= VAR2; VAR1",    110,      eval("VAR1 = new Number(11); VAR2 = 10; VAR1 /= VAR2; VAR1") );
+  new TestCase( SECTION,    "VAR1 = new Number(11); VAR2 = new Number(10); VAR1 /= VAR2",    110,      eval("VAR1 = new Number(11); VAR2 = new Number(10); VAR1 /= VAR2") );
+  new TestCase( SECTION,    "VAR1 = new String('15'); VAR2 = new String('0xF'); VAR1 /= VAR2",    255,      eval("VAR1 = String('15'); VAR2 = new String('0xF'); VAR1 /= VAR2") );
+
+*/
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.13.2-3.js b/js/src/tests/ecma/Expressions/11.13.2-3.js
new file mode 100644
index 000000000..b77343aa6
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.13.2-3.js
@@ -0,0 +1,266 @@
+/* -*- 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:          11.13.2-4.js
+   ECMA Section:       11.13.2 Compound Assignment: %=
+   Description:
+
+   *= /= %= += -= <<= >>= >>>= &= ^= |=
+
+   11.13.2 Compound assignment ( op= )
+
+   The production AssignmentExpression :
+   LeftHandSideExpression @ = AssignmentExpression, where @ represents one of
+   the operators indicated above, is evaluated as follows:
+
+   1.  Evaluate LeftHandSideExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate AssignmentExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Apply operator @ to Result(2) and Result(4).
+   6.  Call PutValue(Result(1), Result(5)).
+   7.  Return Result(5).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.13.2-3";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Compound Assignment: +=");
+
+// If either operand is NaN,  result is NaN
+
+new TestCase( SECTION,   
+              "VAR1 = NaN; VAR2=1; VAR1 %= VAR2",      
+              Number.NaN,
+              eval("VAR1 = Number.NaN; VAR2=1; VAR1 %= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = NaN; VAR2=1; VAR1 %= VAR2; VAR1",
+              Number.NaN,
+              eval("VAR1 = Number.NaN; VAR2=1; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = NaN; VAR2=0; VAR1 %= VAR2",      
+              Number.NaN,
+              eval("VAR1 = Number.NaN; VAR2=0; VAR1 %= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = NaN; VAR2=0; VAR1 %= VAR2; VAR1",
+              Number.NaN,
+              eval("VAR1 = Number.NaN; VAR2=0; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2=NaN; VAR1 %= VAR2",      
+              Number.NaN,
+              eval("VAR1 = 0; VAR2=Number.NaN; VAR1 %= VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2=NaN; VAR1 %= VAR2; VAR1",
+              Number.NaN,
+              eval("VAR1 = 0; VAR2=Number.NaN; VAR1 %= VAR2; VAR1") );
+
+// if the dividend is infinity or the divisor is zero or both, the result is NaN
+
+new TestCase( SECTION,   
+              "VAR1 = Infinity; VAR2= Infinity; VAR1 %= VAR2; VAR1",  
+              Number.NaN,     
+              eval("VAR1 = Number.POSITIVE_INFINITY; VAR2 = Number.POSITIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = Infinity; VAR2= -Infinity; VAR1 %= VAR2; VAR1", 
+              Number.NaN,     
+              eval("VAR1 = Number.POSITIVE_INFINITY; VAR2 = Number.NEGATIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 =-Infinity; VAR2= Infinity; VAR1 %= VAR2; VAR1",  
+              Number.NaN,     
+              eval("VAR1 = Number.NEGATIVE_INFINITY; VAR2 = Number.POSITIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 =-Infinity; VAR2=-Infinity; VAR1 %= VAR2; VAR1",  
+              Number.NaN,     
+              eval("VAR1 = Number.NEGATIVE_INFINITY; VAR2 = Number.NEGATIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= Infinity; VAR2 %= VAR1",   
+              Number.NaN,     
+              eval("VAR1 = 0; VAR2 = Number.POSITIVE_INFINITY; VAR2 %= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= Infinity; VAR2 %= VAR1",  
+              Number.NaN,     
+              eval("VAR1 = -0; VAR2 = Number.POSITIVE_INFINITY; VAR2 %= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= -Infinity; VAR2 %= VAR1", 
+              Number.NaN,     
+              eval("VAR1 = -0; VAR2 = Number.NEGATIVE_INFINITY; VAR2 %= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= -Infinity; VAR2 %= VAR1",  
+              Number.NaN,     
+              eval("VAR1 = 0; VAR2 = Number.NEGATIVE_INFINITY; VAR2 %= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 1; VAR2= Infinity; VAR2 %= VAR1",   
+              Number.NaN,     
+              eval("VAR1 = 1; VAR2 = Number.POSITIVE_INFINITY; VAR2 %= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = -1; VAR2= Infinity; VAR2 %= VAR1",  
+              Number.NaN,     
+              eval("VAR1 = -1; VAR2 = Number.POSITIVE_INFINITY; VAR2 %= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = -1; VAR2= -Infinity; VAR2 %= VAR1", 
+              Number.NaN,     
+              eval("VAR1 = -1; VAR2 = Number.NEGATIVE_INFINITY; VAR2 %= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 1; VAR2= -Infinity; VAR2 %= VAR1",  
+              Number.NaN,     
+              eval("VAR1 = 1; VAR2 = Number.NEGATIVE_INFINITY; VAR2 %= VAR1; VAR2") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= 0; VAR1 %= VAR2",   
+              Number.NaN,     
+              eval("VAR1 = 0; VAR2 = 0; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= -0; VAR1 %= VAR2",  
+              Number.NaN,     
+              eval("VAR1 = 0; VAR2 = -0; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= 0; VAR1 %= VAR2",  
+              Number.NaN,     
+              eval("VAR1 = -0; VAR2 = 0; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= -0; VAR1 %= VAR2", 
+              Number.NaN,     
+              eval("VAR1 = -0; VAR2 = -0; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 1; VAR2= 0; VAR1 %= VAR2",   
+              Number.NaN,     
+              eval("VAR1 = 1; VAR2 = 0; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 1; VAR2= -0; VAR1 %= VAR2",  
+              Number.NaN,     
+              eval("VAR1 = 1; VAR2 = -0; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -1; VAR2= 0; VAR1 %= VAR2",  
+              Number.NaN,     
+              eval("VAR1 = -1; VAR2 = 0; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -1; VAR2= -0; VAR1 %= VAR2", 
+              Number.NaN,     
+              eval("VAR1 = -1; VAR2 = -0; VAR1 %= VAR2; VAR1") );
+
+// if the dividend is finite and the divisor is an infinity, the result equals the dividend.
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= Infinity; VAR1 %= VAR2;VAR1",   
+              0,     
+              eval("VAR1 = 0; VAR2 = Number.POSITIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= Infinity; VAR1 %= VAR2;VAR1",  
+              -0,    
+              eval("VAR1 = -0; VAR2 = Number.POSITIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= -Infinity; VAR1 %= VAR2;VAR1", 
+              -0,    
+              eval("VAR1 = -0; VAR2 = Number.NEGATIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= -Infinity; VAR1 %= VAR2;VAR1",  
+              0,     
+              eval("VAR1 = 0; VAR2 = Number.NEGATIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 1; VAR2= Infinity; VAR1 %= VAR2;VAR1",   
+              1,     
+              eval("VAR1 = 1; VAR2 = Number.POSITIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -1; VAR2= Infinity; VAR1 %= VAR2;VAR1",  
+              -1,    
+              eval("VAR1 = -1; VAR2 = Number.POSITIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -1; VAR2= -Infinity; VAR1 %= VAR2;VAR1", 
+              -1,    
+              eval("VAR1 = -1; VAR2 = Number.NEGATIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 1; VAR2= -Infinity; VAR1 %= VAR2;VAR1",  
+              1,     
+              eval("VAR1 = 1; VAR2 = Number.NEGATIVE_INFINITY; VAR1 %= VAR2; VAR1") );
+
+// if the dividend is a zero and the divisor is finite, the result is the same as the dividend
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= 1; VAR1 %= VAR2; VAR1",   
+              0,   
+              eval("VAR1 = 0; VAR2 = 1; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= 1; VAR1 %= VAR2; VAR1",  
+              -0,  
+              eval("VAR1 = -0; VAR2 = 1; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = -0; VAR2= -1; VAR1 %= VAR2; VAR1", 
+              -0,  
+              eval("VAR1 = -0; VAR2 = -1; VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = 0; VAR2= -1; VAR1 %= VAR2; VAR1",  
+              0,   
+              eval("VAR1 = 0; VAR2 = -1; VAR1 %= VAR2; VAR1") );
+
+// string cases
+new TestCase( SECTION,   
+              "VAR1 = 1000; VAR2 = '10', VAR1 %= VAR2; VAR1",
+              0,      
+              eval("VAR1 = 1000; VAR2 = '10', VAR1 %= VAR2; VAR1") );
+
+new TestCase( SECTION,   
+              "VAR1 = '1000'; VAR2 = 10, VAR1 %= VAR2; VAR1",
+              0,      
+              eval("VAR1 = '1000'; VAR2 = 10, VAR1 %= VAR2; VAR1") );
+/*
+  new TestCase( SECTION,    "VAR1 = 10; VAR2 = '0XFF', VAR1 %= VAR2", 2550,       eval("VAR1 = 10; VAR2 = '0XFF', VAR1 %= VAR2") );
+  new TestCase( SECTION,    "VAR1 = '0xFF'; VAR2 = 0xA, VAR1 %= VAR2", 2550,      eval("VAR1 = '0XFF'; VAR2 = 0XA, VAR1 %= VAR2") );
+
+  new TestCase( SECTION,    "VAR1 = '10'; VAR2 = '255', VAR1 %= VAR2", 2550,      eval("VAR1 = '10'; VAR2 = '255', VAR1 %= VAR2") );
+  new TestCase( SECTION,    "VAR1 = '10'; VAR2 = '0XFF', VAR1 %= VAR2", 2550,     eval("VAR1 = '10'; VAR2 = '0XFF', VAR1 %= VAR2") );
+  new TestCase( SECTION,    "VAR1 = '0xFF'; VAR2 = 0xA, VAR1 %= VAR2", 2550,      eval("VAR1 = '0XFF'; VAR2 = 0XA, VAR1 %= VAR2") );
+
+  // boolean cases
+  new TestCase( SECTION,    "VAR1 = true; VAR2 = false; VAR1 %= VAR2",    0,      eval("VAR1 = true; VAR2 = false; VAR1 %= VAR2") );
+  new TestCase( SECTION,    "VAR1 = true; VAR2 = true; VAR1 %= VAR2",    1,      eval("VAR1 = true; VAR2 = true; VAR1 %= VAR2") );
+
+  // object cases
+  new TestCase( SECTION,    "VAR1 = new Boolean(true); VAR2 = 10; VAR1 %= VAR2;VAR1",    10,      eval("VAR1 = new Boolean(true); VAR2 = 10; VAR1 %= VAR2; VAR1") );
+  new TestCase( SECTION,    "VAR1 = new Number(11); VAR2 = 10; VAR1 %= VAR2; VAR1",    110,      eval("VAR1 = new Number(11); VAR2 = 10; VAR1 %= VAR2; VAR1") );
+  new TestCase( SECTION,    "VAR1 = new Number(11); VAR2 = new Number(10); VAR1 %= VAR2",    110,      eval("VAR1 = new Number(11); VAR2 = new Number(10); VAR1 %= VAR2") );
+  new TestCase( SECTION,    "VAR1 = new String('15'); VAR2 = new String('0xF'); VAR1 %= VAR2",    255,      eval("VAR1 = String('15'); VAR2 = new String('0xF'); VAR1 %= VAR2") );
+
+*/
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.13.2-4.js b/js/src/tests/ecma/Expressions/11.13.2-4.js
new file mode 100644
index 000000000..56e55070a
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.13.2-4.js
@@ -0,0 +1,103 @@
+/* -*- 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:          11.13.2-4.js
+   ECMA Section:       11.13.2 Compound Assignment:+=
+   Description:
+
+   *= /= %= += -= <<= >>= >>>= &= ^= |=
+
+   11.13.2 Compound assignment ( op= )
+
+   The production AssignmentExpression :
+   LeftHandSideExpression @ = AssignmentExpression, where @ represents one of
+   the operators indicated above, is evaluated as follows:
+
+   1.  Evaluate LeftHandSideExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate AssignmentExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Apply operator @ to Result(2) and Result(4).
+   6.  Call PutValue(Result(1), Result(5)).
+   7.  Return Result(5).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.13.2-4";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Compound Assignment: +=");
+
+// If either operand is NaN,  result is NaN
+
+new TestCase( SECTION,    "VAR1 = NaN; VAR2=1; VAR1 += VAR2",       Number.NaN, eval("VAR1 = Number.NaN; VAR2=1; VAR1 += VAR2") );
+new TestCase( SECTION,    "VAR1 = NaN; VAR2=1; VAR1 += VAR2; VAR1", Number.NaN, eval("VAR1 = Number.NaN; VAR2=1; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = NaN; VAR2=0; VAR1 += VAR2",       Number.NaN, eval("VAR1 = Number.NaN; VAR2=0; VAR1 += VAR2") );
+new TestCase( SECTION,    "VAR1 = NaN; VAR2=0; VAR1 += VAR2; VAR1", Number.NaN, eval("VAR1 = Number.NaN; VAR2=0; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2=NaN; VAR1 += VAR2",       Number.NaN, eval("VAR1 = 0; VAR2=Number.NaN; VAR1 += VAR2") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2=NaN; VAR1 += VAR2; VAR1", Number.NaN, eval("VAR1 = 0; VAR2=Number.NaN; VAR1 += VAR2; VAR1") );
+
+// the sum of two Infinities the same sign is the infinity of that sign
+// the sum of two Infinities of opposite sign is NaN
+
+new TestCase( SECTION,    "VAR1 = Infinity; VAR2= Infinity; VAR1 += VAR2; VAR1",   Number.POSITIVE_INFINITY,        eval("VAR1 = Number.POSITIVE_INFINITY; VAR2 = Number.POSITIVE_INFINITY; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = Infinity; VAR2= -Infinity; VAR1 += VAR2; VAR1",  Number.NaN,                      eval("VAR1 = Number.POSITIVE_INFINITY; VAR2 = Number.NEGATIVE_INFINITY; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 =-Infinity; VAR2= Infinity; VAR1 += VAR2; VAR1",   Number.NaN,                      eval("VAR1 = Number.NEGATIVE_INFINITY; VAR2 = Number.POSITIVE_INFINITY; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 =-Infinity; VAR2=-Infinity; VAR1 += VAR2; VAR1",   Number.NEGATIVE_INFINITY,        eval("VAR1 = Number.NEGATIVE_INFINITY; VAR2 = Number.NEGATIVE_INFINITY; VAR1 += VAR2; VAR1") );
+
+// the sum of an infinity and a finite value is equal to the infinite operand
+
+new TestCase( SECTION,    "VAR1 = 0; VAR2= Infinity; VAR1 += VAR2;VAR1",    Number.POSITIVE_INFINITY,      eval("VAR1 = 0; VAR2 = Number.POSITIVE_INFINITY; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= Infinity; VAR1 += VAR2;VAR1",   Number.POSITIVE_INFINITY,      eval("VAR1 = -0; VAR2 = Number.POSITIVE_INFINITY; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= -Infinity; VAR1 += VAR2;VAR1",  Number.NEGATIVE_INFINITY,      eval("VAR1 = -0; VAR2 = Number.NEGATIVE_INFINITY; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2= -Infinity; VAR1 += VAR2;VAR1",   Number.NEGATIVE_INFINITY,      eval("VAR1 = 0; VAR2 = Number.NEGATIVE_INFINITY; VAR1 += VAR2; VAR1") );
+
+// the sum of two negative zeros is -0. the sum of two positive zeros, or of two zeros of opposite sign, is +0
+
+new TestCase( SECTION,    "VAR1 = 0; VAR2= 0; VAR1 += VAR2",    0,      eval("VAR1 = 0; VAR2 = 0; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2= -0; VAR1 += VAR2",   0,      eval("VAR1 = 0; VAR2 = -0; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= 0; VAR1 += VAR2",   0,      eval("VAR1 = -0; VAR2 = 0; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= -0; VAR1 += VAR2",  -0,      eval("VAR1 = -0; VAR2 = -0; VAR1 += VAR2; VAR1") );
+
+//  the sum of a zero and a nonzero finite value is eqal to the nonzero operand
+
+new TestCase( SECTION,    "VAR1 = 0; VAR2= 1; VAR2 += VAR1; VAR2",    1,      eval("VAR1 = 0; VAR2 = 1; VAR2 += VAR1; VAR2") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= 1; VAR2 += VAR1; VAR2",   1,      eval("VAR1 = -0; VAR2 = 1; VAR2 += VAR1; VAR2") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= -1; VAR2 += VAR1; VAR2",  -1,      eval("VAR1 = -0; VAR2 = -1; VAR2 += VAR1; VAR2") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2= -1; VAR2 += VAR1; VAR2",   -1,      eval("VAR1 = 0; VAR2 = -1; VAR2 += VAR1; VAR2") );
+
+// the sum of a zero and a nozero finite value is equal to the nonzero operand.
+new TestCase( SECTION,    "VAR1 = 0; VAR2=1; VAR1 += VAR2",         1,          eval("VAR1 = 0; VAR2=1; VAR1 += VAR2") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2=1; VAR1 += VAR2;VAR1",    1,          eval("VAR1 = 0; VAR2=1; VAR1 += VAR2;VAR1") );
+
+// the sum of two nonzero finite values of the same magnitude and opposite sign is +0
+new TestCase( SECTION,    "VAR1 = Number.MAX_VALUE; VAR2= -Number.MAX_VALUE; VAR1 += VAR2; VAR1",    0,  eval("VAR1 = Number.MAX_VALUE; VAR2= -Number.MAX_VALUE; VAR1 += VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = Number.MIN_VALUE; VAR2= -Number.MIN_VALUE; VAR1 += VAR2; VAR1",   0,  eval("VAR1 = Number.MIN_VALUE; VAR2= -Number.MIN_VALUE; VAR1 += VAR2; VAR1") );
+
+/*
+  new TestCase( SECTION,    "VAR1 = 10; VAR2 = '0XFF', VAR1 += VAR2", 2550,       eval("VAR1 = 10; VAR2 = '0XFF', VAR1 += VAR2") );
+  new TestCase( SECTION,    "VAR1 = '0xFF'; VAR2 = 0xA, VAR1 += VAR2", 2550,      eval("VAR1 = '0XFF'; VAR2 = 0XA, VAR1 += VAR2") );
+
+  new TestCase( SECTION,    "VAR1 = '10'; VAR2 = '255', VAR1 += VAR2", 2550,      eval("VAR1 = '10'; VAR2 = '255', VAR1 += VAR2") );
+  new TestCase( SECTION,    "VAR1 = '10'; VAR2 = '0XFF', VAR1 += VAR2", 2550,     eval("VAR1 = '10'; VAR2 = '0XFF', VAR1 += VAR2") );
+  new TestCase( SECTION,    "VAR1 = '0xFF'; VAR2 = 0xA, VAR1 += VAR2", 2550,      eval("VAR1 = '0XFF'; VAR2 = 0XA, VAR1 += VAR2") );
+
+  // boolean cases
+  new TestCase( SECTION,    "VAR1 = true; VAR2 = false; VAR1 += VAR2",    0,      eval("VAR1 = true; VAR2 = false; VAR1 += VAR2") );
+  new TestCase( SECTION,    "VAR1 = true; VAR2 = true; VAR1 += VAR2",    1,      eval("VAR1 = true; VAR2 = true; VAR1 += VAR2") );
+
+  // object cases
+  new TestCase( SECTION,    "VAR1 = new Boolean(true); VAR2 = 10; VAR1 += VAR2;VAR1",    10,      eval("VAR1 = new Boolean(true); VAR2 = 10; VAR1 += VAR2; VAR1") );
+  new TestCase( SECTION,    "VAR1 = new Number(11); VAR2 = 10; VAR1 += VAR2; VAR1",    110,      eval("VAR1 = new Number(11); VAR2 = 10; VAR1 += VAR2; VAR1") );
+  new TestCase( SECTION,    "VAR1 = new Number(11); VAR2 = new Number(10); VAR1 += VAR2",    110,      eval("VAR1 = new Number(11); VAR2 = new Number(10); VAR1 += VAR2") );
+  new TestCase( SECTION,    "VAR1 = new String('15'); VAR2 = new String('0xF'); VAR1 += VAR2",    255,      eval("VAR1 = String('15'); VAR2 = new String('0xF'); VAR1 += VAR2") );
+
+*/
+
+test();
diff --git a/js/src/tests/ecma/Expressions/11.13.2-5.js b/js/src/tests/ecma/Expressions/11.13.2-5.js
new file mode 100644
index 000000000..46c8cc607
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.13.2-5.js
@@ -0,0 +1,103 @@
+/* -*- 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:          11.13.2-5.js
+   ECMA Section:       11.13.2 Compound Assignment: -=
+   Description:
+
+   *= /= %= -= -= <<= >>= >>>= &= ^= |=
+
+   11.13.2 Compound assignment ( op= )
+
+   The production AssignmentExpression :
+   LeftHandSideExpression @ = AssignmentExpression, where @ represents one of
+   the operators indicated above, is evaluated as follows:
+
+   1.  Evaluate LeftHandSideExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate AssignmentExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Apply operator @ to Result(2) and Result(4).
+   6.  Call PutValue(Result(1), Result(5)).
+   7.  Return Result(5).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.13.2-5";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Compound Assignment: -=");
+
+// If either operand is NaN,  result is NaN
+
+new TestCase( SECTION,    "VAR1 = NaN; VAR2=1; VAR1 -= VAR2",       Number.NaN, eval("VAR1 = Number.NaN; VAR2=1; VAR1 -= VAR2") );
+new TestCase( SECTION,    "VAR1 = NaN; VAR2=1; VAR1 -= VAR2; VAR1", Number.NaN, eval("VAR1 = Number.NaN; VAR2=1; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = NaN; VAR2=0; VAR1 -= VAR2",       Number.NaN, eval("VAR1 = Number.NaN; VAR2=0; VAR1 -= VAR2") );
+new TestCase( SECTION,    "VAR1 = NaN; VAR2=0; VAR1 -= VAR2; VAR1", Number.NaN, eval("VAR1 = Number.NaN; VAR2=0; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2=NaN; VAR1 -= VAR2",       Number.NaN, eval("VAR1 = 0; VAR2=Number.NaN; VAR1 -= VAR2") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2=NaN; VAR1 -= VAR2; VAR1", Number.NaN, eval("VAR1 = 0; VAR2=Number.NaN; VAR1 -= VAR2; VAR1") );
+
+// the sum of two Infinities the same sign is the infinity of that sign
+// the sum of two Infinities of opposite sign is NaN
+
+new TestCase( SECTION,    "VAR1 = Infinity; VAR2= Infinity; VAR1 -= VAR2; VAR1",    Number.NaN,                 eval("VAR1 = Number.POSITIVE_INFINITY; VAR2 = Number.POSITIVE_INFINITY; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = Infinity; VAR2= -Infinity; VAR1 -= VAR2; VAR1",   Number.POSITIVE_INFINITY,   eval("VAR1 = Number.POSITIVE_INFINITY; VAR2 = Number.NEGATIVE_INFINITY; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 =-Infinity; VAR2= Infinity; VAR1 -= VAR2; VAR1",    Number.NEGATIVE_INFINITY,   eval("VAR1 = Number.NEGATIVE_INFINITY; VAR2 = Number.POSITIVE_INFINITY; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 =-Infinity; VAR2=-Infinity; VAR1 -= VAR2; VAR1",    Number.NaN,                 eval("VAR1 = Number.NEGATIVE_INFINITY; VAR2 = Number.NEGATIVE_INFINITY; VAR1 -= VAR2; VAR1") );
+
+// the sum of an infinity and a finite value is equal to the infinite operand
+
+new TestCase( SECTION,    "VAR1 = 0; VAR2= Infinity; VAR1 -= VAR2;VAR1",    Number.NEGATIVE_INFINITY,      eval("VAR1 = 0; VAR2 = Number.POSITIVE_INFINITY; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= Infinity; VAR1 -= VAR2;VAR1",   Number.NEGATIVE_INFINITY,      eval("VAR1 = -0; VAR2 = Number.POSITIVE_INFINITY; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2= -Infinity; VAR1 -= VAR2;VAR1",   Number.POSITIVE_INFINITY,        eval("VAR1 = 0; VAR2 = Number.NEGATIVE_INFINITY; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= -Infinity; VAR1 -= VAR2;VAR1",  Number.POSITIVE_INFINITY,        eval("VAR1 = -0; VAR2 = Number.NEGATIVE_INFINITY; VAR1 -= VAR2; VAR1") );
+
+// the sum of two negative zeros is -0. the sum of two positive zeros, or of two zeros of opposite sign, is +0
+
+new TestCase( SECTION,    "VAR1 = 0; VAR2= -0; VAR1 -= VAR2",    0,      eval("VAR1 = 0; VAR2 = 0; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2= 0; VAR1 -= VAR2",   0,      eval("VAR1 = 0; VAR2 = -0; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= -0; VAR1 -= VAR2",   0,      eval("VAR1 = -0; VAR2 = 0; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= 0; VAR1 -= VAR2",  -0,      eval("VAR1 = -0; VAR2 = -0; VAR1 -= VAR2; VAR1") );
+
+//  the sum of a zero and a nonzero finite value is eqal to the nonzero operand
+
+new TestCase( SECTION,    "VAR1 = 0; VAR2= -1; VAR1 -= VAR2; VAR1",    1,      eval("VAR1 = 0; VAR2 = -1; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= -1; VAR1 -= VAR2; VAR1",   1,      eval("VAR1 = -0; VAR2 = -1; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = -0; VAR2= 1; VAR1 -= VAR2; VAR1",  -1,      eval("VAR1 = -0; VAR2 = 1; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2= 1; VAR1 -= VAR2; VAR1",   -1,      eval("VAR1 = 0; VAR2 = 1; VAR1 -= VAR2; VAR1") );
+
+// the sum of a zero and a nozero finite value is equal to the nonzero operand.
+new TestCase( SECTION,    "VAR1 = 0; VAR2=-1; VAR1 -= VAR2",         1,          eval("VAR1 = 0; VAR2=-1; VAR1 -= VAR2;VAR1") );
+new TestCase( SECTION,    "VAR1 = 0; VAR2=-1; VAR1 -= VAR2;VAR1",    1,          eval("VAR1 = 0; VAR2=-1; VAR1 -= VAR2;VAR1") );
+
+// the sum of two nonzero finite values of the same magnitude and opposite sign is +0
+new TestCase( SECTION,    "VAR1 = Number.MAX_VALUE; VAR2= Number.MAX_VALUE; VAR1 -= VAR2; VAR1",    0,  eval("VAR1 = Number.MAX_VALUE; VAR2= Number.MAX_VALUE; VAR1 -= VAR2; VAR1") );
+new TestCase( SECTION,    "VAR1 = Number.MIN_VALUE; VAR2= Number.MIN_VALUE; VAR1 -= VAR2; VAR1",    0,  eval("VAR1 = Number.MIN_VALUE; VAR2= Number.MIN_VALUE; VAR1 -= VAR2; VAR1") );
+
+/*
+  new TestCase( SECTION,    "VAR1 = 10; VAR2 = '0XFF', VAR1 -= VAR2", 2550,       eval("VAR1 = 10; VAR2 = '0XFF', VAR1 -= VAR2") );
+  new TestCase( SECTION,    "VAR1 = '0xFF'; VAR2 = 0xA, VAR1 -= VAR2", 2550,      eval("VAR1 = '0XFF'; VAR2 = 0XA, VAR1 -= VAR2") );
+
+  new TestCase( SECTION,    "VAR1 = '10'; VAR2 = '255', VAR1 -= VAR2", 2550,      eval("VAR1 = '10'; VAR2 = '255', VAR1 -= VAR2") );
+  new TestCase( SECTION,    "VAR1 = '10'; VAR2 = '0XFF', VAR1 -= VAR2", 2550,     eval("VAR1 = '10'; VAR2 = '0XFF', VAR1 -= VAR2") );
+  new TestCase( SECTION,    "VAR1 = '0xFF'; VAR2 = 0xA, VAR1 -= VAR2", 2550,      eval("VAR1 = '0XFF'; VAR2 = 0XA, VAR1 -= VAR2") );
+
+  // boolean cases
+  new TestCase( SECTION,    "VAR1 = true; VAR2 = false; VAR1 -= VAR2",    0,      eval("VAR1 = true; VAR2 = false; VAR1 -= VAR2") );
+  new TestCase( SECTION,    "VAR1 = true; VAR2 = true; VAR1 -= VAR2",    1,      eval("VAR1 = true; VAR2 = true; VAR1 -= VAR2") );
+
+  // object cases
+  new TestCase( SECTION,    "VAR1 = new Boolean(true); VAR2 = 10; VAR1 -= VAR2;VAR1",    10,      eval("VAR1 = new Boolean(true); VAR2 = 10; VAR1 -= VAR2; VAR1") );
+  new TestCase( SECTION,    "VAR1 = new Number(11); VAR2 = 10; VAR1 -= VAR2; VAR1",    110,      eval("VAR1 = new Number(11); VAR2 = 10; VAR1 -= VAR2; VAR1") );
+  new TestCase( SECTION,    "VAR1 = new Number(11); VAR2 = new Number(10); VAR1 -= VAR2",    110,      eval("VAR1 = new Number(11); VAR2 = new Number(10); VAR1 -= VAR2") );
+  new TestCase( SECTION,    "VAR1 = new String('15'); VAR2 = new String('0xF'); VAR1 -= VAR2",    255,      eval("VAR1 = String('15'); VAR2 = new String('0xF'); VAR1 -= VAR2") );
+
+*/
+
+test();
diff --git a/js/src/tests/ecma/Expressions/11.13.js b/js/src/tests/ecma/Expressions/11.13.js
new file mode 100644
index 000000000..3dd40babb
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.13.js
@@ -0,0 +1,52 @@
+/* -*- 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:          11.12.js
+   ECMA Section:       11.12 Conditional Operator
+   Description:
+   Logi
+
+   calORExpression ? AssignmentExpression : AssignmentExpression
+
+   Semantics
+
+   The production ConditionalExpression :
+   LogicalORExpression ? AssignmentExpression : AssignmentExpression
+   is evaluated as follows:
+
+   1.  Evaluate LogicalORExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToBoolean(Result(2)).
+   4.  If Result(3) is false, go to step 8.
+   5.  Evaluate the first AssignmentExpression.
+   6.  Call GetValue(Result(5)).
+   7.  Return Result(6).
+   8.  Evaluate the second AssignmentExpression.
+   9.  Call GetValue(Result(8)).
+   10.  Return Result(9).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.12";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Conditional operator( ? : )");
+
+new TestCase( SECTION,    "true ? 'PASSED' : 'FAILED'",     "PASSED",       (true?"PASSED":"FAILED"));
+new TestCase( SECTION,    "false ? 'FAILED' : 'PASSED'",     "PASSED",      (false?"FAILED":"PASSED"));
+
+new TestCase( SECTION,    "1 ? 'PASSED' : 'FAILED'",     "PASSED",          (true?"PASSED":"FAILED"));
+new TestCase( SECTION,    "0 ? 'FAILED' : 'PASSED'",     "PASSED",          (false?"FAILED":"PASSED"));
+new TestCase( SECTION,    "-1 ? 'PASSED' : 'FAILED'",     "PASSED",          (true?"PASSED":"FAILED"));
+
+new TestCase( SECTION,    "NaN ? 'FAILED' : 'PASSED'",     "PASSED",          (Number.NaN?"FAILED":"PASSED"));
+
+new TestCase( SECTION,    "var VAR = true ? , : 'FAILED'", "PASSED",           (VAR = true ? "PASSED" : "FAILED") );
+
+test();
diff --git a/js/src/tests/ecma/Expressions/11.14-1.js b/js/src/tests/ecma/Expressions/11.14-1.js
new file mode 100644
index 000000000..c9bbbb00b
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.14-1.js
@@ -0,0 +1,39 @@
+/* -*- 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:          11.14-1.js
+   ECMA Section:       11.14 Comma operator (,)
+   Description:
+   Expression :
+
+   AssignmentExpression
+   Expression , AssignmentExpression
+
+   Semantics
+
+   The production Expression : Expression , AssignmentExpression is evaluated as follows:
+
+   1.  Evaluate Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate AssignmentExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Return Result(4).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.14-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Comma operator (,)");
+
+new TestCase( SECTION,    "true, false",                    false,  eval("true, false") );
+new TestCase( SECTION,    "VAR1=true, VAR2=false",          false,  eval("VAR1=true, VAR2=false") );
+new TestCase( SECTION,    "VAR1=true, VAR2=false;VAR1",     true,   eval("VAR1=true, VAR2=false; VAR1") );
+
+test();
diff --git a/js/src/tests/ecma/Expressions/11.2.1-1.js b/js/src/tests/ecma/Expressions/11.2.1-1.js
new file mode 100644
index 000000000..dfc7c943f
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.1-1.js
@@ -0,0 +1,238 @@
+/* -*- 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:          11.2.1-1.js
+   ECMA Section:       11.2.1 Property Accessors
+   Description:
+
+   Properties are accessed by name, using either the dot notation:
+   MemberExpression . Identifier
+   CallExpression . Identifier
+
+   or the bracket notation:    MemberExpression [ Expression ]
+   CallExpression [ Expression ]
+
+   The dot notation is explained by the following syntactic conversion:
+   MemberExpression . Identifier
+   is identical in its behavior to
+   MemberExpression [ <identifier-string> ]
+   and similarly
+   CallExpression . Identifier
+   is identical in its behavior to
+   CallExpression [ <identifier-string> ]
+   where <identifier-string> is a string literal containing the same sequence
+   of characters as the Identifier.
+
+   The production MemberExpression : MemberExpression [ Expression ] is
+   evaluated as follows:
+
+   1.  Evaluate MemberExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate Expression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToObject(Result(2)).
+   6.  Call ToString(Result(4)).
+   7.  Return a value of type Reference whose base object is Result(5) and
+   whose property name is Result(6).
+
+   The production CallExpression : CallExpression [ Expression ] is evaluated
+   in exactly the same manner, except that the contained CallExpression is
+   evaluated in step 1.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.2.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Property Accessors";
+writeHeaderToLog( SECTION + " "+TITLE );
+
+// go through all Native Function objects, methods, and properties and get their typeof.
+
+var PROPERTY = new Array();
+var p = 0;
+
+// properties and functions of the global object
+
+PROPERTY[p++] = new Property( "this",   "NaN",          "number" );
+PROPERTY[p++] = new Property( "this",   "Infinity",     "number" );
+PROPERTY[p++] = new Property( "this",   "eval",         "function" );
+PROPERTY[p++] = new Property( "this",   "parseInt",     "function" );
+PROPERTY[p++] = new Property( "this",   "parseFloat",   "function" );
+PROPERTY[p++] = new Property( "this",   "escape",       "function" );
+PROPERTY[p++] = new Property( "this",   "unescape",     "function" );
+PROPERTY[p++] = new Property( "this",   "isNaN",        "function" );
+PROPERTY[p++] = new Property( "this",   "isFinite",     "function" );
+PROPERTY[p++] = new Property( "this",   "Object",       "function" );
+PROPERTY[p++] = new Property( "this",   "Number",       "function" );
+PROPERTY[p++] = new Property( "this",   "Function",     "function" );
+PROPERTY[p++] = new Property( "this",   "Array",        "function" );
+PROPERTY[p++] = new Property( "this",   "String",       "function" );
+PROPERTY[p++] = new Property( "this",   "Boolean",      "function" );
+PROPERTY[p++] = new Property( "this",   "Date",         "function" );
+PROPERTY[p++] = new Property( "this",   "Math",         "object" );
+
+// properties and  methods of Object objects
+
+PROPERTY[p++] = new Property( "Object", "prototype",    "object" );
+PROPERTY[p++] = new Property( "Object", "toString",     "function" );
+PROPERTY[p++] = new Property( "Object", "valueOf",      "function" );
+PROPERTY[p++] = new Property( "Object", "constructor",  "function" );
+
+// properties of the Function object
+
+PROPERTY[p++] = new Property( "Function",   "prototype",    "function" );
+PROPERTY[p++] = new Property( "Function.prototype",   "toString",     "function" );
+PROPERTY[p++] = new Property( "Function.prototype",   "length",       "number" );
+PROPERTY[p++] = new Property( "Function.prototype",   "valueOf",      "function" );
+
+Function.prototype.myProperty = "hi";
+
+PROPERTY[p++] = new Property( "Function.prototype",   "myProperty",   "string" );
+
+// properties of the Array object
+PROPERTY[p++] = new Property( "Array",      "prototype",    "object" );
+PROPERTY[p++] = new Property( "Array",      "length",       "number" );
+PROPERTY[p++] = new Property( "Array.prototype",      "constructor",  "function" );
+PROPERTY[p++] = new Property( "Array.prototype",      "toString",     "function" );
+PROPERTY[p++] = new Property( "Array.prototype",      "join",         "function" );
+PROPERTY[p++] = new Property( "Array.prototype",      "reverse",      "function" );
+PROPERTY[p++] = new Property( "Array.prototype",      "sort",         "function" );
+
+// properties of the String object
+PROPERTY[p++] = new Property( "String",     "prototype",    "object" );
+PROPERTY[p++] = new Property( "String",     "fromCharCode", "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "toString",     "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "constructor",  "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "valueOf",      "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "charAt",       "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "charCodeAt",   "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "indexOf",      "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "lastIndexOf",  "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "split",        "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "substring",    "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "toLowerCase",  "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "toUpperCase",  "function" );
+PROPERTY[p++] = new Property( "String.prototype",     "length",       "number" );
+
+// properties of the Boolean object
+PROPERTY[p++] = new Property( "Boolean",    "prototype",    "object" );
+PROPERTY[p++] = new Property( "Boolean",    "constructor",  "function" );
+PROPERTY[p++] = new Property( "Boolean.prototype",    "valueOf",      "function" );
+PROPERTY[p++] = new Property( "Boolean.prototype",    "toString",     "function" );
+
+// properties of the Number object
+
+PROPERTY[p++] = new Property( "Number",     "MAX_VALUE",    "number" );
+PROPERTY[p++] = new Property( "Number",     "MIN_VALUE",    "number" );
+PROPERTY[p++] = new Property( "Number",     "NaN",          "number" );
+PROPERTY[p++] = new Property( "Number",     "NEGATIVE_INFINITY",    "number" );
+PROPERTY[p++] = new Property( "Number",     "POSITIVE_INFINITY",    "number" );
+PROPERTY[p++] = new Property( "Number.prototype",     "toString",     "function" );
+PROPERTY[p++] = new Property( "Number.prototype",     "constructor",  "function" );
+PROPERTY[p++] = new Property( "Number.prototype",     "valueOf",        "function" );
+
+// properties of the Math Object.
+PROPERTY[p++] = new Property( "Math",   "E",        "number" );
+PROPERTY[p++] = new Property( "Math",   "LN10",     "number" );
+PROPERTY[p++] = new Property( "Math",   "LN2",      "number" );
+PROPERTY[p++] = new Property( "Math",   "LOG2E",    "number" );
+PROPERTY[p++] = new Property( "Math",   "LOG10E",   "number" );
+PROPERTY[p++] = new Property( "Math",   "PI",       "number" );
+PROPERTY[p++] = new Property( "Math",   "SQRT1_2",  "number" );
+PROPERTY[p++] = new Property( "Math",   "SQRT2",    "number" );
+PROPERTY[p++] = new Property( "Math",   "abs",      "function" );
+PROPERTY[p++] = new Property( "Math",   "acos",     "function" );
+PROPERTY[p++] = new Property( "Math",   "asin",     "function" );
+PROPERTY[p++] = new Property( "Math",   "atan",     "function" );
+PROPERTY[p++] = new Property( "Math",   "atan2",    "function" );
+PROPERTY[p++] = new Property( "Math",   "ceil",     "function" );
+PROPERTY[p++] = new Property( "Math",   "cos",      "function" );
+PROPERTY[p++] = new Property( "Math",   "exp",      "function" );
+PROPERTY[p++] = new Property( "Math",   "floor",    "function" );
+PROPERTY[p++] = new Property( "Math",   "log",      "function" );
+PROPERTY[p++] = new Property( "Math",   "max",      "function" );
+PROPERTY[p++] = new Property( "Math",   "min",      "function" );
+PROPERTY[p++] = new Property( "Math",   "pow",      "function" );
+PROPERTY[p++] = new Property( "Math",   "random",   "function" );
+PROPERTY[p++] = new Property( "Math",   "round",    "function" );
+PROPERTY[p++] = new Property( "Math",   "sin",      "function" );
+PROPERTY[p++] = new Property( "Math",   "sqrt",     "function" );
+PROPERTY[p++] = new Property( "Math",   "tan",      "function" );
+
+// properties of the Date object
+PROPERTY[p++] = new Property( "Date",   "parse",        "function" );
+PROPERTY[p++] = new Property( "Date",   "prototype",    "object" );
+PROPERTY[p++] = new Property( "Date",   "UTC",          "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "constructor",    "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "toString",       "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "valueOf",        "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getTime",        "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getYear",        "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getFullYear",    "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getUTCFullYear", "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getMonth",       "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getUTCMonth",    "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getDate",        "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getUTCDate",     "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getDay",         "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getUTCDay",      "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getHours",       "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getUTCHours",    "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getMinutes",     "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getUTCMinutes",  "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getSeconds",     "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getUTCSeconds",  "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getMilliseconds","function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "getUTCMilliseconds", "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setTime",        "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setMilliseconds","function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setUTCMilliseconds", "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setSeconds",     "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setUTCSeconds",  "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setMinutes",     "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setUTCMinutes",  "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setHours",       "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setUTCHours",    "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setDate",        "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setUTCDate",     "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setMonth",       "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setUTCMonth",    "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setFullYear",    "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setUTCFullYear", "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "setYear",        "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "toLocaleString", "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "toUTCString",    "function" );
+PROPERTY[p++] = new Property( "Date.prototype",   "toGMTString",    "function" );
+
+for ( var i = 0, RESULT; i < PROPERTY.length; i++ ) {
+  RESULT = eval("typeof " + PROPERTY[i].object + "." + PROPERTY[i].name );
+
+  new TestCase( SECTION,
+                "typeof " + PROPERTY[i].object + "." + PROPERTY[i].name,
+                PROPERTY[i].type,
+                RESULT );
+
+  RESULT = eval("typeof " + PROPERTY[i].object + "['" + PROPERTY[i].name +"']");
+
+  new TestCase( SECTION,
+                "typeof " + PROPERTY[i].object + "['" + PROPERTY[i].name +"']",
+                PROPERTY[i].type,
+                RESULT );
+}
+
+test();
+
+function MyObject( arg0, arg1, arg2, arg3, arg4 ) {
+  this.name   = arg0;
+}
+function Property( object, name, type ) {
+  this.object = object;
+  this.name = name;
+  this.type = type;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.1-2.js b/js/src/tests/ecma/Expressions/11.2.1-2.js
new file mode 100644
index 000000000..c37831d79
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.1-2.js
@@ -0,0 +1,94 @@
+/* -*- 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:          11.2.1-2.js
+   ECMA Section:       11.2.1 Property Accessors
+   Description:
+
+   Properties are accessed by name, using either the dot notation:
+   MemberExpression . Identifier
+   CallExpression . Identifier
+
+   or the bracket notation:    MemberExpression [ Expression ]
+   CallExpression [ Expression ]
+
+   The dot notation is explained by the following syntactic conversion:
+   MemberExpression . Identifier
+   is identical in its behavior to
+   MemberExpression [ <identifier-string> ]
+   and similarly
+   CallExpression . Identifier
+   is identical in its behavior to
+   CallExpression [ <identifier-string> ]
+   where <identifier-string> is a string literal containing the same sequence
+   of characters as the Identifier.
+
+   The production MemberExpression : MemberExpression [ Expression ] is
+   evaluated as follows:
+
+   1.  Evaluate MemberExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate Expression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToObject(Result(2)).
+   6.  Call ToString(Result(4)).
+   7.  Return a value of type Reference whose base object is Result(5) and
+   whose property name is Result(6).
+
+   The production CallExpression : CallExpression [ Expression ] is evaluated
+   in exactly the same manner, except that the contained CallExpression is
+   evaluated in step 1.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.2.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Property Accessors";
+writeHeaderToLog( SECTION + " "+TITLE );
+
+// go through all Native Function objects, methods, and properties and get their typeof.
+
+var PROPERTY = new Array();
+var p = 0;
+
+// try to access properties of primitive types
+
+PROPERTY[p++] = new Property(  "\"hi\"",    "hi",   "hi",   NaN );
+PROPERTY[p++] = new Property(  NaN,         NaN,    "NaN",    NaN );
+//    PROPERTY[p++] = new Property(  3,           3,      "3",    3  );
+PROPERTY[p++] = new Property(  true,        true,      "true",    1 );
+PROPERTY[p++] = new Property(  false,       false,      "false",    0 );
+
+for ( var i = 0, RESULT; i < PROPERTY.length; i++ ) {
+  new TestCase( SECTION,
+                PROPERTY[i].object + ".valueOf()",
+                PROPERTY[i].value,
+                eval( PROPERTY[i].object+ ".valueOf()" ) );
+
+  new TestCase( SECTION,
+                PROPERTY[i].object + ".toString()",
+                PROPERTY[i].string,
+                eval( PROPERTY[i].object+ ".toString()" ) );
+
+}
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.stringValue = value +"";
+  this.numberValue = Number(value);
+  return this;
+}
+function Property( object, value, string, number ) {
+  this.object = object;
+  this.string = String(value);
+  this.number = Number(value);
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.1-3-n.js b/js/src/tests/ecma/Expressions/11.2.1-3-n.js
new file mode 100644
index 000000000..3e50e3105
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.1-3-n.js
@@ -0,0 +1,94 @@
+/* -*- tab-width: 2; 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:          11.2.1-2.js
+   ECMA Section:       11.2.1 Property Accessors
+   Description:
+
+   Properties are accessed by name, using either the dot notation:
+   MemberExpression . Identifier
+   CallExpression . Identifier
+
+   or the bracket notation:    MemberExpression [ Expression ]
+   CallExpression [ Expression ]
+
+   The dot notation is explained by the following syntactic conversion:
+   MemberExpression . Identifier
+   is identical in its behavior to
+   MemberExpression [ <identifier-string> ]
+   and similarly
+   CallExpression . Identifier
+   is identical in its behavior to
+   CallExpression [ <identifier-string> ]
+   where <identifier-string> is a string literal containing the same sequence
+   of characters as the Identifier.
+
+   The production MemberExpression : MemberExpression [ Expression ] is
+   evaluated as follows:
+
+   1.  Evaluate MemberExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate Expression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToObject(Result(2)).
+   6.  Call ToString(Result(4)).
+   7.  Return a value of type Reference whose base object is Result(5) and
+   whose property name is Result(6).
+
+   The production CallExpression : CallExpression [ Expression ] is evaluated
+   in exactly the same manner, except that the contained CallExpression is
+   evaluated in step 1.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.2.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Property Accessors";
+writeHeaderToLog( SECTION + " "+TITLE );
+
+// go through all Native Function objects, methods, and properties and get their typeof.
+
+var PROPERTY = new Array();
+var p = 0;
+
+// try to access properties of primitive types
+
+PROPERTY[p++] = new Property(  "undefined",    void 0,   "undefined",   NaN );
+
+for ( var i = 0, RESULT; i < PROPERTY.length; i++ ) {
+
+  DESCRIPTION = PROPERTY[i].object + ".valueOf()";
+  EXPECTED = "error";
+
+  new TestCase( SECTION,
+		PROPERTY[i].object + ".valueOf()",
+		PROPERTY[i].value,
+		eval( PROPERTY[i].object+ ".valueOf()" ) );
+
+  new TestCase( SECTION,
+		PROPERTY[i].object + ".toString()",
+		PROPERTY[i].string,
+		eval(PROPERTY[i].object+ ".toString()") );
+}
+test();
+
+
+function MyObject( value ) {
+  this.value = value;
+  this.stringValue = value +"";
+  this.numberValue = Number(value);
+  return this;
+}
+
+function Property( object, value, string, number ) {
+  this.object = object;
+  this.string = String(value);
+  this.number = Number(value);
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.1-4-n.js b/js/src/tests/ecma/Expressions/11.2.1-4-n.js
new file mode 100644
index 000000000..173addbce
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.1-4-n.js
@@ -0,0 +1,94 @@
+/* -*- 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:          11.2.1-4-n.js
+   ECMA Section:       11.2.1 Property Accessors
+   Description:
+
+   Properties are accessed by name, using either the dot notation:
+   MemberExpression . Identifier
+   CallExpression . Identifier
+
+   or the bracket notation:    MemberExpression [ Expression ]
+   CallExpression [ Expression ]
+
+   The dot notation is explained by the following syntactic conversion:
+   MemberExpression . Identifier
+   is identical in its behavior to
+   MemberExpression [ <identifier-string> ]
+   and similarly
+   CallExpression . Identifier
+   is identical in its behavior to
+   CallExpression [ <identifier-string> ]
+   where <identifier-string> is a string literal containing the same sequence
+   of characters as the Identifier.
+
+   The production MemberExpression : MemberExpression [ Expression ] is
+   evaluated as follows:
+
+   1.  Evaluate MemberExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate Expression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToObject(Result(2)).
+   6.  Call ToString(Result(4)).
+   7.  Return a value of type Reference whose base object is Result(5) and
+   whose property name is Result(6).
+
+   The production CallExpression : CallExpression [ Expression ] is evaluated
+   in exactly the same manner, except that the contained CallExpression is
+   evaluated in step 1.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.2.1-4-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Property Accessors";
+writeHeaderToLog( SECTION + " "+TITLE );
+
+// go through all Native Function objects, methods, and properties and get their typeof.
+
+var PROPERTY = new Array();
+var p = 0;
+
+// try to access properties of primitive types
+
+PROPERTY[p++] = new Property(  "null",    null,   "null",   0 );
+
+for ( var i = 0, RESULT; i < PROPERTY.length; i++ ) {
+
+  DESCRIPTION = PROPERTY[i].object + ".valueOf()";
+  EXPECTED = "error";
+
+  new TestCase( SECTION,
+                PROPERTY[i].object + ".valueOf()",
+                PROPERTY[i].value,
+                eval( PROPERTY[i].object+ ".valueOf()" ) );
+
+  new TestCase( SECTION,
+                PROPERTY[i].object + ".toString()",
+                PROPERTY[i].string,
+                eval(PROPERTY[i].object+ ".toString()") );
+
+}
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.stringValue = value +"";
+  this.numberValue = Number(value);
+  return this;
+}
+function Property( object, value, string, number ) {
+  this.object = object;
+  this.string = String(value);
+  this.number = Number(value);
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.1-5.js b/js/src/tests/ecma/Expressions/11.2.1-5.js
new file mode 100644
index 000000000..22750b041
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.1-5.js
@@ -0,0 +1,94 @@
+/* -*- 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:          11.2.1-5.js
+   ECMA Section:       11.2.1 Property Accessors
+   Description:
+
+   Properties are accessed by name, using either the dot notation:
+   MemberExpression . Identifier
+   CallExpression . Identifier
+
+   or the bracket notation:    MemberExpression [ Expression ]
+   CallExpression [ Expression ]
+
+   The dot notation is explained by the following syntactic conversion:
+   MemberExpression . Identifier
+   is identical in its behavior to
+   MemberExpression [ <identifier-string> ]
+   and similarly
+   CallExpression . Identifier
+   is identical in its behavior to
+   CallExpression [ <identifier-string> ]
+   where <identifier-string> is a string literal containing the same sequence
+   of characters as the Identifier.
+
+   The production MemberExpression : MemberExpression [ Expression ] is
+   evaluated as follows:
+
+   1.  Evaluate MemberExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate Expression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToObject(Result(2)).
+   6.  Call ToString(Result(4)).
+   7.  Return a value of type Reference whose base object is Result(5) and
+   whose property name is Result(6).
+
+   The production CallExpression : CallExpression [ Expression ] is evaluated
+   in exactly the same manner, except that the contained CallExpression is
+   evaluated in step 1.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.2.1-5";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Property Accessors";
+writeHeaderToLog( SECTION + " "+TITLE );
+
+// go through all Native Function objects, methods, and properties and get their typeof.
+
+var PROPERTY = new Array();
+var p = 0;
+
+// try to access properties of primitive types
+
+PROPERTY[p++] = new Property(  new String("hi"),    "hi",   "hi",   NaN );
+PROPERTY[p++] = new Property(  new Number(NaN),         NaN,    "NaN",    NaN );
+PROPERTY[p++] = new Property(  new Number(3),           3,      "3",    3  );
+PROPERTY[p++] = new Property(  new Boolean(true),        true,      "true",    1 );
+PROPERTY[p++] = new Property(  new Boolean(false),       false,      "false",    0 );
+
+for ( var i = 0, RESULT; i < PROPERTY.length; i++ ) {
+  new TestCase( SECTION,
+                PROPERTY[i].object + ".valueOf()",
+                PROPERTY[i].value,
+                eval( "PROPERTY[i].object.valueOf()" ) );
+
+  new TestCase( SECTION,
+                PROPERTY[i].object + ".toString()",
+                PROPERTY[i].string,
+                eval( "PROPERTY[i].object.toString()" ) );
+
+}
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.stringValue = value +"";
+  this.numberValue = Number(value);
+  return this;
+}
+function Property( object, value, string, number ) {
+  this.object = object;
+  this.string = String(value);
+  this.number = Number(value);
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.2-1-n.js b/js/src/tests/ecma/Expressions/11.2.2-1-n.js
new file mode 100644
index 000000000..6b7f18358
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-1-n.js
@@ -0,0 +1,70 @@
+/* -*- tab-width: 2; 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:          11.2.2-1.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-1-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var OBJECT = new Object();
+
+DESCRIPTION = "OBJECT = new Object; var o = new OBJECT()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "OBJECT = new Object; var o = new OBJECT()",
+	      "error",
+	      eval("o = new OBJECT()") );
+test();
+
+function TestFunction() {
+  return arguments;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.2-1.js b/js/src/tests/ecma/Expressions/11.2.2-1.js
new file mode 100644
index 000000000..3be78b50f
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-1.js
@@ -0,0 +1,66 @@
+/* -*- 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:          11.2.2-1.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+              "(new TestFunction(0,1,2,3,4,5)).length",
+              6,
+              (new TestFunction(0,1,2,3,4,5)).length );
+
+test();
+
+function TestFunction() {
+  return arguments;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.2-10-n.js b/js/src/tests/ecma/Expressions/11.2.2-10-n.js
new file mode 100644
index 000000000..1a2ac973b
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-10-n.js
@@ -0,0 +1,68 @@
+/* -*- 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:          11.2.2-9-n.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-9-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var m = new Math()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+              "var m = new Math()",
+              "error",
+              eval("m = new Math()") );
+test();
+
+function TestFunction() {
+  return arguments;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.2-11.js b/js/src/tests/ecma/Expressions/11.2.2-11.js
new file mode 100644
index 000000000..258d7aca7
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-11.js
@@ -0,0 +1,70 @@
+/* -*- 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:          11.2.2-9-n.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-9-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var FUNCTION = new Function();
+
+new TestCase( SECTION,
+              "var FUNCTION = new Function(); f = new FUNCTION(); typeof f",
+              "object",
+              eval("var FUNCTION = new Function(); f = new FUNCTION(); typeof f") );
+
+new TestCase( SECTION,
+              "var FUNCTION = new Function('return this'); f = new FUNCTION(); typeof f",
+              "object",
+              eval("var FUNCTION = new Function('return this'); f = new FUNCTION(); typeof f") );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.2.2-2-n.js b/js/src/tests/ecma/Expressions/11.2.2-2-n.js
new file mode 100644
index 000000000..82512fcda
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-2-n.js
@@ -0,0 +1,70 @@
+/* -*- tab-width: 2; 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:          11.2.2-2.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-2-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var UNDEFINED = void 0;
+
+DESCRIPTION = "UNDEFINED = void 0; var o = new UNDEFINED()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "UNDEFINED = void 0; var o = new UNDEFINED()",
+	      "error",
+	      eval("o = new UNDEFINED()") );
+test();
+
+function TestFunction() {
+  return arguments;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.2-3-n.js b/js/src/tests/ecma/Expressions/11.2.2-3-n.js
new file mode 100644
index 000000000..a1a6ec3a5
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-3-n.js
@@ -0,0 +1,66 @@
+/* -*- tab-width: 2; 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:          11.2.2-3-n.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-3-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var DESCRIPTION = "NULL = null; var o = new NULL()";
+var EXPECTED = "error";
+var NULL = null;
+
+new TestCase( SECTION,
+	      "NULL = null; var o = new NULL()",
+	      "error",
+	      eval("o = new NULL()") );
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.2.2-4-n.js b/js/src/tests/ecma/Expressions/11.2.2-4-n.js
new file mode 100644
index 000000000..71d642a3f
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-4-n.js
@@ -0,0 +1,70 @@
+/* -*- tab-width: 2; 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:          11.2.2-4-n.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-4-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var STRING = "";
+
+DESCRIPTION = "STRING = '', var s = new STRING()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "STRING = '', var s = new STRING()",
+	      "error",
+	      eval("s = new STRING()") );
+test();
+
+function TestFunction() {
+  return arguments;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.2-5-n.js b/js/src/tests/ecma/Expressions/11.2.2-5-n.js
new file mode 100644
index 000000000..80caff6b9
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-5-n.js
@@ -0,0 +1,70 @@
+/* -*- tab-width: 2; 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:          11.2.2-5-n.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-5-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var NUMBER = 0;
+
+DESCRIPTION = "NUMBER=0, var n = new NUMBER()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "NUMBER=0, var n = new NUMBER()",
+	      "error",
+	      eval("n = new NUMBER()") );
+test();
+
+function TestFunction() {
+  return arguments;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.2-6-n.js b/js/src/tests/ecma/Expressions/11.2.2-6-n.js
new file mode 100644
index 000000000..7b48da67d
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-6-n.js
@@ -0,0 +1,69 @@
+/* -*- tab-width: 2; 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:          11.2.2-6-n.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.2.2-6-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var BOOLEAN  = true;
+DESCRIPTION = "BOOLEAN = true; var b = new BOOLEAN()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "BOOLEAN = true; var b = new BOOLEAN()",
+	      "error",
+	      eval("b = new BOOLEAN()") );
+test();
+
+function TestFunction() {
+  return arguments;
+}
+
diff --git a/js/src/tests/ecma/Expressions/11.2.2-7-n.js b/js/src/tests/ecma/Expressions/11.2.2-7-n.js
new file mode 100644
index 000000000..67ca27d09
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-7-n.js
@@ -0,0 +1,70 @@
+/* -*- tab-width: 2; 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:          11.2.2-6-n.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-6-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var STRING = new String("hi");
+
+DESCRIPTION = "var STRING = new String('hi'); var s = new STRING()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "var STRING = new String('hi'); var s = new STRING()",
+	      "error",
+	      eval("s = new STRING()") );
+test();
+
+function TestFunction() {
+  return arguments;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.2-8-n.js b/js/src/tests/ecma/Expressions/11.2.2-8-n.js
new file mode 100644
index 000000000..a2fbbc0c8
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-8-n.js
@@ -0,0 +1,70 @@
+/* -*- tab-width: 2; 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:          11.2.2-8-n.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-8-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var NUMBER = new Number(1);
+
+DESCRIPTION = "var NUMBER = new Number(1); var n = new NUMBER()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "var NUMBER = new Number(1); var n = new NUMBER()",
+	      "error",
+	      eval("n = new NUMBER()") );
+test();
+
+function TestFunction() {
+  return arguments;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.2-9-n.js b/js/src/tests/ecma/Expressions/11.2.2-9-n.js
new file mode 100644
index 000000000..66fb76197
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.2-9-n.js
@@ -0,0 +1,70 @@
+/* -*- tab-width: 2; 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:          11.2.2-9-n.js
+   ECMA Section:       11.2.2. The new operator
+   Description:
+
+   MemberExpression:
+   PrimaryExpression
+   MemberExpression[Expression]
+   MemberExpression.Identifier
+   new MemberExpression Arguments
+
+   new NewExpression
+
+   The production NewExpression : new NewExpression is evaluated as follows:
+
+   1.   Evaluate NewExpression.
+   2.   Call GetValue(Result(1)).
+   3.   If Type(Result(2)) is not Object, generate a runtime error.
+   4.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   5.   Call the [[Construct]] method on Result(2), providing no arguments
+   (that is, an empty list of arguments).
+   6.   If Type(Result(5)) is not Object, generate a runtime error.
+   7.   Return Result(5).
+
+   The production MemberExpression : new MemberExpression Arguments is evaluated as follows:
+
+   1.   Evaluate MemberExpression.
+   2.   Call GetValue(Result(1)).
+   3.   Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   4.   If Type(Result(2)) is not Object, generate a runtime error.
+   5.   If Result(2) does not implement the internal [[Construct]] method,
+   generate a runtime error.
+   6.   Call the [[Construct]] method on Result(2), providing the list
+   Result(3) as the argument values.
+   7.   If Type(Result(6)) is not Object, generate a runtime error.
+   8    .Return Result(6).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.2-9-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The new operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var BOOLEAN = new Boolean();
+
+DESCRIPTION = "var BOOLEAN = new Boolean(); var b = new BOOLEAN()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "var BOOLEAN = new Boolean(); var b = new BOOLEAN()",
+	      "error",
+	      eval("b = new BOOLEAN()") );
+test();
+
+function TestFunction() {
+  return arguments;
+}
diff --git a/js/src/tests/ecma/Expressions/11.2.3-1.js b/js/src/tests/ecma/Expressions/11.2.3-1.js
new file mode 100644
index 000000000..591304f99
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.3-1.js
@@ -0,0 +1,91 @@
+/* -*- 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:          11.2.3-1.js
+   ECMA Section:       11.2.3. Function Calls
+   Description:
+
+   The production CallExpression : MemberExpression Arguments is evaluated as
+   follows:
+
+   1.Evaluate MemberExpression.
+   2.Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   3.Call GetValue(Result(1)).
+   4.If Type(Result(3)) is not Object, generate a runtime error.
+   5.If Result(3) does not implement the internal [[Call]] method, generate a
+   runtime error.
+   6.If Type(Result(1)) is Reference, Result(6) is GetBase(Result(1)). Otherwise,
+   Result(6) is null.
+   7.If Result(6) is an activation object, Result(7) is null. Otherwise, Result(7) is
+   the same as Result(6).
+   8.Call the [[Call]] method on Result(3), providing Result(7) as the this value
+   and providing the list Result(2) as the argument values.
+   9.Return Result(8).
+
+   The production CallExpression : CallExpression Arguments is evaluated in
+   exactly the same manner, except that the contained CallExpression is
+   evaluated in step 1.
+
+   Note: Result(8) will never be of type Reference if Result(3) is a native
+   ECMAScript object. Whether calling a host object can return a value of
+   type Reference is implementation-dependent.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.3-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function Calls";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+/*  this.eval() is no longer legal syntax.
+// MemberExpression : this
+
+new TestCase( SECTION,
+"this.eval()",
+void 0,
+this.eval() );
+
+new TestCase( SECTION,
+"this.eval('NaN')",
+NaN,
+this.eval("NaN") );
+*/
+// MemberExpression:  Identifier
+
+var OBJECT = true;
+
+new TestCase( SECTION,
+              "OBJECT.toString()",
+              "true",
+              OBJECT.toString() );
+
+// MemberExpression[ Expression]
+
+new TestCase( SECTION,
+              "(new Array())['length'].valueOf()",
+              0,
+              (new Array())["length"].valueOf() );
+
+// MemberExpression . Identifier
+new TestCase( SECTION,
+              "(new Array()).length.valueOf()",
+              0,
+              (new Array()).length.valueOf() );
+// new MemberExpression Arguments
+
+new TestCase( SECTION,
+              "(new Array(20))['length'].valueOf()",
+              20,
+              (new Array(20))["length"].valueOf() );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.2.3-2-n.js b/js/src/tests/ecma/Expressions/11.2.3-2-n.js
new file mode 100644
index 000000000..609eac9dd
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.3-2-n.js
@@ -0,0 +1,60 @@
+/* -*- tab-width: 2; 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:          11.2.3-2-n.js
+   ECMA Section:       11.2.3. Function Calls
+   Description:
+
+   The production CallExpression : MemberExpression Arguments is evaluated as
+   follows:
+
+   1.Evaluate MemberExpression.
+   2.Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   3.Call GetValue(Result(1)).
+   4.If Type(Result(3)) is not Object, generate a runtime error.
+   5.If Result(3) does not implement the internal [[Call]] method, generate a
+   runtime error.
+   6.If Type(Result(1)) is Reference, Result(6) is GetBase(Result(1)). Otherwise,
+   Result(6) is null.
+   7.If Result(6) is an activation object, Result(7) is null. Otherwise, Result(7) is
+   the same as Result(6).
+   8.Call the [[Call]] method on Result(3), providing Result(7) as the this value
+   and providing the list Result(2) as the argument values.
+   9.Return Result(8).
+
+   The production CallExpression : CallExpression Arguments is evaluated in
+   exactly the same manner, except that the contained CallExpression is
+   evaluated in step 1.
+
+   Note: Result(8) will never be of type Reference if Result(3) is a native
+   ECMAScript object. Whether calling a host object can return a value of
+   type Reference is implementation-dependent.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.3-2-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function Calls";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "3.valueOf()",
+	      3,
+	      eval("3.valueOf()") );
+
+new TestCase( SECTION,
+	      "(3).valueOf()",
+	      3,
+	      eval("(3).valueOf()") );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.2.3-3-n.js b/js/src/tests/ecma/Expressions/11.2.3-3-n.js
new file mode 100644
index 000000000..9d9aec595
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.3-3-n.js
@@ -0,0 +1,57 @@
+/* -*- 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:          11.2.3-3-n.js
+   ECMA Section:       11.2.3. Function Calls
+   Description:
+
+   The production CallExpression : MemberExpression Arguments is evaluated as
+   follows:
+
+   1.Evaluate MemberExpression.
+   2.Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   3.Call GetValue(Result(1)).
+   4.If Type(Result(3)) is not Object, generate a runtime error.
+   5.If Result(3) does not implement the internal [[Call]] method, generate a
+   runtime error.
+   6.If Type(Result(1)) is Reference, Result(6) is GetBase(Result(1)). Otherwise,
+   Result(6) is null.
+   7.If Result(6) is an activation object, Result(7) is null. Otherwise, Result(7) is
+   the same as Result(6).
+   8.Call the [[Call]] method on Result(3), providing Result(7) as the this value
+   and providing the list Result(2) as the argument values.
+   9.Return Result(8).
+
+   The production CallExpression : CallExpression Arguments is evaluated in
+   exactly the same manner, except that the contained CallExpression is
+   evaluated in step 1.
+
+   Note: Result(8) will never be of type Reference if Result(3) is a native
+   ECMAScript object. Whether calling a host object can return a value of
+   type Reference is implementation-dependent.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.3-3-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function Calls";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "(void 0).valueOf()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+              "(void 0).valueOf()",
+              "error",
+              eval("(void 0).valueOf()") );
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.2.3-4-n.js b/js/src/tests/ecma/Expressions/11.2.3-4-n.js
new file mode 100644
index 000000000..7d097303b
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.3-4-n.js
@@ -0,0 +1,57 @@
+/* -*- 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:          11.2.3-4-n.js
+   ECMA Section:       11.2.3. Function Calls
+   Description:
+
+   The production CallExpression : MemberExpression Arguments is evaluated as
+   follows:
+
+   1.Evaluate MemberExpression.
+   2.Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   3.Call GetValue(Result(1)).
+   4.If Type(Result(3)) is not Object, generate a runtime error.
+   5.If Result(3) does not implement the internal [[Call]] method, generate a
+   runtime error.
+   6.If Type(Result(1)) is Reference, Result(6) is GetBase(Result(1)). Otherwise,
+   Result(6) is null.
+   7.If Result(6) is an activation object, Result(7) is null. Otherwise, Result(7) is
+   the same as Result(6).
+   8.Call the [[Call]] method on Result(3), providing Result(7) as the this value
+   and providing the list Result(2) as the argument values.
+   9.Return Result(8).
+
+   The production CallExpression : CallExpression Arguments is evaluated in
+   exactly the same manner, except that the contained CallExpression is
+   evaluated in step 1.
+
+   Note: Result(8) will never be of type Reference if Result(3) is a native
+   ECMAScript object. Whether calling a host object can return a value of
+   type Reference is implementation-dependent.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.3-4-n.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function Calls";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "null.valueOf()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+              "null.valueOf()",
+              "error",
+              eval("null.valueOf()") );
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.2.3-5.js b/js/src/tests/ecma/Expressions/11.2.3-5.js
new file mode 100644
index 000000000..8914867f0
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.2.3-5.js
@@ -0,0 +1,51 @@
+/* -*- 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:          11.2.3-5-n.js
+   ECMA Section:       11.2.3. Function Calls
+   Description:
+
+   The production CallExpression : MemberExpression Arguments is evaluated as
+   follows:
+
+   1.  Evaluate MemberExpression.
+   2.  Evaluate Arguments, producing an internal list of argument values
+   (section 0).
+   3.  Call GetValue(Result(1)).
+   4.  If Type(Result(3)) is not Object, generate a runtime error.
+   5.  If Result(3) does not implement the internal [[Call]] method, generate a
+   runtime error.
+   6.  If Type(Result(1)) is Reference, Result(6) is GetBase(Result(1)). Otherwise,
+   Result(6) is null.
+   7.  If Result(6) is an activation object, Result(7) is null. Otherwise, Result(7) is
+   the same as Result(6).
+   8.  Call the [[Call]] method on Result(3), providing Result(7) as the this value
+   and providing the list Result(2) as the argument values.
+   9.  Return Result(8).
+
+   The production CallExpression : CallExpression Arguments is evaluated in
+   exactly the same manner, except that the contained CallExpression is
+   evaluated in step 1.
+
+   Note: Result(8) will never be of type Reference if Result(3) is a native
+   ECMAScript object. Whether calling a host object can return a value of
+   type Reference is implementation-dependent.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "11.2.3-5";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function Calls";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "true.valueOf()", true, true.valueOf() );
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.3.1.js b/js/src/tests/ecma/Expressions/11.3.1.js
new file mode 100644
index 000000000..9b11d00c9
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.3.1.js
@@ -0,0 +1,119 @@
+/* -*- 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:          11.3.1.js
+   ECMA Section:       11.3.1 Postfix increment operator
+   Description:
+   The production MemberExpression : MemberExpression ++ is evaluated as
+   follows:
+
+   1.  Evaluate MemberExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToNumber(Result(2)).
+   4.  Add the value 1 to Result(3), using the same rules as for the +
+   operator (section 0).
+   5.  Call PutValue(Result(1), Result(4)).
+   6.  Return Result(3).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.3.1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Postfix increment operator");
+
+// special numbers
+new TestCase( SECTION,  "var MYVAR; MYVAR++",                       NaN,                            eval("var MYVAR; MYVAR++") );
+new TestCase( SECTION,  "var MYVAR= void 0; MYVAR++",               NaN,                            eval("var MYVAR=void 0; MYVAR++") );
+new TestCase( SECTION,  "var MYVAR=null; MYVAR++",                  0,                            eval("var MYVAR=null; MYVAR++") );
+new TestCase( SECTION,  "var MYVAR=true; MYVAR++",                  1,                            eval("var MYVAR=true; MYVAR++") );
+new TestCase( SECTION,  "var MYVAR=false; MYVAR++",                 0,                            eval("var MYVAR=false; MYVAR++") );
+
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=Number.POSITIVE_INFINITY;MYVAR++", Number.POSITIVE_INFINITY,   eval("var MYVAR=Number.POSITIVE_INFINITY;MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=Number.NEGATIVE_INFINITY;MYVAR++", Number.NEGATIVE_INFINITY,   eval("var MYVAR=Number.NEGATIVE_INFINITY;MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=Number.NaN;MYVAR++",               Number.NaN,                 eval("var MYVAR=Number.NaN;MYVAR++") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=Number.POSITIVE_INFINITY;MYVAR++;MYVAR", Number.POSITIVE_INFINITY,   eval("var MYVAR=Number.POSITIVE_INFINITY;MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NEGATIVE_INFINITY;MYVAR++;MYVAR", Number.NEGATIVE_INFINITY,   eval("var MYVAR=Number.NEGATIVE_INFINITY;MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NaN;MYVAR++;MYVAR",               Number.NaN,                 eval("var MYVAR=Number.NaN;MYVAR++;MYVAR") );
+
+// number primitives
+new TestCase( SECTION,    "var MYVAR=0;MYVAR++",            0,          eval("var MYVAR=0;MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=0.2345;MYVAR++",       0.2345,     eval("var MYVAR=0.2345;MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=-0.2345;MYVAR++",      -0.2345,     eval("var MYVAR=-0.2345;MYVAR++") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=0;MYVAR++;MYVAR",      1,          eval("var MYVAR=0;MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0.2345;MYVAR++;MYVAR", 1.2345,     eval("var MYVAR=0.2345;MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=-0.2345;MYVAR++;MYVAR", 0.7655,   eval("var MYVAR=-0.2345;MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;MYVAR++;MYVAR",      1,   eval("var MYVAR=0;MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;MYVAR++;MYVAR",      1,   eval("var MYVAR=0;MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;MYVAR++;MYVAR",      1,   eval("var MYVAR=0;MYVAR++;MYVAR") );
+
+// boolean values
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=true;MYVAR++",         1,       eval("var MYVAR=true;MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=false;MYVAR++",        0,      eval("var MYVAR=false;MYVAR++") );
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=true;MYVAR++;MYVAR",   2,   eval("var MYVAR=true;MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=false;MYVAR++;MYVAR",  1,   eval("var MYVAR=false;MYVAR++;MYVAR") );
+
+// boolean objects
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=new Boolean(true);MYVAR++",         1,     eval("var MYVAR=true;MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=new Boolean(false);MYVAR++",        0,     eval("var MYVAR=false;MYVAR++") );
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=new Boolean(true);MYVAR++;MYVAR",   2,     eval("var MYVAR=new Boolean(true);MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new Boolean(false);MYVAR++;MYVAR",  1,     eval("var MYVAR=new Boolean(false);MYVAR++;MYVAR") );
+
+// string primitives
+new TestCase( SECTION,    "var MYVAR='string';MYVAR++",         Number.NaN,     eval("var MYVAR='string';MYVAR++") );
+new TestCase( SECTION,    "var MYVAR='12345';MYVAR++",          12345,          eval("var MYVAR='12345';MYVAR++") );
+new TestCase( SECTION,    "var MYVAR='-12345';MYVAR++",         -12345,         eval("var MYVAR='-12345';MYVAR++") );
+new TestCase( SECTION,    "var MYVAR='0Xf';MYVAR++",            15,             eval("var MYVAR='0Xf';MYVAR++") );
+new TestCase( SECTION,    "var MYVAR='077';MYVAR++",            77,             eval("var MYVAR='077';MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=''; MYVAR++",              0,              eval("var MYVAR='';MYVAR++") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR='string';MYVAR++;MYVAR",   Number.NaN,     eval("var MYVAR='string';MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='12345';MYVAR++;MYVAR",    12346,          eval("var MYVAR='12345';MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='-12345';MYVAR++;MYVAR",   -12344,          eval("var MYVAR='-12345';MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='0xf';MYVAR++;MYVAR",      16,             eval("var MYVAR='0xf';MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='077';MYVAR++;MYVAR",      78,             eval("var MYVAR='077';MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='';MYVAR++;MYVAR",         1,              eval("var MYVAR='';MYVAR++;MYVAR") );
+
+// string objects
+new TestCase( SECTION,    "var MYVAR=new String('string');MYVAR++",         Number.NaN,     eval("var MYVAR=new String('string');MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=new String('12345');MYVAR++",          12345,          eval("var MYVAR=new String('12345');MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=new String('-12345');MYVAR++",         -12345,         eval("var MYVAR=new String('-12345');MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=new String('0Xf');MYVAR++",            15,             eval("var MYVAR=new String('0Xf');MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=new String('077');MYVAR++",            77,             eval("var MYVAR=new String('077');MYVAR++") );
+new TestCase( SECTION,    "var MYVAR=new String(''); MYVAR++",              0,              eval("var MYVAR=new String('');MYVAR++") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=new String('string');MYVAR++;MYVAR",   Number.NaN,     eval("var MYVAR=new String('string');MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('12345');MYVAR++;MYVAR",    12346,          eval("var MYVAR=new String('12345');MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('-12345');MYVAR++;MYVAR",   -12344,          eval("var MYVAR=new String('-12345');MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('0xf');MYVAR++;MYVAR",      16,             eval("var MYVAR=new String('0xf');MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('077');MYVAR++;MYVAR",      78,             eval("var MYVAR=new String('077');MYVAR++;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('');MYVAR++;MYVAR",         1,              eval("var MYVAR=new String('');MYVAR++;MYVAR") );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.3.2.js b/js/src/tests/ecma/Expressions/11.3.2.js
new file mode 100644
index 000000000..1e4367946
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.3.2.js
@@ -0,0 +1,119 @@
+/* -*- 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:          11.3.2.js
+   ECMA Section:       11.3.2 Postfix decrement operator
+   Description:
+
+   11.3.2 Postfix decrement operator
+
+   The production MemberExpression : MemberExpression -- is evaluated as follows:
+   1.  Evaluate MemberExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToNumber(Result(2)).
+   4.  Subtract the value 1 from Result(3), using the same rules as for the -
+   operator (section 0).
+   5.  Call PutValue(Result(1), Result(4)).
+   6.  Return Result(3).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.3.2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Postfix decrement operator");
+
+// special numbers
+new TestCase( SECTION,  "var MYVAR; MYVAR--",                       NaN,                            eval("var MYVAR; MYVAR--") );
+new TestCase( SECTION,  "var MYVAR= void 0; MYVAR--",               NaN,                            eval("var MYVAR=void 0; MYVAR--") );
+new TestCase( SECTION,  "var MYVAR=null; MYVAR--",                  0,                            eval("var MYVAR=null; MYVAR--") );
+new TestCase( SECTION,  "var MYVAR=true; MYVAR--",                  1,                            eval("var MYVAR=true; MYVAR--") );
+new TestCase( SECTION,  "var MYVAR=false; MYVAR--",                 0,                            eval("var MYVAR=false; MYVAR--") );
+
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=Number.POSITIVE_INFINITY;MYVAR--", Number.POSITIVE_INFINITY,   eval("var MYVAR=Number.POSITIVE_INFINITY;MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=Number.NEGATIVE_INFINITY;MYVAR--", Number.NEGATIVE_INFINITY,   eval("var MYVAR=Number.NEGATIVE_INFINITY;MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=Number.NaN;MYVAR--",               Number.NaN,                 eval("var MYVAR=Number.NaN;MYVAR--") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=Number.POSITIVE_INFINITY;MYVAR--;MYVAR", Number.POSITIVE_INFINITY,   eval("var MYVAR=Number.POSITIVE_INFINITY;MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NEGATIVE_INFINITY;MYVAR--;MYVAR", Number.NEGATIVE_INFINITY,   eval("var MYVAR=Number.NEGATIVE_INFINITY;MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NaN;MYVAR--;MYVAR",               Number.NaN,                 eval("var MYVAR=Number.NaN;MYVAR--;MYVAR") );
+
+// number primitives
+new TestCase( SECTION,    "var MYVAR=0;MYVAR--",            0,          eval("var MYVAR=0;MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=0.2345;MYVAR--",       0.2345,     eval("var MYVAR=0.2345;MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=-0.2345;MYVAR--",      -0.2345,    eval("var MYVAR=-0.2345;MYVAR--") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=0;MYVAR--;MYVAR",      -1,         eval("var MYVAR=0;MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0.2345;MYVAR--;MYVAR", -0.7655,    eval("var MYVAR=0.2345;MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=-0.2345;MYVAR--;MYVAR", -1.2345,   eval("var MYVAR=-0.2345;MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;MYVAR--;MYVAR",      -1,   eval("var MYVAR=0;MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;MYVAR--;MYVAR",      -1,   eval("var MYVAR=0;MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;MYVAR--;MYVAR",      -1,   eval("var MYVAR=0;MYVAR--;MYVAR") );
+
+// boolean values
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=true;MYVAR--",         1,       eval("var MYVAR=true;MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=false;MYVAR--",        0,      eval("var MYVAR=false;MYVAR--") );
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=true;MYVAR--;MYVAR",   0,   eval("var MYVAR=true;MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=false;MYVAR--;MYVAR",  -1,   eval("var MYVAR=false;MYVAR--;MYVAR") );
+
+// boolean objects
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=new Boolean(true);MYVAR--",         1,     eval("var MYVAR=true;MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=new Boolean(false);MYVAR--",        0,     eval("var MYVAR=false;MYVAR--") );
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=new Boolean(true);MYVAR--;MYVAR",   0,     eval("var MYVAR=new Boolean(true);MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new Boolean(false);MYVAR--;MYVAR",  -1,     eval("var MYVAR=new Boolean(false);MYVAR--;MYVAR") );
+
+// string primitives
+new TestCase( SECTION,    "var MYVAR='string';MYVAR--",         Number.NaN,     eval("var MYVAR='string';MYVAR--") );
+new TestCase( SECTION,    "var MYVAR='12345';MYVAR--",          12345,          eval("var MYVAR='12345';MYVAR--") );
+new TestCase( SECTION,    "var MYVAR='-12345';MYVAR--",         -12345,         eval("var MYVAR='-12345';MYVAR--") );
+new TestCase( SECTION,    "var MYVAR='0Xf';MYVAR--",            15,             eval("var MYVAR='0Xf';MYVAR--") );
+new TestCase( SECTION,    "var MYVAR='077';MYVAR--",            77,             eval("var MYVAR='077';MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=''; MYVAR--",              0,              eval("var MYVAR='';MYVAR--") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR='string';MYVAR--;MYVAR",   Number.NaN,     eval("var MYVAR='string';MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='12345';MYVAR--;MYVAR",    12344,          eval("var MYVAR='12345';MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='-12345';MYVAR--;MYVAR",   -12346,          eval("var MYVAR='-12345';MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='0xf';MYVAR--;MYVAR",      14,             eval("var MYVAR='0xf';MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='077';MYVAR--;MYVAR",      76,             eval("var MYVAR='077';MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='';MYVAR--;MYVAR",         -1,              eval("var MYVAR='';MYVAR--;MYVAR") );
+
+// string objects
+new TestCase( SECTION,    "var MYVAR=new String('string');MYVAR--",         Number.NaN,     eval("var MYVAR=new String('string');MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=new String('12345');MYVAR--",          12345,          eval("var MYVAR=new String('12345');MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=new String('-12345');MYVAR--",         -12345,         eval("var MYVAR=new String('-12345');MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=new String('0Xf');MYVAR--",            15,             eval("var MYVAR=new String('0Xf');MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=new String('077');MYVAR--",            77,             eval("var MYVAR=new String('077');MYVAR--") );
+new TestCase( SECTION,    "var MYVAR=new String(''); MYVAR--",              0,              eval("var MYVAR=new String('');MYVAR--") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=new String('string');MYVAR--;MYVAR",   Number.NaN,     eval("var MYVAR=new String('string');MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('12345');MYVAR--;MYVAR",    12344,          eval("var MYVAR=new String('12345');MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('-12345');MYVAR--;MYVAR",   -12346,          eval("var MYVAR=new String('-12345');MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('0xf');MYVAR--;MYVAR",      14,             eval("var MYVAR=new String('0xf');MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('077');MYVAR--;MYVAR",      76,             eval("var MYVAR=new String('077');MYVAR--;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('');MYVAR--;MYVAR",         -1,              eval("var MYVAR=new String('');MYVAR--;MYVAR") );
+
+test();
diff --git a/js/src/tests/ecma/Expressions/11.4.1.js b/js/src/tests/ecma/Expressions/11.4.1.js
new file mode 100644
index 000000000..d247f60fd
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.4.1.js
@@ -0,0 +1,58 @@
+/* -*- 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:          11.4.1.js
+   ECMA Section:       11.4.1 the Delete Operator
+   Description:        returns true if the property could be deleted
+   returns false if it could not be deleted
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+*/
+
+
+var SECTION = "11.4.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The delete operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//    new TestCase( SECTION,   "x=[9,8,7];delete(x[2]);x.length",         2,             eval("x=[9,8,7];delete(x[2]);x.length") );
+//    new TestCase( SECTION,   "x=[9,8,7];delete(x[2]);x.toString()",     "9,8",         eval("x=[9,8,7];delete(x[2]);x.toString()") );
+new TestCase( SECTION,   "x=new Date();delete x;typeof(x)",        "undefined",    eval("x=new Date();delete x;typeof(x)") );
+
+//    array[item++] = new TestCase( SECTION,   "delete(x=new Date())",        true,   delete(x=new Date()) );
+//    array[item++] = new TestCase( SECTION,   "delete('string primitive')",   true,   delete("string primitive") );
+//    array[item++] = new TestCase( SECTION,   "delete(new String( 'string object' ) )",  true,   delete(new String("string object")) );
+//    array[item++] = new TestCase( SECTION,   "delete(new Number(12345) )",  true,   delete(new Number(12345)) );
+new TestCase( SECTION,   "delete(Math.PI)",             false,   delete(Math.PI) );
+//    array[item++] = new TestCase( SECTION,   "delete(null)",                true,   delete(null) );
+//    array[item++] = new TestCase( SECTION,   "delete(void(0))",             true,   delete(void(0)) );
+
+// variables declared with the var statement are not deletable.
+
+var abc;
+new TestCase( SECTION,   "var abc; delete(abc)",        false,   delete abc );
+
+new TestCase(   SECTION,
+                "var OB = new MyObject(); for ( p in OB ) { delete p }",
+                true,
+                eval("var OB = new MyObject(); for ( p in OB ) { delete p }") );
+
+test();
+
+function MyObject() {
+  this.prop1 = true;
+  this.prop2 = false;
+  this.prop3 = null;
+  this.prop4 = void 0;
+  this.prop5 = "hi";
+  this.prop6 = 42;
+  this.prop7 = new Date();
+  this.prop8 = Math.PI;
+}
diff --git a/js/src/tests/ecma/Expressions/11.4.2.js b/js/src/tests/ecma/Expressions/11.4.2.js
new file mode 100644
index 000000000..28071120b
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.4.2.js
@@ -0,0 +1,49 @@
+/* -*- 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:          11.4.2.js
+   ECMA Section:       11.4.2 the Void Operator
+   Description:        always returns undefined (?)
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+*/
+var SECTION = "11.4.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The void operator";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,   "void(new String('string object'))",      void 0,  void(new String( 'string object' )) );
+new TestCase( SECTION,   "void('string primitive')",               void 0,  void("string primitive") );
+new TestCase( SECTION,   "void(Number.NaN)",                       void 0,  void(Number.NaN) );
+new TestCase( SECTION,   "void(Number.POSITIVE_INFINITY)",         void 0,  void(Number.POSITIVE_INFINITY) );
+new TestCase( SECTION,   "void(1)",                                void 0,  void(1) );
+new TestCase( SECTION,   "void(0)",                                void 0,  void(0) );
+new TestCase( SECTION,   "void(-1)",                               void 0,  void(-1) );
+new TestCase( SECTION,   "void(Number.NEGATIVE_INFINITY)",         void 0,  void(Number.NEGATIVE_INFINITY) );
+new TestCase( SECTION,   "void(Math.PI)",                          void 0,  void(Math.PI) );
+new TestCase( SECTION,   "void(true)",                             void 0,  void(true) );
+new TestCase( SECTION,   "void(false)",                            void 0,  void(false) );
+new TestCase( SECTION,   "void(null)",                             void 0,  void(null) );
+new TestCase( SECTION,   "void new String('string object')",      void 0,  void new String( 'string object' ) );
+new TestCase( SECTION,   "void 'string primitive'",               void 0,  void "string primitive" );
+new TestCase( SECTION,   "void Number.NaN",                       void 0,  void Number.NaN );
+new TestCase( SECTION,   "void Number.POSITIVE_INFINITY",         void 0,  void Number.POSITIVE_INFINITY );
+new TestCase( SECTION,   "void 1",                                void 0,  void 1 );
+new TestCase( SECTION,   "void 0",                                void 0,  void 0 );
+new TestCase( SECTION,   "void -1",                               void 0,  void -1 );
+new TestCase( SECTION,   "void Number.NEGATIVE_INFINITY",         void 0,  void Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,   "void Math.PI",                          void 0,  void Math.PI );
+new TestCase( SECTION,   "void true",                             void 0,  void true );
+new TestCase( SECTION,   "void false",                            void 0,  void false );
+new TestCase( SECTION,   "void null",                             void 0,  void null );
+
+//     array[item++] = new TestCase( SECTION,   "void()",                                 void 0,  void() );
+
+test();
diff --git a/js/src/tests/ecma/Expressions/11.4.3.js b/js/src/tests/ecma/Expressions/11.4.3.js
new file mode 100644
index 000000000..d2d06e8c5
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.4.3.js
@@ -0,0 +1,77 @@
+/* -*- 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:          typeof_1.js
+   ECMA Section:       11.4.3 typeof operator
+   Description:        typeof evaluates unary expressions:
+   undefined   "undefined"
+   null        "object"
+   Boolean     "boolean"
+   Number      "number"
+   String      "string"
+   Object      "object" [native, doesn't implement Call]
+   Object      "function" [native, implements [Call]]
+   Object      implementation dependent
+   [not sure how to test this]
+   Author:             christine@netscape.com
+   Date:               june 30, 1997
+
+*/
+
+var SECTION = "11.4.3";
+
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = " The typeof operator";
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,     "typeof(void(0))",              "undefined",        typeof(void(0)) );
+new TestCase( SECTION,     "typeof(null)",                 "object",           typeof(null) );
+new TestCase( SECTION,     "typeof(true)",                 "boolean",          typeof(true) );
+new TestCase( SECTION,     "typeof(false)",                "boolean",          typeof(false) );
+new TestCase( SECTION,     "typeof(new Boolean())",        "object",           typeof(new Boolean()) );
+new TestCase( SECTION,     "typeof(new Boolean(true))",    "object",           typeof(new Boolean(true)) );
+new TestCase( SECTION,     "typeof(Boolean())",            "boolean",          typeof(Boolean()) );
+new TestCase( SECTION,     "typeof(Boolean(false))",       "boolean",          typeof(Boolean(false)) );
+new TestCase( SECTION,     "typeof(Boolean(true))",        "boolean",          typeof(Boolean(true)) );
+new TestCase( SECTION,     "typeof(NaN)",                  "number",           typeof(Number.NaN) );
+new TestCase( SECTION,     "typeof(Infinity)",             "number",           typeof(Number.POSITIVE_INFINITY) );
+new TestCase( SECTION,     "typeof(-Infinity)",            "number",           typeof(Number.NEGATIVE_INFINITY) );
+new TestCase( SECTION,     "typeof(Math.PI)",              "number",           typeof(Math.PI) );
+new TestCase( SECTION,     "typeof(0)",                    "number",           typeof(0) );
+new TestCase( SECTION,     "typeof(1)",                    "number",           typeof(1) );
+new TestCase( SECTION,     "typeof(-1)",                   "number",           typeof(-1) );
+new TestCase( SECTION,     "typeof('0')",                  "string",           typeof("0") );
+new TestCase( SECTION,     "typeof(Number())",             "number",           typeof(Number()) );
+new TestCase( SECTION,     "typeof(Number(0))",            "number",           typeof(Number(0)) );
+new TestCase( SECTION,     "typeof(Number(1))",            "number",           typeof(Number(1)) );
+new TestCase( SECTION,     "typeof(Nubmer(-1))",           "number",           typeof(Number(-1)) );
+new TestCase( SECTION,     "typeof(new Number())",         "object",           typeof(new Number()) );
+new TestCase( SECTION,     "typeof(new Number(0))",        "object",           typeof(new Number(0)) );
+new TestCase( SECTION,     "typeof(new Number(1))",        "object",           typeof(new Number(1)) );
+
+// Math does not implement [[Construct]] or [[Call]] so its type is object.
+
+new TestCase( SECTION,     "typeof(Math)",                 "object",         typeof(Math) );
+
+new TestCase( SECTION,     "typeof(Number.prototype.toString)", "function",    typeof(Number.prototype.toString) );
+
+new TestCase( SECTION,     "typeof('a string')",           "string",           typeof("a string") );
+new TestCase( SECTION,     "typeof('')",                   "string",           typeof("") );
+new TestCase( SECTION,     "typeof(new Date())",           "object",           typeof(new Date()) );
+new TestCase( SECTION,     "typeof(new Array(1,2,3))",     "object",           typeof(new Array(1,2,3)) );
+new TestCase( SECTION,     "typeof(new String('string object'))",  "object",   typeof(new String("string object")) );
+new TestCase( SECTION,     "typeof(String('string primitive'))",    "string",  typeof(String("string primitive")) );
+new TestCase( SECTION,     "typeof(['array', 'of', 'strings'])",   "object",   typeof(["array", "of", "strings"]) );
+new TestCase( SECTION,     "typeof(new Function())",                "function",     typeof( new Function() ) );
+new TestCase( SECTION,     "typeof(parseInt)",                      "function",     typeof( parseInt ) );
+new TestCase( SECTION,     "typeof(test)",                          "function",     typeof( test ) );
+new TestCase( SECTION,     "typeof(String.fromCharCode)",           "function",     typeof( String.fromCharCode )  );
+
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.4.4.js b/js/src/tests/ecma/Expressions/11.4.4.js
new file mode 100644
index 000000000..744c9e383
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.4.4.js
@@ -0,0 +1,122 @@
+/* -*- 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:          11.4.4.js
+   ECMA Section:       11.4.4 Prefix increment operator
+   Description:
+   The production UnaryExpression : ++ UnaryExpression is evaluated as
+   follows:
+
+   1.  Evaluate UnaryExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToNumber(Result(2)).
+   4.  Add the value 1 to Result(3), using the same rules as for the +
+   operator (section 11.6.3).
+   5.  Call PutValue(Result(1), Result(4)).
+   6.  Return Result(4).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.4.4";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Prefix increment operator");
+
+//  special case:  var is not defined
+
+new TestCase( SECTION,  "var MYVAR; ++MYVAR",                       NaN,                            eval("var MYVAR; ++MYVAR") );
+new TestCase( SECTION,  "var MYVAR= void 0; ++MYVAR",               NaN,                            eval("var MYVAR=void 0; ++MYVAR") );
+new TestCase( SECTION,  "var MYVAR=null; ++MYVAR",                  1,                            eval("var MYVAR=null; ++MYVAR") );
+new TestCase( SECTION,  "var MYVAR=true; ++MYVAR",                  2,                            eval("var MYVAR=true; ++MYVAR") );
+new TestCase( SECTION,  "var MYVAR=false; ++MYVAR",                 1,                            eval("var MYVAR=false; ++MYVAR") );
+
+// special numbers
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=Number.POSITIVE_INFINITY;++MYVAR", Number.POSITIVE_INFINITY,   eval("var MYVAR=Number.POSITIVE_INFINITY;++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NEGATIVE_INFINITY;++MYVAR", Number.NEGATIVE_INFINITY,   eval("var MYVAR=Number.NEGATIVE_INFINITY;++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NaN;++MYVAR",               Number.NaN,                 eval("var MYVAR=Number.NaN;++MYVAR") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=Number.POSITIVE_INFINITY;++MYVAR;MYVAR", Number.POSITIVE_INFINITY,   eval("var MYVAR=Number.POSITIVE_INFINITY;++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NEGATIVE_INFINITY;++MYVAR;MYVAR", Number.NEGATIVE_INFINITY,   eval("var MYVAR=Number.NEGATIVE_INFINITY;++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NaN;++MYVAR;MYVAR",               Number.NaN,                 eval("var MYVAR=Number.NaN;++MYVAR;MYVAR") );
+
+
+// number primitives
+new TestCase( SECTION,    "var MYVAR=0;++MYVAR",            1,          eval("var MYVAR=0;++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0.2345;++MYVAR",       1.2345,     eval("var MYVAR=0.2345;++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=-0.2345;++MYVAR",      0.7655,     eval("var MYVAR=-0.2345;++MYVAR") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=0;++MYVAR;MYVAR",      1,         eval("var MYVAR=0;++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0.2345;++MYVAR;MYVAR", 1.2345,    eval("var MYVAR=0.2345;++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=-0.2345;++MYVAR;MYVAR", 0.7655,   eval("var MYVAR=-0.2345;++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;++MYVAR;MYVAR",      1,   eval("var MYVAR=0;++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;++MYVAR;MYVAR",      1,   eval("var MYVAR=0;++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;++MYVAR;MYVAR",      1,   eval("var MYVAR=0;++MYVAR;MYVAR") );
+
+// boolean values
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=true;++MYVAR",         2,       eval("var MYVAR=true;++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=false;++MYVAR",        1,      eval("var MYVAR=false;++MYVAR") );
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=true;++MYVAR;MYVAR",   2,   eval("var MYVAR=true;++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=false;++MYVAR;MYVAR",  1,   eval("var MYVAR=false;++MYVAR;MYVAR") );
+
+// boolean objects
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=new Boolean(true);++MYVAR",         2,     eval("var MYVAR=true;++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new Boolean(false);++MYVAR",        1,     eval("var MYVAR=false;++MYVAR") );
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=new Boolean(true);++MYVAR;MYVAR",   2,     eval("var MYVAR=new Boolean(true);++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new Boolean(false);++MYVAR;MYVAR",  1,     eval("var MYVAR=new Boolean(false);++MYVAR;MYVAR") );
+
+// string primitives
+new TestCase( SECTION,    "var MYVAR='string';++MYVAR",         Number.NaN,     eval("var MYVAR='string';++MYVAR") );
+new TestCase( SECTION,    "var MYVAR='12345';++MYVAR",          12346,          eval("var MYVAR='12345';++MYVAR") );
+new TestCase( SECTION,    "var MYVAR='-12345';++MYVAR",         -12344,         eval("var MYVAR='-12345';++MYVAR") );
+new TestCase( SECTION,    "var MYVAR='0Xf';++MYVAR",            16,             eval("var MYVAR='0Xf';++MYVAR") );
+new TestCase( SECTION,    "var MYVAR='077';++MYVAR",            78,             eval("var MYVAR='077';++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=''; ++MYVAR",              1,              eval("var MYVAR='';++MYVAR") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR='string';++MYVAR;MYVAR",   Number.NaN,     eval("var MYVAR='string';++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='12345';++MYVAR;MYVAR",    12346,          eval("var MYVAR='12345';++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='-12345';++MYVAR;MYVAR",   -12344,          eval("var MYVAR='-12345';++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='0xf';++MYVAR;MYVAR",      16,             eval("var MYVAR='0xf';++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='077';++MYVAR;MYVAR",      78,             eval("var MYVAR='077';++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='';++MYVAR;MYVAR",         1,              eval("var MYVAR='';++MYVAR;MYVAR") );
+
+// string objects
+new TestCase( SECTION,    "var MYVAR=new String('string');++MYVAR",         Number.NaN,     eval("var MYVAR=new String('string');++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('12345');++MYVAR",          12346,          eval("var MYVAR=new String('12345');++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('-12345');++MYVAR",         -12344,         eval("var MYVAR=new String('-12345');++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('0Xf');++MYVAR",            16,             eval("var MYVAR=new String('0Xf');++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('077');++MYVAR",            78,             eval("var MYVAR=new String('077');++MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String(''); ++MYVAR",              1,              eval("var MYVAR=new String('');++MYVAR") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=new String('string');++MYVAR;MYVAR",   Number.NaN,     eval("var MYVAR=new String('string');++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('12345');++MYVAR;MYVAR",    12346,          eval("var MYVAR=new String('12345');++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('-12345');++MYVAR;MYVAR",   -12344,          eval("var MYVAR=new String('-12345');++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('0xf');++MYVAR;MYVAR",      16,             eval("var MYVAR=new String('0xf');++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('077');++MYVAR;MYVAR",      78,             eval("var MYVAR=new String('077');++MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('');++MYVAR;MYVAR",         1,              eval("var MYVAR=new String('');++MYVAR;MYVAR") );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.4.5.js b/js/src/tests/ecma/Expressions/11.4.5.js
new file mode 100644
index 000000000..1d3ca78f0
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.4.5.js
@@ -0,0 +1,120 @@
+/* -*- 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:          11.4.5.js
+   ECMA Section:       11.4.5 Prefix decrement operator
+   Description:
+
+   The production UnaryExpression : -- UnaryExpression is evaluated as follows:
+
+   1.Evaluate UnaryExpression.
+   2.Call GetValue(Result(1)).
+   3.Call ToNumber(Result(2)).
+   4.Subtract the value 1 from Result(3), using the same rules as for the - operator (section 11.6.3).
+   5.Call PutValue(Result(1), Result(4)).
+
+   1.Return Result(4).
+   Author:             christine@netscape.com
+   Date:        \       12 november 1997
+*/
+var SECTION = "11.4.5";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Prefix decrement operator");
+
+//
+new TestCase( SECTION,  "var MYVAR; --MYVAR",                       NaN,                            eval("var MYVAR; --MYVAR") );
+new TestCase( SECTION,  "var MYVAR= void 0; --MYVAR",               NaN,                            eval("var MYVAR=void 0; --MYVAR") );
+new TestCase( SECTION,  "var MYVAR=null; --MYVAR",                  -1,                            eval("var MYVAR=null; --MYVAR") );
+new TestCase( SECTION,  "var MYVAR=true; --MYVAR",                  0,                            eval("var MYVAR=true; --MYVAR") );
+new TestCase( SECTION,  "var MYVAR=false; --MYVAR",                 -1,                            eval("var MYVAR=false; --MYVAR") );
+
+// special numbers
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=Number.POSITIVE_INFINITY;--MYVAR", Number.POSITIVE_INFINITY,   eval("var MYVAR=Number.POSITIVE_INFINITY;--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NEGATIVE_INFINITY;--MYVAR", Number.NEGATIVE_INFINITY,   eval("var MYVAR=Number.NEGATIVE_INFINITY;--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NaN;--MYVAR",               Number.NaN,                 eval("var MYVAR=Number.NaN;--MYVAR") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=Number.POSITIVE_INFINITY;--MYVAR;MYVAR", Number.POSITIVE_INFINITY,   eval("var MYVAR=Number.POSITIVE_INFINITY;--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NEGATIVE_INFINITY;--MYVAR;MYVAR", Number.NEGATIVE_INFINITY,   eval("var MYVAR=Number.NEGATIVE_INFINITY;--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=Number.NaN;--MYVAR;MYVAR",               Number.NaN,                 eval("var MYVAR=Number.NaN;--MYVAR;MYVAR") );
+
+
+// number primitives
+new TestCase( SECTION,    "var MYVAR=0;--MYVAR",            -1,         eval("var MYVAR=0;--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0.2345;--MYVAR",      -0.7655,     eval("var MYVAR=0.2345;--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=-0.2345;--MYVAR",      -1.2345,    eval("var MYVAR=-0.2345;--MYVAR") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=0;--MYVAR;MYVAR",      -1,         eval("var MYVAR=0;--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0.2345;--MYVAR;MYVAR", -0.7655,    eval("var MYVAR=0.2345;--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=-0.2345;--MYVAR;MYVAR", -1.2345,   eval("var MYVAR=-0.2345;--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;--MYVAR;MYVAR",      -1,   eval("var MYVAR=0;--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;--MYVAR;MYVAR",      -1,   eval("var MYVAR=0;--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=0;--MYVAR;MYVAR",      -1,   eval("var MYVAR=0;--MYVAR;MYVAR") );
+
+// boolean values
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=true;--MYVAR",         0,       eval("var MYVAR=true;--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=false;--MYVAR",        -1,      eval("var MYVAR=false;--MYVAR") );
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=true;--MYVAR;MYVAR",   0,   eval("var MYVAR=true;--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=false;--MYVAR;MYVAR",  -1,   eval("var MYVAR=false;--MYVAR;MYVAR") );
+
+// boolean objects
+// verify return value
+
+new TestCase( SECTION,    "var MYVAR=new Boolean(true);--MYVAR",         0,     eval("var MYVAR=true;--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new Boolean(false);--MYVAR",        -1,     eval("var MYVAR=false;--MYVAR") );
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=new Boolean(true);--MYVAR;MYVAR",   0,     eval("var MYVAR=new Boolean(true);--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new Boolean(false);--MYVAR;MYVAR",  -1,     eval("var MYVAR=new Boolean(false);--MYVAR;MYVAR") );
+
+// string primitives
+new TestCase( SECTION,    "var MYVAR='string';--MYVAR",         Number.NaN,     eval("var MYVAR='string';--MYVAR") );
+new TestCase( SECTION,    "var MYVAR='12345';--MYVAR",          12344,          eval("var MYVAR='12345';--MYVAR") );
+new TestCase( SECTION,    "var MYVAR='-12345';--MYVAR",         -12346,         eval("var MYVAR='-12345';--MYVAR") );
+new TestCase( SECTION,    "var MYVAR='0Xf';--MYVAR",            14,             eval("var MYVAR='0Xf';--MYVAR") );
+new TestCase( SECTION,    "var MYVAR='077';--MYVAR",            76,             eval("var MYVAR='077';--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=''; --MYVAR",              -1,              eval("var MYVAR='';--MYVAR") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR='string';--MYVAR;MYVAR",   Number.NaN,     eval("var MYVAR='string';--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='12345';--MYVAR;MYVAR",    12344,          eval("var MYVAR='12345';--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='-12345';--MYVAR;MYVAR",   -12346,          eval("var MYVAR='-12345';--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='0xf';--MYVAR;MYVAR",      14,             eval("var MYVAR='0xf';--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='077';--MYVAR;MYVAR",      76,             eval("var MYVAR='077';--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR='';--MYVAR;MYVAR",         -1,              eval("var MYVAR='';--MYVAR;MYVAR") );
+
+// string objects
+new TestCase( SECTION,    "var MYVAR=new String('string');--MYVAR",         Number.NaN,     eval("var MYVAR=new String('string');--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('12345');--MYVAR",          12344,          eval("var MYVAR=new String('12345');--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('-12345');--MYVAR",         -12346,         eval("var MYVAR=new String('-12345');--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('0Xf');--MYVAR",            14,             eval("var MYVAR=new String('0Xf');--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('077');--MYVAR",            76,             eval("var MYVAR=new String('077');--MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String(''); --MYVAR",              -1,              eval("var MYVAR=new String('');--MYVAR") );
+
+// verify value of variable
+
+new TestCase( SECTION,    "var MYVAR=new String('string');--MYVAR;MYVAR",   Number.NaN,     eval("var MYVAR=new String('string');--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('12345');--MYVAR;MYVAR",    12344,          eval("var MYVAR=new String('12345');--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('-12345');--MYVAR;MYVAR",   -12346,          eval("var MYVAR=new String('-12345');--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('0xf');--MYVAR;MYVAR",      14,             eval("var MYVAR=new String('0xf');--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('077');--MYVAR;MYVAR",      76,             eval("var MYVAR=new String('077');--MYVAR;MYVAR") );
+new TestCase( SECTION,    "var MYVAR=new String('');--MYVAR;MYVAR",         -1,              eval("var MYVAR=new String('');--MYVAR;MYVAR") );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.4.6.js b/js/src/tests/ecma/Expressions/11.4.6.js
new file mode 100644
index 000000000..16238f020
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.4.6.js
@@ -0,0 +1,265 @@
+/* -*- 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:          11.4.6.js
+   ECMA Section:       11.4.6 Unary + Operator
+   Description:        convert operand to Number type
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "11.4.6";
+var VERSION = "ECMA_1";
+var BUGNUMBER="77391";
+
+startTest();
+
+writeHeaderToLog( SECTION + " Unary + operator");
+
+new TestCase( SECTION,  "+('')",           0,      +("") );
+new TestCase( SECTION,  "+(' ')",          0,      +(" ") );
+new TestCase( SECTION,  "+(\\t)",          0,      +("\t") );
+new TestCase( SECTION,  "+(\\n)",          0,      +("\n") );
+new TestCase( SECTION,  "+(\\r)",          0,      +("\r") );
+new TestCase( SECTION,  "+(\\f)",          0,      +("\f") );
+
+new TestCase( SECTION,  "+(String.fromCharCode(0x0009)",   0,  +(String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "+(String.fromCharCode(0x0020)",   0,  +(String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "+(String.fromCharCode(0x000C)",   0,  +(String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "+(String.fromCharCode(0x000B)",   0,  +(String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "+(String.fromCharCode(0x000D)",   0,  +(String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "+(String.fromCharCode(0x000A)",   0,  +(String.fromCharCode(0x000A)) );
+
+//  a StringNumericLiteral may be preceeded or followed by whitespace and/or
+//  line terminators
+
+new TestCase( SECTION,  "+( '   ' +  999 )",        999,    +( '   '+999) );
+new TestCase( SECTION,  "+( '\\n'  + 999 )",       999,    +( '\n' +999) );
+new TestCase( SECTION,  "+( '\\r'  + 999 )",       999,    +( '\r' +999) );
+new TestCase( SECTION,  "+( '\\t'  + 999 )",       999,    +( '\t' +999) );
+new TestCase( SECTION,  "+( '\\f'  + 999 )",       999,    +( '\f' +999) );
+
+new TestCase( SECTION,  "+( 999 + '   ' )",        999,    +( 999+'   ') );
+new TestCase( SECTION,  "+( 999 + '\\n' )",        999,    +( 999+'\n' ) );
+new TestCase( SECTION,  "+( 999 + '\\r' )",        999,    +( 999+'\r' ) );
+new TestCase( SECTION,  "+( 999 + '\\t' )",        999,    +( 999+'\t' ) );
+new TestCase( SECTION,  "+( 999 + '\\f' )",        999,    +( 999+'\f' ) );
+
+new TestCase( SECTION,  "+( '\\n'  + 999 + '\\n' )",         999,    +( '\n' +999+'\n' ) );
+new TestCase( SECTION,  "+( '\\r'  + 999 + '\\r' )",         999,    +( '\r' +999+'\r' ) );
+new TestCase( SECTION,  "+( '\\t'  + 999 + '\\t' )",         999,    +( '\t' +999+'\t' ) );
+new TestCase( SECTION,  "+( '\\f'  + 999 + '\\f' )",         999,    +( '\f' +999+'\f' ) );
+
+new TestCase( SECTION,  "+( '   ' +  '999' )",     999,    +( '   '+'999') );
+new TestCase( SECTION,  "+( '\\n'  + '999' )",       999,    +( '\n' +'999') );
+new TestCase( SECTION,  "+( '\\r'  + '999' )",       999,    +( '\r' +'999') );
+new TestCase( SECTION,  "+( '\\t'  + '999' )",       999,    +( '\t' +'999') );
+new TestCase( SECTION,  "+( '\\f'  + '999' )",       999,    +( '\f' +'999') );
+
+new TestCase( SECTION,  "+( '999' + '   ' )",        999,    +( '999'+'   ') );
+new TestCase( SECTION,  "+( '999' + '\\n' )",        999,    +( '999'+'\n' ) );
+new TestCase( SECTION,  "+( '999' + '\\r' )",        999,    +( '999'+'\r' ) );
+new TestCase( SECTION,  "+( '999' + '\\t' )",        999,    +( '999'+'\t' ) );
+new TestCase( SECTION,  "+( '999' + '\\f' )",        999,    +( '999'+'\f' ) );
+
+new TestCase( SECTION,  "+( '\\n'  + '999' + '\\n' )",         999,    +( '\n' +'999'+'\n' ) );
+new TestCase( SECTION,  "+( '\\r'  + '999' + '\\r' )",         999,    +( '\r' +'999'+'\r' ) );
+new TestCase( SECTION,  "+( '\\t'  + '999' + '\\t' )",         999,    +( '\t' +'999'+'\t' ) );
+new TestCase( SECTION,  "+( '\\f'  + '999' + '\\f' )",         999,    +( '\f' +'999'+'\f' ) );
+
+new TestCase( SECTION,  "+( String.fromCharCode(0x0009) +  '99' )",    99,     +( String.fromCharCode(0x0009) +  '99' ) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x0020) +  '99' )",    99,     +( String.fromCharCode(0x0020) +  '99' ) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000C) +  '99' )",    99,     +( String.fromCharCode(0x000C) +  '99' ) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000B) +  '99' )",    99,     +( String.fromCharCode(0x000B) +  '99' ) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000D) +  '99' )",    99,     +( String.fromCharCode(0x000D) +  '99' ) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000A) +  '99' )",    99,     +( String.fromCharCode(0x000A) +  '99' ) );
+
+new TestCase( SECTION,  "+( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x0009)",    99,     +( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x0020) +  '99' + String.fromCharCode(0x0020)",    99,     +( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000C) +  '99' + String.fromCharCode(0x000C)",    99,     +( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000D) +  '99' + String.fromCharCode(0x000D)",    99,     +( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000B) +  '99' + String.fromCharCode(0x000B)",    99,     +( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000A) +  '99' + String.fromCharCode(0x000A)",    99,     +( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000A)) );
+
+new TestCase( SECTION,  "+( '99' + String.fromCharCode(0x0009)",    99,     +( '99' + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "+( '99' + String.fromCharCode(0x0020)",    99,     +( '99' + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "+( '99' + String.fromCharCode(0x000C)",    99,     +( '99' + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "+( '99' + String.fromCharCode(0x000D)",    99,     +( '99' + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "+( '99' + String.fromCharCode(0x000B)",    99,     +( '99' + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "+( '99' + String.fromCharCode(0x000A)",    99,     +( '99' + String.fromCharCode(0x000A)) );
+
+new TestCase( SECTION,  "+( String.fromCharCode(0x0009) +  99 )",    99,     +( String.fromCharCode(0x0009) +  99 ) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x0020) +  99 )",    99,     +( String.fromCharCode(0x0020) +  99 ) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000C) +  99 )",    99,     +( String.fromCharCode(0x000C) +  99 ) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000B) +  99 )",    99,     +( String.fromCharCode(0x000B) +  99 ) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000D) +  99 )",    99,     +( String.fromCharCode(0x000D) +  99 ) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000A) +  99 )",    99,     +( String.fromCharCode(0x000A) +  99 ) );
+
+new TestCase( SECTION,  "+( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x0009)",    99,     +( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x0020) +  99 + String.fromCharCode(0x0020)",    99,     +( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000C) +  99 + String.fromCharCode(0x000C)",    99,     +( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000D) +  99 + String.fromCharCode(0x000D)",    99,     +( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000B) +  99 + String.fromCharCode(0x000B)",    99,     +( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "+( String.fromCharCode(0x000A) +  99 + String.fromCharCode(0x000A)",    99,     +( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000A)) );
+
+new TestCase( SECTION,  "+( 99 + String.fromCharCode(0x0009)",    99,     +( 99 + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "+( 99 + String.fromCharCode(0x0020)",    99,     +( 99 + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "+( 99 + String.fromCharCode(0x000C)",    99,     +( 99 + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "+( 99 + String.fromCharCode(0x000D)",    99,     +( 99 + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "+( 99 + String.fromCharCode(0x000B)",    99,     +( 99 + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "+( 99 + String.fromCharCode(0x000A)",    99,     +( 99 + String.fromCharCode(0x000A)) );
+
+
+// StrNumericLiteral:::StrDecimalLiteral:::Infinity
+
+new TestCase( SECTION,  "+('Infinity')",   Math.pow(10,10000),   +("Infinity") );
+new TestCase( SECTION,  "+('-Infinity')", -Math.pow(10,10000),   +("-Infinity") );
+new TestCase( SECTION,  "+('+Infinity')",  Math.pow(10,10000),   +("+Infinity") );
+
+// StrNumericLiteral:::   StrDecimalLiteral ::: DecimalDigits . DecimalDigits opt ExponentPart opt
+
+new TestCase( SECTION,  "+('0')",          0,          +("0") );
+new TestCase( SECTION,  "+('-0')",         -0,         +("-0") );
+new TestCase( SECTION,  "+('+0')",          0,         +("+0") );
+
+new TestCase( SECTION,  "+('1')",          1,          +("1") );
+new TestCase( SECTION,  "+('-1')",         -1,         +("-1") );
+new TestCase( SECTION,  "+('+1')",          1,         +("+1") );
+
+new TestCase( SECTION,  "+('2')",          2,          +("2") );
+new TestCase( SECTION,  "+('-2')",         -2,         +("-2") );
+new TestCase( SECTION,  "+('+2')",          2,         +("+2") );
+
+new TestCase( SECTION,  "+('3')",          3,          +("3") );
+new TestCase( SECTION,  "+('-3')",         -3,         +("-3") );
+new TestCase( SECTION,  "+('+3')",          3,         +("+3") );
+
+new TestCase( SECTION,  "+('4')",          4,          +("4") );
+new TestCase( SECTION,  "+('-4')",         -4,         +("-4") );
+new TestCase( SECTION,  "+('+4')",          4,         +("+4") );
+
+new TestCase( SECTION,  "+('5')",          5,          +("5") );
+new TestCase( SECTION,  "+('-5')",         -5,         +("-5") );
+new TestCase( SECTION,  "+('+5')",          5,         +("+5") );
+
+new TestCase( SECTION,  "+('6')",          6,          +("6") );
+new TestCase( SECTION,  "+('-6')",         -6,         +("-6") );
+new TestCase( SECTION,  "+('+6')",          6,         +("+6") );
+
+new TestCase( SECTION,  "+('7')",          7,          +("7") );
+new TestCase( SECTION,  "+('-7')",         -7,         +("-7") );
+new TestCase( SECTION,  "+('+7')",          7,         +("+7") );
+
+new TestCase( SECTION,  "+('8')",          8,          +("8") );
+new TestCase( SECTION,  "+('-8')",         -8,         +("-8") );
+new TestCase( SECTION,  "+('+8')",          8,         +("+8") );
+
+new TestCase( SECTION,  "+('9')",          9,          +("9") );
+new TestCase( SECTION,  "+('-9')",         -9,         +("-9") );
+new TestCase( SECTION,  "+('+9')",          9,         +("+9") );
+
+new TestCase( SECTION,  "+('3.14159')",    3.14159,    +("3.14159") );
+new TestCase( SECTION,  "+('-3.14159')",   -3.14159,   +("-3.14159") );
+new TestCase( SECTION,  "+('+3.14159')",   3.14159,    +("+3.14159") );
+
+new TestCase( SECTION,  "+('3.')",         3,          +("3.") );
+new TestCase( SECTION,  "+('-3.')",        -3,         +("-3.") );
+new TestCase( SECTION,  "+('+3.')",        3,          +("+3.") );
+
+new TestCase( SECTION,  "+('3.e1')",       30,         +("3.e1") );
+new TestCase( SECTION,  "+('-3.e1')",      -30,        +("-3.e1") );
+new TestCase( SECTION,  "+('+3.e1')",      30,         +("+3.e1") );
+
+new TestCase( SECTION,  "+('3.e+1')",       30,         +("3.e+1") );
+new TestCase( SECTION,  "+('-3.e+1')",      -30,        +("-3.e+1") );
+new TestCase( SECTION,  "+('+3.e+1')",      30,         +("+3.e+1") );
+
+new TestCase( SECTION,  "+('3.e-1')",       .30,         +("3.e-1") );
+new TestCase( SECTION,  "+('-3.e-1')",      -.30,        +("-3.e-1") );
+new TestCase( SECTION,  "+('+3.e-1')",      .30,         +("+3.e-1") );
+
+// StrDecimalLiteral:::  .DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "+('.00001')",     0.00001,    +(".00001") );
+new TestCase( SECTION,  "+('+.00001')",    0.00001,    +("+.00001") );
+new TestCase( SECTION,  "+('-0.0001')",    -0.00001,   +("-.00001") );
+
+new TestCase( SECTION,  "+('.01e2')",      1,          +(".01e2") );
+new TestCase( SECTION,  "+('+.01e2')",     1,          +("+.01e2") );
+new TestCase( SECTION,  "+('-.01e2')",     -1,         +("-.01e2") );
+
+new TestCase( SECTION,  "+('.01e+2')",      1,         +(".01e+2") );
+new TestCase( SECTION,  "+('+.01e+2')",     1,         +("+.01e+2") );
+new TestCase( SECTION,  "+('-.01e+2')",     -1,        +("-.01e+2") );
+
+new TestCase( SECTION,  "+('.01e-2')",      0.0001,    +(".01e-2") );
+new TestCase( SECTION,  "+('+.01e-2')",     0.0001,    +("+.01e-2") );
+new TestCase( SECTION,  "+('-.01e-2')",     -0.0001,   +("-.01e-2") );
+
+//  StrDecimalLiteral:::    DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "+('1234e5')",     123400000,  +("1234e5") );
+new TestCase( SECTION,  "+('+1234e5')",    123400000,  +("+1234e5") );
+new TestCase( SECTION,  "+('-1234e5')",    -123400000, +("-1234e5") );
+
+new TestCase( SECTION,  "+('1234e+5')",    123400000,  +("1234e+5") );
+new TestCase( SECTION,  "+('+1234e+5')",   123400000,  +("+1234e+5") );
+new TestCase( SECTION,  "+('-1234e+5')",   -123400000, +("-1234e+5") );
+
+new TestCase( SECTION,  "+('1234e-5')",     0.01234,  +("1234e-5") );
+new TestCase( SECTION,  "+('+1234e-5')",    0.01234,  +("+1234e-5") );
+new TestCase( SECTION,  "+('-1234e-5')",    -0.01234, +("-1234e-5") );
+
+// StrNumericLiteral::: HexIntegerLiteral
+
+new TestCase( SECTION,  "+('0x0')",        0,          +("0x0"));
+new TestCase( SECTION,  "+('0x1')",        1,          +("0x1"));
+new TestCase( SECTION,  "+('0x2')",        2,          +("0x2"));
+new TestCase( SECTION,  "+('0x3')",        3,          +("0x3"));
+new TestCase( SECTION,  "+('0x4')",        4,          +("0x4"));
+new TestCase( SECTION,  "+('0x5')",        5,          +("0x5"));
+new TestCase( SECTION,  "+('0x6')",        6,          +("0x6"));
+new TestCase( SECTION,  "+('0x7')",        7,          +("0x7"));
+new TestCase( SECTION,  "+('0x8')",        8,          +("0x8"));
+new TestCase( SECTION,  "+('0x9')",        9,          +("0x9"));
+new TestCase( SECTION,  "+('0xa')",        10,         +("0xa"));
+new TestCase( SECTION,  "+('0xb')",        11,         +("0xb"));
+new TestCase( SECTION,  "+('0xc')",        12,         +("0xc"));
+new TestCase( SECTION,  "+('0xd')",        13,         +("0xd"));
+new TestCase( SECTION,  "+('0xe')",        14,         +("0xe"));
+new TestCase( SECTION,  "+('0xf')",        15,         +("0xf"));
+new TestCase( SECTION,  "+('0xA')",        10,         +("0xA"));
+new TestCase( SECTION,  "+('0xB')",        11,         +("0xB"));
+new TestCase( SECTION,  "+('0xC')",        12,         +("0xC"));
+new TestCase( SECTION,  "+('0xD')",        13,         +("0xD"));
+new TestCase( SECTION,  "+('0xE')",        14,         +("0xE"));
+new TestCase( SECTION,  "+('0xF')",        15,         +("0xF"));
+
+new TestCase( SECTION,  "+('0X0')",        0,          +("0X0"));
+new TestCase( SECTION,  "+('0X1')",        1,          +("0X1"));
+new TestCase( SECTION,  "+('0X2')",        2,          +("0X2"));
+new TestCase( SECTION,  "+('0X3')",        3,          +("0X3"));
+new TestCase( SECTION,  "+('0X4')",        4,          +("0X4"));
+new TestCase( SECTION,  "+('0X5')",        5,          +("0X5"));
+new TestCase( SECTION,  "+('0X6')",        6,          +("0X6"));
+new TestCase( SECTION,  "+('0X7')",        7,          +("0X7"));
+new TestCase( SECTION,  "+('0X8')",        8,          +("0X8"));
+new TestCase( SECTION,  "+('0X9')",        9,          +("0X9"));
+new TestCase( SECTION,  "+('0Xa')",        10,         +("0Xa"));
+new TestCase( SECTION,  "+('0Xb')",        11,         +("0Xb"));
+new TestCase( SECTION,  "+('0Xc')",        12,         +("0Xc"));
+new TestCase( SECTION,  "+('0Xd')",        13,         +("0Xd"));
+new TestCase( SECTION,  "+('0Xe')",        14,         +("0Xe"));
+new TestCase( SECTION,  "+('0Xf')",        15,         +("0Xf"));
+new TestCase( SECTION,  "+('0XA')",        10,         +("0XA"));
+new TestCase( SECTION,  "+('0XB')",        11,         +("0XB"));
+new TestCase( SECTION,  "+('0XC')",        12,         +("0XC"));
+new TestCase( SECTION,  "+('0XD')",        13,         +("0XD"));
+new TestCase( SECTION,  "+('0XE')",        14,         +("0XE"));
+new TestCase( SECTION,  "+('0XF')",        15,         +("0XF"));
+
+test();
diff --git a/js/src/tests/ecma/Expressions/11.4.7-01.js b/js/src/tests/ecma/Expressions/11.4.7-01.js
new file mode 100644
index 000000000..28e996ff7
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.4.7-01.js
@@ -0,0 +1,265 @@
+/* -*- 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:          11.4.7-01.js
+   ECMA Section:       11.4.7 Unary - Operator
+   Description:        convert operand to Number type and change sign
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "11.4.7";
+var VERSION = "ECMA_1";
+var BUGNUMBER="77391";
+
+startTest();
+
+writeHeaderToLog( SECTION + " Unary + operator");
+
+new TestCase( SECTION,  "-('')",           -0,      -("") );
+new TestCase( SECTION,  "-(' ')",          -0,      -(" ") );
+new TestCase( SECTION,  "-(\\t)",          -0,      -("\t") );
+new TestCase( SECTION,  "-(\\n)",          -0,      -("\n") );
+new TestCase( SECTION,  "-(\\r)",          -0,      -("\r") );
+new TestCase( SECTION,  "-(\\f)",          -0,      -("\f") );
+
+new TestCase( SECTION,  "-(String.fromCharCode(0x0009)",   -0,  -(String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "-(String.fromCharCode(0x0020)",   -0,  -(String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "-(String.fromCharCode(0x000C)",   -0,  -(String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "-(String.fromCharCode(0x000B)",   -0,  -(String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "-(String.fromCharCode(0x000D)",   -0,  -(String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "-(String.fromCharCode(0x000A)",   -0,  -(String.fromCharCode(0x000A)) );
+
+//  a StringNumericLiteral may be preceeded or followed by whitespace and/or
+//  line terminators
+
+new TestCase( SECTION,  "-( '   ' +  999 )",        -999,    -( '   '+999) );
+new TestCase( SECTION,  "-( '\\n'  + 999 )",       -999,    -( '\n' +999) );
+new TestCase( SECTION,  "-( '\\r'  + 999 )",       -999,    -( '\r' +999) );
+new TestCase( SECTION,  "-( '\\t'  + 999 )",       -999,    -( '\t' +999) );
+new TestCase( SECTION,  "-( '\\f'  + 999 )",       -999,    -( '\f' +999) );
+
+new TestCase( SECTION,  "-( 999 + '   ' )",        -999,    -( 999+'   ') );
+new TestCase( SECTION,  "-( 999 + '\\n' )",        -999,    -( 999+'\n' ) );
+new TestCase( SECTION,  "-( 999 + '\\r' )",        -999,    -( 999+'\r' ) );
+new TestCase( SECTION,  "-( 999 + '\\t' )",        -999,    -( 999+'\t' ) );
+new TestCase( SECTION,  "-( 999 + '\\f' )",        -999,    -( 999+'\f' ) );
+
+new TestCase( SECTION,  "-( '\\n'  + 999 + '\\n' )",         -999,    -( '\n' +999+'\n' ) );
+new TestCase( SECTION,  "-( '\\r'  + 999 + '\\r' )",         -999,    -( '\r' +999+'\r' ) );
+new TestCase( SECTION,  "-( '\\t'  + 999 + '\\t' )",         -999,    -( '\t' +999+'\t' ) );
+new TestCase( SECTION,  "-( '\\f'  + 999 + '\\f' )",         -999,    -( '\f' +999+'\f' ) );
+
+new TestCase( SECTION,  "-( '   ' +  '999' )",     -999,    -( '   '+'999') );
+new TestCase( SECTION,  "-( '\\n'  + '999' )",       -999,    -( '\n' +'999') );
+new TestCase( SECTION,  "-( '\\r'  + '999' )",       -999,    -( '\r' +'999') );
+new TestCase( SECTION,  "-( '\\t'  + '999' )",       -999,    -( '\t' +'999') );
+new TestCase( SECTION,  "-( '\\f'  + '999' )",       -999,    -( '\f' +'999') );
+
+new TestCase( SECTION,  "-( '999' + '   ' )",        -999,    -( '999'+'   ') );
+new TestCase( SECTION,  "-( '999' + '\\n' )",        -999,    -( '999'+'\n' ) );
+new TestCase( SECTION,  "-( '999' + '\\r' )",        -999,    -( '999'+'\r' ) );
+new TestCase( SECTION,  "-( '999' + '\\t' )",        -999,    -( '999'+'\t' ) );
+new TestCase( SECTION,  "-( '999' + '\\f' )",        -999,    -( '999'+'\f' ) );
+
+new TestCase( SECTION,  "-( '\\n'  + '999' + '\\n' )",         -999,    -( '\n' +'999'+'\n' ) );
+new TestCase( SECTION,  "-( '\\r'  + '999' + '\\r' )",         -999,    -( '\r' +'999'+'\r' ) );
+new TestCase( SECTION,  "-( '\\t'  + '999' + '\\t' )",         -999,    -( '\t' +'999'+'\t' ) );
+new TestCase( SECTION,  "-( '\\f'  + '999' + '\\f' )",         -999,    -( '\f' +'999'+'\f' ) );
+
+new TestCase( SECTION,  "-( String.fromCharCode(0x0009) +  '99' )",    -99,     -( String.fromCharCode(0x0009) +  '99' ) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x0020) +  '99' )",    -99,     -( String.fromCharCode(0x0020) +  '99' ) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000C) +  '99' )",    -99,     -( String.fromCharCode(0x000C) +  '99' ) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000B) +  '99' )",    -99,     -( String.fromCharCode(0x000B) +  '99' ) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000D) +  '99' )",    -99,     -( String.fromCharCode(0x000D) +  '99' ) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000A) +  '99' )",    -99,     -( String.fromCharCode(0x000A) +  '99' ) );
+
+new TestCase( SECTION,  "-( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x0009)",    -99,     -( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x0020) +  '99' + String.fromCharCode(0x0020)",    -99,     -( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000C) +  '99' + String.fromCharCode(0x000C)",    -99,     -( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000D) +  '99' + String.fromCharCode(0x000D)",    -99,     -( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000B) +  '99' + String.fromCharCode(0x000B)",    -99,     -( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000A) +  '99' + String.fromCharCode(0x000A)",    -99,     -( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000A)) );
+
+new TestCase( SECTION,  "-( '99' + String.fromCharCode(0x0009)",    -99,     -( '99' + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "-( '99' + String.fromCharCode(0x0020)",    -99,     -( '99' + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "-( '99' + String.fromCharCode(0x000C)",    -99,     -( '99' + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "-( '99' + String.fromCharCode(0x000D)",    -99,     -( '99' + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "-( '99' + String.fromCharCode(0x000B)",    -99,     -( '99' + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "-( '99' + String.fromCharCode(0x000A)",    -99,     -( '99' + String.fromCharCode(0x000A)) );
+
+new TestCase( SECTION,  "-( String.fromCharCode(0x0009) +  99 )",    -99,     -( String.fromCharCode(0x0009) +  99 ) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x0020) +  99 )",    -99,     -( String.fromCharCode(0x0020) +  99 ) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000C) +  99 )",    -99,     -( String.fromCharCode(0x000C) +  99 ) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000B) +  99 )",    -99,     -( String.fromCharCode(0x000B) +  99 ) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000D) +  99 )",    -99,     -( String.fromCharCode(0x000D) +  99 ) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000A) +  99 )",    -99,     -( String.fromCharCode(0x000A) +  99 ) );
+
+new TestCase( SECTION,  "-( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x0009)",    -99,     -( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x0020) +  99 + String.fromCharCode(0x0020)",    -99,     -( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000C) +  99 + String.fromCharCode(0x000C)",    -99,     -( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000D) +  99 + String.fromCharCode(0x000D)",    -99,     -( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000B) +  99 + String.fromCharCode(0x000B)",    -99,     -( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "-( String.fromCharCode(0x000A) +  99 + String.fromCharCode(0x000A)",    -99,     -( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000A)) );
+
+new TestCase( SECTION,  "-( 99 + String.fromCharCode(0x0009)",    -99,     -( 99 + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "-( 99 + String.fromCharCode(0x0020)",    -99,     -( 99 + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "-( 99 + String.fromCharCode(0x000C)",    -99,     -( 99 + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "-( 99 + String.fromCharCode(0x000D)",    -99,     -( 99 + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "-( 99 + String.fromCharCode(0x000B)",    -99,     -( 99 + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "-( 99 + String.fromCharCode(0x000A)",    -99,     -( 99 + String.fromCharCode(0x000A)) );
+
+
+// StrNumericLiteral:::StrDecimalLiteral:::Infinity
+
+new TestCase( SECTION,  "-('Infinity')",   -Math.pow(10,10000),   -("Infinity") );
+new TestCase( SECTION,  "-('-Infinity')", +Math.pow(10,10000),   -("-Infinity") );
+new TestCase( SECTION,  "-('+Infinity')",  -Math.pow(10,10000),   -("+Infinity") );
+
+// StrNumericLiteral:::   StrDecimalLiteral ::: DecimalDigits . DecimalDigits opt ExponentPart opt
+
+new TestCase( SECTION,  "-('0')",          -0,          -("0") );
+new TestCase( SECTION,  "-('-0')",         +0,         -("-0") );
+new TestCase( SECTION,  "-('+0')",          -0,         -("+0") );
+
+new TestCase( SECTION,  "-('1')",          -1,          -("1") );
+new TestCase( SECTION,  "-('-1')",         +1,         -("-1") );
+new TestCase( SECTION,  "-('+1')",          -1,         -("+1") );
+
+new TestCase( SECTION,  "-('2')",          -2,          -("2") );
+new TestCase( SECTION,  "-('-2')",         +2,         -("-2") );
+new TestCase( SECTION,  "-('+2')",          -2,         -("+2") );
+
+new TestCase( SECTION,  "-('3')",          -3,          -("3") );
+new TestCase( SECTION,  "-('-3')",         +3,         -("-3") );
+new TestCase( SECTION,  "-('+3')",          -3,         -("+3") );
+
+new TestCase( SECTION,  "-('4')",          -4,          -("4") );
+new TestCase( SECTION,  "-('-4')",         +4,         -("-4") );
+new TestCase( SECTION,  "-('+4')",          -4,         -("+4") );
+
+new TestCase( SECTION,  "-('5')",          -5,          -("5") );
+new TestCase( SECTION,  "-('-5')",         +5,         -("-5") );
+new TestCase( SECTION,  "-('+5')",          -5,         -("+5") );
+
+new TestCase( SECTION,  "-('6')",          -6,          -("6") );
+new TestCase( SECTION,  "-('-6')",         +6,         -("-6") );
+new TestCase( SECTION,  "-('+6')",          -6,         -("+6") );
+
+new TestCase( SECTION,  "-('7')",          -7,          -("7") );
+new TestCase( SECTION,  "-('-7')",         +7,         -("-7") );
+new TestCase( SECTION,  "-('+7')",          -7,         -("+7") );
+
+new TestCase( SECTION,  "-('8')",          -8,          -("8") );
+new TestCase( SECTION,  "-('-8')",         +8,         -("-8") );
+new TestCase( SECTION,  "-('+8')",          -8,         -("+8") );
+
+new TestCase( SECTION,  "-('9')",          -9,          -("9") );
+new TestCase( SECTION,  "-('-9')",         +9,         -("-9") );
+new TestCase( SECTION,  "-('+9')",          -9,         -("+9") );
+
+new TestCase( SECTION,  "-('3.14159')",    -3.14159,    -("3.14159") );
+new TestCase( SECTION,  "-('-3.14159')",   +3.14159,   -("-3.14159") );
+new TestCase( SECTION,  "-('+3.14159')",   -3.14159,    -("+3.14159") );
+
+new TestCase( SECTION,  "-('3.')",         -3,          -("3.") );
+new TestCase( SECTION,  "-('-3.')",        +3,         -("-3.") );
+new TestCase( SECTION,  "-('+3.')",        -3,          -("+3.") );
+
+new TestCase( SECTION,  "-('3.e1')",       -30,         -("3.e1") );
+new TestCase( SECTION,  "-('-3.e1')",      +30,        -("-3.e1") );
+new TestCase( SECTION,  "-('+3.e1')",      -30,         -("+3.e1") );
+
+new TestCase( SECTION,  "-('3.e+1')",       -30,         -("3.e+1") );
+new TestCase( SECTION,  "-('-3.e+1')",      +30,        -("-3.e+1") );
+new TestCase( SECTION,  "-('+3.e+1')",      -30,         -("+3.e+1") );
+
+new TestCase( SECTION,  "-('3.e-1')",       -.30,         -("3.e-1") );
+new TestCase( SECTION,  "-('-3.e-1')",      +.30,        -("-3.e-1") );
+new TestCase( SECTION,  "-('+3.e-1')",      -.30,         -("+3.e-1") );
+
+// StrDecimalLiteral:::  .DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "-('.00001')",     -0.00001,    -(".00001") );
+new TestCase( SECTION,  "-('+.00001')",    -0.00001,    -("+.00001") );
+new TestCase( SECTION,  "-('-0.0001')",    +0.00001,   -("-.00001") );
+
+new TestCase( SECTION,  "-('.01e2')",      -1,          -(".01e2") );
+new TestCase( SECTION,  "-('+.01e2')",     -1,          -("+.01e2") );
+new TestCase( SECTION,  "-('-.01e2')",     +1,         -("-.01e2") );
+
+new TestCase( SECTION,  "-('.01e+2')",      -1,         -(".01e+2") );
+new TestCase( SECTION,  "-('+.01e+2')",     -1,         -("+.01e+2") );
+new TestCase( SECTION,  "-('-.01e+2')",     +1,        -("-.01e+2") );
+
+new TestCase( SECTION,  "-('.01e-2')",      -0.0001,    -(".01e-2") );
+new TestCase( SECTION,  "-('+.01e-2')",     -0.0001,    -("+.01e-2") );
+new TestCase( SECTION,  "-('-.01e-2')",     +0.0001,   -("-.01e-2") );
+
+//  StrDecimalLiteral:::    DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "-('1234e5')",     -123400000,  -("1234e5") );
+new TestCase( SECTION,  "-('+1234e5')",    -123400000,  -("+1234e5") );
+new TestCase( SECTION,  "-('-1234e5')",    +123400000, -("-1234e5") );
+
+new TestCase( SECTION,  "-('1234e+5')",    -123400000,  -("1234e+5") );
+new TestCase( SECTION,  "-('+1234e+5')",   -123400000,  -("+1234e+5") );
+new TestCase( SECTION,  "-('-1234e+5')",   +123400000, -("-1234e+5") );
+
+new TestCase( SECTION,  "-('1234e-5')",     -0.01234,  -("1234e-5") );
+new TestCase( SECTION,  "-('+1234e-5')",    -0.01234,  -("+1234e-5") );
+new TestCase( SECTION,  "-('-1234e-5')",    +0.01234, -("-1234e-5") );
+
+// StrNumericLiteral::: HexIntegerLiteral
+
+new TestCase( SECTION,  "-('0x0')",        -0,          -("0x0"));
+new TestCase( SECTION,  "-('0x1')",        -1,          -("0x1"));
+new TestCase( SECTION,  "-('0x2')",        -2,          -("0x2"));
+new TestCase( SECTION,  "-('0x3')",        -3,          -("0x3"));
+new TestCase( SECTION,  "-('0x4')",        -4,          -("0x4"));
+new TestCase( SECTION,  "-('0x5')",        -5,          -("0x5"));
+new TestCase( SECTION,  "-('0x6')",        -6,          -("0x6"));
+new TestCase( SECTION,  "-('0x7')",        -7,          -("0x7"));
+new TestCase( SECTION,  "-('0x8')",        -8,          -("0x8"));
+new TestCase( SECTION,  "-('0x9')",        -9,          -("0x9"));
+new TestCase( SECTION,  "-('0xa')",        -10,         -("0xa"));
+new TestCase( SECTION,  "-('0xb')",        -11,         -("0xb"));
+new TestCase( SECTION,  "-('0xc')",        -12,         -("0xc"));
+new TestCase( SECTION,  "-('0xd')",        -13,         -("0xd"));
+new TestCase( SECTION,  "-('0xe')",        -14,         -("0xe"));
+new TestCase( SECTION,  "-('0xf')",        -15,         -("0xf"));
+new TestCase( SECTION,  "-('0xA')",        -10,         -("0xA"));
+new TestCase( SECTION,  "-('0xB')",        -11,         -("0xB"));
+new TestCase( SECTION,  "-('0xC')",        -12,         -("0xC"));
+new TestCase( SECTION,  "-('0xD')",        -13,         -("0xD"));
+new TestCase( SECTION,  "-('0xE')",        -14,         -("0xE"));
+new TestCase( SECTION,  "-('0xF')",        -15,         -("0xF"));
+
+new TestCase( SECTION,  "-('0X0')",        -0,          -("0X0"));
+new TestCase( SECTION,  "-('0X1')",        -1,          -("0X1"));
+new TestCase( SECTION,  "-('0X2')",        -2,          -("0X2"));
+new TestCase( SECTION,  "-('0X3')",        -3,          -("0X3"));
+new TestCase( SECTION,  "-('0X4')",        -4,          -("0X4"));
+new TestCase( SECTION,  "-('0X5')",        -5,          -("0X5"));
+new TestCase( SECTION,  "-('0X6')",        -6,          -("0X6"));
+new TestCase( SECTION,  "-('0X7')",        -7,          -("0X7"));
+new TestCase( SECTION,  "-('0X8')",        -8,          -("0X8"));
+new TestCase( SECTION,  "-('0X9')",        -9,          -("0X9"));
+new TestCase( SECTION,  "-('0Xa')",        -10,         -("0Xa"));
+new TestCase( SECTION,  "-('0Xb')",        -11,         -("0Xb"));
+new TestCase( SECTION,  "-('0Xc')",        -12,         -("0Xc"));
+new TestCase( SECTION,  "-('0Xd')",        -13,         -("0Xd"));
+new TestCase( SECTION,  "-('0Xe')",        -14,         -("0Xe"));
+new TestCase( SECTION,  "-('0Xf')",        -15,         -("0Xf"));
+new TestCase( SECTION,  "-('0XA')",        -10,         -("0XA"));
+new TestCase( SECTION,  "-('0XB')",        -11,         -("0XB"));
+new TestCase( SECTION,  "-('0XC')",        -12,         -("0XC"));
+new TestCase( SECTION,  "-('0XD')",        -13,         -("0XD"));
+new TestCase( SECTION,  "-('0XE')",        -14,         -("0XE"));
+new TestCase( SECTION,  "-('0XF')",        -15,         -("0XF"));
+
+test();
diff --git a/js/src/tests/ecma/Expressions/11.4.7-02.js b/js/src/tests/ecma/Expressions/11.4.7-02.js
new file mode 100644
index 000000000..1ff020530
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.4.7-02.js
@@ -0,0 +1,54 @@
+/* -*- 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:          11.4.7-02.js
+ *  Reference:          https://bugzilla.mozilla.org/show_bug.cgi?id=432881
+ *  Description:        ecma 11.4.7
+ */
+
+var SECTION = "11.4.7";
+var VERSION = "ECMA";
+var TITLE   = "Unary - Operator";
+var BUGNUMBER = "432881";
+
+startTest();
+
+test_negation(0, -0.0);
+test_negation(-0.0, 0);
+test_negation(1, -1);
+test_negation(1.0/0.0, -1.0/0.0);
+test_negation(-1.0/0.0, 1.0/0.0);
+
+//1073741824 == (1 << 30)
+test_negation(1073741824, -1073741824);
+test_negation(-1073741824, 1073741824);
+
+//1073741824 == (1 << 30) - 1
+test_negation(1073741823, -1073741823);
+test_negation(-1073741823, 1073741823);
+
+//1073741824 == (1 << 30)
+test_negation(1073741824, -1073741824);
+test_negation(-1073741824, 1073741824);
+
+//1073741824 == (1 << 30) - 1
+test_negation(1073741823, -1073741823);
+test_negation(-1073741823, 1073741823);
+
+//2147483648 == (1 << 31)
+test_negation(2147483648, -2147483648);
+test_negation(-2147483648, 2147483648);
+
+//2147483648 == (1 << 31) - 1
+test_negation(2147483647, -2147483647);
+test_negation(-2147483647, 2147483647);
+
+function test_negation(value, expected)
+{
+    var actual = -value;
+    reportCompare(expected, actual, '-(' + value + ') == ' + expected);
+} 
diff --git a/js/src/tests/ecma/Expressions/11.4.8.js b/js/src/tests/ecma/Expressions/11.4.8.js
new file mode 100644
index 000000000..d80d8955d
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.4.8.js
@@ -0,0 +1,181 @@
+/* -*- 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:          11.4.8.js
+   ECMA Section:       11.4.8 Bitwise NOT Operator
+   Description:        flip bits up to 32 bits
+   no special cases
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+   Data File Fields:
+   VALUE           value passed as an argument to the ~ operator
+   E_RESULT        expected return value of ~ VALUE;
+
+   Static variables:
+   none
+
+*/
+
+var SECTION = "11.4.8";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Bitwise Not operator");
+
+for ( var i = 0; i < 35; i++ ) {
+  var p = Math.pow(2,i);
+
+  new TestCase( SECTION, "~"+p,   Not(p),     ~p );
+
+}
+for ( i = 0; i < 35; i++ ) {
+  var p = -Math.pow(2,i);
+
+  new TestCase( SECTION, "~"+p,   Not(p),     ~p );
+
+}
+
+test();
+
+function ToInteger( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( n != n ) {
+    return 0;
+  }
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
+    return n;
+  }
+  return ( sign * Math.floor(Math.abs(n)) );
+}
+function ToInt32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
+  n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
+
+  return ( n );
+}
+function ToUint32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+  n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+  if ( n < 0 ){
+    n += Math.pow(2,32);
+  }
+
+  return ( n );
+}
+function ToUint16( n ) {
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
+
+  if (n <0) {
+    n += Math.pow(2,16);
+  }
+
+  return ( n );
+}
+function Mask( b, n ) {
+  b = ToUint32BitString( b );
+  b = b.substring( b.length - n );
+  b = ToUint32Decimal( b );
+  return ( b );
+}
+function ToUint32BitString( n ) {
+  var b = "";
+  for ( var p = 31; p >=0; p-- ) {
+    if ( n >= Math.pow(2,p) ) {
+      b += "1";
+      n -= Math.pow(2,p);
+    } else {
+      b += "0";
+    }
+  }
+  return b;
+}
+function ToInt32BitString( n ) {
+  var b = "";
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  b += ( sign == 1 ) ? "0" : "1";
+
+  for ( var p = 30; p >=0; p-- ) {
+    if ( (sign == 1 ) ? sign * n >= Math.pow(2,p) : sign * n > Math.pow(2,p) ) {
+      b += ( sign == 1 ) ? "1" : "0";
+      n -= sign * Math.pow( 2, p );
+    } else {
+      b += ( sign == 1 ) ? "0" : "1";
+    }
+  }
+
+  return b;
+}
+function ToInt32Decimal( bin ) {
+  var r = 0;
+  var sign;
+
+  if ( Number(bin.charAt(0)) == 0 ) {
+    sign = 1;
+    r = 0;
+  } else {
+    sign = -1;
+    r = -(Math.pow(2,31));
+  }
+
+  for ( var j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+  }
+
+  return r;
+}
+function ToUint32Decimal( bin ) {
+  var r = 0;
+
+  for ( var l = bin.length; l < 32; l++ ) {
+    bin = "0" + bin;
+  }
+
+  for ( var j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+  }
+
+  return r;
+}
+function Not( n ) {
+  n = ToInt32(n);
+  n = ToInt32BitString(n);
+
+  var r = "";
+
+  for( var l = 0; l < n.length; l++  ) {
+    r += ( n.charAt(l) == "0" ) ? "1" : "0";
+  }
+
+  n = ToInt32Decimal(r);
+
+  return n;
+}
diff --git a/js/src/tests/ecma/Expressions/11.4.9.js b/js/src/tests/ecma/Expressions/11.4.9.js
new file mode 100644
index 000000000..58bb2657d
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.4.9.js
@@ -0,0 +1,57 @@
+/* -*- 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:          11.4.9.js
+   ECMA Section:       11.4.9 Logical NOT Operator (!)
+   Description:        if the ToBoolean( VALUE ) result is true, return
+   true.  else return false.
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+   Static variables:
+   none
+*/
+var SECTION = "11.4.9";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Logical NOT operator (!)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,   "!(null)",                true,   !(null) );
+new TestCase( SECTION,   "!(var x)",               true,   !(eval("var x")) );
+new TestCase( SECTION,   "!(void 0)",              true,   !(void 0) );
+
+new TestCase( SECTION,   "!(false)",               true,   !(false) );
+new TestCase( SECTION,   "!(true)",                false,  !(true) );
+new TestCase( SECTION,   "!()",                    true,   !(eval()) );
+new TestCase( SECTION,   "!(0)",                   true,   !(0) );
+new TestCase( SECTION,   "!(-0)",                  true,   !(-0) );
+new TestCase( SECTION,   "!(NaN)",                 true,   !(Number.NaN) );
+new TestCase( SECTION,   "!(Infinity)",            false,  !(Number.POSITIVE_INFINITY) );
+new TestCase( SECTION,   "!(-Infinity)",           false,  !(Number.NEGATIVE_INFINITY) );
+new TestCase( SECTION,   "!(Math.PI)",             false,  !(Math.PI) );
+new TestCase( SECTION,   "!(1)",                   false,  !(1) );
+new TestCase( SECTION,   "!(-1)",                  false,  !(-1) );
+new TestCase( SECTION,   "!('')",                  true,   !("") );
+new TestCase( SECTION,   "!('\t')",                false,  !("\t") );
+new TestCase( SECTION,   "!('0')",                 false,  !("0") );
+new TestCase( SECTION,   "!('string')",            false,  !("string") );
+new TestCase( SECTION,   "!(new String(''))",      false,  !(new String("")) );
+new TestCase( SECTION,   "!(new String('string'))",    false,  !(new String("string")) );
+new TestCase( SECTION,   "!(new String())",        false,  !(new String()) );
+new TestCase( SECTION,   "!(new Boolean(true))",   false,   !(new Boolean(true)) );
+new TestCase( SECTION,   "!(new Boolean(false))",  false,   !(new Boolean(false)) );
+new TestCase( SECTION,   "!(new Array())",         false,  !(new Array()) );
+new TestCase( SECTION,   "!(new Array(1,2,3)",     false,  !(new Array(1,2,3)) );
+new TestCase( SECTION,   "!(new Number())",        false,  !(new Number()) );
+new TestCase( SECTION,   "!(new Number(0))",       false,  !(new Number(0)) );
+new TestCase( SECTION,   "!(new Number(NaN))",     false,  !(new Number(Number.NaN)) );
+new TestCase( SECTION,   "!(new Number(Infinity))", false, !(new Number(Number.POSITIVE_INFINITY)) );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.5.1.js b/js/src/tests/ecma/Expressions/11.5.1.js
new file mode 100644
index 000000000..409147f0d
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.5.1.js
@@ -0,0 +1,81 @@
+/* -*- 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:          11.5.1.js
+   ECMA Section:       11.5.1 Applying the * operator
+   Description:
+
+   11.5.1 Applying the * operator
+
+   The * operator performs multiplication, producing the product of its
+   operands. Multiplication is commutative. Multiplication is not always
+   associative in ECMAScript, because of finite precision.
+
+   The result of a floating-point multiplication is governed by the rules
+   of IEEE 754 double-precision arithmetic:
+
+   If either operand is NaN, the result is NaN.
+   The sign of the result is positive if both operands have the same sign,
+   negative if the operands have different signs.
+   Multiplication of an infinity by a zero results in NaN.
+   Multiplication of an infinity by an infinity results in an infinity.
+   The sign is determined by the rule already stated above.
+   Multiplication of an infinity by a finite non-zero value results in a
+   signed infinity. The sign is determined by the rule already stated above.
+   In the remaining cases, where neither an infinity or NaN is involved, the
+   product is computed and rounded to the nearest representable value using IEEE
+   754 round-to-nearest mode. If the magnitude is too large to represent,
+   the result is then an infinity of appropriate sign. If the magnitude is
+   oo small to represent, the result is then a zero
+   of appropriate sign. The ECMAScript language requires support of gradual
+   underflow as defined by IEEE 754.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.5.1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Applying the * operator");
+
+new TestCase( SECTION,    "Number.NaN * Number.NaN",    Number.NaN,     Number.NaN * Number.NaN );
+new TestCase( SECTION,    "Number.NaN * 1",             Number.NaN,     Number.NaN * 1 );
+new TestCase( SECTION,    "1 * Number.NaN",             Number.NaN,     1 * Number.NaN );
+
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY * 0",   Number.NaN, Number.POSITIVE_INFINITY * 0 );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * 0",   Number.NaN, Number.NEGATIVE_INFINITY * 0 );
+new TestCase( SECTION,    "0 * Number.POSITIVE_INFINITY",   Number.NaN, 0 * Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "0 * Number.NEGATIVE_INFINITY",   Number.NaN, 0 * Number.NEGATIVE_INFINITY );
+
+new TestCase( SECTION,    "-0 * Number.POSITIVE_INFINITY",  Number.NaN,   -0 * Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-0 * Number.NEGATIVE_INFINITY",  Number.NaN,   -0 * Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY * -0",  Number.NaN,   Number.POSITIVE_INFINITY * -0 );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * -0",  Number.NaN,   Number.NEGATIVE_INFINITY * -0 );
+
+new TestCase( SECTION,    "0 * -0",                         -0,         0 * -0 );
+new TestCase( SECTION,    "-0 * 0",                         -0,         -0 * 0 );
+new TestCase( SECTION,    "-0 * -0",                        0,          -0 * -0 );
+new TestCase( SECTION,    "0 * 0",                          0,          0 * 0 );
+
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * Number.NEGATIVE_INFINITY",    Number.POSITIVE_INFINITY,   Number.NEGATIVE_INFINITY * Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY * Number.NEGATIVE_INFINITY",    Number.NEGATIVE_INFINITY,   Number.POSITIVE_INFINITY * Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * Number.POSITIVE_INFINITY",    Number.NEGATIVE_INFINITY,   Number.NEGATIVE_INFINITY * Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY * Number.POSITIVE_INFINITY",    Number.POSITIVE_INFINITY,   Number.POSITIVE_INFINITY * Number.POSITIVE_INFINITY );
+
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * 1 ",                          Number.NEGATIVE_INFINITY,   Number.NEGATIVE_INFINITY * 1 );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * -1 ",                         Number.POSITIVE_INFINITY,   Number.NEGATIVE_INFINITY * -1 );
+new TestCase( SECTION,    "1 * Number.NEGATIVE_INFINITY",                           Number.NEGATIVE_INFINITY,   1 * Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "-1 * Number.NEGATIVE_INFINITY",                          Number.POSITIVE_INFINITY,   -1 * Number.NEGATIVE_INFINITY );
+
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY * 1 ",                          Number.POSITIVE_INFINITY,   Number.POSITIVE_INFINITY * 1 );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY * -1 ",                         Number.NEGATIVE_INFINITY,   Number.POSITIVE_INFINITY * -1 );
+new TestCase( SECTION,    "1 * Number.POSITIVE_INFINITY",                           Number.POSITIVE_INFINITY,   1 * Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-1 * Number.POSITIVE_INFINITY",                          Number.NEGATIVE_INFINITY,   -1 * Number.POSITIVE_INFINITY );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.5.2.js b/js/src/tests/ecma/Expressions/11.5.2.js
new file mode 100644
index 000000000..9e5a37f38
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.5.2.js
@@ -0,0 +1,120 @@
+/* -*- 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:          11.5.2.js
+   ECMA Section:       11.5.2 Applying the / operator
+   Description:
+
+   The / operator performs division, producing the quotient of its operands.
+   The left operand is the dividend and the right operand is the divisor.
+   ECMAScript does not perform integer division. The operands and result of all
+   division operations are double-precision floating-point numbers.
+   The result of division is determined by the specification of IEEE 754 arithmetic:
+
+   If either operand is NaN, the result is NaN.
+   The sign of the result is positive if both operands have the same sign, negative if the operands have different
+   signs.
+   Division of an infinity by an infinity results in NaN.
+   Division of an infinity by a zero results in an infinity. The sign is determined by the rule already stated above.
+   Division of an infinity by a non-zero finite value results in a signed infinity. The sign is determined by the rule
+   already stated above.
+   Division of a finite value by an infinity results in zero. The sign is determined by the rule already stated above.
+   Division of a zero by a zero results in NaN; division of zero by any other finite value results in zero, with the sign
+   determined by the rule already stated above.
+   Division of a non-zero finite value by a zero results in a signed infinity. The sign is determined by the rule
+   already stated above.
+   In the remaining cases, where neither an infinity, nor a zero, nor NaN is involved, the quotient is computed and
+   rounded to the nearest representable value using IEEE 754 round-to-nearest mode. If the magnitude is too
+   large to represent, we say the operation overflows; the result is then an infinity of appropriate sign. If the
+   magnitude is too small to represent, we say the operation underflows and the result is a zero of the appropriate
+   sign. The ECMAScript language requires support of gradual underflow as defined by IEEE 754.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.5.2";
+var VERSION = "ECMA_1";
+var BUGNUMBER="111202";
+startTest();
+
+writeHeaderToLog( SECTION + " Applying the / operator");
+
+// if either operand is NaN, the result is NaN.
+
+new TestCase( SECTION,    "Number.NaN / Number.NaN",    Number.NaN,     Number.NaN / Number.NaN );
+new TestCase( SECTION,    "Number.NaN / 1",             Number.NaN,     Number.NaN / 1 );
+new TestCase( SECTION,    "1 / Number.NaN",             Number.NaN,     1 / Number.NaN );
+
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY / Number.NaN",    Number.NaN,     Number.POSITIVE_INFINITY / Number.NaN );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY / Number.NaN",    Number.NaN,     Number.NEGATIVE_INFINITY / Number.NaN );
+
+// Division of an infinity by an infinity results in NaN.
+
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY / Number.NEGATIVE_INFINITY",    Number.NaN,   Number.NEGATIVE_INFINITY / Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY / Number.NEGATIVE_INFINITY",    Number.NaN,   Number.POSITIVE_INFINITY / Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY / Number.POSITIVE_INFINITY",    Number.NaN,   Number.NEGATIVE_INFINITY / Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY / Number.POSITIVE_INFINITY",    Number.NaN,   Number.POSITIVE_INFINITY / Number.POSITIVE_INFINITY );
+
+// Division of an infinity by a zero results in an infinity.
+
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY / 0",   Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY / 0 );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY / 0",   Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY / 0 );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY / -0",  Number.NEGATIVE_INFINITY,   Number.POSITIVE_INFINITY / -0 );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY / -0",  Number.POSITIVE_INFINITY,   Number.NEGATIVE_INFINITY / -0 );
+
+// Division of an infinity by a non-zero finite value results in a signed infinity.
+
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY / 1 ",          Number.NEGATIVE_INFINITY,   Number.NEGATIVE_INFINITY / 1 );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY / -1 ",         Number.POSITIVE_INFINITY,   Number.NEGATIVE_INFINITY / -1 );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY / 1 ",          Number.POSITIVE_INFINITY,   Number.POSITIVE_INFINITY / 1 );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY / -1 ",         Number.NEGATIVE_INFINITY,   Number.POSITIVE_INFINITY / -1 );
+
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY / Number.MAX_VALUE ",          Number.NEGATIVE_INFINITY,   Number.NEGATIVE_INFINITY / Number.MAX_VALUE );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY / -Number.MAX_VALUE ",         Number.POSITIVE_INFINITY,   Number.NEGATIVE_INFINITY / -Number.MAX_VALUE );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY / Number.MAX_VALUE ",          Number.POSITIVE_INFINITY,   Number.POSITIVE_INFINITY / Number.MAX_VALUE );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY / -Number.MAX_VALUE ",         Number.NEGATIVE_INFINITY,   Number.POSITIVE_INFINITY / -Number.MAX_VALUE );
+
+// Division of a finite value by an infinity results in zero.
+
+new TestCase( SECTION,    "1 / Number.NEGATIVE_INFINITY",   -0,             1 / Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "1 / Number.POSITIVE_INFINITY",   0,              1 / Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-1 / Number.POSITIVE_INFINITY",  -0,             -1 / Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-1 / Number.NEGATIVE_INFINITY",  0,              -1 / Number.NEGATIVE_INFINITY );
+
+new TestCase( SECTION,    "Number.MAX_VALUE / Number.NEGATIVE_INFINITY",   -0,             Number.MAX_VALUE / Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "Number.MAX_VALUE / Number.POSITIVE_INFINITY",   0,              Number.MAX_VALUE / Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-Number.MAX_VALUE / Number.POSITIVE_INFINITY",  -0,             -Number.MAX_VALUE / Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-Number.MAX_VALUE / Number.NEGATIVE_INFINITY",  0,              -Number.MAX_VALUE / Number.NEGATIVE_INFINITY );
+
+// Division of a zero by a zero results in NaN
+
+new TestCase( SECTION,    "0 / -0",                         Number.NaN,     0 / -0 );
+new TestCase( SECTION,    "-0 / 0",                         Number.NaN,     -0 / 0 );
+new TestCase( SECTION,    "-0 / -0",                        Number.NaN,     -0 / -0 );
+new TestCase( SECTION,    "0 / 0",                          Number.NaN,     0 / 0 );
+
+// division of zero by any other finite value results in zero
+
+new TestCase( SECTION,    "0 / 1",                          0,              0 / 1 );
+new TestCase( SECTION,    "0 / -1",                        -0,              0 / -1 );
+new TestCase( SECTION,    "-0 / 1",                        -0,              -0 / 1 );
+new TestCase( SECTION,    "-0 / -1",                       0,               -0 / -1 );
+
+// Division of a non-zero finite value by a zero results in a signed infinity.
+
+new TestCase( SECTION,    "1 / 0",                          Number.POSITIVE_INFINITY,   1/0 );
+new TestCase( SECTION,    "1 / -0",                         Number.NEGATIVE_INFINITY,   1/-0 );
+new TestCase( SECTION,    "-1 / 0",                         Number.NEGATIVE_INFINITY,   -1/0 );
+new TestCase( SECTION,    "-1 / -0",                        Number.POSITIVE_INFINITY,   -1/-0 );
+
+new TestCase( SECTION,    "0 / Number.POSITIVE_INFINITY",   0,      0 / Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "0 / Number.NEGATIVE_INFINITY",   -0,     0 / Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "-0 / Number.POSITIVE_INFINITY",  -0,     -0 / Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-0 / Number.NEGATIVE_INFINITY",  0,      -0 / Number.NEGATIVE_INFINITY );
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.5.3.js b/js/src/tests/ecma/Expressions/11.5.3.js
new file mode 100644
index 000000000..1bbf94efd
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.5.3.js
@@ -0,0 +1,127 @@
+/* -*- 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:          11.5.3.js
+   ECMA Section:       11.5.3 Applying the % operator
+   Description:
+
+   The binary % operator is said to yield the remainder of its operands from
+   an implied division; the left operand is the dividend and the right operand
+   is the divisor. In C and C++, the remainder operator accepts only integral
+   operands, but in ECMAScript, it also accepts floating-point operands.
+
+   The result of a floating-point remainder operation as computed by the %
+   operator is not the same as the "remainder" operation defined by IEEE 754.
+   The IEEE 754 "remainder" operation computes the remainder from a rounding
+   division, not a truncating division, and so its behavior is not analogous
+   to that of the usual integer remainder operator. Instead the ECMAScript
+   language defines % on floating-point operations to behave in a manner
+   analogous to that of the Java integer remainder operator; this may be
+   compared with the C library function fmod.
+
+   The result of a ECMAScript floating-point remainder operation is determined by the rules of IEEE arithmetic:
+
+   If either operand is NaN, the result is NaN.
+   The sign of the result equals the sign of the dividend.
+   If the dividend is an infinity, or the divisor is a zero, or both, the result is NaN.
+   If the dividend is finite and the divisor is an infinity, the result equals the dividend.
+   If the dividend is a zero and the divisor is finite, the result is the same as the dividend.
+   In the remaining cases, where neither an infinity, nor a zero, nor NaN is involved, the floating-point remainder r
+   from a dividend n and a divisor d is defined by the mathematical relation r = n (d * q) where q is an integer that
+   is negative only if n/d is negative and positive only if n/d is positive, and whose magnitude is as large as
+   possible without exceeding the magnitude of the true mathematical quotient of n and d.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.5.3";
+var VERSION = "ECMA_1";
+var BUGNUMBER="111202";
+startTest();
+
+
+writeHeaderToLog( SECTION + " Applying the % operator");
+
+// if either operand is NaN, the result is NaN.
+
+new TestCase( SECTION,    "Number.NaN % Number.NaN",    Number.NaN,     Number.NaN % Number.NaN );
+new TestCase( SECTION,    "Number.NaN % 1",             Number.NaN,     Number.NaN % 1 );
+new TestCase( SECTION,    "1 % Number.NaN",             Number.NaN,     1 % Number.NaN );
+
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY % Number.NaN",    Number.NaN,     Number.POSITIVE_INFINITY % Number.NaN );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY % Number.NaN",    Number.NaN,     Number.NEGATIVE_INFINITY % Number.NaN );
+
+//  If the dividend is an infinity, or the divisor is a zero, or both, the result is NaN.
+//  dividend is an infinity
+
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY % Number.NEGATIVE_INFINITY",    Number.NaN,   Number.NEGATIVE_INFINITY % Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY % Number.NEGATIVE_INFINITY",    Number.NaN,   Number.POSITIVE_INFINITY % Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY % Number.POSITIVE_INFINITY",    Number.NaN,   Number.NEGATIVE_INFINITY % Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY % Number.POSITIVE_INFINITY",    Number.NaN,   Number.POSITIVE_INFINITY % Number.POSITIVE_INFINITY );
+
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY % 0",   Number.NaN,     Number.POSITIVE_INFINITY % 0 );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY % 0",   Number.NaN,     Number.NEGATIVE_INFINITY % 0 );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY % -0",  Number.NaN,     Number.POSITIVE_INFINITY % -0 );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY % -0",  Number.NaN,     Number.NEGATIVE_INFINITY % -0 );
+
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY % 1 ",  Number.NaN,     Number.NEGATIVE_INFINITY % 1 );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY % -1 ", Number.NaN,     Number.NEGATIVE_INFINITY % -1 );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY % 1 ",  Number.NaN,     Number.POSITIVE_INFINITY % 1 );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY % -1 ", Number.NaN,     Number.POSITIVE_INFINITY % -1 );
+
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY % Number.MAX_VALUE ",   Number.NaN,   Number.NEGATIVE_INFINITY % Number.MAX_VALUE );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY % -Number.MAX_VALUE ",  Number.NaN,   Number.NEGATIVE_INFINITY % -Number.MAX_VALUE );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY % Number.MAX_VALUE ",   Number.NaN,   Number.POSITIVE_INFINITY % Number.MAX_VALUE );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY % -Number.MAX_VALUE ",  Number.NaN,   Number.POSITIVE_INFINITY % -Number.MAX_VALUE );
+
+// divisor is 0
+new TestCase( SECTION,    "0 % -0",                         Number.NaN,     0 % -0 );
+new TestCase( SECTION,    "-0 % 0",                         Number.NaN,     -0 % 0 );
+new TestCase( SECTION,    "-0 % -0",                        Number.NaN,     -0 % -0 );
+new TestCase( SECTION,    "0 % 0",                          Number.NaN,     0 % 0 );
+
+new TestCase( SECTION,    "1 % 0",                          Number.NaN,   1%0 );
+new TestCase( SECTION,    "1 % -0",                         Number.NaN,   1%-0 );
+new TestCase( SECTION,    "-1 % 0",                         Number.NaN,   -1%0 );
+new TestCase( SECTION,    "-1 % -0",                        Number.NaN,   -1%-0 );
+
+new TestCase( SECTION,    "Number.MAX_VALUE % 0",           Number.NaN,   Number.MAX_VALUE%0 );
+new TestCase( SECTION,    "Number.MAX_VALUE % -0",          Number.NaN,   Number.MAX_VALUE%-0 );
+new TestCase( SECTION,    "-Number.MAX_VALUE % 0",          Number.NaN,   -Number.MAX_VALUE%0 );
+new TestCase( SECTION,    "-Number.MAX_VALUE % -0",         Number.NaN,   -Number.MAX_VALUE%-0 );
+
+// If the dividend is finite and the divisor is an infinity, the result equals the dividend.
+
+new TestCase( SECTION,    "1 % Number.NEGATIVE_INFINITY",   1,              1 % Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "1 % Number.POSITIVE_INFINITY",   1,              1 % Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-1 % Number.POSITIVE_INFINITY",  -1,             -1 % Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-1 % Number.NEGATIVE_INFINITY",  -1,             -1 % Number.NEGATIVE_INFINITY );
+
+new TestCase( SECTION,    "Number.MAX_VALUE % Number.NEGATIVE_INFINITY",   Number.MAX_VALUE,    Number.MAX_VALUE % Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "Number.MAX_VALUE % Number.POSITIVE_INFINITY",   Number.MAX_VALUE,    Number.MAX_VALUE % Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-Number.MAX_VALUE % Number.POSITIVE_INFINITY",  -Number.MAX_VALUE,   -Number.MAX_VALUE % Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-Number.MAX_VALUE % Number.NEGATIVE_INFINITY",  -Number.MAX_VALUE,   -Number.MAX_VALUE % Number.NEGATIVE_INFINITY );
+
+new TestCase( SECTION,    "0 % Number.POSITIVE_INFINITY",   0, 0 % Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "0 % Number.NEGATIVE_INFINITY",   0, 0 % Number.NEGATIVE_INFINITY );
+new TestCase( SECTION,    "-0 % Number.POSITIVE_INFINITY",  -0,   -0 % Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "-0 % Number.NEGATIVE_INFINITY",  -0,   -0 % Number.NEGATIVE_INFINITY );
+
+// If the dividend is a zero and the divisor is finite, the result is the same as the dividend.
+
+new TestCase( SECTION,    "0 % 1",                          0,              0 % 1 );
+new TestCase( SECTION,    "0 % -1",                        -0,              0 % -1 );
+new TestCase( SECTION,    "-0 % 1",                        -0,              -0 % 1 );
+new TestCase( SECTION,    "-0 % -1",                       0,               -0 % -1 );
+
+//        In the remaining cases, where neither an infinity, nor a zero, nor NaN is involved, the floating-point remainder r
+//      from a dividend n and a divisor d is defined by the mathematical relation r = n (d * q) where q is an integer that
+//      is negative only if n/d is negative and positive only if n/d is positive, and whose magnitude is as large as
+//      possible without exceeding the magnitude of the true mathematical quotient of n and d.
+
+test();
+
diff --git a/js/src/tests/ecma/Expressions/11.6.1-1.js b/js/src/tests/ecma/Expressions/11.6.1-1.js
new file mode 100644
index 000000000..40669e532
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.6.1-1.js
@@ -0,0 +1,126 @@
+/* -*- tab-width: 2; 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:          11.6.1-1.js
+   ECMA Section:       11.6.1 The addition operator ( + )
+   Description:
+
+   The addition operator either performs string concatenation or numeric
+   addition.
+
+   The production AdditiveExpression : AdditiveExpression + MultiplicativeExpression
+   is evaluated as follows:
+
+   1.  Evaluate AdditiveExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate MultiplicativeExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToPrimitive(Result(2)).
+   6.  Call ToPrimitive(Result(4)).
+   7.  If Type(Result(5)) is String or Type(Result(6)) is String, go to step 12.
+   (Note that this step differs from step 3 in the algorithm for comparison
+   for the relational operators in using or instead of and.)
+   8.  Call ToNumber(Result(5)).
+   9.  Call ToNumber(Result(6)).
+   10. Apply the addition operation to Result(8) and Result(9). See the discussion below (11.6.3).
+   11. Return Result(10).
+   12. Call ToString(Result(5)).
+   13. Call ToString(Result(6)).
+   14. Concatenate Result(12) followed by Result(13).
+   15. Return Result(14).
+
+   Note that no hint is provided in the calls to ToPrimitive in steps 5 and 6.
+   All native ECMAScript objects except Date objects handle the absence of a
+   hint as if the hint Number were given; Date objects handle the absence of a
+   hint as if the hint String were given. Host objects may handle the absence
+   of a hint in some other manner.
+
+   This test does not cover cases where the Additive or Mulplicative expression
+   ToPrimitive is string.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.6.1-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The Addition operator ( + )");
+
+// tests for boolean primitive, boolean object, Object object, a "MyObject" whose value is
+// a boolean primitive and a boolean object.
+
+new TestCase(   SECTION,
+		"var EXP_1 = true; var EXP_2 = false; EXP_1 + EXP_2",
+		1,
+		eval("var EXP_1 = true; var EXP_2 = false; EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new Boolean(true); var EXP_2 = new Boolean(false); EXP_1 + EXP_2",
+		1,
+		eval("var EXP_1 = new Boolean(true); var EXP_2 = new Boolean(false); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new Object(true); var EXP_2 = new Object(false); EXP_1 + EXP_2",
+		1,
+		eval("var EXP_1 = new Object(true); var EXP_2 = new Object(false); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new Object(new Boolean(true)); var EXP_2 = new Object(new Boolean(false)); EXP_1 + EXP_2",
+		1,
+		eval("var EXP_1 = new Object(new Boolean(true)); var EXP_2 = new Object(new Boolean(false)); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new MyObject(true); var EXP_2 = new MyObject(false); EXP_1 + EXP_2",
+		1,
+		eval("var EXP_1 = new MyObject(true); var EXP_2 = new MyObject(false); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new MyObject(new Boolean(true)); var EXP_2 = new MyObject(new Boolean(false)); EXP_1 + EXP_2",
+		"[object Object][object Object]",
+		eval("var EXP_1 = new MyObject(new Boolean(true)); var EXP_2 = new MyObject(new Boolean(false)); EXP_1 + EXP_2") );
+
+// tests for number primitive, number object, Object object, a "MyObject" whose value is
+// a number primitive and a number object.
+
+new TestCase(   SECTION,
+		"var EXP_1 = 100; var EXP_2 = -1; EXP_1 + EXP_2",
+		99,
+		eval("var EXP_1 = 100; var EXP_2 = -1; EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new Number(100); var EXP_2 = new Number(-1); EXP_1 + EXP_2",
+		99,
+		eval("var EXP_1 = new Number(100); var EXP_2 = new Number(-1); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new Object(100); var EXP_2 = new Object(-1); EXP_1 + EXP_2",
+		99,
+		eval("var EXP_1 = new Object(100); var EXP_2 = new Object(-1); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new Object(new Number(100)); var EXP_2 = new Object(new Number(-1)); EXP_1 + EXP_2",
+		99,
+		eval("var EXP_1 = new Object(new Number(100)); var EXP_2 = new Object(new Number(-1)); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new MyObject(100); var EXP_2 = new MyObject(-1); EXP_1 + EXP_2",
+		99,
+		eval("var EXP_1 = new MyObject(100); var EXP_2 = new MyObject(-1); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new MyObject(new Number(100)); var EXP_2 = new MyObject(new Number(-1)); EXP_1 + EXP_2",
+		"[object Object][object Object]",
+		eval("var EXP_1 = new MyObject(new Number(100)); var EXP_2 = new MyObject(new Number(-1)); EXP_1 + EXP_2") );
+
+
+test();
+
+function MyObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/Expressions/11.6.1-2.js b/js/src/tests/ecma/Expressions/11.6.1-2.js
new file mode 100644
index 000000000..a04256d5f
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.6.1-2.js
@@ -0,0 +1,130 @@
+/* -*- 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:          11.6.1-2.js
+   ECMA Section:       11.6.1 The addition operator ( + )
+   Description:
+
+   The addition operator either performs string concatenation or numeric
+   addition.
+
+   The production AdditiveExpression : AdditiveExpression + MultiplicativeExpression
+   is evaluated as follows:
+
+   1.  Evaluate AdditiveExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate MultiplicativeExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToPrimitive(Result(2)).
+   6.  Call ToPrimitive(Result(4)).
+   7.  If Type(Result(5)) is String or Type(Result(6)) is String, go to step 12.
+   (Note that this step differs from step 3 in the algorithm for comparison
+   for the relational operators in using or instead of and.)
+   8.  Call ToNumber(Result(5)).
+   9.  Call ToNumber(Result(6)).
+   10. Apply the addition operation to Result(8) and Result(9). See the discussion below (11.6.3).
+   11. Return Result(10).
+   12. Call ToString(Result(5)).
+   13. Call ToString(Result(6)).
+   14. Concatenate Result(12) followed by Result(13).
+   15. Return Result(14).
+
+   Note that no hint is provided in the calls to ToPrimitive in steps 5 and 6.
+   All native ECMAScript objects except Date objects handle the absence of a
+   hint as if the hint Number were given; Date objects handle the absence of a
+   hint as if the hint String were given. Host objects may handle the absence
+   of a hint in some other manner.
+
+   This test does only covers cases where the Additive or Mulplicative expression
+   ToPrimitive is a string.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.6.1-2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The Addition operator ( + )");
+
+// tests for boolean primitive, boolean object, Object object, a "MyObject" whose value is
+// a boolean primitive and a boolean object.
+
+new TestCase(   SECTION,
+                "var EXP_1 = 'string'; var EXP_2 = false; EXP_1 + EXP_2",
+                "stringfalse",
+                eval("var EXP_1 = 'string'; var EXP_2 = false; EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = true; var EXP_2 = 'string'; EXP_1 + EXP_2",
+                "truestring",
+                eval("var EXP_1 = true; var EXP_2 = 'string'; EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Boolean(true); var EXP_2 = new String('string'); EXP_1 + EXP_2",
+                "truestring",
+                eval("var EXP_1 = new Boolean(true); var EXP_2 = new String('string'); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Object(true); var EXP_2 = new Object('string'); EXP_1 + EXP_2",
+                "truestring",
+                eval("var EXP_1 = new Object(true); var EXP_2 = new Object('string'); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Object(new String('string')); var EXP_2 = new Object(new Boolean(false)); EXP_1 + EXP_2",
+                "stringfalse",
+                eval("var EXP_1 = new Object(new String('string')); var EXP_2 = new Object(new Boolean(false)); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyObject(true); var EXP_2 = new MyObject('string'); EXP_1 + EXP_2",
+                "truestring",
+                eval("var EXP_1 = new MyObject(true); var EXP_2 = new MyObject('string'); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyObject(new String('string')); var EXP_2 = new MyObject(new Boolean(false)); EXP_1 + EXP_2",
+                "[object Object][object Object]",
+                eval("var EXP_1 = new MyObject(new String('string')); var EXP_2 = new MyObject(new Boolean(false)); EXP_1 + EXP_2") );
+
+// tests for number primitive, number object, Object object, a "MyObject" whose value is
+// a number primitive and a number object.
+
+new TestCase(   SECTION,
+                "var EXP_1 = 100; var EXP_2 = 'string'; EXP_1 + EXP_2",
+                "100string",
+                eval("var EXP_1 = 100; var EXP_2 = 'string'; EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new String('string'); var EXP_2 = new Number(-1); EXP_1 + EXP_2",
+                "string-1",
+                eval("var EXP_1 = new String('string'); var EXP_2 = new Number(-1); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Object(100); var EXP_2 = new Object('string'); EXP_1 + EXP_2",
+                "100string",
+                eval("var EXP_1 = new Object(100); var EXP_2 = new Object('string'); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Object(new String('string')); var EXP_2 = new Object(new Number(-1)); EXP_1 + EXP_2",
+                "string-1",
+                eval("var EXP_1 = new Object(new String('string')); var EXP_2 = new Object(new Number(-1)); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyObject(100); var EXP_2 = new MyObject('string'); EXP_1 + EXP_2",
+                "100string",
+                eval("var EXP_1 = new MyObject(100); var EXP_2 = new MyObject('string'); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyObject(new String('string')); var EXP_2 = new MyObject(new Number(-1)); EXP_1 + EXP_2",
+                "[object Object][object Object]",
+                eval("var EXP_1 = new MyObject(new String('string')); var EXP_2 = new MyObject(new Number(-1)); EXP_1 + EXP_2") );
+
+test();
+
+function MyObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/Expressions/11.6.1-3.js b/js/src/tests/ecma/Expressions/11.6.1-3.js
new file mode 100644
index 000000000..c8d0781e4
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.6.1-3.js
@@ -0,0 +1,116 @@
+/* -*- 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:          11.6.1-3.js
+   ECMA Section:       11.6.1 The addition operator ( + )
+   Description:
+
+   The addition operator either performs string concatenation or numeric
+   addition.
+
+   The production AdditiveExpression : AdditiveExpression + MultiplicativeExpression
+   is evaluated as follows:
+
+   1.  Evaluate AdditiveExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate MultiplicativeExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToPrimitive(Result(2)).
+   6.  Call ToPrimitive(Result(4)).
+   7.  If Type(Result(5)) is String or Type(Result(6)) is String, go to step 12.
+   (Note that this step differs from step 3 in the algorithm for comparison
+   for the relational operators in using or instead of and.)
+   8.  Call ToNumber(Result(5)).
+   9.  Call ToNumber(Result(6)).
+   10. Apply the addition operation to Result(8) and Result(9). See the discussion below (11.6.3).
+   11. Return Result(10).
+   12. Call ToString(Result(5)).
+   13. Call ToString(Result(6)).
+   14. Concatenate Result(12) followed by Result(13).
+   15. Return Result(14).
+
+   Note that no hint is provided in the calls to ToPrimitive in steps 5 and 6.
+   All native ECMAScript objects except Date objects handle the absence of a
+   hint as if the hint Number were given; Date objects handle the absence of a
+   hint as if the hint String were given. Host objects may handle the absence
+   of a hint in some other manner.
+
+   This test does only covers cases where the Additive or Mulplicative expression
+   is a Date.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.6.1-3";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The Addition operator ( + )");
+
+// tests for boolean primitive, boolean object, Object object, a "MyObject" whose value is
+// a boolean primitive and a boolean object.
+
+var DATE1 = new Date();
+
+new TestCase(   SECTION,
+                "var DATE1 = new Date(); DATE1 + DATE1",
+                DATE1.toString() + DATE1.toString(),
+                DATE1 + DATE1 );
+
+new TestCase(   SECTION,
+                "var DATE1 = new Date(); DATE1 + 0",
+                DATE1.toString() + 0,
+                DATE1 + 0 );
+
+new TestCase(   SECTION,
+                "var DATE1 = new Date(); DATE1 + new Number(0)",
+                DATE1.toString() + 0,
+                DATE1 + new Number(0) );
+
+new TestCase(   SECTION,
+                "var DATE1 = new Date(); DATE1 + true",
+                DATE1.toString() + "true",
+                DATE1 + true );
+
+new TestCase(   SECTION,
+                "var DATE1 = new Date(); DATE1 + new Boolean(true)",
+                DATE1.toString() + "true",
+                DATE1 + new Boolean(true) );
+
+new TestCase(   SECTION,
+                "var DATE1 = new Date(); DATE1 + new Boolean(true)",
+                DATE1.toString() + "true",
+                DATE1 + new Boolean(true) );
+
+var MYOB1 = new MyObject( DATE1 );
+
+new TestCase(   SECTION,
+                "MYOB1 = new MyObject(DATE1); MYOB1 + new Number(1)",
+                "[object Object]1",
+                MYOB1 + new Number(1) );
+
+new TestCase(   SECTION,
+                "MYOB1 = new MyObject(DATE1); MYOB1 + 1",
+                "[object Object]1",
+                MYOB1 + 1 );
+
+new TestCase(   SECTION,
+                "MYOB1 = new MyObject(DATE1); MYOB1 + true",
+                "[object Object]true",
+                MYOB1 + true );
+
+test();
+
+function MyPrototypeObject(value) {
+  this.valueOf = new Function( "return this.value;" );
+  this.toString = new Function( "return (this.value + '');" );
+  this.value = value;
+}
+function MyObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/Expressions/11.6.2-1.js b/js/src/tests/ecma/Expressions/11.6.2-1.js
new file mode 100644
index 000000000..97d8ed792
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.6.2-1.js
@@ -0,0 +1,131 @@
+/* -*- 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:          11.6.2-1.js
+   ECMA Section:       11.6.2 The Subtraction operator ( - )
+   Description:
+
+   The production AdditiveExpression : AdditiveExpression -
+   MultiplicativeExpression is evaluated as follows:
+
+   1.  Evaluate AdditiveExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate MultiplicativeExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToNumber(Result(2)).
+   6.  Call ToNumber(Result(4)).
+   7.  Apply the subtraction operation to Result(5) and Result(6). See the
+   discussion below (11.6.3).
+   8.  Return Result(7).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.6.2-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The subtraction operator ( - )");
+
+// tests for boolean primitive, boolean object, Object object, a "MyObject" whose value is
+// a boolean primitive and a boolean object.
+
+new TestCase(   SECTION,
+                "var EXP_1 = true; var EXP_2 = false; EXP_1 - EXP_2",
+                1,
+                eval("var EXP_1 = true; var EXP_2 = false; EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Boolean(true); var EXP_2 = new Boolean(false); EXP_1 - EXP_2",
+                1,
+                eval("var EXP_1 = new Boolean(true); var EXP_2 = new Boolean(false); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Object(true); var EXP_2 = new Object(false); EXP_1 - EXP_2",
+                1,
+                eval("var EXP_1 = new Object(true); var EXP_2 = new Object(false); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Object(new Boolean(true)); var EXP_2 = new Object(new Boolean(false)); EXP_1 - EXP_2",
+                1,
+                eval("var EXP_1 = new Object(new Boolean(true)); var EXP_2 = new Object(new Boolean(false)); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyObject(true); var EXP_2 = new MyObject(false); EXP_1 - EXP_2",
+                1,
+                eval("var EXP_1 = new MyObject(true); var EXP_2 = new MyObject(false); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyObject(new Boolean(true)); var EXP_2 = new MyObject(new Boolean(false)); EXP_1 - EXP_2",
+                Number.NaN,
+                eval("var EXP_1 = new MyObject(new Boolean(true)); var EXP_2 = new MyObject(new Boolean(false)); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyOtherObject(new Boolean(true)); var EXP_2 = new MyOtherObject(new Boolean(false)); EXP_1 - EXP_2",
+                Number.NaN,
+                eval("var EXP_1 = new MyOtherObject(new Boolean(true)); var EXP_2 = new MyOtherObject(new Boolean(false)); EXP_1 - EXP_2") );
+
+// tests for number primitive, number object, Object object, a "MyObject" whose value is
+// a number primitive and a number object.
+
+new TestCase(   SECTION,
+                "var EXP_1 = 100; var EXP_2 = 1; EXP_1 - EXP_2",
+                99,
+                eval("var EXP_1 = 100; var EXP_2 = 1; EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Number(100); var EXP_2 = new Number(1); EXP_1 - EXP_2",
+                99,
+                eval("var EXP_1 = new Number(100); var EXP_2 = new Number(1); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Object(100); var EXP_2 = new Object(1); EXP_1 - EXP_2",
+                99,
+                eval("var EXP_1 = new Object(100); var EXP_2 = new Object(1); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new Object(new Number(100)); var EXP_2 = new Object(new Number(1)); EXP_1 - EXP_2",
+                99,
+                eval("var EXP_1 = new Object(new Number(100)); var EXP_2 = new Object(new Number(1)); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyObject(100); var EXP_2 = new MyObject(1); EXP_1 - EXP_2",
+                99,
+                eval("var EXP_1 = new MyObject(100); var EXP_2 = new MyObject(1); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyObject(new Number(100)); var EXP_2 = new MyObject(new Number(1)); EXP_1 - EXP_2",
+                Number.NaN,
+                eval("var EXP_1 = new MyObject(new Number(100)); var EXP_2 = new MyObject(new Number(1)); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyOtherObject(new Number(100)); var EXP_2 = new MyOtherObject(new Number(1)); EXP_1 - EXP_2",
+                99,
+                eval("var EXP_1 = new MyOtherObject(new Number(100)); var EXP_2 = new MyOtherObject(new Number(1)); EXP_1 - EXP_2") );
+
+// same thing with string!
+new TestCase(   SECTION,
+                "var EXP_1 = new MyOtherObject(new String('0xff')); var EXP_2 = new MyOtherObject(new String('1'); EXP_1 - EXP_2",
+                254,
+                eval("var EXP_1 = new MyOtherObject(new String('0xff')); var EXP_2 = new MyOtherObject(new String('1')); EXP_1 - EXP_2") );
+
+test();
+
+function MyPrototypeObject(value) {
+  this.valueOf = new Function( "return this.value;" );
+  this.toString = new Function( "return (this.value + '');" );
+  this.value = value;
+}
+function MyObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.value = value;
+}
+function MyOtherObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.toString = new Function ( "return this.value + ''" );
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/Expressions/11.6.3.js b/js/src/tests/ecma/Expressions/11.6.3.js
new file mode 100644
index 000000000..b2eb75e6a
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.6.3.js
@@ -0,0 +1,81 @@
+/* -*- 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:          11.6.3.js
+   ECMA Section:       11.6.3 Applying the additive operators
+   (+, -) to numbers
+   Description:
+   The + operator performs addition when applied to two operands of numeric
+   type, producing the sum of the operands. The - operator performs
+   subtraction, producing the difference of two numeric operands.
+
+   Addition is a commutative operation, but not always associative.
+
+   The result of an addition is determined using the rules of IEEE 754
+   double-precision arithmetic:
+
+   If either operand is NaN, the result is NaN.
+   The sum of two infinities of opposite sign is NaN.
+   The sum of two infinities of the same sign is the infinity of that sign.
+   The sum of an infinity and a finite value is equal to the infinite operand.
+   The sum of two negative zeros is 0. The sum of two positive zeros, or of
+   two zeros of opposite sign, is +0.
+   The sum of a zero and a nonzero finite value is equal to the nonzero
+   operand.
+   The sum of two nonzero finite values of the same magnitude and opposite
+   sign is +0.
+   In the remaining cases, where neither an infinity, nor a zero, nor NaN is
+   involved, and the operands have the same sign or have different
+   magnitudes, the sum is computed and rounded to the nearest
+   representable value using IEEE 754 round-to-nearest mode. If the
+   magnitude is too large to represent, the operation overflows and
+   the result is then an infinity of appropriate sign. The ECMAScript
+   language requires support of gradual underflow as defined by IEEE 754.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.6.3";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Applying the additive operators (+,-) to numbers");
+
+new TestCase( SECTION,    "Number.NaN + 1",     Number.NaN,     Number.NaN + 1 );
+new TestCase( SECTION,    "1 + Number.NaN",     Number.NaN,     1 + Number.NaN );
+
+new TestCase( SECTION,    "Number.NaN - 1",     Number.NaN,     Number.NaN - 1 );
+new TestCase( SECTION,    "1 - Number.NaN",     Number.NaN,     1 - Number.NaN );
+
+new TestCase( SECTION,  "Number.POSITIVE_INFINITY + Number.POSITIVE_INFINITY",  Number.POSITIVE_INFINITY,   Number.POSITIVE_INFINITY + Number.POSITIVE_INFINITY);
+new TestCase( SECTION,  "Number.NEGATIVE_INFINITY + Number.NEGATIVE_INFINITY",  Number.NEGATIVE_INFINITY,   Number.NEGATIVE_INFINITY + Number.NEGATIVE_INFINITY);
+
+new TestCase( SECTION,  "Number.POSITIVE_INFINITY + Number.NEGATIVE_INFINITY",  Number.NaN,     Number.POSITIVE_INFINITY + Number.NEGATIVE_INFINITY);
+new TestCase( SECTION,  "Number.NEGATIVE_INFINITY + Number.POSITIVE_INFINITY",  Number.NaN,     Number.NEGATIVE_INFINITY + Number.POSITIVE_INFINITY);
+
+new TestCase( SECTION,  "Number.POSITIVE_INFINITY - Number.POSITIVE_INFINITY",  Number.NaN,   Number.POSITIVE_INFINITY - Number.POSITIVE_INFINITY);
+new TestCase( SECTION,  "Number.NEGATIVE_INFINITY - Number.NEGATIVE_INFINITY",  Number.NaN,   Number.NEGATIVE_INFINITY - Number.NEGATIVE_INFINITY);
+
+new TestCase( SECTION,  "Number.POSITIVE_INFINITY - Number.NEGATIVE_INFINITY",  Number.POSITIVE_INFINITY,   Number.POSITIVE_INFINITY - Number.NEGATIVE_INFINITY);
+new TestCase( SECTION,  "Number.NEGATIVE_INFINITY - Number.POSITIVE_INFINITY",  Number.NEGATIVE_INFINITY,   Number.NEGATIVE_INFINITY - Number.POSITIVE_INFINITY);
+
+new TestCase( SECTION,  "-0 + -0",      -0,     -0 + -0 );
+new TestCase( SECTION,  "-0 - 0",       -0,     -0 - 0 );
+
+new TestCase( SECTION,  "0 + 0",        0,      0 + 0 );
+new TestCase( SECTION,  "0 + -0",       0,      0 + -0 );
+new TestCase( SECTION,  "0 - -0",       0,      0 - -0 );
+new TestCase( SECTION,  "0 - 0",        0,      0 - 0 );
+new TestCase( SECTION,  "-0 - -0",      0,     -0 - -0 );
+new TestCase( SECTION,  "-0 + 0",       0,     -0 + 0 );
+
+new TestCase( SECTION,  "Number.MAX_VALUE - Number.MAX_VALUE",      0,  Number.MAX_VALUE - Number.MAX_VALUE );
+new TestCase( SECTION,  "1/Number.MAX_VALUE - 1/Number.MAX_VALUE",  0,  1/Number.MAX_VALUE - 1/Number.MAX_VALUE );
+
+new TestCase( SECTION,  "Number.MIN_VALUE - Number.MIN_VALUE",      0,  Number.MIN_VALUE - Number.MIN_VALUE );
+
+test();
diff --git a/js/src/tests/ecma/Expressions/11.7.1.js b/js/src/tests/ecma/Expressions/11.7.1.js
new file mode 100644
index 000000000..5c527453c
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.7.1.js
@@ -0,0 +1,194 @@
+/* -*- tab-width: 2; 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:          11.7.1.js
+   ECMA Section:       11.7.1 The Left Shift Operator ( << )
+   Description:
+   Performs a bitwise left shift operation on the left argument by the amount
+   specified by the right argument.
+
+   The production ShiftExpression : ShiftExpression << AdditiveExpression is
+   evaluated as follows:
+
+   1.  Evaluate ShiftExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate AdditiveExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToInt32(Result(2)).
+   6.  Call ToUint32(Result(4)).
+   7.  Mask out all but the least significant 5 bits of Result(6), that is,
+   compute Result(6) & 0x1F.
+   8.  Left shift Result(5) by Result(7) bits. The result is a signed 32 bit
+   integer.
+   9.  Return Result(8).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.7.1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The left shift operator ( << )");
+
+for ( power = 0; power < 33; power++ ) {
+  shiftexp = Math.pow( 2, power );
+
+  for ( addexp = 0; addexp < 33; addexp++ ) {
+    new TestCase( SECTION,
+		  shiftexp + " << " + addexp,
+		  LeftShift( shiftexp, addexp ),
+		  shiftexp << addexp );
+  }
+}
+
+test();
+
+function ToInteger( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( n != n ) {
+    return 0;
+  }
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
+    return n;
+  }
+  return ( sign * Math.floor(Math.abs(n)) );
+}
+function ToInt32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
+  n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
+
+  return ( n );
+}
+function ToUint32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+  n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+  if ( n < 0 ){
+    n += Math.pow(2,32);
+  }
+
+  return ( n );
+}
+function ToUint16( n ) {
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
+
+  if (n <0) {
+    n += Math.pow(2,16);
+  }
+
+  return ( n );
+}
+function Mask( b, n ) {
+  b = ToUint32BitString( b );
+  b = b.substring( b.length - n );
+  b = ToUint32Decimal( b );
+  return ( b );
+}
+function ToUint32BitString( n ) {
+  var b = "";
+  for ( p = 31; p >=0; p-- ) {
+    if ( n >= Math.pow(2,p) ) {
+      b += "1";
+      n -= Math.pow(2,p);
+    } else {
+      b += "0";
+    }
+  }
+  return b;
+}
+function ToInt32BitString( n ) {
+  var b = "";
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  b += ( sign == 1 ) ? "0" : "1";
+
+  for ( p = 30; p >=0; p-- ) {
+    if ( (sign == 1 ) ? sign * n >= Math.pow(2,p) : sign * n > Math.pow(2,p) ) {
+      b += ( sign == 1 ) ? "1" : "0";
+      n -= sign * Math.pow( 2, p );
+    } else {
+      b += ( sign == 1 ) ? "0" : "1";
+    }
+  }
+
+  return b;
+}
+function ToInt32Decimal( bin ) {
+  var r = 0;
+  var sign;
+
+  if ( Number(bin.charAt(0)) == 0 ) {
+    sign = 1;
+    r = 0;
+  } else {
+    sign = -1;
+    r = -(Math.pow(2,31));
+  }
+
+  for ( var j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+  }
+
+  return r;
+}
+function ToUint32Decimal( bin ) {
+  var r = 0;
+
+
+  for ( l = bin.length; l < 32; l++ ) {
+    bin = "0" + bin;
+  }
+
+  for ( j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+
+  }
+
+  return r;
+}
+function LeftShift( s, a ) {
+  var shift = ToInt32( s );
+  var add = ToUint32( a );
+  add = Mask( add, 5 );
+  var exp = LShift( shift, add );
+
+  return ( exp );
+}
+function LShift( s, a ) {
+  s = ToInt32BitString( s );
+
+  for ( var z = 0; z < a; z++ ) {
+    s += "0";
+  }
+
+  s = s.substring( a, s.length);
+
+  return ToInt32(ToInt32Decimal(s));
+}
diff --git a/js/src/tests/ecma/Expressions/11.7.2.js b/js/src/tests/ecma/Expressions/11.7.2.js
new file mode 100644
index 000000000..95cee343b
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.7.2.js
@@ -0,0 +1,212 @@
+/* -*- tab-width: 2; 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:          11.7.2.js
+   ECMA Section:       11.7.2  The signed right shift operator ( >> )
+   Description:
+   Performs a sign-filling bitwise right shift operation on the left argument
+   by the amount specified by the right argument.
+
+   The production ShiftExpression : ShiftExpression >> AdditiveExpression is
+   evaluated as follows:
+
+   1.  Evaluate ShiftExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate AdditiveExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToInt32(Result(2)).
+   6.  Call ToUint32(Result(4)).
+   7.  Mask out all but the least significant 5 bits of Result(6), that is,
+   compute Result(6) & 0x1F.
+   8.  Perform sign-extending right shift of Result(5) by Result(7) bits. The
+   most significant bit is propagated. The result is a signed 32 bit
+   integer.
+   9.  Return Result(8).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.7.2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + "  The signed right shift operator ( >> )");
+
+var power = 0;
+var addexp = 0;
+
+for ( power = 0; power <= 32; power++ ) {
+  shiftexp = Math.pow( 2, power );
+
+  for ( addexp = 0; addexp <= 32; addexp++ ) {
+    new TestCase( SECTION,
+		  shiftexp + " >> " + addexp,
+		  SignedRightShift( shiftexp, addexp ),
+		  shiftexp >> addexp );
+  }
+}
+
+for ( power = 0; power <= 32; power++ ) {
+  shiftexp = -Math.pow( 2, power );
+
+  for ( addexp = 0; addexp <= 32; addexp++ ) {
+    new TestCase( SECTION,
+		  shiftexp + " >> " + addexp,
+		  SignedRightShift( shiftexp, addexp ),
+		  shiftexp >> addexp );
+  }
+}
+
+test();
+
+function ToInteger( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( n != n ) {
+    return 0;
+  }
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
+    return n;
+  }
+  return ( sign * Math.floor(Math.abs(n)) );
+}
+function ToInt32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
+  n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
+
+  return ( n );
+}
+function ToUint32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+  n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+  if ( n < 0 ){
+    n += Math.pow(2,32);
+  }
+
+  return ( n );
+}
+function ToUint16( n ) {
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
+
+  if (n <0) {
+    n += Math.pow(2,16);
+  }
+
+  return ( n );
+}
+function Mask( b, n ) {
+  b = ToUint32BitString( b );
+  b = b.substring( b.length - n );
+  b = ToUint32Decimal( b );
+  return ( b );
+}
+function ToUint32BitString( n ) {
+  var b = "";
+  for ( p = 31; p >=0; p-- ) {
+    if ( n >= Math.pow(2,p) ) {
+      b += "1";
+      n -= Math.pow(2,p);
+    } else {
+      b += "0";
+    }
+  }
+  return b;
+}
+function ToInt32BitString( n ) {
+  var b = "";
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  b += ( sign == 1 ) ? "0" : "1";
+
+  for ( p = 30; p >=0; p-- ) {
+    if ( (sign == 1 ) ? sign * n >= Math.pow(2,p) : sign * n > Math.pow(2,p) ) {
+      b += ( sign == 1 ) ? "1" : "0";
+      n -= sign * Math.pow( 2, p );
+    } else {
+      b += ( sign == 1 ) ? "0" : "1";
+    }
+  }
+
+  return b;
+}
+function ToInt32Decimal( bin ) {
+  var r = 0;
+  var sign;
+
+  if ( Number(bin.charAt(0)) == 0 ) {
+    sign = 1;
+    r = 0;
+  } else {
+    sign = -1;
+    r = -(Math.pow(2,31));
+  }
+
+  for ( var j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+  }
+
+  return r;
+}
+function ToUint32Decimal( bin ) {
+  var r = 0;
+
+  for ( l = bin.length; l < 32; l++ ) {
+    bin = "0" + bin;
+  }
+
+  for ( j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+  }
+
+  return r;
+}
+function SignedRightShift( s, a ) {
+  s = ToInt32( s );
+  a = ToUint32( a );
+  a = Mask( a, 5 );
+  return ( SignedRShift( s, a ) );
+}
+function SignedRShift( s, a ) {
+  s = ToInt32BitString( s );
+
+  var firstbit = s.substring(0,1);
+
+  s = s.substring( 1, s.length );
+
+  for ( var z = 0; z < a; z++ ) {
+    s = firstbit + s;
+  }
+
+  s = s.substring( 0, s.length - a);
+
+  s = firstbit +s;
+
+
+  return ToInt32(ToInt32Decimal(s));
+}
diff --git a/js/src/tests/ecma/Expressions/11.7.3.js b/js/src/tests/ecma/Expressions/11.7.3.js
new file mode 100644
index 000000000..948b54020
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.7.3.js
@@ -0,0 +1,196 @@
+/* -*- 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:          11.7.3.js
+   ECMA Section:       11.7.3  The unsigned right shift operator ( >>> )
+   Description:
+   11.7.3 The unsigned right shift operator ( >>> )
+   Performs a zero-filling bitwise right shift operation on the left argument
+   by the amount specified by the right argument.
+
+   The production ShiftExpression : ShiftExpression >>> AdditiveExpression is
+   evaluated as follows:
+
+   1.  Evaluate ShiftExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate AdditiveExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToUint32(Result(2)).
+   6.  Call ToUint32(Result(4)).
+   7.  Mask out all but the least significant 5 bits of Result(6), that is,
+   compute Result(6) & 0x1F.
+   8.  Perform zero-filling right shift of Result(5) by Result(7) bits.
+   Vacated bits are filled with zero. The result is an unsigned 32 bit
+   integer.
+   9.  Return Result(8).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.7.3";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + "  The unsigned right shift operator ( >>> )");
+
+var addexp = 0;
+var power = 0;
+
+for ( power = 0; power <= 32; power++ ) {
+  shiftexp = Math.pow( 2, power );
+
+  for ( addexp = 0; addexp <= 32; addexp++ ) {
+    new TestCase( SECTION,
+                  shiftexp + " >>> " + addexp,
+                  UnsignedRightShift( shiftexp, addexp ),
+                  shiftexp >>> addexp );
+  }
+}
+
+test();
+
+
+function ToInteger( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( n != n ) {
+    return 0;
+  }
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
+    return n;
+  }
+  return ( sign * Math.floor(Math.abs(n)) );
+}
+function ToInt32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
+  n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
+
+  return ( n );
+}
+function ToUint32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+  n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+  if ( n < 0 ){
+    n += Math.pow(2,32);
+  }
+
+  return ( n );
+}
+function ToUint16( n ) {
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
+
+  if (n <0) {
+    n += Math.pow(2,16);
+  }
+
+  return ( n );
+}
+function Mask( b, n ) {
+  b = ToUint32BitString( b );
+  b = b.substring( b.length - n );
+  b = ToUint32Decimal( b );
+  return ( b );
+}
+function ToUint32BitString( n ) {
+  var b = "";
+  for ( p = 31; p >=0; p-- ) {
+    if ( n >= Math.pow(2,p) ) {
+      b += "1";
+      n -= Math.pow(2,p);
+    } else {
+      b += "0";
+    }
+  }
+  return b;
+}
+function ToInt32BitString( n ) {
+  var b = "";
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  b += ( sign == 1 ) ? "0" : "1";
+
+  for ( p = 30; p >=0; p-- ) {
+    if ( (sign == 1 ) ? sign * n >= Math.pow(2,p) : sign * n > Math.pow(2,p) ) {
+      b += ( sign == 1 ) ? "1" : "0";
+      n -= sign * Math.pow( 2, p );
+    } else {
+      b += ( sign == 1 ) ? "0" : "1";
+    }
+  }
+
+  return b;
+}
+function ToInt32Decimal( bin ) {
+  var r = 0;
+  var sign;
+
+  if ( Number(bin.charAt(0)) == 0 ) {
+    sign = 1;
+    r = 0;
+  } else {
+    sign = -1;
+    r = -(Math.pow(2,31));
+  }
+
+  for ( var j = 0; j < 31; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+  }
+
+  return r;
+}
+function ToUint32Decimal( bin ) {
+  var r = 0;
+
+
+  for ( l = bin.length; l < 32; l++ ) {
+    bin = "0" + bin;
+  }
+
+  for ( j = 0; j < 32; j++ ) {
+    r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+
+  }
+
+  return r;
+}
+function RShift( s, a ) {
+  s = ToUint32BitString( s );
+  for ( z = 0; z < a; z++ ) {
+    s = "0" + s;
+  }
+  s = s.substring( 0, s.length - a );
+
+  return ToUint32Decimal(s);
+}
+function UnsignedRightShift( s, a ) {
+  s = ToUint32( s );
+  a = ToUint32( a );
+  a = Mask( a, 5 );
+  return ( RShift( s, a ) );
+}
diff --git a/js/src/tests/ecma/Expressions/11.8.1.js b/js/src/tests/ecma/Expressions/11.8.1.js
new file mode 100644
index 000000000..2902bf135
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.8.1.js
@@ -0,0 +1,87 @@
+/* -*- 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:          11.8.1.js
+   ECMA Section:       11.8.1  The less-than operator ( < )
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.8.1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The less-than operator ( < )");
+
+new TestCase( SECTION, "true < false",              false,      true < false );
+new TestCase( SECTION, "false < true",              true,       false < true );
+new TestCase( SECTION, "false < false",             false,      false < false );
+new TestCase( SECTION, "true < true",               false,      true < true );
+
+new TestCase( SECTION, "new Boolean(true) < new Boolean(true)",     false,  new Boolean(true) < new Boolean(true) );
+new TestCase( SECTION, "new Boolean(true) < new Boolean(false)",    false,  new Boolean(true) < new Boolean(false) );
+new TestCase( SECTION, "new Boolean(false) < new Boolean(true)",    true,   new Boolean(false) < new Boolean(true) );
+new TestCase( SECTION, "new Boolean(false) < new Boolean(false)",   false,  new Boolean(false) < new Boolean(false) );
+
+new TestCase( SECTION, "new MyObject(Infinity) < new MyObject(Infinity)",   false,  new MyObject( Number.POSITIVE_INFINITY ) < new MyObject( Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "new MyObject(-Infinity) < new MyObject(Infinity)",  true,   new MyObject( Number.NEGATIVE_INFINITY ) < new MyObject( Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "new MyObject(-Infinity) < new MyObject(-Infinity)", false,  new MyObject( Number.NEGATIVE_INFINITY ) < new MyObject( Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, "new MyValueObject(false) < new MyValueObject(true)",  true,   new MyValueObject(false) < new MyValueObject(true) );
+new TestCase( SECTION, "new MyValueObject(true) < new MyValueObject(true)",   false,  new MyValueObject(true) < new MyValueObject(true) );
+new TestCase( SECTION, "new MyValueObject(false) < new MyValueObject(false)", false,  new MyValueObject(false) < new MyValueObject(false) );
+
+new TestCase( SECTION, "new MyStringObject(false) < new MyStringObject(true)",  true,   new MyStringObject(false) < new MyStringObject(true) );
+new TestCase( SECTION, "new MyStringObject(true) < new MyStringObject(true)",   false,  new MyStringObject(true) < new MyStringObject(true) );
+new TestCase( SECTION, "new MyStringObject(false) < new MyStringObject(false)", false,  new MyStringObject(false) < new MyStringObject(false) );
+
+new TestCase( SECTION, "Number.NaN < Number.NaN",   false,     Number.NaN < Number.NaN );
+new TestCase( SECTION, "0 < Number.NaN",            false,     0 < Number.NaN );
+new TestCase( SECTION, "Number.NaN < 0",            false,     Number.NaN < 0 );
+
+new TestCase( SECTION, "0 < -0",                    false,      0 < -0 );
+new TestCase( SECTION, "-0 < 0",                    false,      -0 < 0 );
+
+new TestCase( SECTION, "Infinity < 0",                  false,      Number.POSITIVE_INFINITY < 0 );
+new TestCase( SECTION, "Infinity < Number.MAX_VALUE",   false,      Number.POSITIVE_INFINITY < Number.MAX_VALUE );
+new TestCase( SECTION, "Infinity < Infinity",           false,      Number.POSITIVE_INFINITY < Number.POSITIVE_INFINITY );
+
+new TestCase( SECTION, "0 < Infinity",                  true,       0 < Number.POSITIVE_INFINITY );
+new TestCase( SECTION, "Number.MAX_VALUE < Infinity",   true,       Number.MAX_VALUE < Number.POSITIVE_INFINITY );
+
+new TestCase( SECTION, "0 < -Infinity",                 false,      0 < Number.NEGATIVE_INFINITY );
+new TestCase( SECTION, "Number.MAX_VALUE < -Infinity",  false,      Number.MAX_VALUE < Number.NEGATIVE_INFINITY );
+new TestCase( SECTION, "-Infinity < -Infinity",         false,      Number.NEGATIVE_INFINITY < Number.NEGATIVE_INFINITY );
+
+new TestCase( SECTION, "-Infinity < 0",                 true,       Number.NEGATIVE_INFINITY < 0 );
+new TestCase( SECTION, "-Infinity < -Number.MAX_VALUE", true,       Number.NEGATIVE_INFINITY < -Number.MAX_VALUE );
+new TestCase( SECTION, "-Infinity < Number.MIN_VALUE",  true,       Number.NEGATIVE_INFINITY < Number.MIN_VALUE );
+
+new TestCase( SECTION, "'string' < 'string'",           false,       'string' < 'string' );
+new TestCase( SECTION, "'astring' < 'string'",          true,       'astring' < 'string' );
+new TestCase( SECTION, "'strings' < 'stringy'",         true,       'strings' < 'stringy' );
+new TestCase( SECTION, "'strings' < 'stringier'",       false,       'strings' < 'stringier' );
+new TestCase( SECTION, "'string' < 'astring'",          false,      'string' < 'astring' );
+new TestCase( SECTION, "'string' < 'strings'",          true,       'string' < 'strings' );
+
+test();
+
+function MyObject(value) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+  this.toString = new Function( "return this.value +''" );
+}
+function MyValueObject(value) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+}
+function MyStringObject(value) {
+  this.value = value;
+  this.toString = new Function( "return this.value +''" );
+}
diff --git a/js/src/tests/ecma/Expressions/11.8.2.js b/js/src/tests/ecma/Expressions/11.8.2.js
new file mode 100644
index 000000000..d8a7315c1
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.8.2.js
@@ -0,0 +1,87 @@
+/* -*- 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:          11.8.2.js
+   ECMA Section:       11.8.2  The greater-than operator ( > )
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.8.2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The greater-than operator ( > )");
+
+new TestCase( SECTION, "true > false",              true,      true > false );
+new TestCase( SECTION, "false > true",              false,       false > true );
+new TestCase( SECTION, "false > false",             false,      false > false );
+new TestCase( SECTION, "true > true",               false,      true > true );
+
+new TestCase( SECTION, "new Boolean(true) > new Boolean(true)",     false,  new Boolean(true) > new Boolean(true) );
+new TestCase( SECTION, "new Boolean(true) > new Boolean(false)",    true,  new Boolean(true) > new Boolean(false) );
+new TestCase( SECTION, "new Boolean(false) > new Boolean(true)",    false,   new Boolean(false) > new Boolean(true) );
+new TestCase( SECTION, "new Boolean(false) > new Boolean(false)",   false,  new Boolean(false) > new Boolean(false) );
+
+new TestCase( SECTION, "new MyObject(Infinity) > new MyObject(Infinity)",   false,  new MyObject( Number.POSITIVE_INFINITY ) > new MyObject( Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "new MyObject(-Infinity) > new MyObject(Infinity)",  false,   new MyObject( Number.NEGATIVE_INFINITY ) > new MyObject( Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "new MyObject(-Infinity) > new MyObject(-Infinity)", false,  new MyObject( Number.NEGATIVE_INFINITY ) > new MyObject( Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, "new MyValueObject(false) > new MyValueObject(true)",  false,   new MyValueObject(false) > new MyValueObject(true) );
+new TestCase( SECTION, "new MyValueObject(true) > new MyValueObject(true)",   false,  new MyValueObject(true) > new MyValueObject(true) );
+new TestCase( SECTION, "new MyValueObject(false) > new MyValueObject(false)", false,  new MyValueObject(false) > new MyValueObject(false) );
+
+new TestCase( SECTION, "new MyStringObject(false) > new MyStringObject(true)",  false,   new MyStringObject(false) > new MyStringObject(true) );
+new TestCase( SECTION, "new MyStringObject(true) > new MyStringObject(true)",   false,  new MyStringObject(true) > new MyStringObject(true) );
+new TestCase( SECTION, "new MyStringObject(false) > new MyStringObject(false)", false,  new MyStringObject(false) > new MyStringObject(false) );
+
+new TestCase( SECTION, "Number.NaN > Number.NaN",   false,     Number.NaN > Number.NaN );
+new TestCase( SECTION, "0 > Number.NaN",            false,     0 > Number.NaN );
+new TestCase( SECTION, "Number.NaN > 0",            false,     Number.NaN > 0 );
+
+new TestCase( SECTION, "0 > -0",                    false,      0 > -0 );
+new TestCase( SECTION, "-0 > 0",                    false,      -0 > 0 );
+
+new TestCase( SECTION, "Infinity > 0",                  true,      Number.POSITIVE_INFINITY > 0 );
+new TestCase( SECTION, "Infinity > Number.MAX_VALUE",   true,      Number.POSITIVE_INFINITY > Number.MAX_VALUE );
+new TestCase( SECTION, "Infinity > Infinity",           false,      Number.POSITIVE_INFINITY > Number.POSITIVE_INFINITY );
+
+new TestCase( SECTION, "0 > Infinity",                  false,       0 > Number.POSITIVE_INFINITY );
+new TestCase( SECTION, "Number.MAX_VALUE > Infinity",   false,       Number.MAX_VALUE > Number.POSITIVE_INFINITY );
+
+new TestCase( SECTION, "0 > -Infinity",                 true,      0 > Number.NEGATIVE_INFINITY );
+new TestCase( SECTION, "Number.MAX_VALUE > -Infinity",  true,      Number.MAX_VALUE > Number.NEGATIVE_INFINITY );
+new TestCase( SECTION, "-Infinity > -Infinity",         false,      Number.NEGATIVE_INFINITY > Number.NEGATIVE_INFINITY );
+
+new TestCase( SECTION, "-Infinity > 0",                 false,       Number.NEGATIVE_INFINITY > 0 );
+new TestCase( SECTION, "-Infinity > -Number.MAX_VALUE", false,       Number.NEGATIVE_INFINITY > -Number.MAX_VALUE );
+new TestCase( SECTION, "-Infinity > Number.MIN_VALUE",  false,       Number.NEGATIVE_INFINITY > Number.MIN_VALUE );
+
+new TestCase( SECTION, "'string' > 'string'",           false,       'string' > 'string' );
+new TestCase( SECTION, "'astring' > 'string'",          false,       'astring' > 'string' );
+new TestCase( SECTION, "'strings' > 'stringy'",         false,       'strings' > 'stringy' );
+new TestCase( SECTION, "'strings' > 'stringier'",       true,       'strings' > 'stringier' );
+new TestCase( SECTION, "'string' > 'astring'",          true,      'string' > 'astring' );
+new TestCase( SECTION, "'string' > 'strings'",          false,       'string' > 'strings' );
+
+test();
+
+function MyObject(value) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+  this.toString = new Function( "return this.value +''" );
+}
+function MyValueObject(value) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+}
+function MyStringObject(value) {
+  this.value = value;
+  this.toString = new Function( "return this.value +''" );
+}
diff --git a/js/src/tests/ecma/Expressions/11.8.3.js b/js/src/tests/ecma/Expressions/11.8.3.js
new file mode 100644
index 000000000..324a5d5f4
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.8.3.js
@@ -0,0 +1,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:          11.8.3.js
+   ECMA Section:       11.8.3  The less-than-or-equal operator ( <= )
+   Description:
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.8.1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The less-than-or-equal operator ( <= )");
+
+new TestCase( SECTION, "true <= false",              false,      true <= false );
+new TestCase( SECTION, "false <= true",              true,       false <= true );
+new TestCase( SECTION, "false <= false",             true,      false <= false );
+new TestCase( SECTION, "true <= true",               true,      true <= true );
+
+new TestCase( SECTION, "new Boolean(true) <= new Boolean(true)",     true,  new Boolean(true) <= new Boolean(true) );
+new TestCase( SECTION, "new Boolean(true) <= new Boolean(false)",    false,  new Boolean(true) <= new Boolean(false) );
+new TestCase( SECTION, "new Boolean(false) <= new Boolean(true)",    true,   new Boolean(false) <= new Boolean(true) );
+new TestCase( SECTION, "new Boolean(false) <= new Boolean(false)",   true,  new Boolean(false) <= new Boolean(false) );
+
+new TestCase( SECTION, "new MyObject(Infinity) <= new MyObject(Infinity)",   true,  new MyObject( Number.POSITIVE_INFINITY ) <= new MyObject( Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "new MyObject(-Infinity) <= new MyObject(Infinity)",  true,   new MyObject( Number.NEGATIVE_INFINITY ) <= new MyObject( Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "new MyObject(-Infinity) <= new MyObject(-Infinity)", true,  new MyObject( Number.NEGATIVE_INFINITY ) <= new MyObject( Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, "new MyValueObject(false) <= new MyValueObject(true)",  true,   new MyValueObject(false) <= new MyValueObject(true) );
+new TestCase( SECTION, "new MyValueObject(true) <= new MyValueObject(true)",   true,  new MyValueObject(true) <= new MyValueObject(true) );
+new TestCase( SECTION, "new MyValueObject(false) <= new MyValueObject(false)", true,  new MyValueObject(false) <= new MyValueObject(false) );
+
+new TestCase( SECTION, "new MyStringObject(false) <= new MyStringObject(true)",  true,   new MyStringObject(false) <= new MyStringObject(true) );
+new TestCase( SECTION, "new MyStringObject(true) <= new MyStringObject(true)",   true,  new MyStringObject(true) <= new MyStringObject(true) );
+new TestCase( SECTION, "new MyStringObject(false) <= new MyStringObject(false)", true,  new MyStringObject(false) <= new MyStringObject(false) );
+
+new TestCase( SECTION, "Number.NaN <= Number.NaN",   false,     Number.NaN <= Number.NaN );
+new TestCase( SECTION, "0 <= Number.NaN",            false,     0 <= Number.NaN );
+new TestCase( SECTION, "Number.NaN <= 0",            false,     Number.NaN <= 0 );
+
+new TestCase( SECTION, "0 <= -0",                    true,      0 <= -0 );
+new TestCase( SECTION, "-0 <= 0",                    true,      -0 <= 0 );
+
+new TestCase( SECTION, "Infinity <= 0",                  false,      Number.POSITIVE_INFINITY <= 0 );
+new TestCase( SECTION, "Infinity <= Number.MAX_VALUE",   false,      Number.POSITIVE_INFINITY <= Number.MAX_VALUE );
+new TestCase( SECTION, "Infinity <= Infinity",           true,       Number.POSITIVE_INFINITY <= Number.POSITIVE_INFINITY );
+
+new TestCase( SECTION, "0 <= Infinity",                  true,       0 <= Number.POSITIVE_INFINITY );
+new TestCase( SECTION, "Number.MAX_VALUE <= Infinity",   true,       Number.MAX_VALUE <= Number.POSITIVE_INFINITY );
+
+new TestCase( SECTION, "0 <= -Infinity",                 false,      0 <= Number.NEGATIVE_INFINITY );
+new TestCase( SECTION, "Number.MAX_VALUE <= -Infinity",  false,      Number.MAX_VALUE <= Number.NEGATIVE_INFINITY );
+new TestCase( SECTION, "-Infinity <= -Infinity",         true,       Number.NEGATIVE_INFINITY <= Number.NEGATIVE_INFINITY );
+
+new TestCase( SECTION, "-Infinity <= 0",                 true,       Number.NEGATIVE_INFINITY <= 0 );
+new TestCase( SECTION, "-Infinity <= -Number.MAX_VALUE", true,       Number.NEGATIVE_INFINITY <= -Number.MAX_VALUE );
+new TestCase( SECTION, "-Infinity <= Number.MIN_VALUE",  true,       Number.NEGATIVE_INFINITY <= Number.MIN_VALUE );
+
+new TestCase( SECTION, "'string' <= 'string'",           true,       'string' <= 'string' );
+new TestCase( SECTION, "'astring' <= 'string'",          true,       'astring' <= 'string' );
+new TestCase( SECTION, "'strings' <= 'stringy'",         true,       'strings' <= 'stringy' );
+new TestCase( SECTION, "'strings' <= 'stringier'",       false,       'strings' <= 'stringier' );
+new TestCase( SECTION, "'string' <= 'astring'",          false,      'string' <= 'astring' );
+new TestCase( SECTION, "'string' <= 'strings'",          true,       'string' <= 'strings' );
+
+test();
+
+function MyObject(value) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+  this.toString = new Function( "return this.value +''" );
+}
+function MyValueObject(value) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+}
+function MyStringObject(value) {
+  this.value = value;
+  this.toString = new Function( "return this.value +''" );
+}
diff --git a/js/src/tests/ecma/Expressions/11.8.4.js b/js/src/tests/ecma/Expressions/11.8.4.js
new file mode 100644
index 000000000..19ed1084f
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.8.4.js
@@ -0,0 +1,87 @@
+/* -*- 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:          11.8.4.js
+   ECMA Section:       11.8.4  The greater-than-or-equal operator ( >= )
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.8.4";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The greater-than-or-equal operator ( >= )");
+
+new TestCase( SECTION, "true >= false",              true,      true >= false );
+new TestCase( SECTION, "false >= true",              false,     false >= true );
+new TestCase( SECTION, "false >= false",             true,      false >= false );
+new TestCase( SECTION, "true >= true",               true,      true >= true );
+
+new TestCase( SECTION, "new Boolean(true) >= new Boolean(true)",     true,  new Boolean(true) >= new Boolean(true) );
+new TestCase( SECTION, "new Boolean(true) >= new Boolean(false)",    true,  new Boolean(true) >= new Boolean(false) );
+new TestCase( SECTION, "new Boolean(false) >= new Boolean(true)",    false,   new Boolean(false) >= new Boolean(true) );
+new TestCase( SECTION, "new Boolean(false) >= new Boolean(false)",   true,  new Boolean(false) >= new Boolean(false) );
+
+new TestCase( SECTION, "new MyObject(Infinity) >= new MyObject(Infinity)",   true,  new MyObject( Number.POSITIVE_INFINITY ) >= new MyObject( Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "new MyObject(-Infinity) >= new MyObject(Infinity)",  false,   new MyObject( Number.NEGATIVE_INFINITY ) >= new MyObject( Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "new MyObject(-Infinity) >= new MyObject(-Infinity)", true,  new MyObject( Number.NEGATIVE_INFINITY ) >= new MyObject( Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, "new MyValueObject(false) >= new MyValueObject(true)",  false,   new MyValueObject(false) >= new MyValueObject(true) );
+new TestCase( SECTION, "new MyValueObject(true) >= new MyValueObject(true)",   true,  new MyValueObject(true) >= new MyValueObject(true) );
+new TestCase( SECTION, "new MyValueObject(false) >= new MyValueObject(false)", true,  new MyValueObject(false) >= new MyValueObject(false) );
+
+new TestCase( SECTION, "new MyStringObject(false) >= new MyStringObject(true)",  false,   new MyStringObject(false) >= new MyStringObject(true) );
+new TestCase( SECTION, "new MyStringObject(true) >= new MyStringObject(true)",   true,  new MyStringObject(true) >= new MyStringObject(true) );
+new TestCase( SECTION, "new MyStringObject(false) >= new MyStringObject(false)", true,  new MyStringObject(false) >= new MyStringObject(false) );
+
+new TestCase( SECTION, "Number.NaN >= Number.NaN",   false,     Number.NaN >= Number.NaN );
+new TestCase( SECTION, "0 >= Number.NaN",            false,     0 >= Number.NaN );
+new TestCase( SECTION, "Number.NaN >= 0",            false,     Number.NaN >= 0 );
+
+new TestCase( SECTION, "0 >= -0",                    true,      0 >= -0 );
+new TestCase( SECTION, "-0 >= 0",                    true,      -0 >= 0 );
+
+new TestCase( SECTION, "Infinity >= 0",                  true,      Number.POSITIVE_INFINITY >= 0 );
+new TestCase( SECTION, "Infinity >= Number.MAX_VALUE",   true,      Number.POSITIVE_INFINITY >= Number.MAX_VALUE );
+new TestCase( SECTION, "Infinity >= Infinity",           true,      Number.POSITIVE_INFINITY >= Number.POSITIVE_INFINITY );
+
+new TestCase( SECTION, "0 >= Infinity",                  false,       0 >= Number.POSITIVE_INFINITY );
+new TestCase( SECTION, "Number.MAX_VALUE >= Infinity",   false,       Number.MAX_VALUE >= Number.POSITIVE_INFINITY );
+
+new TestCase( SECTION, "0 >= -Infinity",                 true,      0 >= Number.NEGATIVE_INFINITY );
+new TestCase( SECTION, "Number.MAX_VALUE >= -Infinity",  true,      Number.MAX_VALUE >= Number.NEGATIVE_INFINITY );
+new TestCase( SECTION, "-Infinity >= -Infinity",         true,      Number.NEGATIVE_INFINITY >= Number.NEGATIVE_INFINITY );
+
+new TestCase( SECTION, "-Infinity >= 0",                 false,       Number.NEGATIVE_INFINITY >= 0 );
+new TestCase( SECTION, "-Infinity >= -Number.MAX_VALUE", false,       Number.NEGATIVE_INFINITY >= -Number.MAX_VALUE );
+new TestCase( SECTION, "-Infinity >= Number.MIN_VALUE",  false,       Number.NEGATIVE_INFINITY >= Number.MIN_VALUE );
+
+new TestCase( SECTION, "'string' > 'string'",           false,       'string' > 'string' );
+new TestCase( SECTION, "'astring' > 'string'",          false,       'astring' > 'string' );
+new TestCase( SECTION, "'strings' > 'stringy'",         false,       'strings' > 'stringy' );
+new TestCase( SECTION, "'strings' > 'stringier'",       true,       'strings' > 'stringier' );
+new TestCase( SECTION, "'string' > 'astring'",          true,      'string' > 'astring' );
+new TestCase( SECTION, "'string' > 'strings'",          false,       'string' > 'strings' );
+
+test();
+
+function MyObject(value) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+  this.toString = new Function( "return this.value +''" );
+}
+function MyValueObject(value) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+}
+function MyStringObject(value) {
+  this.value = value;
+  this.toString = new Function( "return this.value +''" );
+}
diff --git a/js/src/tests/ecma/Expressions/11.9.1.js b/js/src/tests/ecma/Expressions/11.9.1.js
new file mode 100644
index 000000000..3d11a0f32
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.9.1.js
@@ -0,0 +1,125 @@
+/* -*- 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:          11.9.1.js
+   ECMA Section:       11.9.1 The equals operator ( == )
+   Description:
+
+   The production EqualityExpression:
+   EqualityExpression ==  RelationalExpression is evaluated as follows:
+
+   1.  Evaluate EqualityExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate RelationalExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Perform the comparison Result(4) == Result(2). (See section 11.9.3)
+   6.  Return Result(5).
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.9.1";
+var VERSION = "ECMA_1";
+var BUGNUMBER="77391";
+startTest();
+
+writeHeaderToLog( SECTION + " The equals operator ( == )");
+
+// type x and type y are the same.  if type x is undefined or null, return true
+
+new TestCase( SECTION,    "void 0 = void 0",        true,   void 0 == void 0 );
+new TestCase( SECTION,    "null == null",           true,   null == null );
+
+//  if x is NaN, return false. if y is NaN, return false.
+
+new TestCase( SECTION,    "NaN == NaN",             false,  Number.NaN == Number.NaN );
+new TestCase( SECTION,    "NaN == 0",               false,  Number.NaN == 0 );
+new TestCase( SECTION,    "0 == NaN",               false,  0 == Number.NaN );
+new TestCase( SECTION,    "NaN == Infinity",        false,  Number.NaN == Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "Infinity == NaN",        false,  Number.POSITIVE_INFINITY == Number.NaN );
+
+// if x is the same number value as y, return true.
+
+new TestCase( SECTION,    "Number.MAX_VALUE == Number.MAX_VALUE",   true,   Number.MAX_VALUE == Number.MAX_VALUE );
+new TestCase( SECTION,    "Number.MIN_VALUE == Number.MIN_VALUE",   true,   Number.MIN_VALUE == Number.MIN_VALUE );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY == Number.POSITIVE_INFINITY",   true,   Number.POSITIVE_INFINITY == Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY == Number.NEGATIVE_INFINITY",   true,   Number.NEGATIVE_INFINITY == Number.NEGATIVE_INFINITY );
+
+//  if xis 0 and y is -0, return true.   if x is -0 and y is 0, return true.
+
+new TestCase( SECTION,    "0 == 0",                 true,   0 == 0 );
+new TestCase( SECTION,    "0 == -0",                true,   0 == -0 );
+new TestCase( SECTION,    "-0 == 0",                true,   -0 == 0 );
+new TestCase( SECTION,    "-0 == -0",               true,   -0 == -0 );
+
+// return false.
+
+new TestCase( SECTION,    "0.9 == 1",               false,  0.9 == 1 );
+new TestCase( SECTION,    "0.999999 == 1",          false,  0.999999 == 1 );
+new TestCase( SECTION,    "0.9999999999 == 1",      false,  0.9999999999 == 1 );
+new TestCase( SECTION,    "0.9999999999999 == 1",   false,  0.9999999999999 == 1 );
+
+// type x and type y are the same type, but not numbers.
+
+
+// x and y are strings.  return true if x and y are exactly the same sequence of characters.
+// otherwise, return false.
+
+new TestCase( SECTION,    "'hello' == 'hello'",         true,   "hello" == "hello" );
+
+// x and y are booleans.  return true if both are true or both are false.
+
+new TestCase( SECTION,    "true == true",               true,   true == true );
+new TestCase( SECTION,    "false == false",             true,   false == false );
+new TestCase( SECTION,    "true == false",              false,  true == false );
+new TestCase( SECTION,    "false == true",              false,  false == true );
+
+// return true if x and y refer to the same object.  otherwise return false.
+
+new TestCase( SECTION,    "new MyObject(true) == new MyObject(true)",   false,  new MyObject(true) == new MyObject(true) );
+new TestCase( SECTION,    "new Boolean(true) == new Boolean(true)",     false,  new Boolean(true) == new Boolean(true) );
+new TestCase( SECTION,    "new Boolean(false) == new Boolean(false)",   false,  new Boolean(false) == new Boolean(false) );
+
+
+new TestCase( SECTION,    "x = new MyObject(true); y = x; z = x; z == y",   true,  eval("x = new MyObject(true); y = x; z = x; z == y") );
+new TestCase( SECTION,    "x = new MyObject(false); y = x; z = x; z == y",  true,  eval("x = new MyObject(false); y = x; z = x; z == y") );
+new TestCase( SECTION,    "x = new Boolean(true); y = x; z = x; z == y",   true,  eval("x = new Boolean(true); y = x; z = x; z == y") );
+new TestCase( SECTION,    "x = new Boolean(false); y = x; z = x; z == y",   true,  eval("x = new Boolean(false); y = x; z = x; z == y") );
+
+new TestCase( SECTION,    "new Boolean(true) == new Boolean(true)",     false,  new Boolean(true) == new Boolean(true) );
+new TestCase( SECTION,    "new Boolean(false) == new Boolean(false)",   false,  new Boolean(false) == new Boolean(false) );
+
+// if x is null and y is undefined, return true.  if x is undefined and y is null return true.
+
+new TestCase( SECTION,    "null == void 0",             true,   null == void 0 );
+new TestCase( SECTION,    "void 0 == null",             true,   void 0 == null );
+
+// if type(x) is Number and type(y) is string, return the result of the comparison x == ToNumber(y).
+
+new TestCase( SECTION,    "1 == '1'",                   true,   1 == '1' );
+new TestCase( SECTION,    "255 == '0xff'",               true,  255 == '0xff' );
+new TestCase( SECTION,    "0 == '\r'",                  true,   0 == "\r" );
+new TestCase( SECTION,    "1e19 == '1e19'",             true,   1e19 == "1e19" );
+
+
+new TestCase( SECTION,    "new Boolean(true) == true",  true,   true == new Boolean(true) );
+new TestCase( SECTION,    "new MyObject(true) == true", true,   true == new MyObject(true) );
+
+new TestCase( SECTION,    "new Boolean(false) == false",    true,   new Boolean(false) == false );
+new TestCase( SECTION,    "new MyObject(false) == false",   true,   new MyObject(false) == false );
+
+new TestCase( SECTION,    "true == new Boolean(true)",      true,   true == new Boolean(true) );
+new TestCase( SECTION,    "true == new MyObject(true)",     true,   true == new MyObject(true) );
+
+new TestCase( SECTION,    "false == new Boolean(false)",    true,   false == new Boolean(false) );
+new TestCase( SECTION,    "false == new MyObject(false)",   true,   false == new MyObject(false) );
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+}
diff --git a/js/src/tests/ecma/Expressions/11.9.2.js b/js/src/tests/ecma/Expressions/11.9.2.js
new file mode 100644
index 000000000..196d7e825
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.9.2.js
@@ -0,0 +1,125 @@
+/* -*- 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:          11.9.2.js
+   ECMA Section:       11.9.2 The equals operator ( == )
+   Description:
+
+   The production EqualityExpression:
+   EqualityExpression ==  RelationalExpression is evaluated as follows:
+
+   1.  Evaluate EqualityExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate RelationalExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Perform the comparison Result(4) == Result(2). (See section 11.9.3)
+   6.  Return Result(5).
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.9.2";
+var VERSION = "ECMA_1";
+var BUGNUMBER="77391";
+startTest();
+
+writeHeaderToLog( SECTION + " The equals operator ( == )");
+
+// type x and type y are the same.  if type x is undefined or null, return true
+
+new TestCase( SECTION,    "void 0 == void 0",        false,   void 0 != void 0 );
+new TestCase( SECTION,    "null == null",           false,   null != null );
+
+//  if x is NaN, return false. if y is NaN, return false.
+
+new TestCase( SECTION,    "NaN != NaN",             true,  Number.NaN != Number.NaN );
+new TestCase( SECTION,    "NaN != 0",               true,  Number.NaN != 0 );
+new TestCase( SECTION,    "0 != NaN",               true,  0 != Number.NaN );
+new TestCase( SECTION,    "NaN != Infinity",        true,  Number.NaN != Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "Infinity != NaN",        true,  Number.POSITIVE_INFINITY != Number.NaN );
+
+// if x is the same number value as y, return true.
+
+new TestCase( SECTION,    "Number.MAX_VALUE != Number.MAX_VALUE",   false,   Number.MAX_VALUE != Number.MAX_VALUE );
+new TestCase( SECTION,    "Number.MIN_VALUE != Number.MIN_VALUE",   false,   Number.MIN_VALUE != Number.MIN_VALUE );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY != Number.POSITIVE_INFINITY",   false,   Number.POSITIVE_INFINITY != Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY != Number.NEGATIVE_INFINITY",   false,   Number.NEGATIVE_INFINITY != Number.NEGATIVE_INFINITY );
+
+//  if xis 0 and y is -0, return true.   if x is -0 and y is 0, return true.
+
+new TestCase( SECTION,    "0 != 0",                 false,   0 != 0 );
+new TestCase( SECTION,    "0 != -0",                false,   0 != -0 );
+new TestCase( SECTION,    "-0 != 0",                false,   -0 != 0 );
+new TestCase( SECTION,    "-0 != -0",               false,   -0 != -0 );
+
+// return false.
+
+new TestCase( SECTION,    "0.9 != 1",               true,  0.9 != 1 );
+new TestCase( SECTION,    "0.999999 != 1",          true,  0.999999 != 1 );
+new TestCase( SECTION,    "0.9999999999 != 1",      true,  0.9999999999 != 1 );
+new TestCase( SECTION,    "0.9999999999999 != 1",   true,  0.9999999999999 != 1 );
+
+// type x and type y are the same type, but not numbers.
+
+
+// x and y are strings.  return true if x and y are exactly the same sequence of characters.
+// otherwise, return false.
+
+new TestCase( SECTION,    "'hello' != 'hello'",         false,   "hello" != "hello" );
+
+// x and y are booleans.  return true if both are true or both are false.
+
+new TestCase( SECTION,    "true != true",               false,   true != true );
+new TestCase( SECTION,    "false != false",             false,   false != false );
+new TestCase( SECTION,    "true != false",              true,  true != false );
+new TestCase( SECTION,    "false != true",              true,  false != true );
+
+// return true if x and y refer to the same object.  otherwise return false.
+
+new TestCase( SECTION,    "new MyObject(true) != new MyObject(true)",   true,  new MyObject(true) != new MyObject(true) );
+new TestCase( SECTION,    "new Boolean(true) != new Boolean(true)",     true,  new Boolean(true) != new Boolean(true) );
+new TestCase( SECTION,    "new Boolean(false) != new Boolean(false)",   true,  new Boolean(false) != new Boolean(false) );
+
+
+new TestCase( SECTION,    "x = new MyObject(true); y = x; z = x; z != y",   false,  eval("x = new MyObject(true); y = x; z = x; z != y") );
+new TestCase( SECTION,    "x = new MyObject(false); y = x; z = x; z != y",  false,  eval("x = new MyObject(false); y = x; z = x; z != y") );
+new TestCase( SECTION,    "x = new Boolean(true); y = x; z = x; z != y",   false,  eval("x = new Boolean(true); y = x; z = x; z != y") );
+new TestCase( SECTION,    "x = new Boolean(false); y = x; z = x; z != y",   false,  eval("x = new Boolean(false); y = x; z = x; z != y") );
+
+new TestCase( SECTION,    "new Boolean(true) != new Boolean(true)",     true,  new Boolean(true) != new Boolean(true) );
+new TestCase( SECTION,    "new Boolean(false) != new Boolean(false)",   true,  new Boolean(false) != new Boolean(false) );
+
+// if x is null and y is undefined, return true.  if x is undefined and y is null return true.
+
+new TestCase( SECTION,    "null != void 0",             false,   null != void 0 );
+new TestCase( SECTION,    "void 0 != null",             false,   void 0 != null );
+
+// if type(x) is Number and type(y) is string, return the result of the comparison x != ToNumber(y).
+
+new TestCase( SECTION,    "1 != '1'",                   false,   1 != '1' );
+new TestCase( SECTION,    "255 != '0xff'",               false,  255 != '0xff' );
+new TestCase( SECTION,    "0 != '\r'",                  false,   0 != "\r" );
+new TestCase( SECTION,    "1e19 != '1e19'",             false,   1e19 != "1e19" );
+
+
+new TestCase( SECTION,    "new Boolean(true) != true",  false,   true != new Boolean(true) );
+new TestCase( SECTION,    "new MyObject(true) != true", false,   true != new MyObject(true) );
+
+new TestCase( SECTION,    "new Boolean(false) != false",    false,   new Boolean(false) != false );
+new TestCase( SECTION,    "new MyObject(false) != false",   false,   new MyObject(false) != false );
+
+new TestCase( SECTION,    "true != new Boolean(true)",      false,   true != new Boolean(true) );
+new TestCase( SECTION,    "true != new MyObject(true)",     false,   true != new MyObject(true) );
+
+new TestCase( SECTION,    "false != new Boolean(false)",    false,   false != new Boolean(false) );
+new TestCase( SECTION,    "false != new MyObject(false)",   false,   false != new MyObject(false) );
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+}
diff --git a/js/src/tests/ecma/Expressions/11.9.3.js b/js/src/tests/ecma/Expressions/11.9.3.js
new file mode 100644
index 000000000..5fa0d35b3
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/11.9.3.js
@@ -0,0 +1,125 @@
+/* -*- 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:          11.9.3.js
+   ECMA Section:       11.9.3 The equals operator ( == )
+   Description:
+
+   The production EqualityExpression:
+   EqualityExpression ==  RelationalExpression is evaluated as follows:
+
+   1.  Evaluate EqualityExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate RelationalExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Perform the comparison Result(4) == Result(2). (See section 11.9.3)
+   6.  Return Result(5).
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.9.3";
+var VERSION = "ECMA_1";
+var BUGNUMBER="77391";
+startTest();
+
+writeHeaderToLog( SECTION + " The equals operator ( == )");
+
+// type x and type y are the same.  if type x is undefined or null, return true
+
+new TestCase( SECTION,    "void 0 = void 0",        true,   void 0 == void 0 );
+new TestCase( SECTION,    "null == null",           true,   null == null );
+
+//  if x is NaN, return false. if y is NaN, return false.
+
+new TestCase( SECTION,    "NaN == NaN",             false,  Number.NaN == Number.NaN );
+new TestCase( SECTION,    "NaN == 0",               false,  Number.NaN == 0 );
+new TestCase( SECTION,    "0 == NaN",               false,  0 == Number.NaN );
+new TestCase( SECTION,    "NaN == Infinity",        false,  Number.NaN == Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "Infinity == NaN",        false,  Number.POSITIVE_INFINITY == Number.NaN );
+
+// if x is the same number value as y, return true.
+
+new TestCase( SECTION,    "Number.MAX_VALUE == Number.MAX_VALUE",   true,   Number.MAX_VALUE == Number.MAX_VALUE );
+new TestCase( SECTION,    "Number.MIN_VALUE == Number.MIN_VALUE",   true,   Number.MIN_VALUE == Number.MIN_VALUE );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY == Number.POSITIVE_INFINITY",   true,   Number.POSITIVE_INFINITY == Number.POSITIVE_INFINITY );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY == Number.NEGATIVE_INFINITY",   true,   Number.NEGATIVE_INFINITY == Number.NEGATIVE_INFINITY );
+
+//  if xis 0 and y is -0, return true.   if x is -0 and y is 0, return true.
+
+new TestCase( SECTION,    "0 == 0",                 true,   0 == 0 );
+new TestCase( SECTION,    "0 == -0",                true,   0 == -0 );
+new TestCase( SECTION,    "-0 == 0",                true,   -0 == 0 );
+new TestCase( SECTION,    "-0 == -0",               true,   -0 == -0 );
+
+// return false.
+
+new TestCase( SECTION,    "0.9 == 1",               false,  0.9 == 1 );
+new TestCase( SECTION,    "0.999999 == 1",          false,  0.999999 == 1 );
+new TestCase( SECTION,    "0.9999999999 == 1",      false,  0.9999999999 == 1 );
+new TestCase( SECTION,    "0.9999999999999 == 1",   false,  0.9999999999999 == 1 );
+
+// type x and type y are the same type, but not numbers.
+
+
+// x and y are strings.  return true if x and y are exactly the same sequence of characters.
+// otherwise, return false.
+
+new TestCase( SECTION,    "'hello' == 'hello'",         true,   "hello" == "hello" );
+
+// x and y are booleans.  return true if both are true or both are false.
+
+new TestCase( SECTION,    "true == true",               true,   true == true );
+new TestCase( SECTION,    "false == false",             true,   false == false );
+new TestCase( SECTION,    "true == false",              false,  true == false );
+new TestCase( SECTION,    "false == true",              false,  false == true );
+
+// return true if x and y refer to the same object.  otherwise return false.
+
+new TestCase( SECTION,    "new MyObject(true) == new MyObject(true)",   false,  new MyObject(true) == new MyObject(true) );
+new TestCase( SECTION,    "new Boolean(true) == new Boolean(true)",     false,  new Boolean(true) == new Boolean(true) );
+new TestCase( SECTION,    "new Boolean(false) == new Boolean(false)",   false,  new Boolean(false) == new Boolean(false) );
+
+
+new TestCase( SECTION,    "x = new MyObject(true); y = x; z = x; z == y",   true,  eval("x = new MyObject(true); y = x; z = x; z == y") );
+new TestCase( SECTION,    "x = new MyObject(false); y = x; z = x; z == y",  true,  eval("x = new MyObject(false); y = x; z = x; z == y") );
+new TestCase( SECTION,    "x = new Boolean(true); y = x; z = x; z == y",   true,  eval("x = new Boolean(true); y = x; z = x; z == y") );
+new TestCase( SECTION,    "x = new Boolean(false); y = x; z = x; z == y",   true,  eval("x = new Boolean(false); y = x; z = x; z == y") );
+
+new TestCase( SECTION,    "new Boolean(true) == new Boolean(true)",     false,  new Boolean(true) == new Boolean(true) );
+new TestCase( SECTION,    "new Boolean(false) == new Boolean(false)",   false,  new Boolean(false) == new Boolean(false) );
+
+// if x is null and y is undefined, return true.  if x is undefined and y is null return true.
+
+new TestCase( SECTION,    "null == void 0",             true,   null == void 0 );
+new TestCase( SECTION,    "void 0 == null",             true,   void 0 == null );
+
+// if type(x) is Number and type(y) is string, return the result of the comparison x == ToNumber(y).
+
+new TestCase( SECTION,    "1 == '1'",                   true,   1 == '1' );
+new TestCase( SECTION,    "255 == '0xff'",               true,  255 == '0xff' );
+new TestCase( SECTION,    "0 == '\r'",                  true,   0 == "\r" );
+new TestCase( SECTION,    "1e19 == '1e19'",             true,   1e19 == "1e19" );
+
+
+new TestCase( SECTION,    "new Boolean(true) == true",  true,   true == new Boolean(true) );
+new TestCase( SECTION,    "new MyObject(true) == true", true,   true == new MyObject(true) );
+
+new TestCase( SECTION,    "new Boolean(false) == false",    true,   new Boolean(false) == false );
+new TestCase( SECTION,    "new MyObject(false) == false",   true,   new MyObject(false) == false );
+
+new TestCase( SECTION,    "true == new Boolean(true)",      true,   true == new Boolean(true) );
+new TestCase( SECTION,    "true == new MyObject(true)",     true,   true == new MyObject(true) );
+
+new TestCase( SECTION,    "false == new Boolean(false)",    true,   false == new Boolean(false) );
+new TestCase( SECTION,    "false == new MyObject(false)",   true,   false == new MyObject(false) );
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+}
diff --git a/js/src/tests/ecma/Expressions/browser.js b/js/src/tests/ecma/Expressions/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/browser.js
diff --git a/js/src/tests/ecma/Expressions/shell.js b/js/src/tests/ecma/Expressions/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Expressions/shell.js
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.1.1-1.js b/js/src/tests/ecma/FunctionObjects/15.3.1.1-1.js
new file mode 100644
index 000000000..62d66cbc9
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.1.1-1.js
@@ -0,0 +1,102 @@
+/* -*- tab-width: 2; 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:          15.3.1.1.js
+   ECMA Section:       15.3.1.1 The Function Constructor Called as a Function
+
+   Description:
+   When the Function function is called with some arguments p1, p2, . . . , pn, body
+   (where n might be 0, that is, there are no "p" arguments, and where body might
+   also not be provided), the following steps are taken:
+
+   1.  Create and return a new Function object exactly if the function constructor had
+   been called with the same arguments (15.3.2.1).
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.1.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Function Constructor Called as a Function";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var MyObject = Function( "value", "this.value = value; this.valueOf =  Function( 'return this.value' ); this.toString =  Function( 'return String(this.value);' )" );
+
+
+var myfunc = Function();
+myfunc.toString = Object.prototype.toString;
+
+//    not going to test toString here since it is implementation dependent.
+//    new TestCase( SECTION,  "myfunc.toString()",     "function anonymous() { }",    myfunc.toString() );
+
+myfunc.toString = Object.prototype.toString;
+new TestCase(   SECTION,
+		"myfunc = Function(); myfunc.toString = Object.prototype.toString; myfunc.toString()",
+		"[object Function]",
+		myfunc.toString() );
+
+new TestCase( SECTION, 
+	      "myfunc.length",                           
+	      0,                     
+	      myfunc.length );
+
+new TestCase( SECTION, 
+	      "myfunc.prototype.toString()",             
+	      "[object Object]",     
+	      myfunc.prototype.toString() );
+
+new TestCase( SECTION, 
+	      "myfunc.prototype.constructor",            
+	      myfunc,                
+	      myfunc.prototype.constructor );
+
+new TestCase( SECTION, 
+	      "myfunc.arguments",                        
+	      null,                  
+	      myfunc.arguments );
+
+new TestCase( SECTION, 
+	      "var OBJ = new MyObject(true); OBJ.valueOf()",   
+	      true,            
+	      eval("var OBJ = new MyObject(true); OBJ.valueOf()") );
+
+new TestCase( SECTION, 
+	      "OBJ.toString()",                          
+	      "true",                
+	      OBJ.toString() );
+
+new TestCase( SECTION, 
+	      "OBJ.toString = Object.prototype.toString; OBJ.toString()",
+	      "[object Object]", 
+	      eval("OBJ.toString = Object.prototype.toString; OBJ.toString()") );
+
+new TestCase( SECTION, 
+	      "MyObject.toString = Object.prototype.toString; MyObject.toString()",   
+	      "[object Function]",  
+	      eval("MyObject.toString = Object.prototype.toString; MyObject.toString()") );
+
+new TestCase( SECTION, 
+	      "MyObject.length",                             
+	      1,     
+	      MyObject.length );
+
+new TestCase( SECTION, 
+	      "MyObject.prototype.constructor",              
+	      MyObject,  
+	      MyObject.prototype.constructor );
+
+new TestCase( SECTION, 
+	      "MyObject.arguments",                          
+	      null,  
+	      MyObject.arguments );
+   
+test();
+
+
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.1.1-2.js b/js/src/tests/ecma/FunctionObjects/15.3.1.1-2.js
new file mode 100644
index 000000000..1cea3c1cc
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.1.1-2.js
@@ -0,0 +1,149 @@
+/* -*- tab-width: 2; 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:          15.3.1.1-2.js
+   ECMA Section:       15.3.1.1 The Function Constructor Called as a Function
+   Function(p1, p2, ..., pn, body )
+
+   Description:
+   When the Function function is called with some arguments p1, p2, . . . , pn,
+   body (where n might be 0, that is, there are no "p" arguments, and where body
+   might also not be provided), the following steps are taken:
+
+   1.  Create and return a new Function object exactly if the function constructor
+   had been called with the same arguments (15.3.2.1).
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.1.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Function Constructor Called as a Function";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var myfunc1 =  Function("a","b","c", "return a+b+c" );
+var myfunc2 =  Function("a, b, c",   "return a+b+c" );
+var myfunc3 =  Function("a,b", "c",  "return a+b+c" );
+
+myfunc1.toString = Object.prototype.toString;
+myfunc2.toString = Object.prototype.toString;
+myfunc3.toString = Object.prototype.toString;
+
+new TestCase( SECTION, 
+	      "myfunc1 =  Function('a','b','c'); myfunc.toString = Object.prototype.toString; myfunc.toString()",
+	      "[object Function]",
+	      myfunc1.toString() );
+
+new TestCase( SECTION, 
+	      "myfunc1.length",                           
+	      3,                     
+	      myfunc1.length );
+
+new TestCase( SECTION, 
+	      "myfunc1.prototype.toString()",             
+	      "[object Object]",     
+	      myfunc1.prototype.toString() );
+
+new TestCase( SECTION, 
+	      "myfunc1.prototype.constructor",            
+	      myfunc1,               
+	      myfunc1.prototype.constructor );
+
+new TestCase( SECTION, 
+	      "myfunc1.arguments",                        
+	      null,                  
+	      myfunc1.arguments );
+
+new TestCase( SECTION, 
+	      "myfunc1(1,2,3)",                           
+	      6,                     
+	      myfunc1(1,2,3) );
+
+new TestCase( SECTION, 
+	      "var MYPROPS = ''; for ( var p in myfunc1.prototype ) { MYPROPS += p; }; MYPROPS",
+	      "",
+	      eval("var MYPROPS = ''; for ( var p in myfunc1.prototype ) { MYPROPS += p; }; MYPROPS") );
+
+new TestCase( SECTION, 
+	      "myfunc2 =  Function('a','b','c'); myfunc.toString = Object.prototype.toString; myfunc.toString()",
+	      "[object Function]",
+	      myfunc2.toString() );
+
+new TestCase( SECTION, 
+	      "myfunc2.length",                           
+	      3,                     
+	      myfunc2.length );
+
+new TestCase( SECTION, 
+	      "myfunc2.prototype.toString()",             
+	      "[object Object]",     
+	      myfunc2.prototype.toString() );
+
+new TestCase( SECTION, 
+	      "myfunc2.prototype.constructor",            
+	      myfunc2,                
+	      myfunc2.prototype.constructor );
+
+new TestCase( SECTION, 
+	      "myfunc2.arguments",                        
+	      null,                  
+	      myfunc2.arguments );
+
+new TestCase( SECTION, 
+	      "myfunc2( 1000, 200, 30 )",                
+	      1230,                   
+	      myfunc2(1000,200,30) );
+
+new TestCase( SECTION, 
+	      "var MYPROPS = ''; for ( var p in myfunc2.prototype ) { MYPROPS += p; }; MYPROPS",
+	      "",
+	      eval("var MYPROPS = ''; for ( var p in myfunc2.prototype ) { MYPROPS += p; }; MYPROPS") );
+
+new TestCase( SECTION, 
+	      "myfunc3 =  Function('a','b','c'); myfunc.toString = Object.prototype.toString; myfunc.toString()",
+	      "[object Function]",
+	      myfunc3.toString() );
+
+new TestCase( SECTION, 
+	      "myfunc3.length",                           
+	      3,                     
+	      myfunc3.length );
+
+new TestCase( SECTION, 
+	      "myfunc3.prototype.toString()",             
+	      "[object Object]",     
+	      myfunc3.prototype.toString() );
+
+new TestCase( SECTION, 
+	      "myfunc3.prototype.valueOf() +''",          
+	      "[object Object]",     
+	      myfunc3.prototype.valueOf() +'' );
+
+new TestCase( SECTION, 
+	      "myfunc3.prototype.constructor",            
+	      myfunc3,                
+	      myfunc3.prototype.constructor );
+
+new TestCase( SECTION, 
+	      "myfunc3.arguments",                        
+	      null,                  
+	      myfunc3.arguments );
+
+new TestCase( SECTION, 
+	      "myfunc3(-100,100,NaN)",                   
+	      Number.NaN,             
+	      myfunc3(-100,100,NaN) );
+
+new TestCase( SECTION, 
+	      "var MYPROPS = ''; for ( var p in myfunc3.prototype ) { MYPROPS += p; }; MYPROPS",
+	      "",
+	      eval("var MYPROPS = ''; for ( var p in myfunc3.prototype ) { MYPROPS += p; }; MYPROPS") );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.1.1-3.js b/js/src/tests/ecma/FunctionObjects/15.3.1.1-3.js
new file mode 100644
index 000000000..7c3e2b006
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.1.1-3.js
@@ -0,0 +1,65 @@
+/* -*- 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:          15.3.1.1-3.js
+   ECMA Section:       15.3.1.1 The Function Constructor Called as a Function
+
+   new Function(p1, p2, ..., pn, body )
+
+   Description:        The last argument specifies the body (executable code)
+   of a function; any preceding arguments sepcify formal
+   parameters.
+
+   See the text for description of this section.
+
+   This test examples from the specification.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.1.1-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Function Constructor Called as a Function";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var args = "";
+
+for ( var i = 0; i < 2000; i++ ) {
+  args += "arg"+i;
+  if ( i != 1999 ) {
+    args += ",";
+  }
+}
+
+var s = "";
+
+for ( var i = 0; i < 2000; i++ ) {
+  s += ".0005";
+  if ( i != 1999 ) {
+    s += ",";
+  }
+}
+
+MyFunc = Function( args, "var r=0; for (var i = 0; i < MyFunc.length; i++ ) { if ( eval('arg'+i) == void 0) break; else r += eval('arg'+i); }; return r");
+MyObject = Function( args, "for (var i = 0; i < MyFunc.length; i++ ) { if ( eval('arg'+i) == void 0) break; eval('this.arg'+i +'=arg'+i); };");
+
+var MY_OB = eval( "MyFunc("+ s +")" );
+
+new TestCase( SECTION, "MyFunc.length",                       2000,         MyFunc.length );
+new TestCase( SECTION, "var MY_OB = eval('MyFunc(s)')",       1,            MY_OB );
+new TestCase( SECTION, "var MY_OB = eval('MyFunc(s)')",       1,            eval("var MY_OB = MyFunc("+s+"); MY_OB") );
+
+new TestCase( SECTION, "MyObject.length",                       2000,         MyObject.length );
+
+new TestCase( SECTION, "FUN1 = Function( 'a','b','c', 'return FUN1.length' ); FUN1.length",     3, eval("FUN1 = Function( 'a','b','c', 'return FUN1.length' ); FUN1.length") );
+new TestCase( SECTION, "FUN1 = Function( 'a','b','c', 'return FUN1.length' ); FUN1()",          3, eval("FUN1 = Function( 'a','b','c', 'return FUN1.length' ); FUN1()") );
+new TestCase( SECTION, "FUN1 = Function( 'a','b','c', 'return FUN1.length' ); FUN1(1,2,3,4,5)", 3, eval("FUN1 = Function( 'a','b','c', 'return FUN1.length' ); FUN1(1,2,3,4,5)") );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.2.1-1.js b/js/src/tests/ecma/FunctionObjects/15.3.2.1-1.js
new file mode 100644
index 000000000..2f3334fd8
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.2.1-1.js
@@ -0,0 +1,98 @@
+/* -*- tab-width: 2; 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:          15.3.2.1.js
+   ECMA Section:       15.3.2.1 The Function Constructor
+   new Function(p1, p2, ..., pn, body )
+
+   Description:        The last argument specifies the body (executable code)
+   of a function; any preceding arguments sepcify formal
+   parameters.
+
+   See the text for description of this section.
+
+   This test examples from the specification.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.2.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Function Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var MyObject = new Function( "value", "this.value = value; this.valueOf = new Function( 'return this.value' ); this.toString = new Function( 'return String(this.value);' )" );
+
+var myfunc = new Function();
+
+//    not going to test toString here since it is implementation dependent.
+//    new TestCase( SECTION,  "myfunc.toString()",     "function anonymous() { }",    myfunc.toString() );
+
+myfunc.toString = Object.prototype.toString;
+
+new TestCase( SECTION,  "myfunc = new Function(); myfunc.toString = Object.prototype.toString; myfunc.toString()",
+	      "[object Function]",
+	      myfunc.toString() );
+
+new TestCase( SECTION, 
+	      "myfunc.length",                           
+	      0,                     
+	      myfunc.length );
+
+new TestCase( SECTION,
+	      "myfunc.prototype.toString()",
+	      "[object Object]", 
+	      myfunc.prototype.toString() );
+
+new TestCase( SECTION,
+	      "myfunc.prototype.constructor",   
+	      myfunc,   
+	      myfunc.prototype.constructor );
+
+new TestCase( SECTION,
+	      "myfunc.arguments",  
+	      null,  
+	      myfunc.arguments );
+
+new TestCase( SECTION,
+	      "var OBJ = new MyObject(true); OBJ.valueOf()",
+	      true, 
+	      eval("var OBJ = new MyObject(true); OBJ.valueOf()") );
+
+new TestCase( SECTION,
+	      "OBJ.toString()",  
+	      "true", 
+	      OBJ.toString() );
+
+new TestCase( SECTION,
+	      "OBJ.toString = Object.prototype.toString; OBJ.toString()", "[object Object]",
+	      eval("OBJ.toString = Object.prototype.toString; OBJ.toString()") );
+
+new TestCase( SECTION, 
+	      "MyObject.toString = Object.prototype.toString; MyObject.toString()",
+	      "[object Function]", 
+	      eval("MyObject.toString = Object.prototype.toString; MyObject.toString()") );
+
+new TestCase( SECTION,
+	      "MyObject.length", 
+	      1,
+	      MyObject.length );
+
+new TestCase( SECTION,
+	      "MyObject.prototype.constructor",
+              MyObject,
+	      MyObject.prototype.constructor );
+
+new TestCase( SECTION,
+	      "MyObject.arguments",  
+	      null, 
+	      MyObject.arguments );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.2.1-2.js b/js/src/tests/ecma/FunctionObjects/15.3.2.1-2.js
new file mode 100644
index 000000000..7740480ab
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.2.1-2.js
@@ -0,0 +1,73 @@
+/* -*- tab-width: 2; 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:          15.3.2.1.js
+   ECMA Section:       15.3.2.1 The Function Constructor
+   new Function(p1, p2, ..., pn, body )
+
+   Description:
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.2.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Function Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var myfunc1 = new Function("a","b","c", "return a+b+c" );
+var myfunc2 = new Function("a, b, c",   "return a+b+c" );
+var myfunc3 = new Function("a,b", "c",  "return a+b+c" );
+
+myfunc1.toString = Object.prototype.toString;
+myfunc2.toString = Object.prototype.toString;
+myfunc3.toString = Object.prototype.toString;
+
+new TestCase( SECTION,  "myfunc1 = new Function('a','b','c'); myfunc.toString = Object.prototype.toString; myfunc.toString()",
+	      "[object Function]",
+	      myfunc1.toString() );
+
+new TestCase( SECTION,  "myfunc1.length",                            3,                      myfunc1.length );
+new TestCase( SECTION,  "myfunc1.prototype.toString()",              "[object Object]",      myfunc1.prototype.toString() );
+
+new TestCase( SECTION,  "myfunc1.prototype.constructor",             myfunc1,                myfunc1.prototype.constructor );
+new TestCase( SECTION,  "myfunc1.arguments",                         null,                   myfunc1.arguments );
+new TestCase( SECTION,  "myfunc1(1,2,3)",                            6,                      myfunc1(1,2,3) );
+new TestCase( SECTION,  "var MYPROPS = ''; for ( var p in myfunc1.prototype ) { MYPROPS += p; }; MYPROPS",
+	      "",
+	      eval("var MYPROPS = ''; for ( var p in myfunc1.prototype ) { MYPROPS += p; }; MYPROPS") );
+
+new TestCase( SECTION,  "myfunc2 = new Function('a','b','c'); myfunc.toString = Object.prototype.toString; myfunc.toString()",
+	      "[object Function]",
+	      myfunc2.toString() );
+new TestCase( SECTION,  "myfunc2.length",                            3,                      myfunc2.length );
+new TestCase( SECTION,  "myfunc2.prototype.toString()",              "[object Object]",      myfunc2.prototype.toString() );
+
+new TestCase( SECTION,  "myfunc2.prototype.constructor",             myfunc2,                 myfunc2.prototype.constructor );
+new TestCase( SECTION,  "myfunc2.arguments",                         null,                   myfunc2.arguments );
+new TestCase( SECTION,  "myfunc2( 1000, 200, 30 )",                 1230,                    myfunc2(1000,200,30) );
+new TestCase( SECTION,  "var MYPROPS = ''; for ( var p in myfunc2.prototype ) { MYPROPS += p; }; MYPROPS",
+	      "",
+	      eval("var MYPROPS = ''; for ( var p in myfunc2.prototype ) { MYPROPS += p; }; MYPROPS") );
+
+new TestCase( SECTION,  "myfunc3 = new Function('a','b','c'); myfunc.toString = Object.prototype.toString; myfunc.toString()",
+	      "[object Function]",
+	      myfunc3.toString() );
+new TestCase( SECTION,  "myfunc3.length",                            3,                      myfunc3.length );
+new TestCase( SECTION,  "myfunc3.prototype.toString()",              "[object Object]",      myfunc3.prototype.toString() );
+new TestCase( SECTION,  "myfunc3.prototype.valueOf() +''",           "[object Object]",      myfunc3.prototype.valueOf() +'' );
+new TestCase( SECTION,  "myfunc3.prototype.constructor",             myfunc3,                 myfunc3.prototype.constructor );
+new TestCase( SECTION,  "myfunc3.arguments",                         null,                   myfunc3.arguments );
+new TestCase( SECTION,  "myfunc3(-100,100,NaN)",                    Number.NaN,              myfunc3(-100,100,NaN) );
+
+new TestCase( SECTION,  "var MYPROPS = ''; for ( var p in myfunc3.prototype ) { MYPROPS += p; }; MYPROPS",
+	      "",
+	      eval("var MYPROPS = ''; for ( var p in myfunc3.prototype ) { MYPROPS += p; }; MYPROPS") );
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.2.1-3.js b/js/src/tests/ecma/FunctionObjects/15.3.2.1-3.js
new file mode 100644
index 000000000..36860057d
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.2.1-3.js
@@ -0,0 +1,61 @@
+/* -*- 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:          15.3.2.1-3.js
+   ECMA Section:       15.3.2.1 The Function Constructor
+   new Function(p1, p2, ..., pn, body )
+
+   Description:        The last argument specifies the body (executable code)
+   of a function; any preceding arguments sepcify formal
+   parameters.
+
+   See the text for description of this section.
+
+   This test examples from the specification.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.2.1-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Function Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var args = "";
+
+for ( var i = 0; i < 2000; i++ ) {
+  args += "arg"+i;
+  if ( i != 1999 ) {
+    args += ",";
+  }
+}
+
+var s = "";
+
+for ( var i = 0; i < 2000; i++ ) {
+  s += ".0005";
+  if ( i != 1999 ) {
+    s += ",";
+  }
+}
+
+MyFunc = new Function( args, "var r=0; for (var i = 0; i < MyFunc.length; i++ ) { if ( eval('arg'+i) == void 0) break; else r += eval('arg'+i); }; return r");
+MyObject = new Function( args, "for (var i = 0; i < MyFunc.length; i++ ) { if ( eval('arg'+i) == void 0) break; eval('this.arg'+i +'=arg'+i); };");
+
+new TestCase( SECTION, "MyFunc.length",                       2000,         MyFunc.length );
+new TestCase( SECTION, "var MY_OB = eval('MyFunc(s)')",       1,            eval("var MY_OB = MyFunc("+s+"); MY_OB") );
+
+new TestCase( SECTION, "MyObject.length",                       2000,         MyObject.length );
+
+new TestCase( SECTION, "FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1.length",     3, eval("FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1.length") );
+new TestCase( SECTION, "FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1()",          3, eval("FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1()") );
+new TestCase( SECTION, "FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1(1,2,3,4,5)", 3, eval("FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1(1,2,3,4,5)") );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.3.1-2.js b/js/src/tests/ecma/FunctionObjects/15.3.3.1-2.js
new file mode 100644
index 000000000..c3a3f26bf
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.3.1-2.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.3.3.1-2.js
+   ECMA Section:       15.3.3.1 Properties of the Function Constructor
+   Function.prototype
+
+   Description:        The initial value of Function.prototype is the built-in
+   Function prototype object.
+
+   This property shall have the attributes [DontEnum |
+   DontDelete | ReadOnly]
+
+   This test the DontEnum property of Function.prototype.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.3.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"var str='';for (prop in Function ) str += prop; str;",
+		"",
+		eval("var str='';for (prop in Function) str += prop; str;")
+  );
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.3.1-3.js b/js/src/tests/ecma/FunctionObjects/15.3.3.1-3.js
new file mode 100644
index 000000000..c11928753
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.3.1-3.js
@@ -0,0 +1,45 @@
+/* -*- tab-width: 2; 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:          15.3.3.1-3.js
+   ECMA Section:       15.3.3.1 Properties of the Function Constructor
+   Function.prototype
+
+   Description:        The initial value of Function.prototype is the built-in
+   Function prototype object.
+
+   This property shall have the attributes [DontEnum |
+   DontDelete | ReadOnly]
+
+   This test the DontDelete property of Function.prototype.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.3.1-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var FUN_PROTO = Function.prototype;
+
+new TestCase(   SECTION,
+		"delete Function.prototype",
+		false,
+		delete Function.prototype
+  );
+
+new TestCase(   SECTION,
+		"delete Function.prototype; Function.prototype",
+		FUN_PROTO,
+		eval("delete Function.prototype; Function.prototype")
+  );
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.3.1-4.js b/js/src/tests/ecma/FunctionObjects/15.3.3.1-4.js
new file mode 100644
index 000000000..3b5b64dc4
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.3.1-4.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.3.3.1-4.js
+   ECMA Section:       15.3.3.1 Properties of the Function Constructor
+   Function.prototype
+
+   Description:        The initial value of Function.prototype is the built-in
+   Function prototype object.
+
+   This property shall have the attributes [DontEnum |
+   DontDelete | ReadOnly]
+
+   This test the ReadOnly property of Function.prototype.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.3.1-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"Function.prototype = null; Function.prototype",
+		Function.prototype,
+		eval("Function.prototype = null; Function.prototype")
+  );
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.3.2.js b/js/src/tests/ecma/FunctionObjects/15.3.3.2.js
new file mode 100644
index 000000000..d92463101
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.3.2.js
@@ -0,0 +1,28 @@
+/* -*- 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:          15.3.3.2.js
+   ECMA Section:       15.3.3.2 Properties of the Function Constructor
+   Function.length
+
+   Description:        The length property is 1.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.3.3.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function.length";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,    "Function.length",  1, Function.length );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.4-1.js b/js/src/tests/ecma/FunctionObjects/15.3.4-1.js
new file mode 100644
index 000000000..49892a382
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.4-1.js
@@ -0,0 +1,60 @@
+/* -*- tab-width: 2; 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:          15.3.4-1.js
+   ECMA Section:       15.3.4  Properties of the Function Prototype Object
+
+   Description:        The Function prototype object is itself a Function
+   object ( its [[Class]] is "Function") that, when
+   invoked, accepts any arguments and returns undefined.
+
+   The value of the internal [[Prototype]] property
+   object is the Object prototype object.
+
+   It is a function with an "empty body"; if it is
+   invoked, it merely returns undefined.
+
+   The Function prototype object does not have a valueOf
+   property of its own; however it inherits the valueOf
+   property from the Object prototype Object.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.3.4-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the Function Prototype Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "var myfunc = Function.prototype; myfunc.toString = Object.prototype.toString; myfunc.toString()",
+	      "[object Function]",
+	      eval("var myfunc = Function.prototype; myfunc.toString = Object.prototype.toString; myfunc.toString()"));
+
+
+//  new TestCase( SECTION,  "Function.prototype.__proto__",     Object.prototype,           Function.prototype.__proto__ );
+
+new TestCase( SECTION, 
+	      "Function.prototype.valueOf",      
+	      Object.prototype.valueOf,  
+	      Function.prototype.valueOf );
+
+new TestCase( SECTION, 
+	      "Function.prototype()",            
+	      (void 0),                  
+	      Function.prototype() );
+
+new TestCase( SECTION, 
+	      "Function.prototype(1,true,false,'string', new Date(),null)", 
+	      (void 0),
+	      Function.prototype(1,true,false,'string', new Date(),null) );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.4.1.js b/js/src/tests/ecma/FunctionObjects/15.3.4.1.js
new file mode 100644
index 000000000..e8f669d48
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.4.1.js
@@ -0,0 +1,27 @@
+/* -*- 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:          15.3.4.1.js
+   ECMA Section:       15.3.4.1  Function.prototype.constructor
+
+   Description:        The initial value of Function.prototype.constructor
+   is the built-in Function constructor.
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.3.4.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function.prototype.constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "Function.prototype.constructor",   Function,   Function.prototype.constructor );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.4.js b/js/src/tests/ecma/FunctionObjects/15.3.4.js
new file mode 100644
index 000000000..3ce16e9f5
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.4.js
@@ -0,0 +1,47 @@
+/* -*- tab-width: 2; 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:          15.3.4.js
+   ECMA Section:       15.3.4  Properties of the Function Prototype Object
+
+   Description:        The Function prototype object is itself a Function
+   object ( its [[Class]] is "Function") that, when
+   invoked, accepts any arguments and returns undefined.
+
+   The value of the internal [[Prototype]] property
+   object is the Object prototype object.
+
+   It is a function with an "empty body"; if it is
+   invoked, it merely returns undefined.
+
+   The Function prototype object does not have a valueOf
+   property of its own; however it inherits the valueOf
+   property from the Object prototype Object.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the Function Prototype Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"var myfunc = Function.prototype; myfunc.toString = Object.prototype.toString; myfunc.toString()",
+		"[object Function]",
+		eval("var myfunc = Function.prototype; myfunc.toString = Object.prototype.toString; myfunc.toString()"));
+
+
+//  new TestCase( SECTION,  "Function.prototype.__proto__",     Object.prototype,           Function.prototype.__proto__ );
+new TestCase( SECTION,  "Function.prototype.valueOf",       Object.prototype.valueOf,   Function.prototype.valueOf );
+new TestCase( SECTION,  "Function.prototype()",             (void 0),                   Function.prototype() );
+new TestCase( SECTION,  "Function.prototype(1,true,false,'string', new Date(),null)",  (void 0), Function.prototype(1,true,false,'string', new Date(),null) );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.5-1.js b/js/src/tests/ecma/FunctionObjects/15.3.5-1.js
new file mode 100644
index 000000000..b6561ab96
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.5-1.js
@@ -0,0 +1,83 @@
+/* -*- 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:          15.3.5-1.js
+   ECMA Section:       15.3.5 Properties of Function Instances
+   new Function(p1, p2, ..., pn, body )
+
+   Description:
+
+   15.3.5.1 length
+
+   The value of the length property is usually an integer that indicates
+   the "typical" number of arguments expected by the function. However,
+   the language permits the function to be invoked with some other number
+   of arguments. The behavior of a function when invoked on a number of
+   arguments other than the number specified by its length property depends
+   on the function.
+
+   15.3.5.2 prototype
+   The value of the prototype property is used to initialize the internal [[
+   Prototype]] property of a newly created object before the Function object
+   is invoked as a constructor for that newly created object.
+
+   15.3.5.3 arguments
+
+   The value of the arguments property is normally null if there is no
+   outstanding invocation of the function in progress (that is, the function has been called
+   but has not yet returned). When a non-internal Function object (15.3.2.1) is invoked, its
+   arguments property is "dynamically bound" to a newly created object that contains the
+   arguments on which it was invoked (see 10.1.6 and 10.1.8). Note that the use of this
+   property is discouraged; it is provided principally for compatibility with existing old code.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.3.5-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of Function Instances";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+var args = "";
+
+for ( var i = 0; i < 2000; i++ ) {
+  args += "arg"+i;
+  if ( i != 1999 ) {
+    args += ",";
+  }
+}
+
+var s = "";
+
+for ( var i = 0; i < 2000; i++ ) {
+  s += ".0005";
+  if ( i != 1999 ) {
+    s += ",";
+  }
+}
+
+MyFunc = new Function( args, "var r=0; for (var i = 0; i < MyFunc.length; i++ ) { if ( eval('arg'+i) == void 0) break; else r += eval('arg'+i); }; return r");
+MyObject = new Function( args, "for (var i = 0; i < MyFunc.length; i++ ) { if ( eval('arg'+i) == void 0) break; eval('this.arg'+i +'=arg'+i); };");
+
+
+new TestCase( SECTION, "MyFunc.length",                       2000,         MyFunc.length );
+new TestCase( SECTION, "var MY_OB = eval('MyFunc(s)')",       1,            eval("var MY_OB = MyFunc("+s+"); MY_OB") );
+new TestCase( SECTION, "MyFunc.prototype.toString()",       "[object Object]",  MyFunc.prototype.toString() );
+new TestCase( SECTION, "typeof MyFunc.prototype",           "object",           typeof MyFunc.prototype );
+
+
+new TestCase( SECTION, "MyObject.length",                       2000,         MyObject.length );
+
+new TestCase( SECTION, "FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1.length",     3, eval("FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1.length") );
+new TestCase( SECTION, "FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1()",          3, eval("FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1()") );
+new TestCase( SECTION, "FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1(1,2,3,4,5)", 3, eval("FUN1 = new Function( 'a','b','c', 'return FUN1.length' ); FUN1(1,2,3,4,5)") );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.5-2.js b/js/src/tests/ecma/FunctionObjects/15.3.5-2.js
new file mode 100644
index 000000000..50593481d
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.5-2.js
@@ -0,0 +1,56 @@
+/* -*- 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:          15.3.5-1.js
+   ECMA Section:       15.3.5 Properties of Function Instances
+   new Function(p1, p2, ..., pn, body )
+
+   Description:
+
+   15.3.5.1 length
+
+   The value of the length property is usually an integer that indicates
+   the "typical" number of arguments expected by the function. However,
+   the language permits the function to be invoked with some other number
+   of arguments. The behavior of a function when invoked on a number of
+   arguments other than the number specified by its length property depends
+   on the function.
+
+   15.3.5.2 prototype
+   The value of the prototype property is used to initialize the internal [[
+   Prototype]] property of a newly created object before the Function object
+   is invoked as a constructor for that newly created object.
+
+   15.3.5.3 arguments
+
+   The value of the arguments property is normally null if there is no
+   outstanding invocation of the function in progress (that is, the function has been called
+   but has not yet returned). When a non-internal Function object (15.3.2.1) is invoked, its
+   arguments property is "dynamically bound" to a newly created object that contains the
+   arguments on which it was invoked (see 10.1.6 and 10.1.8). Note that the use of this
+   property is discouraged; it is provided principally for compatibility with existing old code.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.3.5-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of Function Instances";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+var MyObject = new Function( 'a', 'b', 'c', 'this.a = a; this.b = b; this.c = c; this.value = a+b+c; this.valueOf = new Function( "return this.value" )' );
+
+new TestCase( SECTION, "MyObject.length",                       3,          MyObject.length );
+new TestCase( SECTION, "typeof MyObject.prototype",             "object",   typeof MyObject.prototype );
+new TestCase( SECTION, "typeof MyObject.prototype.constructor", "function", typeof MyObject.prototype.constructor );
+new TestCase( SECTION, "MyObject.arguments",                     null,       MyObject.arguments );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.5.1.js b/js/src/tests/ecma/FunctionObjects/15.3.5.1.js
new file mode 100644
index 000000000..5a6eb1451
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.5.1.js
@@ -0,0 +1,49 @@
+/* -*- tab-width: 2; 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:          15.3.5.1.js
+   ECMA Section:       Function.length
+   Description:
+
+   The value of the length property is usually an integer that indicates the
+   "typical" number of arguments expected by the function.  However, the
+   language permits the function to be invoked with some other number of
+   arguments. The behavior of a function when invoked on a number of arguments
+   other than the number specified by its length property depends on the function.
+
+   this test needs a 1.2 version check.
+
+   http://scopus.mcom.com/bugsplat/show_bug.cgi?id=104204
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.3.5.1";
+var VERSION = "ECMA_1";
+var TITLE   = "Function.length";
+var BUGNUMBER="104204";
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var f = new Function( "a","b", "c", "return f.length");
+
+new TestCase( SECTION,
+	      'var f = new Function( "a","b", "c", "return f.length"); f()',
+	      3,
+	      f() );
+
+
+new TestCase( SECTION,
+	      'var f = new Function( "a","b", "c", "return f.length"); f(1,2,3,4,5)',
+	      3,
+	      f(1,2,3,4,5) );
+
+test();
+
diff --git a/js/src/tests/ecma/FunctionObjects/15.3.5.3.js b/js/src/tests/ecma/FunctionObjects/15.3.5.3.js
new file mode 100644
index 000000000..6274d3101
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/15.3.5.3.js
@@ -0,0 +1,38 @@
+/* -*- 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:          15.3.5.3.js
+   ECMA Section:       Function.arguments
+   Description:
+
+   The value of the arguments property is normally null if there is no
+   outstanding invocation of the function in progress (that is, the
+   function has been called but has not yet returned). When a non-internal
+   Function object (15.3.2.1) is invoked, its arguments property is
+   "dynamically bound" to a newly created object that contains the arguments
+   on which it was invoked (see 10.1.6 and 10.1.8). Note that the use of this
+   property is discouraged; it is provided principally for compatibility
+   with existing old code.
+
+   See sections 10.1.6 and 10.1.8 for more extensive tests.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.3.5.3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Function.arguments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var MYFUNCTION = new Function( "return this.arguments" );
+
+new TestCase( SECTION,  "var MYFUNCTION = new Function( 'return this.arguments' ); MYFUNCTION.arguments",   null,   MYFUNCTION.arguments );
+
+test();
diff --git a/js/src/tests/ecma/FunctionObjects/browser.js b/js/src/tests/ecma/FunctionObjects/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/browser.js
diff --git a/js/src/tests/ecma/FunctionObjects/shell.js b/js/src/tests/ecma/FunctionObjects/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/FunctionObjects/shell.js
diff --git a/js/src/tests/ecma/GlobalObject/15.1-1-n.js b/js/src/tests/ecma/GlobalObject/15.1-1-n.js
new file mode 100644
index 000000000..5f9e2128b
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1-1-n.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.1-1-n.js
+   ECMA Section:       The global object
+   Description:
+
+   The global object does not have a [[Construct]] property; it is not
+   possible to use the global object as a constructor with the new operator.
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.1-1-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Global Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var MY_GLOBAL = new this()";
+EXPECTED = "error";
+
+new TestCase(   SECTION,
+		"var MY_GLOBAL = new this()",
+		"error",
+		eval("var MY_GLOBAL = new this()") );
+
+test();
+
diff --git a/js/src/tests/ecma/GlobalObject/15.1-2-n.js b/js/src/tests/ecma/GlobalObject/15.1-2-n.js
new file mode 100644
index 000000000..4307914ca
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1-2-n.js
@@ -0,0 +1,33 @@
+/* -*- tab-width: 2; 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:          15.1-2-n.js
+   ECMA Section:       The global object
+   Description:
+
+   The global object does not have a [[Call]] property; it is not possible
+   to invoke the global object as a function.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.1-2-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Global Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var MY_GLOBAL = this()";
+EXPECTED = "error";
+
+new TestCase(   SECTION,
+		"var MY_GLOBAL = this()",
+		"error",
+		eval("var MY_GLOBAL = this()") );
+test();
diff --git a/js/src/tests/ecma/GlobalObject/15.1.1.1.js b/js/src/tests/ecma/GlobalObject/15.1.1.1.js
new file mode 100644
index 000000000..b37eca384
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.1.1.js
@@ -0,0 +1,29 @@
+/* -*- 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:          15.1.1.1.js
+   ECMA Section:       15.1.1.1 NaN
+
+   Description:        The initial value of NaN is NaN.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.1.1.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "NaN";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION, "NaN",               Number.NaN,     NaN );
+new TestCase( SECTION, "this.NaN",          Number.NaN,     this.NaN );
+new TestCase( SECTION, "typeof NaN",        "number",       typeof NaN );
+
+test();
diff --git a/js/src/tests/ecma/GlobalObject/15.1.1.2.js b/js/src/tests/ecma/GlobalObject/15.1.1.2.js
new file mode 100644
index 000000000..970b38475
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.1.2.js
@@ -0,0 +1,28 @@
+/* -*- 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:          15.1.1.2.js
+   ECMA Section:       15.1.1.2 Infinity
+
+   Description:        The initial value of Infinity is +Infinity.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.1.1.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Infinity";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "Infinity",               Number.POSITIVE_INFINITY,      Infinity );
+new TestCase( SECTION, "this.Infinity",          Number.POSITIVE_INFINITY,      this.Infinity );
+new TestCase( SECTION, "typeof Infinity",        "number",                      typeof Infinity );
+
+test();
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.1-2.js b/js/src/tests/ecma/GlobalObject/15.1.2.1-2.js
new file mode 100644
index 000000000..3737275aa
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.1-2.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.1.2.1-2.js
+   ECMA Section:       15.1.2.1 eval(x)
+
+   Parse x as an ECMAScript Program.  If the parse fails,
+   generate a runtime error.  Evaluate the program.  If
+   result is "Normal completion after value V", return
+   the value V.  Else, return undefined.
+   Description:
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.1.2.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "eval(x)";
+var BUGNUMBER = "none";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(    SECTION,
+		 "d = new Date(0); with (d) { x = getUTCMonth() +'/'+ getUTCDate() +'/'+ getUTCFullYear(); } x",
+		 "0/1/1970",
+		 eval( "d = new Date(0); with (d) { x = getUTCMonth() +'/'+ getUTCDate() +'/'+ getUTCFullYear(); } x" ));
+
+test();
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.2-1.js b/js/src/tests/ecma/GlobalObject/15.1.2.2-1.js
new file mode 100644
index 000000000..5e6a57f36
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.2-1.js
@@ -0,0 +1,363 @@
+/* -*- tab-width: 2; 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:          15.1.2.2-1.js
+   ECMA Section:       15.1.2.2 Function properties of the global object
+   parseInt( string, radix )
+
+   Description:
+
+   The parseInt function produces an integer value dictated by intepretation
+   of the contents of the string argument according to the specified radix.
+
+   When the parseInt function is called, the following steps are taken:
+
+   1.   Call ToString(string).
+   2.   Compute a substring of Result(1) consisting of the leftmost character
+   that is not a StrWhiteSpaceChar and all characters to the right of
+   that character. (In other words, remove leading whitespace.)
+   3.   Let sign be 1.
+   4.   If Result(2) is not empty and the first character of Result(2) is a
+   minus sign -, let sign be -1.
+   5.   If Result(2) is not empty and the first character of Result(2) is a
+   plus sign + or a minus sign -, then Result(5) is the substring of
+   Result(2) produced by removing the first character; otherwise, Result(5)
+   is Result(2).
+   6.   If the radix argument is not supplied, go to step 12.
+   7.   Call ToInt32(radix).
+   8.   If Result(7) is zero, go to step 12; otherwise, if Result(7) < 2 or
+   Result(7) > 36, return NaN.
+   9.   Let R be Result(7).
+   10.   If R = 16 and the length of Result(5) is at least 2 and the first two
+   characters of Result(5) are either "0x" or "0X", let S be the substring
+   of Result(5) consisting of all but the first two characters; otherwise,
+   let S be Result(5).
+   11.   Go to step 22.
+   12.   If Result(5) is empty or the first character of Result(5) is not 0,
+   go to step 20.
+   13.   If the length of Result(5) is at least 2 and the second character of
+   Result(5) is x or X, go to step 17.
+   14.   Let R be 8.
+   15.   Let S be Result(5).
+   16.   Go to step 22.
+   17.   Let R be 16.
+   18.   Let S be the substring of Result(5) consisting of all but the first
+   two characters.
+   19.   Go to step 22.
+   20.   Let R be 10.
+   21.   Let S be Result(5).
+   22.   If S contains any character that is not a radix-R digit, then let Z be
+   the substring of S consisting of all characters to the left of the
+   leftmost such character; otherwise, let Z be S.
+   23.   If Z is empty, return NaN.
+   24.   Compute the mathematical integer value that is represented by Z in
+   radix-R notation. (But if R is 10 and Z contains more than 20
+   significant digits, every digit after the 20th may be replaced by a 0
+   digit, at the option of the implementation; and if R is not 2, 4, 8,
+   10, 16, or 32, then Result(24) may be an implementation-dependent
+   approximation to the mathematical integer value that is represented
+   by Z in radix-R notation.)
+   25.   Compute the number value for Result(24).
+   26.   Return sign Result(25).
+
+   Note that parseInt may interpret only a leading portion of the string as
+   an integer value; it ignores any characters that cannot be interpreted as
+   part of the notation of an integer, and no indication is given that any
+   such characters were ignored.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.1.2.2-1";
+var VERSION = "ECMA_1";
+var TITLE   = "parseInt(string, radix)";
+var BUGNUMBER = "none";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var HEX_STRING = "0x0";
+var HEX_VALUE = 0;
+
+new TestCase( SECTION, 
+	      "parseInt.length",     
+	      2,     
+	      parseInt.length );
+
+new TestCase( SECTION, 
+	      "parseInt.length = 0; parseInt.length",    
+	      2,     
+	      eval("parseInt.length = 0; parseInt.length") );
+
+new TestCase( SECTION, 
+	      "var PROPS=''; for ( var p in parseInt ) { PROPS += p; }; PROPS",   "",
+	      eval("var PROPS=''; for ( var p in parseInt ) { PROPS += p; }; PROPS") );
+
+new TestCase( SECTION, 
+	      "parseInt()",      
+	      NaN,   
+	      parseInt() );
+
+new TestCase( SECTION, 
+	      "parseInt('')",    
+	      NaN,   
+	      parseInt("") );
+
+new TestCase( SECTION, 
+	      "parseInt('','')", 
+	      NaN,   
+	      parseInt("","") );
+
+new TestCase( SECTION,
+	      "parseInt(\"     0xabcdef     ",
+	      11259375,
+	      parseInt( "      0xabcdef     " ));
+
+new TestCase( SECTION,
+	      "parseInt(\"     0XABCDEF     ",
+	      11259375,
+	      parseInt( "      0XABCDEF     " ) );
+
+new TestCase( SECTION,
+	      "parseInt( 0xabcdef )",
+	      11259375,
+	      parseInt( "0xabcdef") );
+
+new TestCase( SECTION,
+	      "parseInt( 0XABCDEF )",
+	      11259375,
+	      parseInt( "0XABCDEF") );
+
+for ( HEX_STRING = "0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"')",    HEX_VALUE,  parseInt(HEX_STRING) );
+  HEX_VALUE += Math.pow(16,POWER)*15;
+}
+for ( HEX_STRING = "0X0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"')",    HEX_VALUE,  parseInt(HEX_STRING) );
+  HEX_VALUE += Math.pow(16,POWER)*15;
+}
+for ( HEX_STRING = "0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"', 16)",    HEX_VALUE,  parseInt(HEX_STRING,16) );
+  HEX_VALUE += Math.pow(16,POWER)*15;
+}
+for ( HEX_STRING = "0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"', 16)",    HEX_VALUE,  parseInt(HEX_STRING,16) );
+  HEX_VALUE += Math.pow(16,POWER)*15;
+}
+for ( HEX_STRING = "0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"', null)",    HEX_VALUE,  parseInt(HEX_STRING,null) );
+  HEX_VALUE += Math.pow(16,POWER)*15;
+}
+for ( HEX_STRING = "0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"', void 0)",    HEX_VALUE,  parseInt(HEX_STRING, void 0) );
+  HEX_VALUE += Math.pow(16,POWER)*15;
+}
+
+// a few tests with spaces
+
+for ( var space = " ", HEX_STRING = "0x0", HEX_VALUE = 0, POWER = 0;
+      POWER < 15;
+      POWER++, HEX_STRING = HEX_STRING +"f", space += " ")
+{
+  new TestCase( SECTION, "parseInt('"+space+HEX_STRING+space+"', void 0)",    HEX_VALUE,  parseInt(space+HEX_STRING+space, void 0) );
+  HEX_VALUE += Math.pow(16,POWER)*15;
+}
+
+new TestCase(SECTION, "parseInt(BOM + '123', 10)", 123, parseInt("\uFEFF" + "123", 10));
+
+// a few tests with negative numbers
+for ( HEX_STRING = "-0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"')",    HEX_VALUE,  parseInt(HEX_STRING) );
+  HEX_VALUE -= Math.pow(16,POWER)*15;
+}
+
+// we should stop parsing when we get to a value that is not a numeric literal for the type we expect
+
+for ( HEX_STRING = "0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"g', 16)",    HEX_VALUE,  parseInt(HEX_STRING+"g",16) );
+  HEX_VALUE += Math.pow(16,POWER)*15;
+}
+for ( HEX_STRING = "0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"G', 16)",    HEX_VALUE,  parseInt(HEX_STRING+"G",16) );
+  HEX_VALUE += Math.pow(16,POWER)*15;
+}
+
+for ( HEX_STRING = "-0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"')",    HEX_VALUE,  parseInt(HEX_STRING) );
+  HEX_VALUE -= Math.pow(16,POWER)*15;
+}
+for ( HEX_STRING = "-0X0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"')",    HEX_VALUE,  parseInt(HEX_STRING) );
+  HEX_VALUE -= Math.pow(16,POWER)*15;
+}
+for ( HEX_STRING = "-0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"', 16)",    HEX_VALUE,  parseInt(HEX_STRING,16) );
+  HEX_VALUE -= Math.pow(16,POWER)*15;
+}
+for ( HEX_STRING = "-0x0", HEX_VALUE = 0, POWER = 0; POWER < 15; POWER++, HEX_STRING = HEX_STRING +"f" ) {
+  new TestCase( SECTION, "parseInt('"+HEX_STRING+"', 16)",    HEX_VALUE,  parseInt(HEX_STRING,16) );
+  HEX_VALUE -= Math.pow(16,POWER)*15;
+}
+
+// Numbers that start with 0 and do not provide a radix should use 10 as radix
+// per ES5, not octal (as it was in ES3).
+
+var OCT_STRING = "0";
+var OCT_VALUE = 0;
+
+for ( OCT_STRING = "0", OCT_VALUE = 0, POWER = 0; POWER < 15; POWER++, OCT_STRING = OCT_STRING +"7" ) {
+  new TestCase( SECTION, "parseInt('"+OCT_STRING+"')",    OCT_VALUE,  parseInt(OCT_STRING) );
+  OCT_VALUE += Math.pow(10,POWER)*7;
+}
+
+for ( OCT_STRING = "-0", OCT_VALUE = 0, POWER = 0; POWER < 15; POWER++, OCT_STRING = OCT_STRING +"7" ) {
+  new TestCase( SECTION, "parseInt('"+OCT_STRING+"')",    OCT_VALUE,  parseInt(OCT_STRING) );
+  OCT_VALUE -= Math.pow(10,POWER)*7;
+}
+
+// should get octal-based results if we provid the radix of 8 (or 010)
+
+for ( OCT_STRING = "0", OCT_VALUE = 0, POWER = 0; POWER < 15; POWER++, OCT_STRING = OCT_STRING +"7" ) {
+  new TestCase( SECTION, "parseInt('"+OCT_STRING+"', 8)",    OCT_VALUE,  parseInt(OCT_STRING,8) );
+  OCT_VALUE += Math.pow(8,POWER)*7;
+}
+for ( OCT_STRING = "-0", OCT_VALUE = 0, POWER = 0; POWER < 15; POWER++, OCT_STRING = OCT_STRING +"7" ) {
+  new TestCase( SECTION, "parseInt('"+OCT_STRING+"', 010)",    OCT_VALUE,  parseInt(OCT_STRING,010) );
+  OCT_VALUE -= Math.pow(8,POWER)*7;
+}
+
+// we shall stop parsing digits when we get one that isn't a numeric literal of the type we think
+// it should be.
+for ( OCT_STRING = "0", OCT_VALUE = 0, POWER = 0; POWER < 15; POWER++, OCT_STRING = OCT_STRING +"7" ) {
+  new TestCase( SECTION, "parseInt('"+OCT_STRING+"8', 8)",    OCT_VALUE,  parseInt(OCT_STRING+"8",8) );
+  OCT_VALUE += Math.pow(8,POWER)*7;
+}
+for ( OCT_STRING = "-0", OCT_VALUE = 0, POWER = 0; POWER < 15; POWER++, OCT_STRING = OCT_STRING +"7" ) {
+  new TestCase( SECTION, "parseInt('"+OCT_STRING+"8', 010)",    OCT_VALUE,  parseInt(OCT_STRING+"8",010) );
+  OCT_VALUE -= Math.pow(8,POWER)*7;
+}
+
+new TestCase( SECTION,
+	      "parseInt( '0x' )",             
+	      NaN,       
+	      parseInt("0x") );
+
+new TestCase( SECTION,
+	      "parseInt( '0X' )",             
+	      NaN,       
+	      parseInt("0X") );
+
+new TestCase( SECTION,
+	      "parseInt( '11111111112222222222' )",   
+	      11111111112222222222,  
+	      parseInt("11111111112222222222") );
+
+new TestCase( SECTION,
+	      "parseInt( '111111111122222222223' )",   
+	      111111111122222222220,  
+	      parseInt("111111111122222222223") );
+
+new TestCase( SECTION,
+	      "parseInt( '11111111112222222222',10 )",   
+	      11111111112222222222,  
+	      parseInt("11111111112222222222",10) );
+
+new TestCase( SECTION,
+	      "parseInt( '111111111122222222223',10 )",   
+	      111111111122222222220,  
+	      parseInt("111111111122222222223",10) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', -1 )", 
+	      Number.NaN,   
+	      parseInt("01234567890",-1) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 0 )", 
+	      1234567890,
+	      parseInt("01234567890", 0) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 1 )", 
+	      Number.NaN,    
+	      parseInt("01234567890",1) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 2 )", 
+	      1,             
+	      parseInt("01234567890",2) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 3 )", 
+	      5,             
+	      parseInt("01234567890",3) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 4 )", 
+	      27,            
+	      parseInt("01234567890",4) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 5 )", 
+	      194,           
+	      parseInt("01234567890",5) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 6 )", 
+	      1865,          
+	      parseInt("01234567890",6) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 7 )", 
+	      22875,         
+	      parseInt("01234567890",7) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 8 )", 
+	      342391,        
+	      parseInt("01234567890",8) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 9 )", 
+	      6053444,       
+	      parseInt("01234567890",9) );
+
+new TestCase( SECTION,
+	      "parseInt( '01234567890', 10 )",
+	      1234567890,
+	      parseInt("01234567890",10) );
+
+// need more test cases with hex radix
+
+new TestCase( SECTION,
+	      "parseInt( '1234567890', '0xa')",
+	      1234567890,
+	      parseInt("1234567890","0xa") );
+
+new TestCase( SECTION,
+	      "parseInt( '012345', 11 )",     
+	      17715,         
+	      parseInt("012345",11) );
+
+new TestCase( SECTION,
+	      "parseInt( '012345', 35 )",     
+	      1590195,       
+	      parseInt("012345",35) );
+
+new TestCase( SECTION,
+	      "parseInt( '012345', 36 )",     
+	      1776965,       
+	      parseInt("012345",36) );
+
+new TestCase( SECTION,
+	      "parseInt( '012345', 37 )",     
+	      Number.NaN,    
+	      parseInt("012345",37) );
+
+test();
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.2-2.js b/js/src/tests/ecma/GlobalObject/15.1.2.2-2.js
new file mode 100644
index 000000000..d6692b4a6
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.2-2.js
@@ -0,0 +1,209 @@
+/* -*- tab-width: 2; 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:          15.1.2.2-1.js
+   ECMA Section:       15.1.2.2 Function properties of the global object
+   parseInt( string, radix )
+
+   Description:        parseInt test cases written by waldemar, and documented in
+   http://scopus.mcom.com/bugsplat/show_bug.cgi?id=123874.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.1.2.2-2";
+var VERSION = "ECMA_1";
+var TITLE   = "parseInt(string, radix)";
+var BUGNUMBER = "none";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      'parseInt("000000100000000100100011010001010110011110001001101010111100",2)',
+	      9027215253084860,
+	      parseInt("000000100000000100100011010001010110011110001001101010111100",2) );
+
+new TestCase( SECTION,
+	      'parseInt("000000100000000100100011010001010110011110001001101010111101",2)',
+	      9027215253084860,
+	      parseInt("000000100000000100100011010001010110011110001001101010111101",2));
+
+new TestCase( SECTION,
+	      'parseInt("000000100000000100100011010001010110011110001001101010111111",2)',
+	      9027215253084864,
+	      parseInt("000000100000000100100011010001010110011110001001101010111111",2) );
+
+new TestCase( SECTION,
+	      'parseInt("0000001000000001001000110100010101100111100010011010101111010",2)',
+	      18054430506169720,
+	      parseInt("0000001000000001001000110100010101100111100010011010101111010",2) );
+
+new TestCase( SECTION,
+	      'parseInt("0000001000000001001000110100010101100111100010011010101111011",2)',
+	      18054430506169724,
+	      parseInt("0000001000000001001000110100010101100111100010011010101111011",2));
+
+new TestCase( SECTION,
+	      'parseInt("0000001000000001001000110100010101100111100010011010101111100",2)',
+	      18054430506169724,
+	      parseInt("0000001000000001001000110100010101100111100010011010101111100",2) );
+
+new TestCase( SECTION,
+	      'parseInt("0000001000000001001000110100010101100111100010011010101111110",2)',
+	      18054430506169728,
+	      parseInt("0000001000000001001000110100010101100111100010011010101111110",2) );
+
+new TestCase( SECTION,
+	      'parseInt("yz",35)',
+	      34,
+	      parseInt("yz",35) );
+
+new TestCase( SECTION,
+	      'parseInt("yz",36)',
+	      1259,
+	      parseInt("yz",36) );
+
+new TestCase( SECTION,
+	      'parseInt("yz",37)',
+	      NaN,
+	      parseInt("yz",37) );
+
+new TestCase( SECTION,
+	      'parseInt("+77")',
+	      77,
+	      parseInt("+77") );
+
+new TestCase( SECTION,
+	      'parseInt("-77",9)',
+	      -70,
+	      parseInt("-77",9) );
+
+new TestCase( SECTION,
+	      'parseInt("\u20001234\u2000")',
+	      1234,
+	      parseInt("\u20001234\u2000") );
+
+new TestCase( SECTION,
+	      'parseInt("123456789012345678")',
+	      123456789012345680,
+	      parseInt("123456789012345678") );
+
+new TestCase( SECTION,
+	      'parseInt("9",8)',
+	      NaN,
+	      parseInt("9",8) );
+
+new TestCase( SECTION,
+	      'parseInt("1e2")',
+	      1,
+	      parseInt("1e2") );
+
+new TestCase( SECTION,
+	      'parseInt("1.9999999999999999999")',
+	      1,
+	      parseInt("1.9999999999999999999") );
+
+new TestCase( SECTION,
+	      'parseInt("0x10")',
+	      16,
+	      parseInt("0x10") );
+
+new TestCase( SECTION,
+	      'parseInt("0x10",10)',
+	      0,
+	      parseInt("0x10",10));
+
+new TestCase( SECTION,
+	      'parseInt("0022")',
+	      22,
+	      parseInt("0022"));
+
+new TestCase( SECTION,
+	      'parseInt("0022", 8)',
+	      18,
+	      parseInt("0022", 8));
+
+new TestCase( SECTION,
+	      'parseInt("0022", 10)',
+	      22,
+	      parseInt("0022", 10) );
+
+new TestCase( SECTION,
+	      'parseInt("0x1000000000000080")',
+	      1152921504606847000,
+	      parseInt("0x1000000000000080") );
+
+new TestCase( SECTION,
+	      'parseInt("0x1000000000000081")',
+	      1152921504606847200,
+	      parseInt("0x1000000000000081") );
+
+s =
+  "0xFFFFFFFFFFFFF80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000"
+
+  s += "0000000000000000000000000000000000000";
+
+new TestCase( SECTION,
+	      "s = " + s +"; -s",
+	      -1.7976931348623157e+308,
+	      -s );
+
+s =
+  "0xFFFFFFFFFFFFF80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000";
+s += "0000000000000000000000000000000000001";
+
+new TestCase( SECTION,
+	      "s = " + s +"; -s",
+	      -1.7976931348623157e+308,
+	      -s );
+
+
+s = "0xFFFFFFFFFFFFFC0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000";
+
+s += "0000000000000000000000000000000000000"
+
+
+new TestCase( SECTION,
+	      "s = " + s + "; -s",
+	      -Infinity,
+	      -s );
+
+s = "0xFFFFFFFFFFFFFB0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000";
+s += "0000000000000000000000000000000000001";
+
+new TestCase( SECTION,
+	      "s = " + s + "; -s",
+	      -1.7976931348623157e+308,
+	      -s );
+
+s += "0"
+
+new TestCase( SECTION,
+	      "s = " + s + "; -s",
+	      -Infinity,
+	      -s );
+
+new TestCase( SECTION,
+	      'parseInt(s)',
+	      Infinity,
+	      parseInt(s) );
+
+new TestCase( SECTION,
+	      'parseInt(s,32)',
+	      0,
+	      parseInt(s,32) );
+
+new TestCase( SECTION,
+	      'parseInt(s,36)',
+	      Infinity,
+	      parseInt(s,36));
+
+test();
+
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.3-1.js b/js/src/tests/ecma/GlobalObject/15.1.2.3-1.js
new file mode 100644
index 000000000..46fb82523
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.3-1.js
@@ -0,0 +1,405 @@
+/* -*- 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:          15.1.2.3.js
+   ECMA Section:       15.1.2.3 Function properties of the global object:
+   parseFloat( string )
+
+   Description:        The parseFloat function produces a number value dictated
+   by the interpretation of the contents of the string
+   argument defined as a decimal literal.
+
+   When the parseFloat function is called, the following
+   steps are taken:
+
+   1.  Call ToString( string ).
+   2.  Remove leading whitespace Result(1).
+   3.  If neither Result(2) nor any prefix of Result(2)
+   satisfies the syntax of a StrDecimalLiteral,
+   return NaN.
+   4.  Compute the longest prefix of Result(2) which might
+   be Resusult(2) itself, that satisfies the syntax of
+   a StrDecimalLiteral
+   5.  Return the number value for the MV of Result(4).
+
+   Note that parseFloate may interpret only a leading
+   portion of the string as a number value; it ignores any
+   characters that cannot be interpreted as part of the
+   notation of a decimal literal, and no indication is given
+   that such characters were ignored.
+
+   StrDecimalLiteral::
+   Infinity
+   DecimalDigits.DecimalDigits opt ExponentPart opt
+   .DecimalDigits ExponentPart opt
+   DecimalDigits ExponentPart opt
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.1.2.3-1";
+var VERSION = "ECMA_1";
+var TITLE   = "parseFloat(string)";
+var BUGNUMBER="none";
+
+startTest();
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "parseFloat.length",     1,              parseFloat.length );
+
+new TestCase( SECTION, "parseFloat.length = null; parseFloat.length",   1,      eval("parseFloat.length = null; parseFloat.length") );
+new TestCase( SECTION, "var MYPROPS=''; for ( var p in parseFloat ) { MYPROPS += p }; MYPROPS", "", eval("var MYPROPS=''; for ( var p in parseFloat ) { MYPROPS += p }; MYPROPS") );
+
+new TestCase( SECTION, "parseFloat()",          Number.NaN,     parseFloat() );
+new TestCase( SECTION, "parseFloat('')",        Number.NaN,     parseFloat('') );
+
+new TestCase( SECTION, "parseFloat(' ')",       Number.NaN,     parseFloat(' ') );
+new TestCase( SECTION, "parseFloat(true)",      Number.NaN,     parseFloat(true) );
+new TestCase( SECTION, "parseFloat(false)",     Number.NaN,     parseFloat(false) );
+new TestCase( SECTION, "parseFloat('string')",  Number.NaN,     parseFloat("string") );
+
+new TestCase( SECTION, "parseFloat('  Infinity')",    Infinity,    parseFloat("Infinity") );
+new TestCase( SECTION, "parseFloat('  Infinity  ')",      Infinity,    parseFloat('  Infinity  ') );
+
+new TestCase( SECTION, "parseFloat('Infinity')",    Infinity,    parseFloat("Infinity") );
+new TestCase( SECTION, "parseFloat(Infinity)",      Infinity,    parseFloat(Infinity) );
+
+
+new TestCase( SECTION, "parseFloat('  +Infinity')",         +Infinity,    parseFloat("+Infinity") );
+new TestCase( SECTION, "parseFloat('  -Infinity  ')",      -Infinity,    parseFloat('  -Infinity  ') );
+
+new TestCase( SECTION, "parseFloat('+Infinity')",    +Infinity,    parseFloat("+Infinity") );
+new TestCase( SECTION, "parseFloat(-Infinity)",      -Infinity,    parseFloat(-Infinity) );
+
+new TestCase( SECTION,  "parseFloat('0')",          0,          parseFloat("0") );
+new TestCase( SECTION,  "parseFloat('-0')",         -0,         parseFloat("-0") );
+new TestCase( SECTION,  "parseFloat('+0')",          0,         parseFloat("+0") );
+
+new TestCase( SECTION,  "parseFloat('1')",          1,          parseFloat("1") );
+new TestCase( SECTION,  "parseFloat('-1')",         -1,         parseFloat("-1") );
+new TestCase( SECTION,  "parseFloat('+1')",          1,         parseFloat("+1") );
+
+new TestCase( SECTION,  "parseFloat('2')",          2,          parseFloat("2") );
+new TestCase( SECTION,  "parseFloat('-2')",         -2,         parseFloat("-2") );
+new TestCase( SECTION,  "parseFloat('+2')",          2,         parseFloat("+2") );
+
+new TestCase( SECTION,  "parseFloat('3')",          3,          parseFloat("3") );
+new TestCase( SECTION,  "parseFloat('-3')",         -3,         parseFloat("-3") );
+new TestCase( SECTION,  "parseFloat('+3')",          3,         parseFloat("+3") );
+
+new TestCase( SECTION,  "parseFloat('4')",          4,          parseFloat("4") );
+new TestCase( SECTION,  "parseFloat('-4')",         -4,         parseFloat("-4") );
+new TestCase( SECTION,  "parseFloat('+4')",          4,         parseFloat("+4") );
+
+new TestCase( SECTION,  "parseFloat('5')",          5,          parseFloat("5") );
+new TestCase( SECTION,  "parseFloat('-5')",         -5,         parseFloat("-5") );
+new TestCase( SECTION,  "parseFloat('+5')",          5,         parseFloat("+5") );
+
+new TestCase( SECTION,  "parseFloat('6')",          6,          parseFloat("6") );
+new TestCase( SECTION,  "parseFloat('-6')",         -6,         parseFloat("-6") );
+new TestCase( SECTION,  "parseFloat('+6')",          6,         parseFloat("+6") );
+
+new TestCase( SECTION,  "parseFloat('7')",          7,          parseFloat("7") );
+new TestCase( SECTION,  "parseFloat('-7')",         -7,         parseFloat("-7") );
+new TestCase( SECTION,  "parseFloat('+7')",          7,         parseFloat("+7") );
+
+new TestCase( SECTION,  "parseFloat('8')",          8,          parseFloat("8") );
+new TestCase( SECTION,  "parseFloat('-8')",         -8,         parseFloat("-8") );
+new TestCase( SECTION,  "parseFloat('+8')",          8,         parseFloat("+8") );
+
+new TestCase( SECTION,  "parseFloat('9')",          9,          parseFloat("9") );
+new TestCase( SECTION,  "parseFloat('-9')",         -9,         parseFloat("-9") );
+new TestCase( SECTION,  "parseFloat('+9')",          9,         parseFloat("+9") );
+
+new TestCase( SECTION,  "parseFloat('3.14159')",    3.14159,    parseFloat("3.14159") );
+new TestCase( SECTION,  "parseFloat('-3.14159')",   -3.14159,   parseFloat("-3.14159") );
+new TestCase( SECTION,  "parseFloat('+3.14159')",   3.14159,    parseFloat("+3.14159") );
+
+new TestCase( SECTION,  "parseFloat('3.')",         3,          parseFloat("3.") );
+new TestCase( SECTION,  "parseFloat('-3.')",        -3,         parseFloat("-3.") );
+new TestCase( SECTION,  "parseFloat('+3.')",        3,          parseFloat("+3.") );
+
+new TestCase( SECTION,  "parseFloat('3.e1')",       30,         parseFloat("3.e1") );
+new TestCase( SECTION,  "parseFloat('-3.e1')",      -30,        parseFloat("-3.e1") );
+new TestCase( SECTION,  "parseFloat('+3.e1')",      30,         parseFloat("+3.e1") );
+
+new TestCase( SECTION,  "parseFloat('3.e+1')",       30,         parseFloat("3.e+1") );
+new TestCase( SECTION,  "parseFloat('-3.e+1')",      -30,        parseFloat("-3.e+1") );
+new TestCase( SECTION,  "parseFloat('+3.e+1')",      30,         parseFloat("+3.e+1") );
+
+new TestCase( SECTION,  "parseFloat('3.e-1')",       .30,         parseFloat("3.e-1") );
+new TestCase( SECTION,  "parseFloat('-3.e-1')",      -.30,        parseFloat("-3.e-1") );
+new TestCase( SECTION,  "parseFloat('+3.e-1')",      .30,         parseFloat("+3.e-1") );
+
+// StrDecimalLiteral:::  .DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "parseFloat('.00001')",     0.00001,    parseFloat(".00001") );
+new TestCase( SECTION,  "parseFloat('+.00001')",    0.00001,    parseFloat("+.00001") );
+new TestCase( SECTION,  "parseFloat('-0.0001')",    -0.00001,   parseFloat("-.00001") );
+
+new TestCase( SECTION,  "parseFloat('.01e2')",      1,          parseFloat(".01e2") );
+new TestCase( SECTION,  "parseFloat('+.01e2')",     1,          parseFloat("+.01e2") );
+new TestCase( SECTION,  "parseFloat('-.01e2')",     -1,         parseFloat("-.01e2") );
+
+new TestCase( SECTION,  "parseFloat('.01e+2')",      1,         parseFloat(".01e+2") );
+new TestCase( SECTION,  "parseFloat('+.01e+2')",     1,         parseFloat("+.01e+2") );
+new TestCase( SECTION,  "parseFloat('-.01e+2')",     -1,        parseFloat("-.01e+2") );
+
+new TestCase( SECTION,  "parseFloat('.01e-2')",      0.0001,    parseFloat(".01e-2") );
+new TestCase( SECTION,  "parseFloat('+.01e-2')",     0.0001,    parseFloat("+.01e-2") );
+new TestCase( SECTION,  "parseFloat('-.01e-2')",     -0.0001,   parseFloat("-.01e-2") );
+
+//  StrDecimalLiteral:::    DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "parseFloat('1234e5')",     123400000,  parseFloat("1234e5") );
+new TestCase( SECTION,  "parseFloat('+1234e5')",    123400000,  parseFloat("+1234e5") );
+new TestCase( SECTION,  "parseFloat('-1234e5')",    -123400000, parseFloat("-1234e5") );
+
+new TestCase( SECTION,  "parseFloat('1234e+5')",    123400000,  parseFloat("1234e+5") );
+new TestCase( SECTION,  "parseFloat('+1234e+5')",   123400000,  parseFloat("+1234e+5") );
+new TestCase( SECTION,  "parseFloat('-1234e+5')",   -123400000, parseFloat("-1234e+5") );
+
+new TestCase( SECTION,  "parseFloat('1234e-5')",     0.01234,  parseFloat("1234e-5") );
+new TestCase( SECTION,  "parseFloat('+1234e-5')",    0.01234,  parseFloat("+1234e-5") );
+new TestCase( SECTION,  "parseFloat('-1234e-5')",    -0.01234, parseFloat("-1234e-5") );
+
+
+new TestCase( SECTION,  "parseFloat(0)",          0,          parseFloat(0) );
+new TestCase( SECTION,  "parseFloat(-0)",         -0,         parseFloat(-0) );
+
+new TestCase( SECTION,  "parseFloat(1)",          1,          parseFloat(1) );
+new TestCase( SECTION,  "parseFloat(-1)",         -1,         parseFloat(-1) );
+
+new TestCase( SECTION,  "parseFloat(2)",          2,          parseFloat(2) );
+new TestCase( SECTION,  "parseFloat(-2)",         -2,         parseFloat(-2) );
+
+new TestCase( SECTION,  "parseFloat(3)",          3,          parseFloat(3) );
+new TestCase( SECTION,  "parseFloat(-3)",         -3,         parseFloat(-3) );
+
+new TestCase( SECTION,  "parseFloat(4)",          4,          parseFloat(4) );
+new TestCase( SECTION,  "parseFloat(-4)",         -4,         parseFloat(-4) );
+
+new TestCase( SECTION,  "parseFloat(5)",          5,          parseFloat(5) );
+new TestCase( SECTION,  "parseFloat(-5)",         -5,         parseFloat(-5) );
+
+new TestCase( SECTION,  "parseFloat(6)",          6,          parseFloat(6) );
+new TestCase( SECTION,  "parseFloat(-6)",         -6,         parseFloat(-6) );
+
+new TestCase( SECTION,  "parseFloat(7)",          7,          parseFloat(7) );
+new TestCase( SECTION,  "parseFloat(-7)",         -7,         parseFloat(-7) );
+
+new TestCase( SECTION,  "parseFloat(8)",          8,          parseFloat(8) );
+new TestCase( SECTION,  "parseFloat(-8)",         -8,         parseFloat(-8) );
+
+new TestCase( SECTION,  "parseFloat(9)",          9,          parseFloat(9) );
+new TestCase( SECTION,  "parseFloat(-9)",         -9,         parseFloat(-9) );
+
+new TestCase( SECTION,  "parseFloat(3.14159)",    3.14159,    parseFloat(3.14159) );
+new TestCase( SECTION,  "parseFloat(-3.14159)",   -3.14159,   parseFloat(-3.14159) );
+
+new TestCase( SECTION,  "parseFloat(3.)",         3,          parseFloat(3.) );
+new TestCase( SECTION,  "parseFloat(-3.)",        -3,         parseFloat(-3.) );
+
+new TestCase( SECTION,  "parseFloat(3.e1)",       30,         parseFloat(3.e1) );
+new TestCase( SECTION,  "parseFloat(-3.e1)",      -30,        parseFloat(-3.e1) );
+
+new TestCase( SECTION,  "parseFloat(3.e+1)",       30,         parseFloat(3.e+1) );
+new TestCase( SECTION,  "parseFloat(-3.e+1)",      -30,        parseFloat(-3.e+1) );
+
+new TestCase( SECTION,  "parseFloat(3.e-1)",       .30,         parseFloat(3.e-1) );
+new TestCase( SECTION,  "parseFloat(-3.e-1)",      -.30,        parseFloat(-3.e-1) );
+
+
+new TestCase( SECTION,  "parseFloat(3.E1)",       30,         parseFloat(3.E1) );
+new TestCase( SECTION,  "parseFloat(-3.E1)",      -30,        parseFloat(-3.E1) );
+
+new TestCase( SECTION,  "parseFloat(3.E+1)",       30,         parseFloat(3.E+1) );
+new TestCase( SECTION,  "parseFloat(-3.E+1)",      -30,        parseFloat(-3.E+1) );
+
+new TestCase( SECTION,  "parseFloat(3.E-1)",       .30,         parseFloat(3.E-1) );
+new TestCase( SECTION,  "parseFloat(-3.E-1)",      -.30,        parseFloat(-3.E-1) );
+
+// StrDecimalLiteral:::  .DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "parseFloat(.00001)",     0.00001,    parseFloat(.00001) );
+new TestCase( SECTION,  "parseFloat(-0.0001)",    -0.00001,   parseFloat(-.00001) );
+
+new TestCase( SECTION,  "parseFloat(.01e2)",      1,          parseFloat(.01e2) );
+new TestCase( SECTION,  "parseFloat(-.01e2)",     -1,         parseFloat(-.01e2) );
+
+new TestCase( SECTION,  "parseFloat(.01e+2)",      1,         parseFloat(.01e+2) );
+new TestCase( SECTION,  "parseFloat(-.01e+2)",     -1,        parseFloat(-.01e+2) );
+
+new TestCase( SECTION,  "parseFloat(.01e-2)",      0.0001,    parseFloat(.01e-2) );
+new TestCase( SECTION,  "parseFloat(-.01e-2)",     -0.0001,   parseFloat(-.01e-2) );
+
+//  StrDecimalLiteral:::    DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "parseFloat(1234e5)",     123400000,  parseFloat(1234e5) );
+new TestCase( SECTION,  "parseFloat(-1234e5)",    -123400000, parseFloat(-1234e5) );
+
+new TestCase( SECTION,  "parseFloat(1234e+5)",    123400000,  parseFloat(1234e+5) );
+new TestCase( SECTION,  "parseFloat(-1234e+5)",   -123400000, parseFloat(-1234e+5) );
+
+new TestCase( SECTION,  "parseFloat(1234e-5)",     0.01234,  parseFloat(1234e-5) );
+new TestCase( SECTION,  "parseFloat(-1234e-5)",    -0.01234, parseFloat(-1234e-5) );
+
+// hex cases should all return 0  (0 is the longest string that satisfies a StringDecimalLiteral)
+
+new TestCase( SECTION,  "parseFloat('0x0')",        0,         parseFloat("0x0"));
+new TestCase( SECTION,  "parseFloat('0x1')",        0,         parseFloat("0x1"));
+new TestCase( SECTION,  "parseFloat('0x2')",        0,         parseFloat("0x2"));
+new TestCase( SECTION,  "parseFloat('0x3')",        0,         parseFloat("0x3"));
+new TestCase( SECTION,  "parseFloat('0x4')",        0,         parseFloat("0x4"));
+new TestCase( SECTION,  "parseFloat('0x5')",        0,         parseFloat("0x5"));
+new TestCase( SECTION,  "parseFloat('0x6')",        0,         parseFloat("0x6"));
+new TestCase( SECTION,  "parseFloat('0x7')",        0,         parseFloat("0x7"));
+new TestCase( SECTION,  "parseFloat('0x8')",        0,         parseFloat("0x8"));
+new TestCase( SECTION,  "parseFloat('0x9')",        0,         parseFloat("0x9"));
+new TestCase( SECTION,  "parseFloat('0xa')",        0,         parseFloat("0xa"));
+new TestCase( SECTION,  "parseFloat('0xb')",        0,         parseFloat("0xb"));
+new TestCase( SECTION,  "parseFloat('0xc')",        0,         parseFloat("0xc"));
+new TestCase( SECTION,  "parseFloat('0xd')",        0,         parseFloat("0xd"));
+new TestCase( SECTION,  "parseFloat('0xe')",        0,         parseFloat("0xe"));
+new TestCase( SECTION,  "parseFloat('0xf')",        0,         parseFloat("0xf"));
+new TestCase( SECTION,  "parseFloat('0xA')",        0,         parseFloat("0xA"));
+new TestCase( SECTION,  "parseFloat('0xB')",        0,         parseFloat("0xB"));
+new TestCase( SECTION,  "parseFloat('0xC')",        0,         parseFloat("0xC"));
+new TestCase( SECTION,  "parseFloat('0xD')",        0,         parseFloat("0xD"));
+new TestCase( SECTION,  "parseFloat('0xE')",        0,         parseFloat("0xE"));
+new TestCase( SECTION,  "parseFloat('0xF')",        0,         parseFloat("0xF"));
+
+new TestCase( SECTION,  "parseFloat('0X0')",        0,         parseFloat("0X0"));
+new TestCase( SECTION,  "parseFloat('0X1')",        0,         parseFloat("0X1"));
+new TestCase( SECTION,  "parseFloat('0X2')",        0,         parseFloat("0X2"));
+new TestCase( SECTION,  "parseFloat('0X3')",        0,         parseFloat("0X3"));
+new TestCase( SECTION,  "parseFloat('0X4')",        0,         parseFloat("0X4"));
+new TestCase( SECTION,  "parseFloat('0X5')",        0,         parseFloat("0X5"));
+new TestCase( SECTION,  "parseFloat('0X6')",        0,         parseFloat("0X6"));
+new TestCase( SECTION,  "parseFloat('0X7')",        0,         parseFloat("0X7"));
+new TestCase( SECTION,  "parseFloat('0X8')",        0,         parseFloat("0X8"));
+new TestCase( SECTION,  "parseFloat('0X9')",        0,         parseFloat("0X9"));
+new TestCase( SECTION,  "parseFloat('0Xa')",        0,         parseFloat("0Xa"));
+new TestCase( SECTION,  "parseFloat('0Xb')",        0,         parseFloat("0Xb"));
+new TestCase( SECTION,  "parseFloat('0Xc')",        0,         parseFloat("0Xc"));
+new TestCase( SECTION,  "parseFloat('0Xd')",        0,         parseFloat("0Xd"));
+new TestCase( SECTION,  "parseFloat('0Xe')",        0,         parseFloat("0Xe"));
+new TestCase( SECTION,  "parseFloat('0Xf')",        0,         parseFloat("0Xf"));
+new TestCase( SECTION,  "parseFloat('0XA')",        0,         parseFloat("0XA"));
+new TestCase( SECTION,  "parseFloat('0XB')",        0,         parseFloat("0XB"));
+new TestCase( SECTION,  "parseFloat('0XC')",        0,         parseFloat("0XC"));
+new TestCase( SECTION,  "parseFloat('0XD')",        0,         parseFloat("0XD"));
+new TestCase( SECTION,  "parseFloat('0XE')",        0,         parseFloat("0XE"));
+new TestCase( SECTION,  "parseFloat('0XF')",        0,         parseFloat("0XF"));
+new TestCase( SECTION,  "parseFloat('  0XF  ')",    0,         parseFloat("  0XF  "));
+
+// hex literals should still succeed
+
+new TestCase( SECTION,  "parseFloat(0x0)",        0,          parseFloat(0x0));
+new TestCase( SECTION,  "parseFloat(0x1)",        1,          parseFloat(0x1));
+new TestCase( SECTION,  "parseFloat(0x2)",        2,          parseFloat(0x2));
+new TestCase( SECTION,  "parseFloat(0x3)",        3,          parseFloat(0x3));
+new TestCase( SECTION,  "parseFloat(0x4)",        4,          parseFloat(0x4));
+new TestCase( SECTION,  "parseFloat(0x5)",        5,          parseFloat(0x5));
+new TestCase( SECTION,  "parseFloat(0x6)",        6,          parseFloat(0x6));
+new TestCase( SECTION,  "parseFloat(0x7)",        7,          parseFloat(0x7));
+new TestCase( SECTION,  "parseFloat(0x8)",        8,          parseFloat(0x8));
+new TestCase( SECTION,  "parseFloat(0x9)",        9,          parseFloat(0x9));
+new TestCase( SECTION,  "parseFloat(0xa)",        10,         parseFloat(0xa));
+new TestCase( SECTION,  "parseFloat(0xb)",        11,         parseFloat(0xb));
+new TestCase( SECTION,  "parseFloat(0xc)",        12,         parseFloat(0xc));
+new TestCase( SECTION,  "parseFloat(0xd)",        13,         parseFloat(0xd));
+new TestCase( SECTION,  "parseFloat(0xe)",        14,         parseFloat(0xe));
+new TestCase( SECTION,  "parseFloat(0xf)",        15,         parseFloat(0xf));
+new TestCase( SECTION,  "parseFloat(0xA)",        10,         parseFloat(0xA));
+new TestCase( SECTION,  "parseFloat(0xB)",        11,         parseFloat(0xB));
+new TestCase( SECTION,  "parseFloat(0xC)",        12,         parseFloat(0xC));
+new TestCase( SECTION,  "parseFloat(0xD)",        13,         parseFloat(0xD));
+new TestCase( SECTION,  "parseFloat(0xE)",        14,         parseFloat(0xE));
+new TestCase( SECTION,  "parseFloat(0xF)",        15,         parseFloat(0xF));
+
+new TestCase( SECTION,  "parseFloat(0X0)",        0,          parseFloat(0X0));
+new TestCase( SECTION,  "parseFloat(0X1)",        1,          parseFloat(0X1));
+new TestCase( SECTION,  "parseFloat(0X2)",        2,          parseFloat(0X2));
+new TestCase( SECTION,  "parseFloat(0X3)",        3,          parseFloat(0X3));
+new TestCase( SECTION,  "parseFloat(0X4)",        4,          parseFloat(0X4));
+new TestCase( SECTION,  "parseFloat(0X5)",        5,          parseFloat(0X5));
+new TestCase( SECTION,  "parseFloat(0X6)",        6,          parseFloat(0X6));
+new TestCase( SECTION,  "parseFloat(0X7)",        7,          parseFloat(0X7));
+new TestCase( SECTION,  "parseFloat(0X8)",        8,          parseFloat(0X8));
+new TestCase( SECTION,  "parseFloat(0X9)",        9,          parseFloat(0X9));
+new TestCase( SECTION,  "parseFloat(0Xa)",        10,         parseFloat(0Xa));
+new TestCase( SECTION,  "parseFloat(0Xb)",        11,         parseFloat(0Xb));
+new TestCase( SECTION,  "parseFloat(0Xc)",        12,         parseFloat(0Xc));
+new TestCase( SECTION,  "parseFloat(0Xd)",        13,         parseFloat(0Xd));
+new TestCase( SECTION,  "parseFloat(0Xe)",        14,         parseFloat(0Xe));
+new TestCase( SECTION,  "parseFloat(0Xf)",        15,         parseFloat(0Xf));
+new TestCase( SECTION,  "parseFloat(0XA)",        10,         parseFloat(0XA));
+new TestCase( SECTION,  "parseFloat(0XB)",        11,         parseFloat(0XB));
+new TestCase( SECTION,  "parseFloat(0XC)",        12,         parseFloat(0XC));
+new TestCase( SECTION,  "parseFloat(0XD)",        13,         parseFloat(0XD));
+new TestCase( SECTION,  "parseFloat(0XE)",        14,         parseFloat(0XE));
+new TestCase( SECTION,  "parseFloat(0XF)",        15,         parseFloat(0XF));
+
+
+// A StringNumericLiteral may not use octal notation
+
+new TestCase( SECTION,  "parseFloat('00')",        0,         parseFloat("00"));
+new TestCase( SECTION,  "parseFloat('01')",        1,         parseFloat("01"));
+new TestCase( SECTION,  "parseFloat('02')",        2,         parseFloat("02"));
+new TestCase( SECTION,  "parseFloat('03')",        3,         parseFloat("03"));
+new TestCase( SECTION,  "parseFloat('04')",        4,         parseFloat("04"));
+new TestCase( SECTION,  "parseFloat('05')",        5,         parseFloat("05"));
+new TestCase( SECTION,  "parseFloat('06')",        6,         parseFloat("06"));
+new TestCase( SECTION,  "parseFloat('07')",        7,         parseFloat("07"));
+new TestCase( SECTION,  "parseFloat('010')",       10,        parseFloat("010"));
+new TestCase( SECTION,  "parseFloat('011')",       11,        parseFloat("011"));
+
+// A StringNumericLIteral may have any number of leading 0 digits
+
+new TestCase( SECTION,  "parseFloat('001')",        1,         parseFloat("001"));
+new TestCase( SECTION,  "parseFloat('0001')",       1,         parseFloat("0001"));
+new TestCase( SECTION,  "parseFloat('  0001  ')",       1,         parseFloat("  0001  "));
+
+// an octal numeric literal should be treated as an octal
+
+new TestCase( SECTION,  "parseFloat(00)",        0,         parseFloat(00));
+new TestCase( SECTION,  "parseFloat(01)",        1,         parseFloat(01));
+new TestCase( SECTION,  "parseFloat(02)",        2,         parseFloat(02));
+new TestCase( SECTION,  "parseFloat(03)",        3,         parseFloat(03));
+new TestCase( SECTION,  "parseFloat(04)",        4,         parseFloat(04));
+new TestCase( SECTION,  "parseFloat(05)",        5,         parseFloat(05));
+new TestCase( SECTION,  "parseFloat(06)",        6,         parseFloat(06));
+new TestCase( SECTION,  "parseFloat(07)",        7,         parseFloat(07));
+new TestCase( SECTION,  "parseFloat(010)",       8,        parseFloat(010));
+new TestCase( SECTION,  "parseFloat(011)",       9,        parseFloat(011));
+
+// A StringNumericLIteral may have any number of leading 0 digits
+
+new TestCase( SECTION,  "parseFloat(001)",        1,         parseFloat(001));
+new TestCase( SECTION,  "parseFloat(0001)",       1,         parseFloat(0001));
+
+// make sure it's reflexive
+new TestCase( SECTION,  "parseFloat(Math.PI)",      Math.PI,        parseFloat(Math.PI));
+new TestCase( SECTION,  "parseFloat(Math.LN2)",     Math.LN2,       parseFloat(Math.LN2));
+new TestCase( SECTION,  "parseFloat(Math.LN10)",    Math.LN10,      parseFloat(Math.LN10));
+new TestCase( SECTION,  "parseFloat(Math.LOG2E)",   Math.LOG2E,     parseFloat(Math.LOG2E));
+new TestCase( SECTION,  "parseFloat(Math.LOG10E)",  Math.LOG10E,    parseFloat(Math.LOG10E));
+new TestCase( SECTION,  "parseFloat(Math.SQRT2)",   Math.SQRT2,     parseFloat(Math.SQRT2));
+new TestCase( SECTION,  "parseFloat(Math.SQRT1_2)", Math.SQRT1_2,   parseFloat(Math.SQRT1_2));
+
+new TestCase( SECTION,  "parseFloat(Math.PI+'')",      Math.PI,        parseFloat(Math.PI+''));
+new TestCase( SECTION,  "parseFloat(Math.LN2+'')",     Math.LN2,       parseFloat(Math.LN2+''));
+new TestCase( SECTION,  "parseFloat(Math.LN10+'')",    Math.LN10,      parseFloat(Math.LN10+''));
+new TestCase( SECTION,  "parseFloat(Math.LOG2E+'')",   Math.LOG2E,     parseFloat(Math.LOG2E+''));
+new TestCase( SECTION,  "parseFloat(Math.LOG10E+'')",  Math.LOG10E,    parseFloat(Math.LOG10E+''));
+new TestCase( SECTION,  "parseFloat(Math.SQRT2+'')",   Math.SQRT2,     parseFloat(Math.SQRT2+''));
+new TestCase( SECTION,  "parseFloat(Math.SQRT1_2+'')", Math.SQRT1_2,   parseFloat(Math.SQRT1_2+''));
+
+test();
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.3-2.js b/js/src/tests/ecma/GlobalObject/15.1.2.3-2.js
new file mode 100644
index 000000000..456c18aa9
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.3-2.js
@@ -0,0 +1,257 @@
+/* -*- 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:          15.1.2.3-2.js
+   ECMA Section:       15.1.2.3 Function properties of the global object:
+   parseFloat( string )
+
+   Description:        The parseFloat function produces a number value dictated
+   by the interpretation of the contents of the string
+   argument defined as a decimal literal.
+
+   When the parseFloat function is called, the following
+   steps are taken:
+
+   1.  Call ToString( string ).
+   2.  Remove leading whitespace Result(1).
+   3.  If neither Result(2) nor any prefix of Result(2)
+   satisfies the syntax of a StrDecimalLiteral,
+   return NaN.
+   4.  Compute the longest prefix of Result(2) which might
+   be Resusult(2) itself, that satisfies the syntax of
+   a StrDecimalLiteral
+   5.  Return the number value for the MV of Result(4).
+
+   Note that parseFloate may interpret only a leading
+   portion of the string as a number value; it ignores any
+   characters that cannot be interpreted as part of the
+   notation of a decimal literal, and no indication is given
+   that such characters were ignored.
+
+   StrDecimalLiteral::
+   Infinity
+   DecimalDigits.DecimalDigits opt ExponentPart opt
+   .DecimalDigits ExponentPart opt
+   DecimalDigits ExponentPart opt
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.1.2.3-2";
+var VERSION = "ECMA_1";
+startTest();
+
+var BUGNUMBER="none";
+
+new TestCase( SECTION, "parseFloat(true)",      Number.NaN,     parseFloat(true) );
+new TestCase( SECTION, "parseFloat(false)",     Number.NaN,     parseFloat(false) );
+new TestCase( SECTION, "parseFloat('string')",  Number.NaN,     parseFloat("string") );
+
+new TestCase( SECTION, "parseFloat('     Infinity')",      Number.POSITIVE_INFINITY,    parseFloat("Infinity") );
+//     new TestCase( SECTION, "parseFloat(Infinity)",      Number.POSITIVE_INFINITY,    parseFloat(Infinity) );
+
+new TestCase( SECTION,  "parseFloat('          0')",          0,          parseFloat("          0") );
+new TestCase( SECTION,  "parseFloat('          -0')",         -0,         parseFloat("          -0") );
+new TestCase( SECTION,  "parseFloat('          +0')",          0,         parseFloat("          +0") );
+
+new TestCase( SECTION,  "parseFloat('          1')",          1,          parseFloat("          1") );
+new TestCase( SECTION,  "parseFloat('          -1')",         -1,         parseFloat("          -1") );
+new TestCase( SECTION,  "parseFloat('          +1')",          1,         parseFloat("          +1") );
+
+new TestCase( SECTION,  "parseFloat('          2')",          2,          parseFloat("          2") );
+new TestCase( SECTION,  "parseFloat('          -2')",         -2,         parseFloat("          -2") );
+new TestCase( SECTION,  "parseFloat('          +2')",          2,         parseFloat("          +2") );
+
+new TestCase( SECTION,  "parseFloat('          3')",          3,          parseFloat("          3") );
+new TestCase( SECTION,  "parseFloat('          -3')",         -3,         parseFloat("          -3") );
+new TestCase( SECTION,  "parseFloat('          +3')",          3,         parseFloat("          +3") );
+
+new TestCase( SECTION,  "parseFloat('          4')",          4,          parseFloat("          4") );
+new TestCase( SECTION,  "parseFloat('          -4')",         -4,         parseFloat("          -4") );
+new TestCase( SECTION,  "parseFloat('          +4')",          4,         parseFloat("          +4") );
+
+new TestCase( SECTION,  "parseFloat('          5')",          5,          parseFloat("          5") );
+new TestCase( SECTION,  "parseFloat('          -5')",         -5,         parseFloat("          -5") );
+new TestCase( SECTION,  "parseFloat('          +5')",          5,         parseFloat("          +5") );
+
+new TestCase( SECTION,  "parseFloat('          6')",          6,          parseFloat("          6") );
+new TestCase( SECTION,  "parseFloat('          -6')",         -6,         parseFloat("          -6") );
+new TestCase( SECTION,  "parseFloat('          +6')",          6,         parseFloat("          +6") );
+
+new TestCase( SECTION,  "parseFloat('          7')",          7,          parseFloat("          7") );
+new TestCase( SECTION,  "parseFloat('          -7')",         -7,         parseFloat("          -7") );
+new TestCase( SECTION,  "parseFloat('          +7')",          7,         parseFloat("          +7") );
+
+new TestCase( SECTION,  "parseFloat('          8')",          8,          parseFloat("          8") );
+new TestCase( SECTION,  "parseFloat('          -8')",         -8,         parseFloat("          -8") );
+new TestCase( SECTION,  "parseFloat('          +8')",          8,         parseFloat("          +8") );
+
+new TestCase( SECTION,  "parseFloat('          9')",          9,          parseFloat("          9") );
+new TestCase( SECTION,  "parseFloat('          -9')",         -9,         parseFloat("          -9") );
+new TestCase( SECTION,  "parseFloat('          +9')",          9,         parseFloat("          +9") );
+
+new TestCase( SECTION,  "parseFloat('          3.14159')",    3.14159,    parseFloat("          3.14159") );
+new TestCase( SECTION,  "parseFloat('          -3.14159')",   -3.14159,   parseFloat("          -3.14159") );
+new TestCase( SECTION,  "parseFloat('          +3.14159')",   3.14159,    parseFloat("          +3.14159") );
+
+new TestCase( SECTION,  "parseFloat('          3.')",         3,          parseFloat("          3.") );
+new TestCase( SECTION,  "parseFloat('          -3.')",        -3,         parseFloat("          -3.") );
+new TestCase( SECTION,  "parseFloat('          +3.')",        3,          parseFloat("          +3.") );
+
+new TestCase( SECTION,  "parseFloat('          3.e1')",       30,         parseFloat("          3.e1") );
+new TestCase( SECTION,  "parseFloat('          -3.e1')",      -30,        parseFloat("          -3.e1") );
+new TestCase( SECTION,  "parseFloat('          +3.e1')",      30,         parseFloat("          +3.e1") );
+
+new TestCase( SECTION,  "parseFloat('          3.e+1')",       30,         parseFloat("          3.e+1") );
+new TestCase( SECTION,  "parseFloat('          -3.e+1')",      -30,        parseFloat("          -3.e+1") );
+new TestCase( SECTION,  "parseFloat('          +3.e+1')",      30,         parseFloat("          +3.e+1") );
+
+new TestCase( SECTION,  "parseFloat('          3.e-1')",       .30,         parseFloat("          3.e-1") );
+new TestCase( SECTION,  "parseFloat('          -3.e-1')",      -.30,        parseFloat("          -3.e-1") );
+new TestCase( SECTION,  "parseFloat('          +3.e-1')",      .30,         parseFloat("          +3.e-1") );
+
+// StrDecimalLiteral:::  .DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "parseFloat('          .00001')",     0.00001,    parseFloat("          .00001") );
+new TestCase( SECTION,  "parseFloat('          +.00001')",    0.00001,    parseFloat("          +.00001") );
+new TestCase( SECTION,  "parseFloat('          -0.0001')",    -0.00001,   parseFloat("          -.00001") );
+
+new TestCase( SECTION,  "parseFloat('          .01e2')",      1,          parseFloat("          .01e2") );
+new TestCase( SECTION,  "parseFloat('          +.01e2')",     1,          parseFloat("          +.01e2") );
+new TestCase( SECTION,  "parseFloat('          -.01e2')",     -1,         parseFloat("          -.01e2") );
+
+new TestCase( SECTION,  "parseFloat('          .01e+2')",      1,         parseFloat("          .01e+2") );
+new TestCase( SECTION,  "parseFloat('          +.01e+2')",     1,         parseFloat("          +.01e+2") );
+new TestCase( SECTION,  "parseFloat('          -.01e+2')",     -1,        parseFloat("          -.01e+2") );
+
+new TestCase( SECTION,  "parseFloat('          .01e-2')",      0.0001,    parseFloat("          .01e-2") );
+new TestCase( SECTION,  "parseFloat('          +.01e-2')",     0.0001,    parseFloat("          +.01e-2") );
+new TestCase( SECTION,  "parseFloat('          -.01e-2')",     -0.0001,   parseFloat("          -.01e-2") );
+
+//  StrDecimalLiteral:::    DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "parseFloat('          1234e5')",     123400000,  parseFloat("          1234e5") );
+new TestCase( SECTION,  "parseFloat('          +1234e5')",    123400000,  parseFloat("          +1234e5") );
+new TestCase( SECTION,  "parseFloat('          -1234e5')",    -123400000, parseFloat("          -1234e5") );
+
+new TestCase( SECTION,  "parseFloat('          1234e+5')",    123400000,  parseFloat("          1234e+5") );
+new TestCase( SECTION,  "parseFloat('          +1234e+5')",   123400000,  parseFloat("          +1234e+5") );
+new TestCase( SECTION,  "parseFloat('          -1234e+5')",   -123400000, parseFloat("          -1234e+5") );
+
+new TestCase( SECTION,  "parseFloat('          1234e-5')",     0.01234,  parseFloat("          1234e-5") );
+new TestCase( SECTION,  "parseFloat('          +1234e-5')",    0.01234,  parseFloat("          +1234e-5") );
+new TestCase( SECTION,  "parseFloat('          -1234e-5')",    -0.01234, parseFloat("          -1234e-5") );
+
+
+new TestCase( SECTION,  "parseFloat('          .01E2')",      1,          parseFloat("          .01E2") );
+new TestCase( SECTION,  "parseFloat('          +.01E2')",     1,          parseFloat("          +.01E2") );
+new TestCase( SECTION,  "parseFloat('          -.01E2')",     -1,         parseFloat("          -.01E2") );
+
+new TestCase( SECTION,  "parseFloat('          .01E+2')",      1,         parseFloat("          .01E+2") );
+new TestCase( SECTION,  "parseFloat('          +.01E+2')",     1,         parseFloat("          +.01E+2") );
+new TestCase( SECTION,  "parseFloat('          -.01E+2')",     -1,        parseFloat("          -.01E+2") );
+
+new TestCase( SECTION,  "parseFloat('          .01E-2')",      0.0001,    parseFloat("          .01E-2") );
+new TestCase( SECTION,  "parseFloat('          +.01E-2')",     0.0001,    parseFloat("          +.01E-2") );
+new TestCase( SECTION,  "parseFloat('          -.01E-2')",     -0.0001,   parseFloat("          -.01E-2") );
+
+//  StrDecimalLiteral:::    DecimalDigits ExponentPart opt
+new TestCase( SECTION,  "parseFloat('          1234E5')",     123400000,  parseFloat("          1234E5") );
+new TestCase( SECTION,  "parseFloat('          +1234E5')",    123400000,  parseFloat("          +1234E5") );
+new TestCase( SECTION,  "parseFloat('          -1234E5')",    -123400000, parseFloat("          -1234E5") );
+
+new TestCase( SECTION,  "parseFloat('          1234E+5')",    123400000,  parseFloat("          1234E+5") );
+new TestCase( SECTION,  "parseFloat('          +1234E+5')",   123400000,  parseFloat("          +1234E+5") );
+new TestCase( SECTION,  "parseFloat('          -1234E+5')",   -123400000, parseFloat("          -1234E+5") );
+
+new TestCase( SECTION,  "parseFloat('          1234E-5')",     0.01234,  parseFloat("          1234E-5") );
+new TestCase( SECTION,  "parseFloat('          +1234E-5')",    0.01234,  parseFloat("          +1234E-5") );
+new TestCase( SECTION,  "parseFloat('          -1234E-5')",    -0.01234, parseFloat("          -1234E-5") );
+
+
+// hex cases should all return NaN
+
+new TestCase( SECTION,  "parseFloat('          0x0')",        0,         parseFloat("          0x0"));
+new TestCase( SECTION,  "parseFloat('          0x1')",        0,         parseFloat("          0x1"));
+new TestCase( SECTION,  "parseFloat('          0x2')",        0,         parseFloat("          0x2"));
+new TestCase( SECTION,  "parseFloat('          0x3')",        0,         parseFloat("          0x3"));
+new TestCase( SECTION,  "parseFloat('          0x4')",        0,         parseFloat("          0x4"));
+new TestCase( SECTION,  "parseFloat('          0x5')",        0,         parseFloat("          0x5"));
+new TestCase( SECTION,  "parseFloat('          0x6')",        0,         parseFloat("          0x6"));
+new TestCase( SECTION,  "parseFloat('          0x7')",        0,         parseFloat("          0x7"));
+new TestCase( SECTION,  "parseFloat('          0x8')",        0,         parseFloat("          0x8"));
+new TestCase( SECTION,  "parseFloat('          0x9')",        0,         parseFloat("          0x9"));
+new TestCase( SECTION,  "parseFloat('          0xa')",        0,         parseFloat("          0xa"));
+new TestCase( SECTION,  "parseFloat('          0xb')",        0,         parseFloat("          0xb"));
+new TestCase( SECTION,  "parseFloat('          0xc')",        0,         parseFloat("          0xc"));
+new TestCase( SECTION,  "parseFloat('          0xd')",        0,         parseFloat("          0xd"));
+new TestCase( SECTION,  "parseFloat('          0xe')",        0,         parseFloat("          0xe"));
+new TestCase( SECTION,  "parseFloat('          0xf')",        0,         parseFloat("          0xf"));
+new TestCase( SECTION,  "parseFloat('          0xA')",        0,         parseFloat("          0xA"));
+new TestCase( SECTION,  "parseFloat('          0xB')",        0,         parseFloat("          0xB"));
+new TestCase( SECTION,  "parseFloat('          0xC')",        0,         parseFloat("          0xC"));
+new TestCase( SECTION,  "parseFloat('          0xD')",        0,         parseFloat("          0xD"));
+new TestCase( SECTION,  "parseFloat('          0xE')",        0,         parseFloat("          0xE"));
+new TestCase( SECTION,  "parseFloat('          0xF')",        0,         parseFloat("          0xF"));
+
+new TestCase( SECTION,  "parseFloat('          0X0')",        0,         parseFloat("          0X0"));
+new TestCase( SECTION,  "parseFloat('          0X1')",        0,         parseFloat("          0X1"));
+new TestCase( SECTION,  "parseFloat('          0X2')",        0,         parseFloat("          0X2"));
+new TestCase( SECTION,  "parseFloat('          0X3')",        0,         parseFloat("          0X3"));
+new TestCase( SECTION,  "parseFloat('          0X4')",        0,         parseFloat("          0X4"));
+new TestCase( SECTION,  "parseFloat('          0X5')",        0,         parseFloat("          0X5"));
+new TestCase( SECTION,  "parseFloat('          0X6')",        0,         parseFloat("          0X6"));
+new TestCase( SECTION,  "parseFloat('          0X7')",        0,         parseFloat("          0X7"));
+new TestCase( SECTION,  "parseFloat('          0X8')",        0,         parseFloat("          0X8"));
+new TestCase( SECTION,  "parseFloat('          0X9')",        0,         parseFloat("          0X9"));
+new TestCase( SECTION,  "parseFloat('          0Xa')",        0,         parseFloat("          0Xa"));
+new TestCase( SECTION,  "parseFloat('          0Xb')",        0,         parseFloat("          0Xb"));
+new TestCase( SECTION,  "parseFloat('          0Xc')",        0,         parseFloat("          0Xc"));
+new TestCase( SECTION,  "parseFloat('          0Xd')",        0,         parseFloat("          0Xd"));
+new TestCase( SECTION,  "parseFloat('          0Xe')",        0,         parseFloat("          0Xe"));
+new TestCase( SECTION,  "parseFloat('          0Xf')",        0,         parseFloat("          0Xf"));
+new TestCase( SECTION,  "parseFloat('          0XA')",        0,         parseFloat("          0XA"));
+new TestCase( SECTION,  "parseFloat('          0XB')",        0,         parseFloat("          0XB"));
+new TestCase( SECTION,  "parseFloat('          0XC')",        0,         parseFloat("          0XC"));
+new TestCase( SECTION,  "parseFloat('          0XD')",        0,         parseFloat("          0XD"));
+new TestCase( SECTION,  "parseFloat('          0XE')",        0,         parseFloat("          0XE"));
+new TestCase( SECTION,  "parseFloat('          0XF')",        0,         parseFloat("          0XF"));
+
+// A StringNumericLiteral may not use octal notation
+
+new TestCase( SECTION,  "parseFloat('          00')",        0,         parseFloat("          00"));
+new TestCase( SECTION,  "parseFloat('          01')",        1,         parseFloat("          01"));
+new TestCase( SECTION,  "parseFloat('          02')",        2,         parseFloat("          02"));
+new TestCase( SECTION,  "parseFloat('          03')",        3,         parseFloat("          03"));
+new TestCase( SECTION,  "parseFloat('          04')",        4,         parseFloat("          04"));
+new TestCase( SECTION,  "parseFloat('          05')",        5,         parseFloat("          05"));
+new TestCase( SECTION,  "parseFloat('          06')",        6,         parseFloat("          06"));
+new TestCase( SECTION,  "parseFloat('          07')",        7,         parseFloat("          07"));
+new TestCase( SECTION,  "parseFloat('          010')",       10,        parseFloat("          010"));
+new TestCase( SECTION,  "parseFloat('          011')",       11,        parseFloat("          011"));
+
+// A StringNumericLIteral may have any number of leading 0 digits
+
+new TestCase( SECTION,  "parseFloat('          001')",        1,         parseFloat("          001"));
+new TestCase( SECTION,  "parseFloat('          0001')",       1,         parseFloat("          0001"));
+
+// A StringNumericLIteral may have any number of leading 0 digits
+
+new TestCase( SECTION,  "parseFloat(001)",        1,         parseFloat(001));
+new TestCase( SECTION,  "parseFloat(0001)",       1,         parseFloat(0001));
+
+// make sure it'          s reflexive
+new TestCase( SECTION,  "parseFloat( '                    '          +Math.PI+'          ')",      Math.PI,        parseFloat( '                    '          +Math.PI+'          '));
+new TestCase( SECTION,  "parseFloat( '                    '          +Math.LN2+'          ')",     Math.LN2,       parseFloat( '                    '          +Math.LN2+'          '));
+new TestCase( SECTION,  "parseFloat( '                    '          +Math.LN10+'          ')",    Math.LN10,      parseFloat( '                    '          +Math.LN10+'          '));
+new TestCase( SECTION,  "parseFloat( '                    '          +Math.LOG2E+'          ')",   Math.LOG2E,     parseFloat( '                    '          +Math.LOG2E+'          '));
+new TestCase( SECTION,  "parseFloat( '                    '          +Math.LOG10E+'          ')",  Math.LOG10E,    parseFloat( '                    '          +Math.LOG10E+'          '));
+new TestCase( SECTION,  "parseFloat( '                    '          +Math.SQRT2+'          ')",   Math.SQRT2,     parseFloat( '                    '          +Math.SQRT2+'          '));
+new TestCase( SECTION,  "parseFloat( '                    '          +Math.SQRT1_2+'          ')", Math.SQRT1_2,   parseFloat( '                    '          +Math.SQRT1_2+'          '));
+
+test();
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.4.js b/js/src/tests/ecma/GlobalObject/15.1.2.4.js
new file mode 100644
index 000000000..f74622edf
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.4.js
@@ -0,0 +1,169 @@
+/* -*- tab-width: 2; 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:          15.1.2.4.js
+   ECMA Section:       15.1.2.4  Function properties of the global object
+   escape( string )
+
+   Description:
+   The escape function computes a new version of a string value in which
+   certain characters have been replaced by a hexadecimal escape sequence.
+   The result thus contains no special characters that might have special
+   meaning within a URL.
+
+   For characters whose Unicode encoding is 0xFF or less, a two-digit
+   escape sequence of the form %xx is used in accordance with RFC1738.
+   For characters whose Unicode encoding is greater than 0xFF, a four-
+   digit escape sequence of the form %uxxxx is used.
+
+   When the escape function is called with one argument string, the
+   following steps are taken:
+
+   1.  Call ToString(string).
+   2.  Compute the number of characters in Result(1).
+   3.  Let R be the empty string.
+   4.  Let k be 0.
+   5.  If k equals Result(2), return R.
+   6.  Get the character at position k within Result(1).
+   7.  If Result(6) is one of the 69 nonblank ASCII characters
+   ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz
+   0123456789 @*_+-./, go to step 14.
+   8.  Compute the 16-bit unsigned integer that is the Unicode character
+   encoding of Result(6).
+   9.  If Result(8), is less than 256, go to step 12.
+   10.  Let S be a string containing six characters "%uwxyz" where wxyz are
+   four hexadecimal digits encoding the value of Result(8).
+   11.  Go to step 15.
+   12.  Let S be a string containing three characters "%xy" where xy are two
+   hexadecimal digits encoding the value of Result(8).
+   13.  Go to step 15.
+   14.  Let S be a string containing the single character Result(6).
+   15.  Let R be a new string value computed by concatenating the previous value
+   of R and S.
+   16.  Increase k by 1.
+   17.  Go to step 5.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.1.2.4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "escape(string)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "escape.length",         1,          escape.length );
+new TestCase( SECTION, "escape.length = null; escape.length",   1,  eval("escape.length = null; escape.length") );
+new TestCase( SECTION, "var MYPROPS=''; for ( var p in escape ) { MYPROPS+= p}; MYPROPS",    "",    eval("var MYPROPS=''; for ( var p in escape ) { MYPROPS+= p}; MYPROPS") );
+
+new TestCase( SECTION, "escape()",              "undefined",    escape() );
+new TestCase( SECTION, "escape('')",            "",             escape('') );
+new TestCase( SECTION, "escape( null )",        "null",         escape(null) );
+new TestCase( SECTION, "escape( void 0 )",      "undefined",    escape(void 0) );
+new TestCase( SECTION, "escape( true )",        "true",         escape( true ) );
+new TestCase( SECTION, "escape( false )",       "false",        escape( false ) );
+
+new TestCase( SECTION, "escape( new Boolean(true) )",   "true", escape(new Boolean(true)) );
+new TestCase( SECTION, "escape( new Boolean(false) )",  "false",    escape(new Boolean(false)) );
+
+new TestCase( SECTION, "escape( Number.NaN  )",                 "NaN",      escape(Number.NaN) );
+new TestCase( SECTION, "escape( -0 )",                          "0",        escape( -0 ) );
+new TestCase( SECTION, "escape( 'Infinity' )",                  "Infinity", escape( "Infinity" ) );
+new TestCase( SECTION, "escape( Number.POSITIVE_INFINITY )",    "Infinity", escape( Number.POSITIVE_INFINITY ) );
+new TestCase( SECTION, "escape( Number.NEGATIVE_INFINITY )",    "-Infinity", escape( Number.NEGATIVE_INFINITY ) );
+
+var ASCII_TEST_STRING = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789@*_+-./";
+
+new TestCase( SECTION, "escape( " +ASCII_TEST_STRING+" )",    ASCII_TEST_STRING,  escape( ASCII_TEST_STRING ) );
+
+// ASCII value less than
+
+for ( var CHARCODE = 0; CHARCODE < 32; CHARCODE++ ) {
+  new TestCase( SECTION,
+		"escape(String.fromCharCode("+CHARCODE+"))",
+		"%"+ToHexString(CHARCODE),
+		escape(String.fromCharCode(CHARCODE))  );
+}
+for ( var CHARCODE = 128; CHARCODE < 256; CHARCODE++ ) {
+  new TestCase( SECTION,
+		"escape(String.fromCharCode("+CHARCODE+"))",
+		"%"+ToHexString(CHARCODE),
+		escape(String.fromCharCode(CHARCODE))  );
+}
+
+for ( var CHARCODE = 256; CHARCODE < 1024; CHARCODE++ ) {
+  new TestCase( SECTION,
+		"escape(String.fromCharCode("+CHARCODE+"))",
+		"%u"+ ToUnicodeString(CHARCODE),
+		escape(String.fromCharCode(CHARCODE))  );
+}
+for ( var CHARCODE = 65500; CHARCODE < 65536; CHARCODE++ ) {
+  new TestCase( SECTION,
+		"escape(String.fromCharCode("+CHARCODE+"))",
+		"%u"+ ToUnicodeString(CHARCODE),
+		escape(String.fromCharCode(CHARCODE))  );
+}
+
+test();
+
+function ToUnicodeString( n ) {
+  var string = ToHexString(n);
+
+  for ( var PAD = (4 - string.length ); PAD > 0; PAD-- ) {
+    string = "0" + string;
+  }
+
+  return string;
+}
+function ToHexString( n ) {
+  var hex = new Array();
+
+  for ( var mag = 1; Math.pow(16,mag) <= n ; mag++ ) {
+    ;
+  }
+
+  for ( index = 0, mag -= 1; mag > 0; index++, mag-- ) {
+    hex[index] = Math.floor( n / Math.pow(16,mag) );
+    n -= Math.pow(16,mag) * Math.floor( n/Math.pow(16,mag) );
+  }
+
+  hex[hex.length] = n % 16;
+
+  var string ="";
+
+  for ( var index = 0 ; index < hex.length ; index++ ) {
+    switch ( hex[index] ) {
+    case 10:
+      string += "A";
+      break;
+    case 11:
+      string += "B";
+      break;
+    case 12:
+      string += "C";
+      break;
+    case 13:
+      string += "D";
+      break;
+    case 14:
+      string += "E";
+      break;
+    case 15:
+      string += "F";
+      break;
+    default:
+      string += hex[index];
+    }
+  }
+
+  if ( string.length == 1 ) {
+    string = "0" + string;
+  }
+  return string;
+}
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.5-1.js b/js/src/tests/ecma/GlobalObject/15.1.2.5-1.js
new file mode 100644
index 000000000..3eccdfe88
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.5-1.js
@@ -0,0 +1,170 @@
+/* -*- tab-width: 2; 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:          15.1.2.5-1.js
+   ECMA Section:       15.1.2.5  Function properties of the global object
+   unescape( string )
+
+   Description:
+   The unescape function computes a new version of a string value in which
+   each escape sequences of the sort that might be introduced by the escape
+   function is replaced with the character that it represents.
+
+   When the unescape function is called with one argument string, the
+   following steps are taken:
+
+   1.  Call ToString(string).
+   2.  Compute the number of characters in Result(1).
+   3.  Let R be the empty string.
+   4.  Let k be 0.
+   5.  If k equals Result(2), return R.
+   6.  Let c be the character at position k within Result(1).
+   7.  If c is not %, go to step 18.
+   8.  If k is greater than Result(2)-6, go to step 14.
+   9.  If the character at position k+1 within result(1) is not u, go to step
+   14.
+   10. If the four characters at positions k+2, k+3, k+4, and k+5 within
+   Result(1) are not all hexadecimal digits, go to step 14.
+   11. Let c be the character whose Unicode encoding is the integer represented
+   by the four hexadecimal digits at positions k+2, k+3, k+4, and k+5
+   within Result(1).
+   12. Increase k by 5.
+   13. Go to step 18.
+   14. If k is greater than Result(2)-3, go to step 18.
+   15. If the two characters at positions k+1 and k+2 within Result(1) are not
+   both hexadecimal digits, go to step 18.
+   16. Let c be the character whose Unicode encoding is the integer represented
+   by two zeroes plus the two hexadecimal digits at positions k+1 and k+2
+   within Result(1).
+   17. Increase k by 2.
+   18. Let R be a new string value computed by concatenating the previous value
+   of R and c.
+   19. Increase k by 1.
+   20. Go to step 5.
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+*/
+
+var SECTION = "15.1.2.5-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "unescape(string)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "unescape.length",       1,               unescape.length );
+new TestCase( SECTION, "unescape.length = null; unescape.length",   1,      eval("unescape.length=null; unescape.length") );
+new TestCase( SECTION, "var MYPROPS=''; for ( var p in unescape ) { MYPROPS+= p }; MYPROPS",    "", eval("var MYPROPS=''; for ( var p in unescape ) { MYPROPS+= p }; MYPROPS") );
+
+new TestCase( SECTION, "unescape()",              "undefined",    unescape() );
+new TestCase( SECTION, "unescape('')",            "",             unescape('') );
+new TestCase( SECTION, "unescape( null )",        "null",         unescape(null) );
+new TestCase( SECTION, "unescape( void 0 )",      "undefined",    unescape(void 0) );
+new TestCase( SECTION, "unescape( true )",        "true",         unescape( true ) );
+new TestCase( SECTION, "unescape( false )",       "false",        unescape( false ) );
+
+new TestCase( SECTION, "unescape( new Boolean(true) )",   "true", unescape(new Boolean(true)) );
+new TestCase( SECTION, "unescape( new Boolean(false) )",  "false",    unescape(new Boolean(false)) );
+
+new TestCase( SECTION, "unescape( Number.NaN  )",                 "NaN",      unescape(Number.NaN) );
+new TestCase( SECTION, "unescape( -0 )",                          "0",        unescape( -0 ) );
+new TestCase( SECTION, "unescape( 'Infinity' )",                  "Infinity", unescape( "Infinity" ) );
+new TestCase( SECTION, "unescape( Number.POSITIVE_INFINITY )",    "Infinity", unescape( Number.POSITIVE_INFINITY ) );
+new TestCase( SECTION, "unescape( Number.NEGATIVE_INFINITY )",    "-Infinity", unescape( Number.NEGATIVE_INFINITY ) );
+
+var ASCII_TEST_STRING = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789@*_+-./";
+
+new TestCase( SECTION, "unescape( " +ASCII_TEST_STRING+" )",    ASCII_TEST_STRING,  unescape( ASCII_TEST_STRING ) );
+
+// escaped chars with ascii values less than 256
+
+for ( var CHARCODE = 0; CHARCODE < 256; CHARCODE++ ) {
+  new TestCase( SECTION,
+		"unescape( %"+ ToHexString(CHARCODE)+" )",
+		String.fromCharCode(CHARCODE),
+		unescape( "%" + ToHexString(CHARCODE) )  );
+}
+
+// unicode chars represented by two hex digits
+for ( var CHARCODE = 0; CHARCODE < 256; CHARCODE++ ) {
+  new TestCase( SECTION,
+		"unescape( %u"+ ToHexString(CHARCODE)+" )",
+		"%u"+ToHexString(CHARCODE),
+		unescape( "%u" + ToHexString(CHARCODE) )  );
+}
+/*
+  for ( var CHARCODE = 0; CHARCODE < 256; CHARCODE++ ) {
+  new TestCase( SECTION,
+  "unescape( %u"+ ToUnicodeString(CHARCODE)+" )",
+  String.fromCharCode(CHARCODE),
+  unescape( "%u" + ToUnicodeString(CHARCODE) )  );
+  }
+  for ( var CHARCODE = 256; CHARCODE < 65536; CHARCODE+= 333 ) {
+  new TestCase( SECTION,
+  "unescape( %u"+ ToUnicodeString(CHARCODE)+" )",
+  String.fromCharCode(CHARCODE),
+  unescape( "%u" + ToUnicodeString(CHARCODE) )  );
+  }
+*/
+
+test();
+
+function ToUnicodeString( n ) {
+  var string = ToHexString(n);
+
+  for ( var PAD = (4 - string.length ); PAD > 0; PAD-- ) {
+    string = "0" + string;
+  }
+
+  return string;
+}
+function ToHexString( n ) {
+  var hex = new Array();
+
+  for ( var mag = 1; Math.pow(16,mag) <= n ; mag++ ) {
+    ;
+  }
+
+  for ( index = 0, mag -= 1; mag > 0; index++, mag-- ) {
+    hex[index] = Math.floor( n / Math.pow(16,mag) );
+    n -= Math.pow(16,mag) * Math.floor( n/Math.pow(16,mag) );
+  }
+
+  hex[hex.length] = n % 16;
+
+  var string ="";
+
+  for ( var index = 0 ; index < hex.length ; index++ ) {
+    switch ( hex[index] ) {
+    case 10:
+      string += "A";
+      break;
+    case 11:
+      string += "B";
+      break;
+    case 12:
+      string += "C";
+      break;
+    case 13:
+      string += "D";
+      break;
+    case 14:
+      string += "E";
+      break;
+    case 15:
+      string += "F";
+      break;
+    default:
+      string += hex[index];
+    }
+  }
+
+  if ( string.length == 1 ) {
+    string = "0" + string;
+  }
+  return string;
+}
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.5-2.js b/js/src/tests/ecma/GlobalObject/15.1.2.5-2.js
new file mode 100644
index 000000000..5aa2a36a3
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.5-2.js
@@ -0,0 +1,149 @@
+/* -*- tab-width: 2; 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:          15.1.2.5-2.js
+   ECMA Section:       15.1.2.5  Function properties of the global object
+   unescape( string )
+   Description:
+
+   This tests the cases where there are fewer than 4 characters following "%u",
+   or fewer than 2 characters following "%" or "%u".
+
+   The unescape function computes a new version of a string value in which
+   each escape sequences of the sort that might be introduced by the escape
+   function is replaced with the character that it represents.
+
+   When the unescape function is called with one argument string, the
+   following steps are taken:
+
+   1.  Call ToString(string).
+   2.  Compute the number of characters in Result(1).
+   3.  Let R be the empty string.
+   4.  Let k be 0.
+   5.  If k equals Result(2), return R.
+   6.  Let c be the character at position k within Result(1).
+   7.  If c is not %, go to step 18.
+   8.  If k is greater than Result(2)-6, go to step 14.
+   9.  If the character at position k+1 within result(1) is not u, go to step
+   14.
+   10. If the four characters at positions k+2, k+3, k+4, and k+5 within
+   Result(1) are not all hexadecimal digits, go to step 14.
+   11. Let c be the character whose Unicode encoding is the integer represented
+   by the four hexadecimal digits at positions k+2, k+3, k+4, and k+5
+   within Result(1).
+   12. Increase k by 5.
+   13. Go to step 18.
+   14. If k is greater than Result(2)-3, go to step 18.
+   15. If the two characters at positions k+1 and k+2 within Result(1) are not
+   both hexadecimal digits, go to step 18.
+   16. Let c be the character whose Unicode encoding is the integer represented
+   by two zeroes plus the two hexadecimal digits at positions k+1 and k+2
+   within Result(1).
+   17. Increase k by 2.
+   18. Let R be a new string value computed by concatenating the previous value
+   of R and c.
+   19. Increase k by 1.
+   20. Go to step 5.
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+*/
+
+var SECTION = "15.1.2.5-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "unescape(string)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// since there is only one character following "%", no conversion should occur.
+
+for ( var CHARCODE = 0; CHARCODE < 256; CHARCODE += 16 ) {
+  new TestCase( SECTION,
+		"unescape( %"+ (ToHexString(CHARCODE)).substring(0,1) +" )",
+		"%"+(ToHexString(CHARCODE)).substring(0,1),
+		unescape( "%" + (ToHexString(CHARCODE)).substring(0,1) )  );
+}
+
+// since there is only one character following "%u", no conversion should occur.
+
+for ( var CHARCODE = 0; CHARCODE < 256; CHARCODE +=16 ) {
+  new TestCase( SECTION,
+		"unescape( %u"+ (ToHexString(CHARCODE)).substring(0,1) +" )",
+		"%u"+(ToHexString(CHARCODE)).substring(0,1),
+		unescape( "%u" + (ToHexString(CHARCODE)).substring(0,1) )  );
+}
+
+
+// three char unicode string.  no conversion should occur
+
+for ( var CHARCODE = 1024; CHARCODE < 65536; CHARCODE+= 1234 ) {
+  new TestCase
+    (   SECTION,
+	"unescape( %u"+ (ToUnicodeString(CHARCODE)).substring(0,3)+ " )",
+
+	"%u"+(ToUnicodeString(CHARCODE)).substring(0,3),
+	unescape( "%u"+(ToUnicodeString(CHARCODE)).substring(0,3) )
+      );
+}
+
+test();
+
+function ToUnicodeString( n ) {
+  var string = ToHexString(n);
+
+  for ( var PAD = (4 - string.length ); PAD > 0; PAD-- ) {
+    string = "0" + string;
+  }
+
+  return string;
+}
+function ToHexString( n ) {
+  var hex = new Array();
+
+  for ( var mag = 1; Math.pow(16,mag) <= n ; mag++ ) {
+    ;
+  }
+
+  for ( index = 0, mag -= 1; mag > 0; index++, mag-- ) {
+    hex[index] = Math.floor( n / Math.pow(16,mag) );
+    n -= Math.pow(16,mag) * Math.floor( n/Math.pow(16,mag) );
+  }
+
+  hex[hex.length] = n % 16;
+
+  var string ="";
+
+  for ( var index = 0 ; index < hex.length ; index++ ) {
+    switch ( hex[index] ) {
+    case 10:
+      string += "A";
+      break;
+    case 11:
+      string += "B";
+      break;
+    case 12:
+      string += "C";
+      break;
+    case 13:
+      string += "D";
+      break;
+    case 14:
+      string += "E";
+      break;
+    case 15:
+      string += "F";
+      break;
+    default:
+      string += hex[index];
+    }
+  }
+
+  if ( string.length == 1 ) {
+    string = "0" + string;
+  }
+  return string;
+}
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.5-3.js b/js/src/tests/ecma/GlobalObject/15.1.2.5-3.js
new file mode 100644
index 000000000..e7e5008e3
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.5-3.js
@@ -0,0 +1,173 @@
+/* -*- tab-width: 2; 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:          15.1.2.5-3.js
+   ECMA Section:       15.1.2.5  Function properties of the global object
+   unescape( string )
+
+   Description:
+   This tests the cases where one of the four characters following "%u" is
+   not a hexidecimal character, or one of the two characters following "%"
+   or "%u" is not a hexidecimal character.
+
+   The unescape function computes a new version of a string value in which
+   each escape sequences of the sort that might be introduced by the escape
+   function is replaced with the character that it represents.
+
+   When the unescape function is called with one argument string, the
+   following steps are taken:
+
+   1.  Call ToString(string).
+   2.  Compute the number of characters in Result(1).
+   3.  Let R be the empty string.
+   4.  Let k be 0.
+   5.  If k equals Result(2), return R.
+   6.  Let c be the character at position k within Result(1).
+   7.  If c is not %, go to step 18.
+   8.  If k is greater than Result(2)-6, go to step 14.
+   9.  If the character at position k+1 within result(1) is not u, go to step
+   14.
+   10. If the four characters at positions k+2, k+3, k+4, and k+5 within
+   Result(1) are not all hexadecimal digits, go to step 14.
+   11. Let c be the character whose Unicode encoding is the integer represented
+   by the four hexadecimal digits at positions k+2, k+3, k+4, and k+5
+   within Result(1).
+   12. Increase k by 5.
+   13. Go to step 18.
+   14. If k is greater than Result(2)-3, go to step 18.
+   15. If the two characters at positions k+1 and k+2 within Result(1) are not
+   both hexadecimal digits, go to step 18.
+   16. Let c be the character whose Unicode encoding is the integer represented
+   by two zeroes plus the two hexadecimal digits at positions k+1 and k+2
+   within Result(1).
+   17. Increase k by 2.
+   18. Let R be a new string value computed by concatenating the previous value
+   of R and c.
+   19. Increase k by 1.
+   20. Go to step 5.
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+*/
+
+
+var SECTION = "15.1.2.5-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "unescape(string)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+for ( var CHARCODE = 0, NONHEXCHARCODE = 0; CHARCODE < 256; CHARCODE++, NONHEXCHARCODE++ ) {
+  NONHEXCHARCODE = getNextNonHexCharCode( NONHEXCHARCODE );
+
+  new TestCase( SECTION,
+		"unescape( %"+ (ToHexString(CHARCODE)).substring(0,1) +
+		String.fromCharCode( NONHEXCHARCODE ) +" )" +
+		"[where last character is String.fromCharCode("+NONHEXCHARCODE+")]",
+		"%"+(ToHexString(CHARCODE)).substring(0,1)+
+		String.fromCharCode( NONHEXCHARCODE ),
+		unescape( "%" + (ToHexString(CHARCODE)).substring(0,1)+
+			  String.fromCharCode( NONHEXCHARCODE ) )  );
+}
+for ( var CHARCODE = 0, NONHEXCHARCODE = 0; CHARCODE < 256; CHARCODE++, NONHEXCHARCODE++ ) {
+  NONHEXCHARCODE = getNextNonHexCharCode( NONHEXCHARCODE );
+
+  new TestCase( SECTION,
+		"unescape( %u"+ (ToHexString(CHARCODE)).substring(0,1) +
+		String.fromCharCode( NONHEXCHARCODE ) +" )" +
+		"[where last character is String.fromCharCode("+NONHEXCHARCODE+")]",
+		"%u"+(ToHexString(CHARCODE)).substring(0,1)+
+		String.fromCharCode( NONHEXCHARCODE ),
+		unescape( "%u" + (ToHexString(CHARCODE)).substring(0,1)+
+			  String.fromCharCode( NONHEXCHARCODE ) )  );
+}
+
+for ( var CHARCODE = 0, NONHEXCHARCODE = 0 ; CHARCODE < 65536; CHARCODE+= 54321, NONHEXCHARCODE++ ) {
+  NONHEXCHARCODE = getNextNonHexCharCode( NONHEXCHARCODE );
+
+  new TestCase( SECTION,
+		"unescape( %u"+ (ToUnicodeString(CHARCODE)).substring(0,3) +
+		String.fromCharCode( NONHEXCHARCODE ) +" )" +
+		"[where last character is String.fromCharCode("+NONHEXCHARCODE+")]",
+
+		String.fromCharCode(eval("0x"+ (ToUnicodeString(CHARCODE)).substring(0,2))) +
+		(ToUnicodeString(CHARCODE)).substring(2,3) +
+		String.fromCharCode( NONHEXCHARCODE ),
+
+		unescape( "%" + (ToUnicodeString(CHARCODE)).substring(0,3)+
+			  String.fromCharCode( NONHEXCHARCODE ) )  );
+}
+
+test();
+
+function getNextNonHexCharCode( n ) {
+  for (  ; n < Math.pow(2,16); n++ ) {
+    if ( (  n == 43 || n == 45 || n == 46 || n == 47 ||
+            (n >= 71 && n <= 90) || (n >= 103 && n <= 122) ||
+            n == 64 || n == 95 ) ) {
+      break;
+    } else {
+      n = ( n > 122 ) ? 0 : n;
+    }
+  }
+  return n;
+}
+function ToUnicodeString( n ) {
+  var string = ToHexString(n);
+
+  for ( var PAD = (4 - string.length ); PAD > 0; PAD-- ) {
+    string = "0" + string;
+  }
+
+  return string;
+}
+function ToHexString( n ) {
+  var hex = new Array();
+
+  for ( var mag = 1; Math.pow(16,mag) <= n ; mag++ ) {
+    ;
+  }
+
+  for ( index = 0, mag -= 1; mag > 0; index++, mag-- ) {
+    hex[index] = Math.floor( n / Math.pow(16,mag) );
+    n -= Math.pow(16,mag) * Math.floor( n/Math.pow(16,mag) );
+  }
+
+  hex[hex.length] = n % 16;
+
+  var string ="";
+
+  for ( var index = 0 ; index < hex.length ; index++ ) {
+    switch ( hex[index] ) {
+    case 10:
+      string += "A";
+      break;
+    case 11:
+      string += "B";
+      break;
+    case 12:
+      string += "C";
+      break;
+    case 13:
+      string += "D";
+      break;
+    case 14:
+      string += "E";
+      break;
+    case 15:
+      string += "F";
+      break;
+    default:
+      string += hex[index];
+    }
+  }
+
+  if ( string.length == 1 ) {
+    string = "0" + string;
+  }
+  return string;
+}
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.6.js b/js/src/tests/ecma/GlobalObject/15.1.2.6.js
new file mode 100644
index 000000000..d54358a6d
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.6.js
@@ -0,0 +1,89 @@
+/* -*- 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:          15.1.2.6.js
+   ECMA Section:       15.1.2.6 isNaN( x )
+
+   Description:        Applies ToNumber to its argument, then returns true if
+   the result isNaN and otherwise returns false.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.1.2.6";
+var VERSION = "ECMA_1";
+var TITLE   = "isNaN( x )";
+var BUGNUMBER = "none";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "isNaN.length",      1,                  isNaN.length );
+new TestCase( SECTION, "var MYPROPS=''; for ( var p in isNaN ) { MYPROPS+= p }; MYPROPS", "", eval("var MYPROPS=''; for ( var p in isNaN ) { MYPROPS+= p }; MYPROPS") );
+new TestCase( SECTION, "isNaN.length = null; isNaN.length", 1,      eval("isNaN.length=null; isNaN.length") );
+
+//     new TestCase( SECTION, "isNaN.__proto__",   Function.prototype, isNaN.__proto__ );
+
+new TestCase( SECTION, "isNaN()",           true,               isNaN() );
+new TestCase( SECTION, "isNaN( null )",     false,              isNaN(null) );
+new TestCase( SECTION, "isNaN( void 0 )",   true,               isNaN(void 0) );
+new TestCase( SECTION, "isNaN( true )",     false,              isNaN(true) );
+new TestCase( SECTION, "isNaN( false)",     false,              isNaN(false) );
+new TestCase( SECTION, "isNaN( ' ' )",      false,              isNaN( " " ) );
+
+new TestCase( SECTION, "isNaN( 0 )",        false,              isNaN(0) );
+new TestCase( SECTION, "isNaN( 1 )",        false,              isNaN(1) );
+new TestCase( SECTION, "isNaN( 2 )",        false,              isNaN(2) );
+new TestCase( SECTION, "isNaN( 3 )",        false,              isNaN(3) );
+new TestCase( SECTION, "isNaN( 4 )",        false,              isNaN(4) );
+new TestCase( SECTION, "isNaN( 5 )",        false,              isNaN(5) );
+new TestCase( SECTION, "isNaN( 6 )",        false,              isNaN(6) );
+new TestCase( SECTION, "isNaN( 7 )",        false,              isNaN(7) );
+new TestCase( SECTION, "isNaN( 8 )",        false,              isNaN(8) );
+new TestCase( SECTION, "isNaN( 9 )",        false,              isNaN(9) );
+
+new TestCase( SECTION, "isNaN( '0' )",        false,              isNaN('0') );
+new TestCase( SECTION, "isNaN( '1' )",        false,              isNaN('1') );
+new TestCase( SECTION, "isNaN( '2' )",        false,              isNaN('2') );
+new TestCase( SECTION, "isNaN( '3' )",        false,              isNaN('3') );
+new TestCase( SECTION, "isNaN( '4' )",        false,              isNaN('4') );
+new TestCase( SECTION, "isNaN( '5' )",        false,              isNaN('5') );
+new TestCase( SECTION, "isNaN( '6' )",        false,              isNaN('6') );
+new TestCase( SECTION, "isNaN( '7' )",        false,              isNaN('7') );
+new TestCase( SECTION, "isNaN( '8' )",        false,              isNaN('8') );
+new TestCase( SECTION, "isNaN( '9' )",        false,              isNaN('9') );
+
+
+new TestCase( SECTION, "isNaN( 0x0a )",    false,              isNaN( 0x0a ) );
+new TestCase( SECTION, "isNaN( 0xaa )",    false,              isNaN( 0xaa ) );
+new TestCase( SECTION, "isNaN( 0x0A )",    false,              isNaN( 0x0A ) );
+new TestCase( SECTION, "isNaN( 0xAA )",    false,              isNaN( 0xAA ) );
+
+new TestCase( SECTION, "isNaN( '0x0a' )",    false,              isNaN( "0x0a" ) );
+new TestCase( SECTION, "isNaN( '0xaa' )",    false,              isNaN( "0xaa" ) );
+new TestCase( SECTION, "isNaN( '0x0A' )",    false,              isNaN( "0x0A" ) );
+new TestCase( SECTION, "isNaN( '0xAA' )",    false,              isNaN( "0xAA" ) );
+
+new TestCase( SECTION, "isNaN( 077 )",      false,              isNaN( 077 ) );
+new TestCase( SECTION, "isNaN( '077' )",    false,              isNaN( "077" ) );
+
+
+new TestCase( SECTION, "isNaN( Number.NaN )",   true,              isNaN(Number.NaN) );
+new TestCase( SECTION, "isNaN( Number.POSITIVE_INFINITY )", false,  isNaN(Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "isNaN( Number.NEGATIVE_INFINITY )", false,  isNaN(Number.NEGATIVE_INFINITY) );
+new TestCase( SECTION, "isNaN( Number.MAX_VALUE )",         false,  isNaN(Number.MAX_VALUE) );
+new TestCase( SECTION, "isNaN( Number.MIN_VALUE )",         false,  isNaN(Number.MIN_VALUE) );
+
+new TestCase( SECTION, "isNaN( NaN )",               true,      isNaN(NaN) );
+new TestCase( SECTION, "isNaN( Infinity )",          false,     isNaN(Infinity) );
+
+new TestCase( SECTION, "isNaN( 'Infinity' )",               false,  isNaN("Infinity") );
+new TestCase( SECTION, "isNaN( '-Infinity' )",              false,  isNaN("-Infinity") );
+
+test();
diff --git a/js/src/tests/ecma/GlobalObject/15.1.2.7.js b/js/src/tests/ecma/GlobalObject/15.1.2.7.js
new file mode 100644
index 000000000..49797749b
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/15.1.2.7.js
@@ -0,0 +1,94 @@
+/* -*- 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:          15.1.2.7.js
+   ECMA Section:       15.1.2.7 isFinite(number)
+
+   Description:        Applies ToNumber to its argument, then returns false if
+   the result is NaN, Infinity, or -Infinity, and otherwise
+   returns true.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.1.2.7";
+var VERSION = "ECMA_1";
+var TITLE   = "isFinite( x )";
+var BUGNUMBER= "none";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "isFinite.length",      1,                  isFinite.length );
+new TestCase( SECTION, "isFinite.length = null; isFinite.length",   1,      eval("isFinite.length=null; isFinite.length") );
+new TestCase( SECTION, "var MYPROPS=''; for ( p in isFinite ) { MYPROPS+= p }; MYPROPS",    "", eval("var MYPROPS=''; for ( p in isFinite ) { MYPROPS += p }; MYPROPS") );
+
+new TestCase( SECTION,  "isFinite()",           false,              isFinite() );
+new TestCase( SECTION, "isFinite( null )",      true,              isFinite(null) );
+new TestCase( SECTION, "isFinite( void 0 )",    false,             isFinite(void 0) );
+new TestCase( SECTION, "isFinite( false )",     true,              isFinite(false) );
+new TestCase( SECTION, "isFinite( true)",       true,              isFinite(true) );
+new TestCase( SECTION, "isFinite( ' ' )",       true,              isFinite( " " ) );
+
+new TestCase( SECTION, "isFinite( new Boolean(true) )",     true,   isFinite(new Boolean(true)) );
+new TestCase( SECTION, "isFinite( new Boolean(false) )",    true,   isFinite(new Boolean(false)) );
+
+new TestCase( SECTION, "isFinite( 0 )",        true,              isFinite(0) );
+new TestCase( SECTION, "isFinite( 1 )",        true,              isFinite(1) );
+new TestCase( SECTION, "isFinite( 2 )",        true,              isFinite(2) );
+new TestCase( SECTION, "isFinite( 3 )",        true,              isFinite(3) );
+new TestCase( SECTION, "isFinite( 4 )",        true,              isFinite(4) );
+new TestCase( SECTION, "isFinite( 5 )",        true,              isFinite(5) );
+new TestCase( SECTION, "isFinite( 6 )",        true,              isFinite(6) );
+new TestCase( SECTION, "isFinite( 7 )",        true,              isFinite(7) );
+new TestCase( SECTION, "isFinite( 8 )",        true,              isFinite(8) );
+new TestCase( SECTION, "isFinite( 9 )",        true,              isFinite(9) );
+
+new TestCase( SECTION, "isFinite( '0' )",        true,              isFinite('0') );
+new TestCase( SECTION, "isFinite( '1' )",        true,              isFinite('1') );
+new TestCase( SECTION, "isFinite( '2' )",        true,              isFinite('2') );
+new TestCase( SECTION, "isFinite( '3' )",        true,              isFinite('3') );
+new TestCase( SECTION, "isFinite( '4' )",        true,              isFinite('4') );
+new TestCase( SECTION, "isFinite( '5' )",        true,              isFinite('5') );
+new TestCase( SECTION, "isFinite( '6' )",        true,              isFinite('6') );
+new TestCase( SECTION, "isFinite( '7' )",        true,              isFinite('7') );
+new TestCase( SECTION, "isFinite( '8' )",        true,              isFinite('8') );
+new TestCase( SECTION, "isFinite( '9' )",        true,              isFinite('9') );
+
+new TestCase( SECTION, "isFinite( 0x0a )",    true,                 isFinite( 0x0a ) );
+new TestCase( SECTION, "isFinite( 0xaa )",    true,                 isFinite( 0xaa ) );
+new TestCase( SECTION, "isFinite( 0x0A )",    true,                 isFinite( 0x0A ) );
+new TestCase( SECTION, "isFinite( 0xAA )",    true,                 isFinite( 0xAA ) );
+
+new TestCase( SECTION, "isFinite( '0x0a' )",    true,               isFinite( "0x0a" ) );
+new TestCase( SECTION, "isFinite( '0xaa' )",    true,               isFinite( "0xaa" ) );
+new TestCase( SECTION, "isFinite( '0x0A' )",    true,               isFinite( "0x0A" ) );
+new TestCase( SECTION, "isFinite( '0xAA' )",    true,               isFinite( "0xAA" ) );
+
+new TestCase( SECTION, "isFinite( 077 )",       true,               isFinite( 077 ) );
+new TestCase( SECTION, "isFinite( '077' )",     true,               isFinite( "077" ) );
+
+new TestCase( SECTION, "isFinite( new String('Infinity') )",        false,      isFinite(new String("Infinity")) );
+new TestCase( SECTION, "isFinite( new String('-Infinity') )",       false,      isFinite(new String("-Infinity")) );
+
+new TestCase( SECTION, "isFinite( 'Infinity' )",        false,      isFinite("Infinity") );
+new TestCase( SECTION, "isFinite( '-Infinity' )",       false,      isFinite("-Infinity") );
+new TestCase( SECTION, "isFinite( Number.POSITIVE_INFINITY )",  false,  isFinite(Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "isFinite( Number.NEGATIVE_INFINITY )",  false,  isFinite(Number.NEGATIVE_INFINITY) );
+new TestCase( SECTION, "isFinite( Number.NaN )",                false,  isFinite(Number.NaN) );
+
+new TestCase( SECTION, "isFinite( Infinity )",  false,  isFinite(Infinity) );
+new TestCase( SECTION, "isFinite( -Infinity )",  false,  isFinite(-Infinity) );
+new TestCase( SECTION, "isFinite( NaN )",                false,  isFinite(NaN) );
+
+
+new TestCase( SECTION, "isFinite( Number.MAX_VALUE )",          true,  isFinite(Number.MAX_VALUE) );
+new TestCase( SECTION, "isFinite( Number.MIN_VALUE )",          true,  isFinite(Number.MIN_VALUE) );
+
+test();
diff --git a/js/src/tests/ecma/GlobalObject/browser.js b/js/src/tests/ecma/GlobalObject/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/browser.js
diff --git a/js/src/tests/ecma/GlobalObject/shell.js b/js/src/tests/ecma/GlobalObject/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/GlobalObject/shell.js
diff --git a/js/src/tests/ecma/LexicalConventions/7.1-1.js b/js/src/tests/ecma/LexicalConventions/7.1-1.js
new file mode 100644
index 000000000..202ffec02
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.1-1.js
@@ -0,0 +1,48 @@
+/* -*- tab-width: 2; 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:          7.1-1.js
+   ECMA Section:       7.1 White Space
+   Description:        - readability
+   - separate tokens
+   - otherwise should be insignificant
+   - in strings, white space characters are significant
+   - cannot appear within any other kind of token
+
+   white space characters are:
+   unicode     name            formal name     string representation
+   \u0009      tab             <TAB>           \t
+   \u000B      veritical tab   <VT>            \v
+   \U000C      form feed       <FF>            \f
+   \u0020      space           <SP>            " "
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+
+var SECTION = "7.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "White Space";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// whitespace between var keyword and identifier
+
+new TestCase( SECTION,  'var'+'\t'+'MYVAR1=10;MYVAR1',   10, eval('var'+'\t'+'MYVAR1=10;MYVAR1') );
+new TestCase( SECTION,  'var'+'\f'+'MYVAR2=10;MYVAR2',   10, eval('var'+'\f'+'MYVAR2=10;MYVAR2') );
+new TestCase( SECTION,  'var'+'\v'+'MYVAR2=10;MYVAR2',   10, eval('var'+'\v'+'MYVAR2=10;MYVAR2') );
+new TestCase( SECTION,  'var'+'\ '+'MYVAR2=10;MYVAR2',   10, eval('var'+'\ '+'MYVAR2=10;MYVAR2') );
+
+// use whitespace between tokens object name, dot operator, and object property
+
+new TestCase( SECTION,
+	      "var a = new Array(12345); a\t\v\f .\\u0009\\000B\\u000C\\u0020length",
+	      12345,
+	      eval("var a = new Array(12345); a\t\v\f .\u0009\u0020\u000C\u000Blength") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.1-2.js b/js/src/tests/ecma/LexicalConventions/7.1-2.js
new file mode 100644
index 000000000..2e22212fb
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.1-2.js
@@ -0,0 +1,39 @@
+/* -*- 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:          7.1-2.js
+   ECMA Section:       7.1 White Space
+   Description:        - readability
+   - separate tokens
+   - otherwise should be insignificant
+   - in strings, white space characters are significant
+   - cannot appear within any other kind of token
+
+   white space characters are:
+   unicode     name            formal name     string representation
+   \u0009      tab             <TAB>           \t
+   \u000B      veritical tab   <VT>            ??
+   \U000C      form feed       <FF>            \f
+   \u0020      space           <SP>            " "
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+
+var SECTION = "7.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "White Space";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,    "'var'+'\u000B'+'MYVAR1=10;MYVAR1'",   10, eval('var'+'\u000B'+'MYVAR1=10;MYVAR1') );
+new TestCase( SECTION,    "'var'+'\u0009'+'MYVAR2=10;MYVAR2'",   10, eval('var'+'\u0009'+'MYVAR2=10;MYVAR2') );
+new TestCase( SECTION,    "'var'+'\u000C'+'MYVAR3=10;MYVAR3'",   10, eval('var'+'\u000C'+'MYVAR3=10;MYVAR3') );
+new TestCase( SECTION,    "'var'+'\u0020'+'MYVAR4=10;MYVAR4'",   10, eval('var'+'\u0020'+'MYVAR4=10;MYVAR4') );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.1-3.js b/js/src/tests/ecma/LexicalConventions/7.1-3.js
new file mode 100644
index 000000000..1f4d253ba
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.1-3.js
@@ -0,0 +1,55 @@
+/* -*- tab-width: 2; 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:          7.1-3.js
+   ECMA Section:       7.1 White Space
+   Description:        - readability
+   - separate tokens
+   - otherwise should be insignificant
+   - in strings, white space characters are significant
+   - cannot appear within any other kind of token
+
+   white space characters are:
+   unicode     name            formal name     string representation
+   \u0009      tab             <TAB>           \t
+   \u000B      veritical tab   <VT>            ??
+   \U000C      form feed       <FF>            \f
+   \u0020      space           <SP>            " "
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+
+var SECTION = "7.1-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "White Space";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,    "'var'+'\u000B'+'MYVAR1=10;MYVAR1'",   10, eval('var'+'\u000B'+'MYVAR1=10;MYVAR1') );
+new TestCase( SECTION,    "'var'+'\u0009'+'MYVAR2=10;MYVAR2'",   10, eval('var'+'\u0009'+'MYVAR2=10;MYVAR2') );
+new TestCase( SECTION,    "'var'+'\u000C'+'MYVAR3=10;MYVAR3'",   10, eval('var'+'\u000C'+'MYVAR3=10;MYVAR3') );
+new TestCase( SECTION,    "'var'+'\u0020'+'MYVAR4=10;MYVAR4'",   10, eval('var'+'\u0020'+'MYVAR4=10;MYVAR4') );
+
+// +<white space>+ should be interpreted as the unary + operator twice, not as a post or prefix increment operator
+
+new TestCase(   SECTION,
+		"var VAR = 12345; + + VAR",
+		12345,
+		eval("var VAR = 12345; + + VAR") );
+
+new TestCase(   SECTION,
+		"var VAR = 12345;VAR+ + VAR",
+		24690,
+		eval("var VAR = 12345;VAR+ +VAR") );
+new TestCase(   SECTION,
+		"var VAR = 12345;VAR - - VAR",
+		24690,
+		eval("var VAR = 12345;VAR- -VAR") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.2-1.js b/js/src/tests/ecma/LexicalConventions/7.2-1.js
new file mode 100644
index 000000000..f17143af5
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.2-1.js
@@ -0,0 +1,39 @@
+/* -*- 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:          7.2-1.js
+   ECMA Section:       7.2 Line Terminators
+   Description:        - readability
+   - separate tokens
+   - may occur between any two tokens
+   - cannot occur within any token, not even a string
+   - affect the process of automatic semicolon insertion.
+
+   white space characters are:
+   unicode     name            formal name     string representation
+   \u000A      line feed       <LF>            \n
+   \u000D      carriage return <CR>            \r
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Line Terminators";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION,    "var a\nb =  5; ab=10;ab;",     10,     eval("var a\nb =  5; ab=10;ab") );
+new TestCase( SECTION,    "var a\nb =  5; ab=10;b;",      5,      eval("var a\nb =  5; ab=10;b") );
+new TestCase( SECTION,    "var a\rb =  5; ab=10;ab;",     10,     eval("var a\rb =  5; ab=10;ab") );
+new TestCase( SECTION,    "var a\rb =  5; ab=10;b;",      5,      eval("var a\rb =  5; ab=10;b") );
+new TestCase( SECTION,    "var a\r\nb =  5; ab=10;ab;",     10,     eval("var a\r\nb =  5; ab=10;ab") );
+new TestCase( SECTION,    "var a\r\nb =  5; ab=10;b;",      5,      eval("var a\r\nb =  5; ab=10;b") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.2-2-n.js b/js/src/tests/ecma/LexicalConventions/7.2-2-n.js
new file mode 100644
index 000000000..7f3bb8676
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.2-2-n.js
@@ -0,0 +1,40 @@
+/* -*- 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:          7.2.js
+   ECMA Section:       7.2 Line Terminators
+   Description:        - readability
+   - separate tokens
+   - may occur between any two tokens
+   - cannot occur within any token, not even a string
+   - affect the process of automatic semicolon insertion.
+
+   white space characters are:
+   unicode     name            formal name     string representation
+   \u000A      line feed       <LF>            \n
+   \u000D      carriage return <CR>            \r
+
+   this test uses onerror to capture line numbers.  because
+   we use on error, we can only have one test case per file.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.2-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Line Terminators";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "\r\r\r\nb";
+EXPECTED = "error"
+
+  new TestCase( SECTION,   DESCRIPTION,     "error",     eval("\r\r\r\nb"));
+
+test();
+
diff --git a/js/src/tests/ecma/LexicalConventions/7.2-3-n.js b/js/src/tests/ecma/LexicalConventions/7.2-3-n.js
new file mode 100644
index 000000000..0d78e549c
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.2-3-n.js
@@ -0,0 +1,40 @@
+/* -*- 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:          7.2-3.js
+   ECMA Section:       7.2 Line Terminators
+   Description:        - readability
+   - separate tokens
+   - may occur between any two tokens
+   - cannot occur within any token, not even a string
+   - affect the process of automatic semicolon insertion.
+
+   white space characters are:
+   unicode     name            formal name     string representation
+   \u000A      line feed       <LF>            \n
+   \u000D      carriage return <CR>            \r
+
+   this test uses onerror to capture line numbers.  because
+   we use on error, we can only have one test case per file.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.2-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Line Terminators";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+DESCRIPTION = "\r\nb";
+EXPECTED = "error"
+
+  new TestCase( SECTION,    "<cr>a",     "error",     eval("\r\nb"));
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.2-4-n.js b/js/src/tests/ecma/LexicalConventions/7.2-4-n.js
new file mode 100644
index 000000000..36a55d288
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.2-4-n.js
@@ -0,0 +1,39 @@
+/* -*- 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:          7.2.js
+   ECMA Section:       7.2 Line Terminators
+   Description:        - readability
+   - separate tokens
+   - may occur between any two tokens
+   - cannot occur within any token, not even a string
+   - affect the process of automatic semicolon insertion.
+
+   white space characters are:
+   unicode     name            formal name     string representation
+   \u000A      line feed       <LF>            \n
+   \u000D      carriage return <CR>            \r
+
+   this test uses onerror to capture line numbers.  because
+   we use on error, we can only have one test case per file.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.2-6";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Line Terminators";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "\nb";
+EXPECTED = "error";
+
+new TestCase( SECTION,    "\nb",     "error",     eval("\nb"));
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.2-5-n.js b/js/src/tests/ecma/LexicalConventions/7.2-5-n.js
new file mode 100644
index 000000000..44fd905b1
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.2-5-n.js
@@ -0,0 +1,38 @@
+/* -*- 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:          7.2.js
+   ECMA Section:       7.2 Line Terminators
+   Description:        - readability
+   - separate tokens
+   - may occur between any two tokens
+   - cannot occur within any token, not even a string
+   - affect the process of automatic semicolon insertion.
+
+   white space characters are:
+   unicode     name            formal name     string representation
+   \u000A      line feed       <LF>            \n
+   \u000D      carriage return <CR>            \r
+
+   this test uses onerror to capture line numbers.  because
+   we use on error, we can only have one test case per file.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.2-5";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Line Terminators";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION =
+  EXPECTED = "error";
+
+new TestCase( SECTION,    "\rb",     "error",    eval("\rb"));
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.2-6.js b/js/src/tests/ecma/LexicalConventions/7.2-6.js
new file mode 100644
index 000000000..030a6a6ba
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.2-6.js
@@ -0,0 +1,34 @@
+/* -*- 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:          7.2-6.js
+   ECMA Section:       7.2 Line Terminators
+   Description:        - readability
+   - separate tokens
+   - may occur between any two tokens
+   - cannot occur within any token, not even a string
+   - affect the process of automatic semicolon insertion.
+
+   white space characters are:
+   unicode     name            formal name     string representation
+   \u000A      line feed       <LF>            \n
+   \u000D      carriage return <CR>            \r
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.2-6";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Line Terminators";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,    "var a\u000Ab =  5; ab=10;ab;",     10,     eval("var a\nb =  5; ab=10;ab") );
+new TestCase( SECTION,    "var a\u000Db =  5; ab=10;b;",      5,      eval("var a\nb =  5; ab=10;b") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-1.js b/js/src/tests/ecma/LexicalConventions/7.3-1.js
new file mode 100644
index 000000000..0b080f664
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-1.js
@@ -0,0 +1,57 @@
+/* -*- tab-width: 2; 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:          7.3-1.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase;
+
+testcase = new TestCase( SECTION,
+			 "a comment with a line terminator string, and text following",
+			 "pass",
+			 "pass");
+
+// "\u000A" testcase.actual = "fail";
+
+
+testcase = new TestCase( SECTION,
+			 "// test \\n testcase.actual = \"pass\"",
+			 "pass",
+			 "" );
+
+var x = "// test \n testcase.actual = 'pass'";
+
+testcase.actual = eval(x);
+
+test();
+
+// XXX bc replace test()
+function test() {
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +":  "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : " ignored chars after line terminator of single-line comment";
+  }
+  return ( gTestcases );
+}
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-10.js b/js/src/tests/ecma/LexicalConventions/7.3-10.js
new file mode 100644
index 000000000..494f8da06
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-10.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          7.3-10.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase = new TestCase( SECTION,
+			     "code following multiline comment",
+			     "pass",
+			     "fail");
+
+/*//*/testcase.actual="pass";
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-11.js b/js/src/tests/ecma/LexicalConventions/7.3-11.js
new file mode 100644
index 000000000..7ac777fba
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-11.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          7.3-11.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-11";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var testcase =  new TestCase( SECTION,
+			      "code following multiline comment",
+			      "pass",
+			      "pass");
+
+////testcase.actual="fail";
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-12.js b/js/src/tests/ecma/LexicalConventions/7.3-12.js
new file mode 100644
index 000000000..8700d26a2
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-12.js
@@ -0,0 +1,30 @@
+/* -*- tab-width: 2; 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:          7.3-12.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-12";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase =  new TestCase( SECTION,
+			      "code following multiline comment",
+			      "pass",
+			      "pass");
+/*testcase.actual="fail";**/
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-13-n.js b/js/src/tests/ecma/LexicalConventions/7.3-13-n.js
new file mode 100644
index 000000000..ce26b91ee
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-13-n.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          7.3-13-n.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-13-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "nested comment";
+EXPECTED = "error";
+
+var testcase = new TestCase( SECTION,
+			     "nested comment",
+			     "error",
+			     eval("/*/*\"fail\";*/*/"));
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-2.js b/js/src/tests/ecma/LexicalConventions/7.3-2.js
new file mode 100644
index 000000000..0b42cb849
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-2.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          7.3-2.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase = new TestCase( SECTION,
+			     "a comment with a carriage return, and text following",
+			     "pass",
+			     "pass");
+
+// "\u000D" testcase.actual = "fail";
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-3.js b/js/src/tests/ecma/LexicalConventions/7.3-3.js
new file mode 100644
index 000000000..c4e629aae
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-3.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          7.3-3.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase =  new TestCase( SECTION,
+			      "source text directly following a single-line comment",
+			      "pass",
+			      "fail");
+// a comment string
+testcase.actual = "pass";
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-4.js b/js/src/tests/ecma/LexicalConventions/7.3-4.js
new file mode 100644
index 000000000..11a7bac8f
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-4.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          7.3-4.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase = new TestCase( SECTION,
+			     "multiline comment ",
+			     "pass",
+			     "pass");
+
+/*testcase.actual = "fail";*/
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-5.js b/js/src/tests/ecma/LexicalConventions/7.3-5.js
new file mode 100644
index 000000000..bb3b7876b
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-5.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          7.3-5.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-5";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase = new TestCase( SECTION,
+			     "a comment with a carriage return, and text following",
+			     "pass",
+			     "pass");
+
+// "\u000A" testcase.actual = "fail";
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-6.js b/js/src/tests/ecma/LexicalConventions/7.3-6.js
new file mode 100644
index 000000000..59e4e7cc4
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-6.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          7.3-6.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-6";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+var testcase = new TestCase( SECTION,
+			     "comment with multiple asterisks",
+			     "pass",
+			     "fail");
+
+/*
+***/testcase.actual="pass";
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-7.js b/js/src/tests/ecma/LexicalConventions/7.3-7.js
new file mode 100644
index 000000000..f82ac011b
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-7.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          7.3-7.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-7";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase = new TestCase( SECTION,
+			     "single line comment following multiline comment",
+			     "pass",
+			     "pass");
+
+/*
+***///testcase.actual="fail";
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-8.js b/js/src/tests/ecma/LexicalConventions/7.3-8.js
new file mode 100644
index 000000000..757968646
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-8.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          7.3-7.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-8";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase = new TestCase( SECTION,
+			     "code following multiline comment",
+			     "pass",
+			     "fail");
+
+/**/testcase.actual="pass";
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.3-9.js b/js/src/tests/ecma/LexicalConventions/7.3-9.js
new file mode 100644
index 000000000..e91047d7e
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.3-9.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          7.3-9.js
+   ECMA Section:       7.3 Comments
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.3-9";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Comments";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase = new TestCase( SECTION,
+			     "code following multiline comment",
+			     "pass",
+			     "fail");
+
+/*/*/testcase.actual="pass";
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.1-1-n.js b/js/src/tests/ecma/LexicalConventions/7.4.1-1-n.js
new file mode 100644
index 000000000..f5044b854
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.1-1-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.1-1-n.js
+   ECMA Section:       7.4.1
+
+   Description:
+
+   Reserved words cannot be used as identifiers.
+
+   ReservedWord ::
+   Keyword
+   FutureReservedWord
+   NullLiteral
+   BooleanLiteral
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-1-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var null = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var null = true",     "error",    eval("var null = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.1-2-n.js b/js/src/tests/ecma/LexicalConventions/7.4.1-2-n.js
new file mode 100644
index 000000000..8012fbfe2
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.1-2-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.1-2.js
+   ECMA Section:       7.4.1
+
+   Description:
+
+   Reserved words cannot be used as identifiers.
+
+   ReservedWord ::
+   Keyword
+   FutureReservedWord
+   NullLiteral
+   BooleanLiteral
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-2-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var true = false";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var true = false",     "error",    eval("var true = false") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.1-3-n.js b/js/src/tests/ecma/LexicalConventions/7.4.1-3-n.js
new file mode 100644
index 000000000..2060370f1
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.1-3-n.js
@@ -0,0 +1,35 @@
+/* -*- 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:          7.4.1-3-n.js
+   ECMA Section:       7.4.1
+
+   Description:
+
+   Reserved words cannot be used as identifiers.
+
+   ReservedWord ::
+   Keyword
+   FutureReservedWord
+   NullLiteral
+   BooleanLiteral
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-3-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+DESCRIPTION = "var false = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var false = true",     "error",    eval("var false = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-1-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-1-n.js
new file mode 100644
index 000000000..cf9ae9c6c
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-1-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-1.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.2-1-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var break = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var break = true",     "error",    eval("var break = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-10-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-10-n.js
new file mode 100644
index 000000000..83a2fb124
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-10-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-10.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-10-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var if = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var if = true",     "error",    eval("var if = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-11-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-11-n.js
new file mode 100644
index 000000000..21f45e135
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-11-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-11-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-11-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var this = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var this = true",     "error",    eval("var this = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-12-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-12-n.js
new file mode 100644
index 000000000..fb4033659
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-12-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-12-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-12-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var while = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var while = true",     "error",    eval("var while = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-13-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-13-n.js
new file mode 100644
index 000000000..7deec9473
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-13-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-13-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-13-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var else = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var else = true",     "error",    eval("var else = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-14-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-14-n.js
new file mode 100644
index 000000000..00eafceef
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-14-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-14-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-14-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var in = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var in = true",     "error",    eval("var in = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-15-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-15-n.js
new file mode 100644
index 000000000..4b224fc2d
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-15-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-15-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-15-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var typeof = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var typeof = true",     "error",    eval("var typeof = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-16-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-16-n.js
new file mode 100644
index 000000000..08418bbc9
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-16-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-16-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-16-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var with = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var with = true",     "error",    eval("var with = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-2-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-2-n.js
new file mode 100644
index 000000000..54085e214
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-2-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-2-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-2-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var for = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var for = true",     "error",    eval("var for = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-3-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-3-n.js
new file mode 100644
index 000000000..194ec14bd
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-3-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-3-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.2-3-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var new = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var new = true",     "error",    eval("var new = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-4-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-4-n.js
new file mode 100644
index 000000000..1784ceefa
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-4-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-4-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.2-4-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var var = true";
+EXPECTED = "error";
+
+TestCase( SECTION,  "var var = true",     "error",    eval("var var = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-5-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-5-n.js
new file mode 100644
index 000000000..df54b433a
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-5-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-5-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.2-5-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var continue = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var continue = true",     "error",    eval("var continue = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-6-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-6-n.js
new file mode 100644
index 000000000..4c43976ca
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-6-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-6.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.2-6-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var function = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var function = true",     "error",    eval("var function = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-7-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-7-n.js
new file mode 100644
index 000000000..d038de1c1
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-7-n.js
@@ -0,0 +1,41 @@
+/* -*- 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:          7.4.2-7-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.2-7";
+var VERSION = "ECMA_1";
+startTest();
+writeHeaderToLog( SECTION + " Keywords");
+
+DESCRIPTION = "var return = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var return = true",     "error",    eval("var return = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-8-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-8-n.js
new file mode 100644
index 000000000..a1d06f3b1
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-8-n.js
@@ -0,0 +1,42 @@
+/* -*- 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:          7.4.2-8-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.2-8";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Keywords");
+
+DESCRIPTION = "var void = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var void = true",     "error",    eval("var void = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.2-9-n.js b/js/src/tests/ecma/LexicalConventions/7.4.2-9-n.js
new file mode 100644
index 000000000..2c3dfb8bd
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.2-9-n.js
@@ -0,0 +1,43 @@
+/* -*- 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:          7.4.2-9-n.js
+   ECMA Section:       7.4.2
+
+   Description:
+   The following tokens are ECMAScript keywords and may not be used as
+   identifiers in ECMAScript programs.
+
+   Syntax
+
+   Keyword :: one of
+   break          for         new         var
+   continue       function    return      void
+   delete         if          this        while
+   else           in          typeof      with
+
+   This test verifies that the keyword cannot be used as an identifier.
+   Functioinal tests of the keyword may be found in the section corresponding
+   to the function of the keyword.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "7.4.1-9-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Keywords";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var delete = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var delete = true",     "error",    eval("var delete = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-1-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-1-n.js
new file mode 100644
index 000000000..b984db0c6
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-1-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.3-1-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-1-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var case = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var case = true",     "error",    eval("var case = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-10-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-10-n.js
new file mode 100644
index 000000000..370d50f06
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-10-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.3-10-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-10-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var do = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var do = true",     "error",    eval("var do = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-11-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-11-n.js
new file mode 100644
index 000000000..625154cdd
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-11-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.3-11-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-11-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var finally = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var finally = true",     "error",    eval("var finally = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-12-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-12-n.js
new file mode 100644
index 000000000..ef1c29e0a
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-12-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.3-12-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-12-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var throw = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var throw = true",     "error",    eval("var throw = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-13-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-13-n.js
new file mode 100644
index 000000000..a4ec57f87
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-13-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.3-13-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-13-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var const = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var const = true",     "error",    eval("var const = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-14-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-14-n.js
new file mode 100644
index 000000000..748cb7183
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-14-n.js
@@ -0,0 +1,69 @@
+/* -*- 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:          7.4.3-14-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-14-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var actual = 'no error';
+var prefValue;
+
+print("This test requires option javascript.options.strict enabled");
+
+if (!options().match(/strict/))
+{
+  options('strict');
+}
+if (!options().match(/werror/))
+{
+  options('werror');
+}
+
+try
+{
+  eval("var enum = true");
+}
+catch(e)
+{
+  actual = 'error';
+}
+
+DESCRIPTION = "var enum = true";
+EXPECTED = "error";
+
+// force exception since this is a negative test
+if (actual == 'error')
+{
+  throw actual;
+}
+
+new TestCase( SECTION, 
+              "var enum = true",    
+              "error",   
+              actual );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-15-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-15-n.js
new file mode 100644
index 000000000..5a3d62c8c
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-15-n.js
@@ -0,0 +1,63 @@
+/* -*- 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:          7.4.3-15-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-15-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var actual = 'no error';
+var prefValue;
+
+print("This test requires option javascript.options.strict enabled");
+
+options('strict');
+options('werror');
+
+try
+{
+  eval("var import = true");
+}
+catch(e)
+{
+  actual = 'error';
+}
+
+DESCRIPTION = "var import = true";
+EXPECTED = "error";
+
+// force exception since this is a negative test
+if (actual == 'error')
+{
+  throw actual;
+}
+
+new TestCase( SECTION, 
+              "var import = true",    
+              "error",   
+              actual );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-16-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-16-n.js
new file mode 100644
index 000000000..5a42152e6
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-16-n.js
@@ -0,0 +1,54 @@
+/* -*- 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:          lexical-023.js
+   Corresponds To:     7.4.3-16-n.js
+   ECMA Section:       7.4.3
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "lexical-023.js";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var result = "Failed";
+var exception = "No exception thrown";
+var expect = "Passed";
+/*
+  try {
+  try = true;
+  } catch ( e ) {
+  result = expect;
+  exception = e.toString();
+  }
+*/
+
+DESCRIPTION = "try = true";
+EXPECTED = "error";
+
+new TestCase(
+  SECTION,
+  "try = true" +
+  " (threw " + exception +")",
+  "error",
+  eval("try = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-2-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-2-n.js
new file mode 100644
index 000000000..6e3e557ee
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-2-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.3-2-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-2-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var debugger = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var debugger = true",     "error",    eval("var debugger = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-3-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-3-n.js
new file mode 100644
index 000000000..f3b0b38db
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-3-n.js
@@ -0,0 +1,38 @@
+// |reftest| skip -- obsolete test
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          7.4.3-3-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-3-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var export = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var export = true",     "error",    eval("var export = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-4-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-4-n.js
new file mode 100644
index 000000000..5cea867e0
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-4-n.js
@@ -0,0 +1,68 @@
+/* -*- 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:          7.4.3-4-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-4-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var actual = 'no error';
+var prefValue;
+
+print("This test requires option javascript.options.strict enabled");
+
+if (!options().match(/strict/))
+{
+  options('strict');
+}
+if (!options().match(/werror/))
+{
+  options('werror');
+}
+
+try
+{
+  eval("var super = true");
+}
+catch(e)
+{
+  actual = 'error';
+}
+
+DESCRIPTION = "var super = true"
+  EXPECTED = "error";
+
+// force exception since this is a negative test
+if (actual == 'error')
+{
+  throw actual;
+}
+
+new TestCase( SECTION, 
+              "var super = true",    
+              "error",   
+              actual );
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-5-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-5-n.js
new file mode 100644
index 000000000..7c27b51dc
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-5-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.3-5-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-5-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+   
+DESCRIPTION = "var catch = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var catch = true",     "error",    eval("var catch = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-6-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-6-n.js
new file mode 100644
index 000000000..00770ff42
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-6-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.3-6-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-6-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var default = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var default = true",     "error",    eval("var default = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-7-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-7-n.js
new file mode 100644
index 000000000..b6f1bc073
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-7-n.js
@@ -0,0 +1,69 @@
+/* -*- 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:          7.4.3-7-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-7-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var actual = 'no error';
+var prefValue;
+
+print("This test requires option javascript.options.strict enabled");
+
+if (!options().match(/strict/))
+{
+  options('strict');
+}
+if (!options().match(/werror/))
+{
+  options('werror');
+}
+
+try
+{
+  eval("var extends = true");
+}
+catch(e)
+{
+  actual = 'error';
+}
+
+DESCRIPTION = "var extends = true";
+EXPECTED = "error";
+
+// force exception since this is a negative test
+if (actual == 'error')
+{
+  throw actual;
+}
+
+new TestCase( SECTION, 
+              "var extends = true",    
+              "error",   
+              actual);
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-8-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-8-n.js
new file mode 100644
index 000000000..f6d5f86b6
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-8-n.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.4.3-8-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-9-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var switch = true";
+EXPECTED = "error";
+
+new TestCase( SECTION,  "var switch = true",     "error",    eval("var switch = true") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.4.3-9-n.js b/js/src/tests/ecma/LexicalConventions/7.4.3-9-n.js
new file mode 100644
index 000000000..94bcdca68
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.4.3-9-n.js
@@ -0,0 +1,70 @@
+/* -*- 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:          7.4.3-9-n.js
+   ECMA Section:       7.4.3
+
+   Description:
+   The following words are used as keywords in proposed extensions and are
+   therefore reserved to allow for the possibility of future adoption of
+   those extensions.
+
+   FutureReservedWord :: one of
+   case    debugger    export      super
+   catch   default     extends     switch
+   class   do          finally     throw
+   const   enum        import      try
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "7.4.3-9-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Future Reserved Words";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var actual = 'no error';
+var prefValue;
+
+DESCRIPTION = "var class = true";
+EXPECTED = "error";
+
+
+print("This test requires option javascript.options.strict enabled");
+
+if (!options().match(/strict/))
+{
+  options('strict');
+}
+if (!options().match(/werror/))
+{
+  options('werror');
+}
+
+try
+{
+  eval("var class = true");
+}
+catch(e)
+{
+  actual = 'error';
+}
+
+// force exception since this is a negative test
+if (actual == 'error')
+{
+  throw actual;
+}
+
+new TestCase( SECTION, 
+              "var class = true",    
+              "error",   
+              actual );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.5-1.js b/js/src/tests/ecma/LexicalConventions/7.5-1.js
new file mode 100644
index 000000000..9888f17cd
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.5-1.js
@@ -0,0 +1,28 @@
+/* -*- 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:          7.5-1.js
+   ECMA Section:       7.5 Identifiers
+   Description:        Identifiers are of unlimited length
+   - can contain letters, a decimal digit, _, or $
+   - the first character cannot be a decimal digit
+   - identifiers are case sensitive
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.5-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Identifiers";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,    "var $123 = 5",      5,       eval("var $123 = 5;$123") );
+new TestCase( SECTION,    "var _123 = 5",      5,       eval("var _123 = 5;_123") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.5-10-n.js b/js/src/tests/ecma/LexicalConventions/7.5-10-n.js
new file mode 100644
index 000000000..dca2cbfce
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.5-10-n.js
@@ -0,0 +1,30 @@
+/* -*- 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:          7.5-9-n.js
+   ECMA Section:       7.5 Identifiers
+   Description:        Identifiers are of unlimited length
+   - can contain letters, a decimal digit, _, or $
+   - the first character cannot be a decimal digit
+   - identifiers are case sensitive
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.5-9-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Identifiers";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var 123=\"hi\"";
+EXPECTED = "error";
+
+new TestCase( SECTION,    "var 123=\"hi\"",   "error",    eval("123 = \"hi\"; array[item] = 123;") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.5-2-n.js b/js/src/tests/ecma/LexicalConventions/7.5-2-n.js
new file mode 100644
index 000000000..3f9097511
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.5-2-n.js
@@ -0,0 +1,30 @@
+/* -*- 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:          7.5-2-n.js
+   ECMA Section:       7.5 Identifiers
+   Description:        Identifiers are of unlimited length
+   - can contain letters, a decimal digit, _, or $
+   - the first character cannot be a decimal digit
+   - identifiers are case sensitive
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.5-2-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Identifiers";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var 0abc";
+EXPECTED = "error";
+
+new TestCase( SECTION,    "var 0abc",   "error",    eval("var 0abc") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.5-3-n.js b/js/src/tests/ecma/LexicalConventions/7.5-3-n.js
new file mode 100644
index 000000000..f88cc7710
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.5-3-n.js
@@ -0,0 +1,30 @@
+/* -*- 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:          7.5-2.js
+   ECMA Section:       7.5 Identifiers
+   Description:        Identifiers are of unlimited length
+   - can contain letters, a decimal digit, _, or $
+   - the first character cannot be a decimal digit
+   - identifiers are case sensitive
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.5-3-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Identifiers";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var 1abc";
+EXPECTED = "error";
+
+new TestCase( SECTION,    "var 1abc",   "error",    eval("var 1abc") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.5-4-n.js b/js/src/tests/ecma/LexicalConventions/7.5-4-n.js
new file mode 100644
index 000000000..393a57afa
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.5-4-n.js
@@ -0,0 +1,30 @@
+/* -*- 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:          7.5-4-n.js
+   ECMA Section:       7.5 Identifiers
+   Description:        Identifiers are of unlimited length
+   - can contain letters, a decimal digit, _, or $
+   - the first character cannot be a decimal digit
+   - identifiers are case sensitive
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.5-4-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Identifiers";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var 2abc";
+EXPECTED = "error";
+
+new TestCase( SECTION,    "var 2abc",   "error",    eval("var 2abc") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.5-5-n.js b/js/src/tests/ecma/LexicalConventions/7.5-5-n.js
new file mode 100644
index 000000000..c04138b6e
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.5-5-n.js
@@ -0,0 +1,30 @@
+/* -*- 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:          7.5-5-n.js
+   ECMA Section:       7.5 Identifiers
+   Description:        Identifiers are of unlimited length
+   - can contain letters, a decimal digit, _, or $
+   - the first character cannot be a decimal digit
+   - identifiers are case sensitive
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.5-5-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Identifiers";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var 3abc";
+EXPECTED = "error";
+
+new TestCase( SECTION,    "var 3abc",   "error",    eval("var 3abc") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.5-6.js b/js/src/tests/ecma/LexicalConventions/7.5-6.js
new file mode 100644
index 000000000..cca79cc20
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.5-6.js
@@ -0,0 +1,27 @@
+/* -*- 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:          7.5-6.js
+   ECMA Section:       7.5 Identifiers
+   Description:        Identifiers are of unlimited length
+   - can contain letters, a decimal digit, _, or $
+   - the first character cannot be a decimal digit
+   - identifiers are case sensitive
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.5-6";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Identifiers";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,    "var _0abc = 5",   5,    eval("var _0abc = 5; _0abc") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.5-7.js b/js/src/tests/ecma/LexicalConventions/7.5-7.js
new file mode 100644
index 000000000..3c6bf48ca
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.5-7.js
@@ -0,0 +1,27 @@
+/* -*- 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:          7.5-7.js
+   ECMA Section:       7.5 Identifiers
+   Description:        Identifiers are of unlimited length
+   - can contain letters, a decimal digit, _, or $
+   - the first character cannot be a decimal digit
+   - identifiers are case sensitive
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.5-7";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Identifiers";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,    "var $0abc = 5",   5,    eval("var $0abc = 5; $0abc") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.5-8-n.js b/js/src/tests/ecma/LexicalConventions/7.5-8-n.js
new file mode 100644
index 000000000..efb30e9d9
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.5-8-n.js
@@ -0,0 +1,30 @@
+/* -*- 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:          7.5-8-n.js
+   ECMA Section:       7.5 Identifiers
+   Description:        Identifiers are of unlimited length
+   - can contain letters, a decimal digit, _, or $
+   - the first character cannot be a decimal digit
+   - identifiers are case sensitive
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.5-8-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Identifiers";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var @0abc = 5; @0abc";
+EXPECTED = "error";
+
+new TestCase( SECTION,    "var @0abc = 5; @0abc",   "error",    eval("var @0abc = 5; @0abc") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.5-9-n.js b/js/src/tests/ecma/LexicalConventions/7.5-9-n.js
new file mode 100644
index 000000000..9d6c01273
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.5-9-n.js
@@ -0,0 +1,30 @@
+/* -*- 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:          7.5-9-n.js
+   ECMA Section:       7.5 Identifiers
+   Description:        Identifiers are of unlimited length
+   - can contain letters, a decimal digit, _, or $
+   - the first character cannot be a decimal digit
+   - identifiers are case sensitive
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "7.5-9-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Identifiers";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var 123=\"hi\"";
+EXPECTED = "error";
+
+new TestCase( SECTION,    "var 123=\"hi\"",   "error",    eval("var 123 = \"hi\";array[item] = 123;") );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.6.js b/js/src/tests/ecma/LexicalConventions/7.6.js
new file mode 100644
index 000000000..b86ee9624
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.6.js
@@ -0,0 +1,279 @@
+/* -*- tab-width: 2; 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:          7.6.js
+   ECMA Section:       Punctuators
+   Description:
+
+   This tests verifies that all ECMA punctutors are recognized as a
+   token separator, but does not attempt to verify the functionality
+   of any punctuator.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "7.6";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Punctuators";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// ==
+new TestCase( SECTION,
+	      "var c,d;c==d",
+	      true,
+	      eval("var c,d;c==d") );
+
+// =
+
+new TestCase( SECTION,
+	      "var a=true;a",
+	      true,
+	      eval("var a=true;a") );
+
+// >
+new TestCase( SECTION,
+	      "var a=true,b=false;a>b",
+	      true,
+	      eval("var a=true,b=false;a>b") );
+
+// <
+new TestCase( SECTION,
+	      "var a=true,b=false;a<b",
+	      false,
+	      eval("var a=true,b=false;a<b") );
+
+// <=
+new TestCase( SECTION,
+	      "var a=0xFFFF,b=0X0FFF;a<=b",
+	      false,
+	      eval("var a=0xFFFF,b=0X0FFF;a<=b") );
+
+// >=
+new TestCase( SECTION,
+	      "var a=0xFFFF,b=0XFFFE;a>=b",
+	      true,
+	      eval("var a=0xFFFF,b=0XFFFE;a>=b") );
+
+// !=
+new TestCase( SECTION,
+	      "var a=true,b=false;a!=b",
+	      true,
+	      eval("var a=true,b=false;a!=b") );
+
+new TestCase( SECTION,
+	      "var a=false,b=false;a!=b",
+	      false,
+	      eval("var a=false,b=false;a!=b") );
+// ,
+new TestCase( SECTION,
+	      "var a=true,b=false;a,b",
+	      false,
+	      eval("var a=true,b=false;a,b") );
+// !
+new TestCase( SECTION,
+	      "var a=true,b=false;!a",
+	      false,
+	      eval("var a=true,b=false;!a") );
+
+// ~
+new TestCase( SECTION,
+	      "var a=true;~a",
+	      -2,
+	      eval("var a=true;~a") );
+// ?
+new TestCase( SECTION,
+	      "var a=true; (a ? 'PASS' : '')",
+	      "PASS",
+	      eval("var a=true; (a ? 'PASS' : '')") );
+
+// :
+
+new TestCase( SECTION,
+	      "var a=false; (a ? 'FAIL' : 'PASS')",
+	      "PASS",
+	      eval("var a=false; (a ? 'FAIL' : 'PASS')") );
+// .
+
+new TestCase( SECTION,
+	      "var a=Number;a.NaN",
+	      NaN,
+	      eval("var a=Number;a.NaN") );
+
+// &&
+new TestCase( SECTION,
+	      "var a=true,b=true;if(a&&b)'PASS';else'FAIL'",
+	      "PASS",
+	      eval("var a=true,b=true;if(a&&b)'PASS';else'FAIL'") );
+
+// ||
+new TestCase( SECTION,
+	      "var a=false,b=false;if(a||b)'FAIL';else'PASS'",
+	      "PASS",
+	      eval("var a=false,b=false;if(a||b)'FAIL';else'PASS'") );
+// ++
+new TestCase( SECTION,
+	      "var a=false,b=false;++a",
+	      1,
+	      eval("var a=false,b=false;++a") );
+// --
+new TestCase( SECTION,
+	      "var a=true,b=false--a",
+	      0,
+	      eval("var a=true,b=false;--a") );
+// +
+
+new TestCase( SECTION,
+	      "var a=true,b=true;a+b",
+	      2,
+	      eval("var a=true,b=true;a+b") );
+// -
+new TestCase( SECTION,
+	      "var a=true,b=true;a-b",
+	      0,
+	      eval("var a=true,b=true;a-b") );
+// *
+new TestCase( SECTION,
+	      "var a=true,b=true;a*b",
+	      1,
+	      eval("var a=true,b=true;a*b") );
+// /
+new TestCase( SECTION,
+	      "var a=true,b=true;a/b",
+	      1,
+	      eval("var a=true,b=true;a/b") );
+// &
+new TestCase( SECTION,
+	      "var a=3,b=2;a&b",
+	      2,
+	      eval("var a=3,b=2;a&b") );
+// |
+new TestCase( SECTION,
+	      "var a=4,b=3;a|b",
+	      7,
+	      eval("var a=4,b=3;a|b") );
+
+// |
+new TestCase( SECTION,
+	      "var a=4,b=3;a^b",
+	      7,
+	      eval("var a=4,b=3;a^b") );
+
+// %
+new TestCase( SECTION,
+	      "var a=4,b=3;a|b",
+	      1,
+	      eval("var a=4,b=3;a%b") );
+
+// <<
+new TestCase( SECTION,
+	      "var a=4,b=3;a<<b",
+	      32,
+	      eval("var a=4,b=3;a<<b") );
+
+//  >>
+new TestCase( SECTION,
+	      "var a=4,b=1;a>>b",
+	      2,
+	      eval("var a=4,b=1;a>>b") );
+
+//  >>>
+new TestCase( SECTION,
+	      "var a=1,b=1;a>>>b",
+	      0,
+	      eval("var a=1,b=1;a>>>b") );
+//  +=
+new TestCase( SECTION,
+	      "var a=4,b=3;a+=b;a",
+	      7,
+	      eval("var a=4,b=3;a+=b;a") );
+
+//  -=
+new TestCase( SECTION,
+	      "var a=4,b=3;a-=b;a",
+	      1,
+	      eval("var a=4,b=3;a-=b;a") );
+//  *=
+new TestCase( SECTION,
+	      "var a=4,b=3;a*=b;a",
+	      12,
+	      eval("var a=4,b=3;a*=b;a") );
+//  +=
+new TestCase( SECTION,
+	      "var a=4,b=3;a+=b;a",
+	      7,
+	      eval("var a=4,b=3;a+=b;a") );
+//  /=
+new TestCase( SECTION,
+	      "var a=12,b=3;a/=b;a",
+	      4,
+	      eval("var a=12,b=3;a/=b;a") );
+
+//  &=
+new TestCase( SECTION,
+	      "var a=4,b=5;a&=b;a",
+	      4,
+	      eval("var a=4,b=5;a&=b;a") );
+
+// |=
+new TestCase( SECTION,
+	      "var a=4,b=5;a&=b;a",
+	      5,
+	      eval("var a=4,b=5;a|=b;a") );
+//  ^=
+new TestCase( SECTION,
+	      "var a=4,b=5;a^=b;a",
+	      1,
+	      eval("var a=4,b=5;a^=b;a") );
+// %=
+new TestCase( SECTION,
+	      "var a=12,b=5;a%=b;a",
+	      2,
+	      eval("var a=12,b=5;a%=b;a") );
+// <<=
+new TestCase( SECTION,
+	      "var a=4,b=3;a<<=b;a",
+	      32,
+	      eval("var a=4,b=3;a<<=b;a") );
+
+//  >>
+new TestCase( SECTION,
+	      "var a=4,b=1;a>>=b;a",
+	      2,
+	      eval("var a=4,b=1;a>>=b;a") );
+
+//  >>>
+new TestCase( SECTION,
+	      "var a=1,b=1;a>>>=b;a",
+	      0,
+	      eval("var a=1,b=1;a>>>=b;a") );
+
+// ()
+new TestCase( SECTION,
+	      "var a=4,b=3;(a)",
+	      4,
+	      eval("var a=4,b=3;(a)") );
+// {}
+new TestCase( SECTION,
+	      "var a=4,b=3;{b}",
+	      3,
+	      eval("var a=4,b=3;{b}") );
+
+// []
+new TestCase( SECTION,
+	      "var a=new Array('hi');a[0]",
+	      "hi",
+	      eval("var a=new Array('hi');a[0]") );
+// []
+new TestCase( SECTION,
+	      ";",
+	      void 0,
+	      eval(";") );
+test();
+
diff --git a/js/src/tests/ecma/LexicalConventions/7.7.1.js b/js/src/tests/ecma/LexicalConventions/7.7.1.js
new file mode 100644
index 000000000..c50a37873
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.7.1.js
@@ -0,0 +1,30 @@
+/* -*- 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:          7.7.1.js
+   ECMA Section:       7.7.1 Null Literals
+
+   Description:        NullLiteral::
+   null
+
+
+   The value of the null literal null is the sole value
+   of the Null type, namely null.
+
+   Author:             christine@netscape.com
+   Date:               21 october 1997
+*/
+var SECTION = "7.7.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Null Literals";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "null",     null,        null);
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.7.2.js b/js/src/tests/ecma/LexicalConventions/7.7.2.js
new file mode 100644
index 000000000..77ebdea60
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.7.2.js
@@ -0,0 +1,37 @@
+/* -*- 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:          7.7.2.js
+   ECMA Section:       7.7.2 Boolean Literals
+
+   Description:        BooleanLiteral::
+   true
+   false
+
+   The value of the Boolean literal true is a value of the
+   Boolean type, namely true.
+
+   The value of the Boolean literal false is a value of the
+   Boolean type, namely false.
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "7.7.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Boolean Literals";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// StringLiteral:: "" and ''
+
+new TestCase( SECTION, "true",     Boolean(true),     true );
+new TestCase( SECTION, "false",    Boolean(false),    false );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.7.3-1.js b/js/src/tests/ecma/LexicalConventions/7.7.3-1.js
new file mode 100644
index 000000000..e5bc48e10
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.7.3-1.js
@@ -0,0 +1,164 @@
+/* -*- tab-width: 2; 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:          7.7.3-1.js
+   ECMA Section:       7.7.3 Numeric Literals
+
+   Description:        A numeric literal stands for a value of the Number type
+   This value is determined in two steps:  first a
+   mathematical value (MV) is derived from the literal;
+   second, this mathematical value is rounded, ideally
+   using IEEE 754 round-to-nearest mode, to a reprentable
+   value of of the number type.
+
+   These test cases came from Waldemar.
+
+   Author:             christine@netscape.com
+   Date:               12 June 1998
+*/
+
+var SECTION = "7.7.3-1";
+var VERSION = "ECMA_1";
+var TITLE   = "Numeric Literals";
+var BUGNUMBER="122877";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "0x12345678",
+	      305419896,
+	      0x12345678 );
+
+new TestCase( SECTION,
+	      "0x80000000",
+	      2147483648,
+	      0x80000000 );
+
+new TestCase( SECTION,
+	      "0xffffffff",
+	      4294967295,
+	      0xffffffff );
+
+new TestCase( SECTION,
+	      "0x100000000",
+	      4294967296,
+	      0x100000000 );
+
+new TestCase( SECTION,
+	      "077777777777777777",
+	      2251799813685247,
+	      077777777777777777 );
+
+new TestCase( SECTION,
+	      "077777777777777776",
+	      2251799813685246,
+	      077777777777777776 );
+
+new TestCase( SECTION,
+	      "0x1fffffffffffff",
+	      9007199254740991,
+	      0x1fffffffffffff );
+
+new TestCase( SECTION,
+	      "0x20000000000000",
+	      9007199254740992,
+	      0x20000000000000 );
+
+new TestCase( SECTION,
+	      "0x20123456789abc",
+	      9027215253084860,
+	      0x20123456789abc );
+
+new TestCase( SECTION,
+	      "0x20123456789abd",
+	      9027215253084860,
+	      0x20123456789abd );
+
+new TestCase( SECTION,
+	      "0x20123456789abe",
+	      9027215253084862,
+	      0x20123456789abe );
+
+new TestCase( SECTION,
+	      "0x20123456789abf",
+	      9027215253084864,
+	      0x20123456789abf );
+
+new TestCase( SECTION,
+	      "0x1000000000000080",
+	      1152921504606847000,
+	      0x1000000000000080 );
+
+new TestCase( SECTION,
+	      "0x1000000000000081",
+	      1152921504606847200,
+	      0x1000000000000081 );
+
+new TestCase( SECTION,
+	      "0x1000000000000100",
+	      1152921504606847200,
+	      0x1000000000000100 );
+
+new TestCase( SECTION,
+	      "0x100000000000017f",
+	      1152921504606847200,
+	      0x100000000000017f );
+
+new TestCase( SECTION,
+	      "0x1000000000000180",
+	      1152921504606847500,
+	      0x1000000000000180 );
+
+new TestCase( SECTION,
+	      "0x1000000000000181",
+	      1152921504606847500,
+	      0x1000000000000181 );
+
+new TestCase( SECTION,
+	      "0x10000000000001f0",
+	      1152921504606847500,
+	      0x10000000000001f0 );
+
+new TestCase( SECTION,
+	      "0x1000000000000200",
+	      1152921504606847500,
+	      0x1000000000000200 );
+
+new TestCase( SECTION,
+	      "0x100000000000027f",
+	      1152921504606847500,
+	      0x100000000000027f );
+
+new TestCase( SECTION,
+	      "0x1000000000000280",
+	      1152921504606847500,
+	      0x1000000000000280 );
+
+new TestCase( SECTION,
+	      "0x1000000000000281",
+	      1152921504606847700,
+	      0x1000000000000281 );
+
+new TestCase( SECTION,
+	      "0x10000000000002ff",
+	      1152921504606847700,
+	      0x10000000000002ff );
+
+new TestCase( SECTION,
+	      "0x1000000000000300",
+	      1152921504606847700,
+	      0x1000000000000300 );
+
+new TestCase( SECTION,
+	      "0x10000000000000000",
+	      18446744073709552000,
+	      0x10000000000000000 );
+
+test();
+
diff --git a/js/src/tests/ecma/LexicalConventions/7.7.3-2.js b/js/src/tests/ecma/LexicalConventions/7.7.3-2.js
new file mode 100644
index 000000000..41aee54e4
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.7.3-2.js
@@ -0,0 +1,59 @@
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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:          7.7.3-2.js
+   ECMA Section:       7.7.3 Numeric Literals
+
+   Description:
+
+   This is a regression test for
+   http://scopus.mcom.com/bugsplat/show_bug.cgi?id=122884
+
+   Waldemar's comments:
+
+   A numeric literal that starts with either '08' or '09' is interpreted as a
+   decimal literal; it should be an error instead.  (Strictly speaking, according
+   to ECMA v1 such literals should be interpreted as two integers -- a zero
+   followed by a decimal number whose first digit is 8 or 9, but this is a bug in
+   ECMA that will be fixed in v2.  In any case, there is no place in the grammar
+   where two consecutive numbers would be legal.)
+
+   Author:             christine@netscape.com
+   Date:               15 june 1998
+
+*/
+var SECTION = "7.7.3-2";
+var VERSION = "ECMA_1";
+var TITLE   = "Numeric Literals";
+var BUGNUMBER="122884";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "9",
+	      9,
+	      9 );
+
+new TestCase( SECTION,
+	      "09",
+	      9,
+	      09 );
+
+new TestCase( SECTION,
+	      "099",
+	      99,
+	      099 );
+
+
+new TestCase( SECTION,
+	      "077",
+	      63,
+	      077 );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.7.3.js b/js/src/tests/ecma/LexicalConventions/7.7.3.js
new file mode 100644
index 000000000..15dfaa8b2
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.7.3.js
@@ -0,0 +1,297 @@
+/* -*- tab-width: 2; 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:          7.7.3.js
+   ECMA Section:       7.7.3 Numeric Literals
+
+   Description:        A numeric literal stands for a value of the Number type
+   This value is determined in two steps:  first a
+   mathematical value (MV) is derived from the literal;
+   second, this mathematical value is rounded, ideally
+   using IEEE 754 round-to-nearest mode, to a reprentable
+   value of of the number type.
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "7.7.3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Numeric Literals";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "0",     0,      0 );
+new TestCase( SECTION, "1",     1,      1 );
+new TestCase( SECTION, "2",     2,      2 );
+new TestCase( SECTION, "3",     3,      3 );
+new TestCase( SECTION, "4",     4,      4 );
+new TestCase( SECTION, "5",     5,      5 );
+new TestCase( SECTION, "6",     6,      6 );
+new TestCase( SECTION, "7",     7,      7 );
+new TestCase( SECTION, "8",     8,      8 );
+new TestCase( SECTION, "9",     9,      9 );
+
+new TestCase( SECTION, "0.",     0,      0. );
+new TestCase( SECTION, "1.",     1,      1. );
+new TestCase( SECTION, "2.",     2,      2. );
+new TestCase( SECTION, "3.",     3,      3. );
+new TestCase( SECTION, "4.",     4,      4. );
+
+new TestCase( SECTION, "0.e0",  0,      0.e0 );
+new TestCase( SECTION, "1.e1",  10,     1.e1 );
+new TestCase( SECTION, "2.e2",  200,    2.e2 );
+new TestCase( SECTION, "3.e3",  3000,   3.e3 );
+new TestCase( SECTION, "4.e4",  40000,  4.e4 );
+
+new TestCase( SECTION, "0.1e0",  .1,    0.1e0 );
+new TestCase( SECTION, "1.1e1",  11,    1.1e1 );
+new TestCase( SECTION, "2.2e2",  220,   2.2e2 );
+new TestCase( SECTION, "3.3e3",  3300,  3.3e3 );
+new TestCase( SECTION, "4.4e4",  44000, 4.4e4 );
+
+new TestCase( SECTION, ".1e0",  .1,   .1e0 );
+new TestCase( SECTION, ".1e1",  1,    .1e1 );
+new TestCase( SECTION, ".2e2",  20,   .2e2 );
+new TestCase( SECTION, ".3e3",  300,  .3e3 );
+new TestCase( SECTION, ".4e4",  4000, .4e4 );
+
+new TestCase( SECTION, "0e0",  0,     0e0 );
+new TestCase( SECTION, "1e1",  10,    1e1 );
+new TestCase( SECTION, "2e2",  200,   2e2 );
+new TestCase( SECTION, "3e3",  3000,  3e3 );
+new TestCase( SECTION, "4e4",  40000, 4e4 );
+
+new TestCase( SECTION, "0e0",  0,     0e0 );
+new TestCase( SECTION, "1e1",  10,    1e1 );
+new TestCase( SECTION, "2e2",  200,   2e2 );
+new TestCase( SECTION, "3e3",  3000,  3e3 );
+new TestCase( SECTION, "4e4",  40000, 4e4 );
+
+new TestCase( SECTION, "0E0",  0,     0E0 );
+new TestCase( SECTION, "1E1",  10,    1E1 );
+new TestCase( SECTION, "2E2",  200,   2E2 );
+new TestCase( SECTION, "3E3",  3000,  3E3 );
+new TestCase( SECTION, "4E4",  40000, 4E4 );
+
+new TestCase( SECTION, "1.e-1",  0.1,     1.e-1 );
+new TestCase( SECTION, "2.e-2",  0.02,    2.e-2 );
+new TestCase( SECTION, "3.e-3",  0.003,   3.e-3 );
+new TestCase( SECTION, "4.e-4",  0.0004,  4.e-4 );
+
+new TestCase( SECTION, "0.1e-0",  .1,     0.1e-0 );
+new TestCase( SECTION, "1.1e-1",  0.11,   1.1e-1 );
+new TestCase( SECTION, "2.2e-2",  .022,   2.2e-2 );
+new TestCase( SECTION, "3.3e-3",  .0033,  3.3e-3 );
+new TestCase( SECTION, "4.4e-4",  .00044, 4.4e-4 );
+
+new TestCase( SECTION, ".1e-0",  .1,    .1e-0 );
+new TestCase( SECTION, ".1e-1",  .01,    .1e-1 );
+new TestCase( SECTION, ".2e-2",  .002,   .2e-2 );
+new TestCase( SECTION, ".3e-3",  .0003,  .3e-3 );
+new TestCase( SECTION, ".4e-4",  .00004, .4e-4 );
+
+new TestCase( SECTION, "1.e+1",  10,     1.e+1 );
+new TestCase( SECTION, "2.e+2",  200,    2.e+2 );
+new TestCase( SECTION, "3.e+3",  3000,   3.e+3 );
+new TestCase( SECTION, "4.e+4",  40000,  4.e+4 );
+
+new TestCase( SECTION, "0.1e+0",  .1,    0.1e+0 );
+new TestCase( SECTION, "1.1e+1",  11,    1.1e+1 );
+new TestCase( SECTION, "2.2e+2",  220,   2.2e+2 );
+new TestCase( SECTION, "3.3e+3",  3300,  3.3e+3 );
+new TestCase( SECTION, "4.4e+4",  44000, 4.4e+4 );
+
+new TestCase( SECTION, ".1e+0",  .1,   .1e+0 );
+new TestCase( SECTION, ".1e+1",  1,    .1e+1 );
+new TestCase( SECTION, ".2e+2",  20,   .2e+2 );
+new TestCase( SECTION, ".3e+3",  300,  .3e+3 );
+new TestCase( SECTION, ".4e+4",  4000, .4e+4 );
+
+new TestCase( SECTION, "0x0",  0,   0x0 );
+new TestCase( SECTION, "0x1",  1,   0x1 );
+new TestCase( SECTION, "0x2",  2,   0x2 );
+new TestCase( SECTION, "0x3",  3,   0x3 );
+new TestCase( SECTION, "0x4",  4,   0x4 );
+new TestCase( SECTION, "0x5",  5,   0x5 );
+new TestCase( SECTION, "0x6",  6,   0x6 );
+new TestCase( SECTION, "0x7",  7,   0x7 );
+new TestCase( SECTION, "0x8",  8,   0x8 );
+new TestCase( SECTION, "0x9",  9,   0x9 );
+new TestCase( SECTION, "0xa",  10,  0xa );
+new TestCase( SECTION, "0xb",  11,  0xb );
+new TestCase( SECTION, "0xc",  12,  0xc );
+new TestCase( SECTION, "0xd",  13,  0xd );
+new TestCase( SECTION, "0xe",  14,  0xe );
+new TestCase( SECTION, "0xf",  15,  0xf );
+
+new TestCase( SECTION, "0X0",  0,   0X0 );
+new TestCase( SECTION, "0X1",  1,   0X1 );
+new TestCase( SECTION, "0X2",  2,   0X2 );
+new TestCase( SECTION, "0X3",  3,   0X3 );
+new TestCase( SECTION, "0X4",  4,   0X4 );
+new TestCase( SECTION, "0X5",  5,   0X5 );
+new TestCase( SECTION, "0X6",  6,   0X6 );
+new TestCase( SECTION, "0X7",  7,   0X7 );
+new TestCase( SECTION, "0X8",  8,   0X8 );
+new TestCase( SECTION, "0X9",  9,   0X9 );
+new TestCase( SECTION, "0Xa",  10,  0Xa );
+new TestCase( SECTION, "0Xb",  11,  0Xb );
+new TestCase( SECTION, "0Xc",  12,  0Xc );
+new TestCase( SECTION, "0Xd",  13,  0Xd );
+new TestCase( SECTION, "0Xe",  14,  0Xe );
+new TestCase( SECTION, "0Xf",  15,  0Xf );
+
+new TestCase( SECTION, "0x0",  0,   0x0 );
+new TestCase( SECTION, "0x1",  1,   0x1 );
+new TestCase( SECTION, "0x2",  2,   0x2 );
+new TestCase( SECTION, "0x3",  3,   0x3 );
+new TestCase( SECTION, "0x4",  4,   0x4 );
+new TestCase( SECTION, "0x5",  5,   0x5 );
+new TestCase( SECTION, "0x6",  6,   0x6 );
+new TestCase( SECTION, "0x7",  7,   0x7 );
+new TestCase( SECTION, "0x8",  8,   0x8 );
+new TestCase( SECTION, "0x9",  9,   0x9 );
+new TestCase( SECTION, "0xA",  10,  0xA );
+new TestCase( SECTION, "0xB",  11,  0xB );
+new TestCase( SECTION, "0xC",  12,  0xC );
+new TestCase( SECTION, "0xD",  13,  0xD );
+new TestCase( SECTION, "0xE",  14,  0xE );
+new TestCase( SECTION, "0xF",  15,  0xF );
+
+new TestCase( SECTION, "0X0",  0,   0X0 );
+new TestCase( SECTION, "0X1",  1,   0X1 );
+new TestCase( SECTION, "0X2",  2,   0X2 );
+new TestCase( SECTION, "0X3",  3,   0X3 );
+new TestCase( SECTION, "0X4",  4,   0X4 );
+new TestCase( SECTION, "0X5",  5,   0X5 );
+new TestCase( SECTION, "0X6",  6,   0X6 );
+new TestCase( SECTION, "0X7",  7,   0X7 );
+new TestCase( SECTION, "0X8",  8,   0X8 );
+new TestCase( SECTION, "0X9",  9,   0X9 );
+new TestCase( SECTION, "0XA",  10,  0XA );
+new TestCase( SECTION, "0XB",  11,  0XB );
+new TestCase( SECTION, "0XC",  12,  0XC );
+new TestCase( SECTION, "0XD",  13,  0XD );
+new TestCase( SECTION, "0XE",  14,  0XE );
+new TestCase( SECTION, "0XF",  15,  0XF );
+
+
+new TestCase( SECTION, "00",  0,   00 );
+new TestCase( SECTION, "01",  1,   01 );
+new TestCase( SECTION, "02",  2,   02 );
+new TestCase( SECTION, "03",  3,   03 );
+new TestCase( SECTION, "04",  4,   04 );
+new TestCase( SECTION, "05",  5,   05 );
+new TestCase( SECTION, "06",  6,   06 );
+new TestCase( SECTION, "07",  7,   07 );
+
+new TestCase( SECTION, "000",  0,   000 );
+new TestCase( SECTION, "011",  9,   011 );
+new TestCase( SECTION, "022",  18,  022 );
+new TestCase( SECTION, "033",  27,  033 );
+new TestCase( SECTION, "044",  36,  044 );
+new TestCase( SECTION, "055",  45,  055 );
+new TestCase( SECTION, "066",  54,  066 );
+new TestCase( SECTION, "077",  63,   077 );
+
+new TestCase( SECTION, "0.00000000001",  0.00000000001,  0.00000000001 );
+new TestCase( SECTION, "0.00000000001e-2",  0.0000000000001,  0.00000000001e-2 );
+
+
+new TestCase( SECTION,
+	      "123456789012345671.9999",
+	      "123456789012345660",
+	      123456789012345671.9999 +"");
+new TestCase( SECTION,
+	      "123456789012345672",
+	      "123456789012345660",
+	      123456789012345672 +"");
+
+new TestCase(   SECTION,
+		"123456789012345672.000000000000000000000000000",
+		"123456789012345660",
+		123456789012345672.000000000000000000000000000 +"");
+
+new TestCase( SECTION,
+	      "123456789012345672.01",
+	      "123456789012345680",
+	      123456789012345672.01 +"");
+
+new TestCase( SECTION,
+	      "123456789012345672.000000000000000000000000001+'' == 123456789012345680 || 123456789012345660",
+	      true,
+	      ( 123456789012345672.00000000000000000000000000 +""  == 1234567890 * 100000000 + 12345680 )
+	      ||
+	      ( 123456789012345672.00000000000000000000000000 +""  == 1234567890 * 100000000 + 12345660) );
+
+new TestCase( SECTION,
+	      "123456789012345673",
+	      "123456789012345680",
+	      123456789012345673 +"" );
+
+new TestCase( SECTION,
+	      "-123456789012345671.9999",
+	      "-123456789012345660",
+	      -123456789012345671.9999 +"" );
+
+new TestCase( SECTION,
+	      "-123456789012345672",
+	      "-123456789012345660",
+	      -123456789012345672+"");
+
+new TestCase( SECTION,
+	      "-123456789012345672.000000000000000000000000000",
+	      "-123456789012345660",
+	      -123456789012345672.000000000000000000000000000 +"");
+
+new TestCase( SECTION,
+	      "-123456789012345672.01",
+	      "-123456789012345680",
+	      -123456789012345672.01 +"" );
+
+new TestCase( SECTION,
+	      "-123456789012345672.000000000000000000000000001 == -123456789012345680 or -123456789012345660",
+	      true,
+	      (-123456789012345672.000000000000000000000000001 +"" == -1234567890 * 100000000 -12345680)
+	      ||
+	      (-123456789012345672.000000000000000000000000001 +"" == -1234567890 * 100000000 -12345660));
+
+new TestCase( SECTION,
+	      -123456789012345673,
+	      "-123456789012345680",
+	      -123456789012345673 +"");
+
+new TestCase( SECTION,
+	      "12345678901234567890",
+	      "12345678901234567000",
+	      12345678901234567890 +"" );
+
+
+/*
+  new TestCase( SECTION, "12345678901234567",         "12345678901234567",        12345678901234567+"" );
+  new TestCase( SECTION, "123456789012345678",        "123456789012345678",       123456789012345678+"" );
+  new TestCase( SECTION, "1234567890123456789",       "1234567890123456789",      1234567890123456789+"" );
+  new TestCase( SECTION, "12345678901234567890",      "12345678901234567890",     12345678901234567890+"" );
+  new TestCase( SECTION, "123456789012345678900",     "123456789012345678900",    123456789012345678900+"" );
+  new TestCase( SECTION, "1234567890123456789000",    "1234567890123456789000",   1234567890123456789000+"" );
+*/
+new TestCase( SECTION, "0x1",          1,          0x1 );
+new TestCase( SECTION, "0x10",         16,         0x10 );
+new TestCase( SECTION, "0x100",        256,        0x100 );
+new TestCase( SECTION, "0x1000",       4096,       0x1000 );
+new TestCase( SECTION, "0x10000",      65536,      0x10000 );
+new TestCase( SECTION, "0x100000",     1048576,    0x100000 );
+new TestCase( SECTION, "0x1000000",    16777216,   0x1000000 );
+new TestCase( SECTION, "0x10000000",   268435456,  0x10000000 );
+/*
+  new TestCase( SECTION, "0x100000000",          4294967296,      0x100000000 );
+  new TestCase( SECTION, "0x1000000000",         68719476736,     0x1000000000 );
+  new TestCase( SECTION, "0x10000000000",        1099511627776,     0x10000000000 );
+*/
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.7.4.js b/js/src/tests/ecma/LexicalConventions/7.7.4.js
new file mode 100644
index 000000000..afbe4c12e
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.7.4.js
@@ -0,0 +1,208 @@
+/* -*- 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:          7.7.4.js
+   ECMA Section:       7.7.4 String Literals
+
+   Description:        A string literal is zero or more characters enclosed in
+   single or double quotes.  Each character may be
+   represented by an escape sequence.
+
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "7.7.4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String Literals";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// StringLiteral:: "" and ''
+
+new TestCase( SECTION, "\"\"",     "",     "" );
+new TestCase( SECTION, "\'\'",     "",      '' );
+
+// DoubleStringCharacters:: DoubleStringCharacter :: EscapeSequence :: CharacterEscapeSequence
+new TestCase( SECTION, "\\\"",        String.fromCharCode(0x0022),     "\"" );
+new TestCase( SECTION, "\\\'",        String.fromCharCode(0x0027),     "\'" );
+new TestCase( SECTION, "\\",         String.fromCharCode(0x005C),     "\\" );
+new TestCase( SECTION, "\\b",        String.fromCharCode(0x0008),     "\b" );
+new TestCase( SECTION, "\\f",        String.fromCharCode(0x000C),     "\f" );
+new TestCase( SECTION, "\\n",        String.fromCharCode(0x000A),     "\n" );
+new TestCase( SECTION, "\\r",        String.fromCharCode(0x000D),     "\r" );
+new TestCase( SECTION, "\\t",        String.fromCharCode(0x0009),     "\t" );
+new TestCase( SECTION, "\\v",        String.fromCharCode(0x000B),        "\v" );
+
+// DoubleStringCharacters:DoubleStringCharacter::EscapeSequence::OctalEscapeSequence
+
+new TestCase( SECTION, "\\00",      String.fromCharCode(0x0000),    "\00" );
+new TestCase( SECTION, "\\01",      String.fromCharCode(0x0001),    "\01" );
+new TestCase( SECTION, "\\02",      String.fromCharCode(0x0002),    "\02" );
+new TestCase( SECTION, "\\03",      String.fromCharCode(0x0003),    "\03" );
+new TestCase( SECTION, "\\04",      String.fromCharCode(0x0004),    "\04" );
+new TestCase( SECTION, "\\05",      String.fromCharCode(0x0005),    "\05" );
+new TestCase( SECTION, "\\06",      String.fromCharCode(0x0006),    "\06" );
+new TestCase( SECTION, "\\07",      String.fromCharCode(0x0007),    "\07" );
+
+new TestCase( SECTION, "\\010",      String.fromCharCode(0x0008),    "\010" );
+new TestCase( SECTION, "\\011",      String.fromCharCode(0x0009),    "\011" );
+new TestCase( SECTION, "\\012",      String.fromCharCode(0x000A),    "\012" );
+new TestCase( SECTION, "\\013",      String.fromCharCode(0x000B),    "\013" );
+new TestCase( SECTION, "\\014",      String.fromCharCode(0x000C),    "\014" );
+new TestCase( SECTION, "\\015",      String.fromCharCode(0x000D),    "\015" );
+new TestCase( SECTION, "\\016",      String.fromCharCode(0x000E),    "\016" );
+new TestCase( SECTION, "\\017",      String.fromCharCode(0x000F),    "\017" );
+new TestCase( SECTION, "\\020",      String.fromCharCode(0x0010),    "\020" );
+new TestCase( SECTION, "\\042",      String.fromCharCode(0x0022),    "\042" );
+
+new TestCase( SECTION, "\\0",      String.fromCharCode(0x0000),    "\0" );
+new TestCase( SECTION, "\\1",      String.fromCharCode(0x0001),    "\1" );
+new TestCase( SECTION, "\\2",      String.fromCharCode(0x0002),    "\2" );
+new TestCase( SECTION, "\\3",      String.fromCharCode(0x0003),    "\3" );
+new TestCase( SECTION, "\\4",      String.fromCharCode(0x0004),    "\4" );
+new TestCase( SECTION, "\\5",      String.fromCharCode(0x0005),    "\5" );
+new TestCase( SECTION, "\\6",      String.fromCharCode(0x0006),    "\6" );
+new TestCase( SECTION, "\\7",      String.fromCharCode(0x0007),    "\7" );
+
+new TestCase( SECTION, "\\10",      String.fromCharCode(0x0008),    "\10" );
+new TestCase( SECTION, "\\11",      String.fromCharCode(0x0009),    "\11" );
+new TestCase( SECTION, "\\12",      String.fromCharCode(0x000A),    "\12" );
+new TestCase( SECTION, "\\13",      String.fromCharCode(0x000B),    "\13" );
+new TestCase( SECTION, "\\14",      String.fromCharCode(0x000C),    "\14" );
+new TestCase( SECTION, "\\15",      String.fromCharCode(0x000D),    "\15" );
+new TestCase( SECTION, "\\16",      String.fromCharCode(0x000E),    "\16" );
+new TestCase( SECTION, "\\17",      String.fromCharCode(0x000F),    "\17" );
+new TestCase( SECTION, "\\20",      String.fromCharCode(0x0010),    "\20" );
+new TestCase( SECTION, "\\42",      String.fromCharCode(0x0022),    "\42" );
+
+new TestCase( SECTION, "\\000",      String.fromCharCode(0),        "\000" );
+new TestCase( SECTION, "\\111",      String.fromCharCode(73),       "\111" );
+new TestCase( SECTION, "\\222",      String.fromCharCode(146),      "\222" );
+new TestCase( SECTION, "\\333",      String.fromCharCode(219),      "\333" );
+
+//  following line commented out as it causes a compile time error
+//    new TestCase( SECTION, "\\444",      "444",                         "\444" );
+
+// DoubleStringCharacters:DoubleStringCharacter::EscapeSequence::HexEscapeSequence
+new TestCase( SECTION, "\\xF0",      String.fromCharCode(240),         "\xF0" );
+new TestCase( SECTION, "\\xE1",      String.fromCharCode(225),         "\xE1" );
+new TestCase( SECTION, "\\xD2",      String.fromCharCode(210),         "\xD2" );
+new TestCase( SECTION, "\\xC3",      String.fromCharCode(195),         "\xC3" );
+new TestCase( SECTION, "\\xB4",      String.fromCharCode(180),         "\xB4" );
+new TestCase( SECTION, "\\xA5",      String.fromCharCode(165),         "\xA5" );
+new TestCase( SECTION, "\\x96",      String.fromCharCode(150),         "\x96" );
+new TestCase( SECTION, "\\x87",      String.fromCharCode(135),         "\x87" );
+new TestCase( SECTION, "\\x78",      String.fromCharCode(120),         "\x78" );
+new TestCase( SECTION, "\\x69",      String.fromCharCode(105),         "\x69" );
+new TestCase( SECTION, "\\x5A",      String.fromCharCode(90),         "\x5A" );
+new TestCase( SECTION, "\\x4B",      String.fromCharCode(75),         "\x4B" );
+new TestCase( SECTION, "\\x3C",      String.fromCharCode(60),         "\x3C" );
+new TestCase( SECTION, "\\x2D",      String.fromCharCode(45),         "\x2D" );
+new TestCase( SECTION, "\\x1E",      String.fromCharCode(30),         "\x1E" );
+new TestCase( SECTION, "\\x0F",      String.fromCharCode(15),         "\x0F" );
+
+// string literals only take up to two hext digits.  therefore, the third character in this string
+// should be interpreted as a StringCharacter and not part of the HextEscapeSequence
+
+new TestCase( SECTION, "\\xF0F",      String.fromCharCode(240)+"F",         "\xF0F" );
+new TestCase( SECTION, "\\xE1E",      String.fromCharCode(225)+"E",         "\xE1E" );
+new TestCase( SECTION, "\\xD2D",      String.fromCharCode(210)+"D",         "\xD2D" );
+new TestCase( SECTION, "\\xC3C",      String.fromCharCode(195)+"C",         "\xC3C" );
+new TestCase( SECTION, "\\xB4B",      String.fromCharCode(180)+"B",         "\xB4B" );
+new TestCase( SECTION, "\\xA5A",      String.fromCharCode(165)+"A",         "\xA5A" );
+new TestCase( SECTION, "\\x969",      String.fromCharCode(150)+"9",         "\x969" );
+new TestCase( SECTION, "\\x878",      String.fromCharCode(135)+"8",         "\x878" );
+new TestCase( SECTION, "\\x787",      String.fromCharCode(120)+"7",         "\x787" );
+new TestCase( SECTION, "\\x696",      String.fromCharCode(105)+"6",         "\x696" );
+new TestCase( SECTION, "\\x5A5",      String.fromCharCode(90)+"5",         "\x5A5" );
+new TestCase( SECTION, "\\x4B4",      String.fromCharCode(75)+"4",         "\x4B4" );
+new TestCase( SECTION, "\\x3C3",      String.fromCharCode(60)+"3",         "\x3C3" );
+new TestCase( SECTION, "\\x2D2",      String.fromCharCode(45)+"2",         "\x2D2" );
+new TestCase( SECTION, "\\x1E1",      String.fromCharCode(30)+"1",         "\x1E1" );
+new TestCase( SECTION, "\\x0F0",      String.fromCharCode(15)+"0",         "\x0F0" );
+
+// DoubleStringCharacter::EscapeSequence::CharacterEscapeSequence::\ NonEscapeCharacter
+new TestCase( SECTION, "\\a",    "a",        "\a" );
+new TestCase( SECTION, "\\c",    "c",        "\c" );
+new TestCase( SECTION, "\\d",    "d",        "\d" );
+new TestCase( SECTION, "\\e",    "e",        "\e" );
+new TestCase( SECTION, "\\g",    "g",        "\g" );
+new TestCase( SECTION, "\\h",    "h",        "\h" );
+new TestCase( SECTION, "\\i",    "i",        "\i" );
+new TestCase( SECTION, "\\j",    "j",        "\j" );
+new TestCase( SECTION, "\\k",    "k",        "\k" );
+new TestCase( SECTION, "\\l",    "l",        "\l" );
+new TestCase( SECTION, "\\m",    "m",        "\m" );
+new TestCase( SECTION, "\\o",    "o",        "\o" );
+new TestCase( SECTION, "\\p",    "p",        "\p" );
+new TestCase( SECTION, "\\q",    "q",        "\q" );
+new TestCase( SECTION, "\\s",    "s",        "\s" );
+new TestCase( SECTION, "\\w",    "w",        "\w" );
+new TestCase( SECTION, "\\y",    "y",        "\y" );
+new TestCase( SECTION, "\\z",    "z",        "\z" );
+new TestCase( SECTION, "\\9",    "9",        "\9" );
+
+new TestCase( SECTION, "\\A",    "A",        "\A" );
+new TestCase( SECTION, "\\B",    "B",        "\B" );
+new TestCase( SECTION, "\\C",    "C",        "\C" );
+new TestCase( SECTION, "\\D",    "D",        "\D" );
+new TestCase( SECTION, "\\E",    "E",        "\E" );
+new TestCase( SECTION, "\\F",    "F",        "\F" );
+new TestCase( SECTION, "\\G",    "G",        "\G" );
+new TestCase( SECTION, "\\H",    "H",        "\H" );
+new TestCase( SECTION, "\\I",    "I",        "\I" );
+new TestCase( SECTION, "\\J",    "J",        "\J" );
+new TestCase( SECTION, "\\K",    "K",        "\K" );
+new TestCase( SECTION, "\\L",    "L",        "\L" );
+new TestCase( SECTION, "\\M",    "M",        "\M" );
+new TestCase( SECTION, "\\N",    "N",        "\N" );
+new TestCase( SECTION, "\\O",    "O",        "\O" );
+new TestCase( SECTION, "\\P",    "P",        "\P" );
+new TestCase( SECTION, "\\Q",    "Q",        "\Q" );
+new TestCase( SECTION, "\\R",    "R",        "\R" );
+new TestCase( SECTION, "\\S",    "S",        "\S" );
+new TestCase( SECTION, "\\T",    "T",        "\T" );
+new TestCase( SECTION, "\\U",    "U",        "\U" );
+new TestCase( SECTION, "\\V",    "V",        "\V" );
+new TestCase( SECTION, "\\W",    "W",        "\W" );
+new TestCase( SECTION, "\\X",    "X",        "\X" );
+new TestCase( SECTION, "\\Y",    "Y",        "\Y" );
+new TestCase( SECTION, "\\Z",    "Z",        "\Z" );
+
+// DoubleStringCharacter::EscapeSequence::UnicodeEscapeSequence
+
+new TestCase( SECTION,  "\\u0020",  " ",        "\u0020" );
+new TestCase( SECTION,  "\\u0021",  "!",        "\u0021" );
+new TestCase( SECTION,  "\\u0022",  "\"",       "\u0022" );
+new TestCase( SECTION,  "\\u0023",  "#",        "\u0023" );
+new TestCase( SECTION,  "\\u0024",  "$",        "\u0024" );
+new TestCase( SECTION,  "\\u0025",  "%",        "\u0025" );
+new TestCase( SECTION,  "\\u0026",  "&",        "\u0026" );
+new TestCase( SECTION,  "\\u0027",  "'",        "\u0027" );
+new TestCase( SECTION,  "\\u0028",  "(",        "\u0028" );
+new TestCase( SECTION,  "\\u0029",  ")",        "\u0029" );
+new TestCase( SECTION,  "\\u002A",  "*",        "\u002A" );
+new TestCase( SECTION,  "\\u002B",  "+",        "\u002B" );
+new TestCase( SECTION,  "\\u002C",  ",",        "\u002C" );
+new TestCase( SECTION,  "\\u002D",  "-",        "\u002D" );
+new TestCase( SECTION,  "\\u002E",  ".",        "\u002E" );
+new TestCase( SECTION,  "\\u002F",  "/",        "\u002F" );
+new TestCase( SECTION,  "\\u0030",  "0",        "\u0030" );
+new TestCase( SECTION,  "\\u0031",  "1",        "\u0031" );
+new TestCase( SECTION,  "\\u0032",  "2",        "\u0032" );
+new TestCase( SECTION,  "\\u0033",  "3",        "\u0033" );
+new TestCase( SECTION,  "\\u0034",  "4",        "\u0034" );
+new TestCase( SECTION,  "\\u0035",  "5",        "\u0035" );
+new TestCase( SECTION,  "\\u0036",  "6",        "\u0036" );
+new TestCase( SECTION,  "\\u0037",  "7",        "\u0037" );
+new TestCase( SECTION,  "\\u0038",  "8",        "\u0038" );
+new TestCase( SECTION,  "\\u0039",  "9",        "\u0039" );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/7.8.2-n.js b/js/src/tests/ecma/LexicalConventions/7.8.2-n.js
new file mode 100644
index 000000000..0675322eb
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/7.8.2-n.js
@@ -0,0 +1,29 @@
+/* -*- 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:          7.8.2.js
+   ECMA Section:       7.8.2 Examples of Automatic Semicolon Insertion
+   Description:        compare some specific examples of the automatic
+   insertion rules in the EMCA specification.
+   Author:             christine@netscape.com
+   Date:               15 september 1997
+*/
+
+var SECTION="7.8.2";
+var VERSION="ECMA_1"
+  startTest();
+writeHeaderToLog(SECTION+" "+"Examples of Semicolon Insertion");
+
+
+//    new TestCase( "7.8.2",  "{ 1 \n 2 } 3",      3,         eval("{ 1 \n 2 } 3") );
+
+DESCRIPTION = "{ 1 2 } 3";
+EXPECTED = "error";
+
+new TestCase( "7.8.2",  "{ 1 2 } 3",         "error",   eval("{1 2 } 3")     );
+
+test();
diff --git a/js/src/tests/ecma/LexicalConventions/browser.js b/js/src/tests/ecma/LexicalConventions/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/browser.js
diff --git a/js/src/tests/ecma/LexicalConventions/shell.js b/js/src/tests/ecma/LexicalConventions/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/LexicalConventions/shell.js
diff --git a/js/src/tests/ecma/Math/15.8-2-n.js b/js/src/tests/ecma/Math/15.8-2-n.js
new file mode 100644
index 000000000..9915f64e1
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8-2-n.js
@@ -0,0 +1,48 @@
+/* -*- tab-width: 2; 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:          15.8-2.js
+   ECMA Section:       15.8 The Math Object
+
+   Description:
+
+   The Math object is merely a single object that has some named properties,
+   some of which are functions.
+
+   The value of the internal [[Prototype]] property of the Math object is the
+   Object prototype object (15.2.3.1).
+
+   The Math object does not have a [[Construct]] property; it is not possible
+   to use the Math object as a constructor with the new operator.
+
+   The Math object does not have a [[Call]] property; it is not possible to
+   invoke the Math object as a function.
+
+   Recall that, in this specification, the phrase "the number value for x" has
+   a technical meaning defined in section 8.5.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+
+var SECTION = "15.8-2-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Math Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "MYMATH = new Math()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "MYMATH = new Math()",
+	      "error",
+	      eval("MYMATH = new Math()") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8-3-n.js b/js/src/tests/ecma/Math/15.8-3-n.js
new file mode 100644
index 000000000..eb238069b
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8-3-n.js
@@ -0,0 +1,47 @@
+/* -*- tab-width: 2; 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:          15.8-3.js
+   ECMA Section:       15.8 The Math Object
+
+   Description:
+
+   The Math object is merely a single object that has some named properties,
+   some of which are functions.
+
+   The value of the internal [[Prototype]] property of the Math object is the
+   Object prototype object (15.2.3.1).
+
+   The Math object does not have a [[Construct]] property; it is not possible
+   to use the Math object as a constructor with the new operator.
+
+   The Math object does not have a [[Call]] property; it is not possible to
+   invoke the Math object as a function.
+
+   Recall that, in this specification, the phrase "the number value for x" has
+   a technical meaning defined in section 8.5.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+var SECTION = "15.8-3-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Math Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "MYMATH = Math()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "MYMATH = Math()",
+	      "error",
+	      eval("MYMATH = Math()") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.1-1.js b/js/src/tests/ecma/Math/15.8.1.1-1.js
new file mode 100644
index 000000000..9b21b00a4
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.1-1.js
@@ -0,0 +1,30 @@
+/* -*- tab-width: 2; 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:          15.8.1.1-1.js
+   ECMA Section:       15.8.1.1.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Math.E
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.8.1.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.E";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.E = 0; Math.E",      
+	      2.7182818284590452354, 
+	      eval("Math.E=0;Math.E") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.1-2.js b/js/src/tests/ecma/Math/15.8.1.1-2.js
new file mode 100644
index 000000000..6efa56bd5
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.1-2.js
@@ -0,0 +1,35 @@
+/* -*- tab-width: 2; 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:          15.8.1.1-2.js
+   ECMA Section:       15.8.1.1.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Math.E
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.8.1.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.E";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var MATH_E = 2.7182818284590452354
+  new TestCase( SECTION,
+		"delete(Math.E)",               
+		false,   
+		eval("delete Math.E") );
+new TestCase( SECTION,
+	      "delete(Math.E); Math.E",       
+	      MATH_E,  
+	      eval("delete Math.E; Math.E") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.2-1.js b/js/src/tests/ecma/Math/15.8.1.2-1.js
new file mode 100644
index 000000000..558914e2c
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.2-1.js
@@ -0,0 +1,30 @@
+/* -*- tab-width: 2; 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:          15.8.1.2-1.js
+   ECMA Section:       15.8.2.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Math.LN10
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.8.1.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.LN10";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.LN10=0; Math.LN10",  
+	      2.302585092994046,     
+	      eval("Math.LN10=0; Math.LN10") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.2-2.js b/js/src/tests/ecma/Math/15.8.1.2-2.js
new file mode 100644
index 000000000..0f161492f
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.2-2.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.8.1.2-1.js
+   ECMA Section:       15.8.2.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Math.LN10
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.2-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.LN10";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "delete( Math.LN10 ); Math.LN10",  
+	      2.302585092994046,      
+	      eval("delete(Math.LN10); Math.LN10") );
+
+new TestCase( SECTION,
+	      "delete( Math.LN10 ); ",            
+	      false,                 
+	      eval("delete(Math.LN10)") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.3-1.js b/js/src/tests/ecma/Math/15.8.1.3-1.js
new file mode 100644
index 000000000..63dbea87d
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.3-1.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.8.1.3-1.js
+   ECMA Section:       15.8.1.3.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Math.LN2
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.3-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.LN2";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.LN2=0; Math.LN2",    
+	      0.6931471805599453,    
+	      eval("Math.LN2=0; Math.LN2") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.3-2.js b/js/src/tests/ecma/Math/15.8.1.3-2.js
new file mode 100644
index 000000000..d9c71bfa4
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.3-2.js
@@ -0,0 +1,38 @@
+/* -*- tab-width: 2; 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:          15.8.1.3-3.js
+   ECMA Section:       15.8.1.3.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Math.LN2
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.3-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.LN2";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var MATH_LN2 = 0.6931471805599453;
+
+new TestCase( SECTION,
+	      "delete(Math.LN2)",             
+	      false,         
+	      eval("delete(Math.LN2)") );
+
+new TestCase( SECTION,
+	      "delete(Math.LN2); Math.LN2",   
+	      MATH_LN2,      
+	      eval("delete(Math.LN2); Math.LN2") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.4-1.js b/js/src/tests/ecma/Math/15.8.1.4-1.js
new file mode 100644
index 000000000..d29d114e9
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.4-1.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.8.1.4-1.js
+   ECMA Section:       15.8.1.4.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Math.LOG2E
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.4-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.LOG2E";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.L0G2E=0; Math.LOG2E",
+	      1.4426950408889634,    
+	      eval("Math.LOG2E=0; Math.LOG2E") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.4-2.js b/js/src/tests/ecma/Math/15.8.1.4-2.js
new file mode 100644
index 000000000..ff4620867
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.4-2.js
@@ -0,0 +1,35 @@
+/* -*- tab-width: 2; 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:          15.8.1.4-2.js
+   ECMA Section:       15.8.1.4.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Math.LOG2E
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.4-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.LOG2E";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "delete(Math.L0G2E);Math.LOG2E",
+	      1.4426950408889634,    
+	      eval("delete(Math.LOG2E);Math.LOG2E") );
+new TestCase( SECTION,
+	      "delete(Math.L0G2E)",           
+	      false,                 
+	      eval("delete(Math.LOG2E)") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.5-1.js b/js/src/tests/ecma/Math/15.8.1.5-1.js
new file mode 100644
index 000000000..4f83a1ad4
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.5-1.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.8.1.5-1.js
+   ECMA Section:       15.8.1.5.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Math.LOG10E
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+
+var SECTION = "15.8.1.5-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.LOG10E";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.LOG10E=0; Math.LOG10E",
+	      0.4342944819032518,  
+	      eval("Math.LOG10E=0; Math.LOG10E") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.5-2.js b/js/src/tests/ecma/Math/15.8.1.5-2.js
new file mode 100644
index 000000000..3203f0bcf
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.5-2.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.8.1.5-2.js
+   ECMA Section:       15.8.1.5.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Math.LOG10E
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.5-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.LOG10E";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "delete Math.LOG10E; Math.LOG10E",  
+	      0.4342944819032518,    
+	      eval("delete Math.LOG10E; Math.LOG10E") );
+
+new TestCase( SECTION,
+	      "delete Math.LOG10E",               
+	      false,                 
+	      eval("delete Math.LOG10E") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.6-1.js b/js/src/tests/ecma/Math/15.8.1.6-1.js
new file mode 100644
index 000000000..4a3fa1b19
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.6-1.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.8.1.6-1.js
+   ECMA Section:       15.8.1.6.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Math.PI
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.6-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.PI";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.PI=0; Math.PI",      
+	      3.1415926535897923846, 
+	      eval("Math.PI=0; Math.PI") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.6-2.js b/js/src/tests/ecma/Math/15.8.1.6-2.js
new file mode 100644
index 000000000..ad5fe3dfd
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.6-2.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.8.1.6-2.js
+   ECMA Section:       15.8.1.6.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Math.PI
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.6-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.PI";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "delete Math.PI; Math.PI",   
+	      3.1415926535897923846, 
+	      eval("delete Math.PI; Math.PI") );
+
+new TestCase( SECTION,
+	      "delete Math.PI; Math.PI", 
+	      false,   
+              eval("delete Math.PI") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.7-1.js b/js/src/tests/ecma/Math/15.8.1.7-1.js
new file mode 100644
index 000000000..bb41c1d1a
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.7-1.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.8.1.7-1.js
+   ECMA Section:       15.8.1.7.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Math.SQRT1_2
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.7-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.SQRT1_2";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.SQRT1_2=0; Math.SQRT1_2",
+	      0.7071067811865476,
+	      eval("Math.SQRT1_2=0; Math.SQRT1_2") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.7-2.js b/js/src/tests/ecma/Math/15.8.1.7-2.js
new file mode 100644
index 000000000..0c931e734
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.7-2.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.8.1.7-2.js
+   ECMA Section:       15.8.1.7.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Math.SQRT1_2
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.7-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.SQRT1_2";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "delete Math.SQRT1_2; Math.SQRT1_2",
+	      0.7071067811865476,
+	      eval("delete Math.SQRT1_2; Math.SQRT1_2") );
+
+new TestCase( SECTION,
+	      "delete Math.SQRT1_2",               
+	      false,             
+	      eval("delete Math.SQRT1_2") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.8-1.js b/js/src/tests/ecma/Math/15.8.1.8-1.js
new file mode 100644
index 000000000..6f9b4b982
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.8-1.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.8.1.8-1.js
+   ECMA Section:       15.8.1.8.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Math.SQRT2
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.1.8-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.SQRT2";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.SQRT2=0; Math.SQRT2",
+	      1.4142135623730951,    
+	      eval("Math.SQRT2=0; Math.SQRT2") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.8-2.js b/js/src/tests/ecma/Math/15.8.1.8-2.js
new file mode 100644
index 000000000..c276ab9bf
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.8-2.js
@@ -0,0 +1,35 @@
+/* -*- tab-width: 2; 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:          15.8.1.8-2.js
+   ECMA Section:       15.8.1.8.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Math.SQRT2
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.8.1.8-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.SQRT2";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "delete Math.SQRT2; Math.SQRT2",
+	      1.4142135623730951,    
+	      eval("delete Math.SQRT2; Math.SQRT2") );
+
+new TestCase( SECTION,
+	      "delete Math.SQRT2",            
+	      false,                 
+	      eval("delete Math.SQRT2") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.8-3.js b/js/src/tests/ecma/Math/15.8.1.8-3.js
new file mode 100644
index 000000000..eae3d9455
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.8-3.js
@@ -0,0 +1,29 @@
+/* -*- tab-width: 2; 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:          15.8.1.8-3.js
+   ECMA Section:       15.8.1.8.js
+   Description:        All value properties of the Math object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Math.SQRT2
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.8.1.8-3";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Math.SQRT2:  DontDelete");
+
+new TestCase( SECTION,
+	      "delete Math.SQRT2",
+	      false,    
+	      eval("delete Math.SQRT2") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.1.js b/js/src/tests/ecma/Math/15.8.1.js
new file mode 100644
index 000000000..3105fefb3
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.1.js
@@ -0,0 +1,115 @@
+/* -*- tab-width: 2; 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:          15.8.1.js
+   ECMA Section:       15.8.1.js   Value Properties of the Math Object
+   15.8.1.1    E
+   15.8.1.2    LN10
+   15.8.1.3    LN2
+   15.8.1.4    LOG2E
+   15.8.1.5    LOG10E
+   15.8.1.6    PI
+   15.8.1.7    SQRT1_2
+   15.8.1.8    SQRT2
+   Description:        verify the values of some math constants
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+*/
+var SECTION = "15.8.1"
+  var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Value Properties of the Math Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( "15.8.1.1", "Math.E",            
+	      2.7182818284590452354, 
+	      Math.E );
+
+new TestCase( "15.8.1.1",
+	      "typeof Math.E",     
+	      "number",              
+	      typeof Math.E );
+
+new TestCase( "15.8.1.2",
+	      "Math.LN10",         
+	      2.302585092994046,     
+	      Math.LN10 );
+
+new TestCase( "15.8.1.2",
+	      "typeof Math.LN10",  
+	      "number",              
+	      typeof Math.LN10 );
+
+new TestCase( "15.8.1.3",
+	      "Math.LN2",         
+	      0.6931471805599453,    
+	      Math.LN2 );
+
+new TestCase( "15.8.1.3",
+	      "typeof Math.LN2",   
+	      "number",              
+	      typeof Math.LN2 );
+
+new TestCase( "15.8.1.4",
+	      "Math.LOG2E",        
+	      1.4426950408889634,    
+	      Math.LOG2E );
+
+new TestCase( "15.8.1.4",
+	      "typeof Math.LOG2E", 
+	      "number",              
+	      typeof Math.LOG2E );
+
+new TestCase( "15.8.1.5",
+	      "Math.LOG10E",       
+	      0.4342944819032518,    
+	      Math.LOG10E);
+
+new TestCase( "15.8.1.5",
+	      "typeof Math.LOG10E",
+	      "number",              
+	      typeof Math.LOG10E);
+
+new TestCase( "15.8.1.6",
+	      "Math.PI",           
+	      3.14159265358979323846,
+	      Math.PI );
+
+new TestCase( "15.8.1.6",
+	      "typeof Math.PI",    
+	      "number",              
+	      typeof Math.PI );
+
+new TestCase( "15.8.1.7",
+	      "Math.SQRT1_2",      
+	      0.7071067811865476,    
+	      Math.SQRT1_2);
+
+new TestCase( "15.8.1.7",
+	      "typeof Math.SQRT1_2",
+	      "number",             
+	      typeof Math.SQRT1_2);
+
+new TestCase( "15.8.1.8",
+	      "Math.SQRT2",        
+	      1.4142135623730951,    
+	      Math.SQRT2 );
+
+new TestCase( "15.8.1.8",
+	      "typeof Math.SQRT2", 
+	      "number",              
+	      typeof Math.SQRT2 );
+
+new TestCase( SECTION, 
+	      "var MATHPROPS='';for( p in Math ){ MATHPROPS +=p; };MATHPROPS",
+	      "",
+	      eval("var MATHPROPS='';for( p in Math ){ MATHPROPS +=p; };MATHPROPS") );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.1.js b/js/src/tests/ecma/Math/15.8.2.1.js
new file mode 100644
index 000000000..d5ea49470
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.1.js
@@ -0,0 +1,192 @@
+/* -*- tab-width: 2; 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:          15.8.2.1.js
+   ECMA Section:       15.8.2.1 abs( x )
+   Description:        return the absolute value of the argument,
+   which should be the magnitude of the argument
+   with a positive sign.
+   -   if x is NaN, return NaN
+   -   if x is -0, result is +0
+   -   if x is -Infinity, result is +Infinity
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+var SECTION = "15.8.2.1";
+var VERSION = "ECMA_1";
+var TITLE   = "Math.abs()";
+var BUGNUMBER = "77391";
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,  
+	      "Math.abs.length",
+	      1,
+              Math.abs.length );
+
+new TestCase( SECTION,
+	      "Math.abs()", 
+	      Number.NaN,
+	      Math.abs() );
+
+new TestCase( SECTION,
+	      "Math.abs( void 0 )", 
+	      Number.NaN,
+	      Math.abs(void 0) );
+
+new TestCase( SECTION,
+	      "Math.abs( null )",  
+	      0,   
+	      Math.abs(null) );
+
+new TestCase( SECTION,
+	      "Math.abs( true )", 
+	      1,    
+	      Math.abs(true) );
+
+new TestCase( SECTION,
+	      "Math.abs( false )", 
+	      0,     
+	      Math.abs(false) );
+
+new TestCase( SECTION,
+	      "Math.abs( string primitive)",
+	      Number.NaN, 
+	      Math.abs("a string primitive") );
+
+new TestCase( SECTION,  
+	      "Math.abs( string object )",  
+	      Number.NaN,    
+	      Math.abs(new String( 'a String object' ))  );
+
+new TestCase( SECTION,  
+	      "Math.abs( Number.NaN )", 
+	      Number.NaN,
+	      Math.abs(Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.abs(0)", 
+	      0,
+              Math.abs( 0 ) );
+
+new TestCase( SECTION, 
+	      "Math.abs( -0 )", 
+	      0,  
+	      Math.abs(-0) );
+
+new TestCase( SECTION,  
+	      "Infinity/Math.abs(-0)",
+	      Infinity, 
+	      Infinity/Math.abs(-0) );
+
+new TestCase( SECTION,  
+	      "Math.abs( -Infinity )",      
+	      Number.POSITIVE_INFINITY,  
+	      Math.abs( Number.NEGATIVE_INFINITY ) );
+
+new TestCase( SECTION,  
+	      "Math.abs( Infinity )",  
+	      Number.POSITIVE_INFINITY,
+	      Math.abs( Number.POSITIVE_INFINITY ) );
+
+new TestCase( SECTION,  
+	      "Math.abs( - MAX_VALUE )",   
+	      Number.MAX_VALUE,
+	      Math.abs( - Number.MAX_VALUE )       );
+
+new TestCase( SECTION,  
+	      "Math.abs( - MIN_VALUE )",
+	      Number.MIN_VALUE,
+	      Math.abs( -Number.MIN_VALUE )        );
+
+new TestCase( SECTION,  
+	      "Math.abs( MAX_VALUE )",  
+	      Number.MAX_VALUE,  
+	      Math.abs( Number.MAX_VALUE )       );
+
+new TestCase( SECTION, 
+	      "Math.abs( MIN_VALUE )",
+	      Number.MIN_VALUE, 
+	      Math.abs( Number.MIN_VALUE )        );
+
+new TestCase( SECTION,  
+	      "Math.abs( -1 )",    
+	      1,   
+	      Math.abs( -1 )                       );
+
+new TestCase( SECTION,  
+	      "Math.abs( new Number( -1 ) )",
+	      1,   
+	      Math.abs( new Number(-1) )           );
+
+new TestCase( SECTION,  
+	      "Math.abs( 1 )",  
+	      1, 
+	      Math.abs( 1 ) );
+
+new TestCase( SECTION,  
+	      "Math.abs( Math.PI )", 
+	      Math.PI,   
+	      Math.abs( Math.PI ) );
+
+new TestCase( SECTION,
+	      "Math.abs( -Math.PI )", 
+	      Math.PI,  
+	      Math.abs( -Math.PI ) );
+
+new TestCase( SECTION,
+	      "Math.abs(-1/100000000)",
+	      1/100000000,  
+	      Math.abs(-1/100000000) );
+
+new TestCase( SECTION,
+	      "Math.abs(-Math.pow(2,32))", 
+	      Math.pow(2,32),    
+	      Math.abs(-Math.pow(2,32)) );
+
+new TestCase( SECTION,  
+	      "Math.abs(Math.pow(2,32))",
+	      Math.pow(2,32), 
+	      Math.abs(Math.pow(2,32)) );
+
+new TestCase( SECTION,
+	      "Math.abs( -0xfff )", 
+	      4095,    
+	      Math.abs( -0xfff ) );
+
+new TestCase( SECTION,
+	      "Math.abs( -0777 )", 
+	      511,   
+	      Math.abs(-0777 ) );
+
+new TestCase( SECTION,
+	      "Math.abs('-1e-1')",  
+	      0.1,  
+	      Math.abs('-1e-1') );
+
+new TestCase( SECTION, 
+	      "Math.abs('0xff')",  
+	      255,  
+	      Math.abs('0xff') );
+
+new TestCase( SECTION,
+	      "Math.abs('077')",   
+	      77,   
+	      Math.abs('077') );
+
+new TestCase( SECTION, 
+	      "Math.abs( 'Infinity' )",
+	      Infinity,
+	      Math.abs('Infinity') );
+
+new TestCase( SECTION,
+	      "Math.abs( '-Infinity' )",
+	      Infinity,
+	      Math.abs('-Infinity') );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.10.js b/js/src/tests/ecma/Math/15.8.2.10.js
new file mode 100644
index 000000000..6b53a1323
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.10.js
@@ -0,0 +1,119 @@
+/* -*- tab-width: 2; 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:          15.8.2.10.js
+   ECMA Section:       15.8.2.10  Math.log(x)
+   Description:        return an approximiation to the natural logarithm of
+   the argument.
+   special cases:
+   -   if arg is NaN       result is NaN
+   -   if arg is <0        result is NaN
+   -   if arg is 0 or -0   result is -Infinity
+   -   if arg is 1         result is 0
+   -   if arg is Infinity  result is Infinity
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.8.2.10";
+var VERSION = "ECMA_1";
+var TITLE   = "Math.log(x)";
+var BUGNUMBER = "77391";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION,
+	      "Math.log.length",
+	      1,
+	      Math.log.length );
+
+
+new TestCase( SECTION,
+	      "Math.log()",
+	      Number.NaN,
+	      Math.log() );
+
+new TestCase( SECTION,
+	      "Math.log(void 0)",
+	      Number.NaN,
+	      Math.log(void 0) );
+
+new TestCase( SECTION,
+	      "Math.log(null)",
+	      Number.NEGATIVE_INFINITY,
+	      Math.log(null) );
+
+new TestCase( SECTION,
+	      "Math.log(true)",
+	      0,
+	      Math.log(true) );
+
+new TestCase( SECTION,
+	      "Math.log(false)",
+	      -Infinity,
+	      Math.log(false) );
+
+new TestCase( SECTION,
+	      "Math.log('0')",
+	      -Infinity,
+	      Math.log('0') );
+
+new TestCase( SECTION,
+	      "Math.log('1')",
+	      0,
+	      Math.log('1') );
+
+new TestCase( SECTION,
+	      "Math.log('Infinity')",
+	      Infinity,
+	      Math.log("Infinity") );
+
+
+new TestCase( SECTION,
+	      "Math.log(NaN)",
+	      Number.NaN,
+	      Math.log(Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.log(-0.0000001)",
+	      Number.NaN,
+	      Math.log(-0.000001)  );
+
+new TestCase( SECTION,
+	      "Math.log(-1)",
+	      Number.NaN,
+	      Math.log(-1)  );
+
+new TestCase( SECTION,
+	      "Math.log(0)",
+	      Number.NEGATIVE_INFINITY,
+	      Math.log(0) );
+
+new TestCase( SECTION,
+	      "Math.log(-0)",
+	      Number.NEGATIVE_INFINITY,
+	      Math.log(-0));
+
+new TestCase( SECTION,
+	      "Math.log(1)",
+	      0,
+	      Math.log(1) );
+
+new TestCase( SECTION,
+	      "Math.log(Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.log(Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.log(-Infinity)",
+	      Number.NaN,
+	      Math.log(Number.NEGATIVE_INFINITY) );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.11.js b/js/src/tests/ecma/Math/15.8.2.11.js
new file mode 100644
index 000000000..5b3bbfe83
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.11.js
@@ -0,0 +1,166 @@
+/* -*- tab-width: 2; 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:          15.8.2.11.js
+   ECMA Section:       15.8.2.11 Math.max(x, y)
+   Description:        return the smaller of the two arguments.
+   special cases:
+   - if x is NaN or y is NaN   return NaN
+   - if x < y                  return x
+   - if y > x                  return y
+   - if x is +0 and y is +0    return +0
+   - if x is +0 and y is -0    return -0
+   - if x is -0 and y is +0    return -0
+   - if x is -0 and y is -0    return -0
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.8.2.11";
+var VERSION = "ECMA_1";
+var TITLE   = "Math.max(x, y)";
+var BUGNUMBER="76439";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.max.length",
+	      2,
+	      Math.max.length );
+
+new TestCase( SECTION,
+	      "Math.max()",
+	      -Infinity,
+	      Math.max() );
+
+new TestCase( SECTION,
+	      "Math.max(void 0, 1)",
+	      Number.NaN,
+	      Math.max( void 0, 1 ) );
+
+new TestCase( SECTION,
+	      "Math.max(void 0, void 0)",
+	      Number.NaN,
+	      Math.max( void 0, void 0 ) );
+
+new TestCase( SECTION,
+	      "Math.max(null, 1)",
+	      1,
+	      Math.max( null, 1 ) );
+
+new TestCase( SECTION,
+	      "Math.max(-1, null)",
+	      0,
+	      Math.max( -1, null ) );
+
+new TestCase( SECTION,
+	      "Math.max(true, false)",
+	      1,
+	      Math.max(true,false) );
+
+new TestCase( SECTION,
+	      "Math.max('-99','99')",
+	      99,
+	      Math.max( "-99","99") );
+
+new TestCase( SECTION,
+	      "Math.max(NaN, Infinity)",
+	      Number.NaN,
+	      Math.max(Number.NaN,Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.max(NaN, 0)",
+	      Number.NaN,
+	      Math.max(Number.NaN, 0) );
+
+new TestCase( SECTION,
+	      "Math.max('a string', 0)",
+	      Number.NaN,
+	      Math.max("a string", 0) );
+
+new TestCase( SECTION,
+	      "Math.max(NaN, 1)",
+	      Number.NaN,
+	      Math.max(Number.NaN,1) );
+
+new TestCase( SECTION,
+	      "Math.max('a string',Infinity)",
+	      Number.NaN,
+	      Math.max("a string", Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.max(Infinity, NaN)",
+	      Number.NaN,
+	      Math.max( Number.POSITIVE_INFINITY, Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.max(NaN, NaN)",
+	      Number.NaN,
+	      Math.max(Number.NaN, Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.max(0,NaN)",
+	      Number.NaN,
+	      Math.max(0,Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.max(1, NaN)",
+	      Number.NaN,
+	      Math.max(1, Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.max(0,0)",
+              0,
+	      Math.max(0,0) );
+
+new TestCase( SECTION,
+	      "Math.max(0,-0)",
+	      0,
+	      Math.max(0,-0) );
+
+new TestCase( SECTION,
+	      "Math.max(-0,0)",
+	      0,
+	      Math.max(-0,0) );
+
+new TestCase( SECTION,
+	      "Math.max(-0,-0)",
+	      -0,
+	      Math.max(-0,-0) );
+
+new TestCase( SECTION,
+	      "Infinity/Math.max(-0,-0)",
+	      -Infinity,
+	      Infinity/Math.max(-0,-0) );
+
+new TestCase( SECTION,
+	      "Math.max(Infinity, Number.MAX_VALUE)", Number.POSITIVE_INFINITY,
+	      Math.max(Number.POSITIVE_INFINITY, Number.MAX_VALUE) );
+
+new TestCase( SECTION,
+	      "Math.max(Infinity, Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.max(Number.POSITIVE_INFINITY,Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.max(-Infinity,-Infinity)",
+	      Number.NEGATIVE_INFINITY,
+	      Math.max(Number.NEGATIVE_INFINITY,Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.max(1,.99999999999999)",
+	      1,
+	      Math.max(1,.99999999999999) );
+
+new TestCase( SECTION,
+	      "Math.max(-1,-.99999999999999)",
+	      -.99999999999999,
+	      Math.max(-1,-.99999999999999) );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.12.js b/js/src/tests/ecma/Math/15.8.2.12.js
new file mode 100644
index 000000000..9c67be1c9
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.12.js
@@ -0,0 +1,143 @@
+/* -*- tab-width: 2; 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:          15.8.2.12.js
+   ECMA Section:       15.8.2.12 Math.min(x, y)
+   Description:        return the smaller of the two arguments.
+   special cases:
+   - if x is NaN or y is NaN   return NaN
+   - if x < y                  return x
+   - if y > x                  return y
+   - if x is +0 and y is +0    return +0
+   - if x is +0 and y is -0    return -0
+   - if x is -0 and y is +0    return -0
+   - if x is -0 and y is -0    return -0
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+
+var SECTION = "15.8.2.12";
+var VERSION = "ECMA_1";
+var TITLE   = "Math.min(x, y)";
+var BUGNUMBER="76439";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.min.length",
+	      2,
+	      Math.min.length );
+
+new TestCase( SECTION,
+	      "Math.min()",
+	      Infinity,
+	      Math.min() );
+
+new TestCase( SECTION,
+	      "Math.min(void 0, 1)",
+	      Number.NaN,
+	      Math.min( void 0, 1 ) );
+
+new TestCase( SECTION,
+	      "Math.min(void 0, void 0)",
+	      Number.NaN,
+	      Math.min( void 0, void 0 ) );
+
+new TestCase( SECTION,
+	      "Math.min(null, 1)",
+	      0,
+	      Math.min( null, 1 ) );
+
+new TestCase( SECTION,
+	      "Math.min(-1, null)",
+	      -1,
+	      Math.min( -1, null ) );
+
+new TestCase( SECTION,
+	      "Math.min(true, false)",
+	      0,
+	      Math.min(true,false) );
+
+new TestCase( SECTION,
+	      "Math.min('-99','99')",
+	      -99,
+	      Math.min( "-99","99") );
+
+new TestCase( SECTION,
+	      "Math.min(NaN,0)",
+	      Number.NaN,
+	      Math.min(Number.NaN,0) );
+
+new TestCase( SECTION,
+	      "Math.min(NaN,1)",
+	      Number.NaN,
+	      Math.min(Number.NaN,1) );
+
+new TestCase( SECTION,
+	      "Math.min(NaN,-1)",
+	      Number.NaN,
+	      Math.min(Number.NaN,-1) );
+
+new TestCase( SECTION,
+	      "Math.min(0,NaN)",
+	      Number.NaN,
+	      Math.min(0,Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.min(1,NaN)",
+	      Number.NaN,
+	      Math.min(1,Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.min(-1,NaN)",
+	      Number.NaN,
+	      Math.min(-1,Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.min(NaN,NaN)",
+	      Number.NaN,
+	      Math.min(Number.NaN,Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.min(1,1.0000000001)",
+	      1,
+	      Math.min(1,1.0000000001) );
+
+new TestCase( SECTION,
+	      "Math.min(1.0000000001,1)",
+	      1,
+	      Math.min(1.0000000001,1) );
+
+new TestCase( SECTION,
+	      "Math.min(0,0)",
+	      0,
+	      Math.min(0,0) );
+
+new TestCase( SECTION,
+	      "Math.min(0,-0)",
+	      -0,
+	      Math.min(0,-0) );
+
+new TestCase( SECTION,
+	      "Math.min(-0,-0)",
+	      -0,
+	      Math.min(-0,-0) );
+
+new TestCase( SECTION,
+	      "Infinity/Math.min(0,-0)",
+	      -Infinity,
+	      Infinity/Math.min(0,-0) );
+
+new TestCase( SECTION,
+	      "Infinity/Math.min(-0,-0)",
+	      -Infinity,
+	      Infinity/Math.min(-0,-0) );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.13.js b/js/src/tests/ecma/Math/15.8.2.13.js
new file mode 100644
index 000000000..c7d562217
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.13.js
@@ -0,0 +1,351 @@
+/* -*- tab-width: 2; 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:          15.8.2.13.js
+   ECMA Section:       15.8.2.13 Math.pow(x, y)
+   Description:        return an approximation to the result of x
+   to the power of y.  there are many special cases;
+   refer to the spec.
+   Author:             christine@netscape.com
+   Date:               9 july 1997
+*/
+
+var SECTION = "15.8.2.13";
+var VERSION = "ECMA_1";
+var TITLE   = "Math.pow(x, y)";
+var BUGNUMBER="77141";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.pow.length",
+	      2,
+	      Math.pow.length );
+
+new TestCase( SECTION,
+	      "Math.pow()",
+	      Number.NaN,
+	      Math.pow() );
+
+new TestCase( SECTION,
+	      "Math.pow(null, null)",
+	      1,
+	      Math.pow(null,null) );
+
+new TestCase( SECTION, 
+	      "Math.pow(void 0, void 0)",
+	      Number.NaN,
+              Math.pow(void 0, void 0));
+
+new TestCase( SECTION, 
+	      "Math.pow(true, false)",
+	      1,
+	      Math.pow(true, false) );
+
+new TestCase( SECTION, 
+	      "Math.pow(false,true)",
+	      0,
+	      Math.pow(false,true) );
+
+new TestCase( SECTION, 
+	      "Math.pow('2','32')",
+	      4294967296,
+              Math.pow('2','32') );
+
+new TestCase( SECTION, 
+	      "Math.pow(1,NaN)",
+	      Number.NaN,
+              Math.pow(1,Number.NaN) );
+
+new TestCase( SECTION, 
+	      "Math.pow(0,NaN)",	
+	      Number.NaN,
+              Math.pow(0,Number.NaN) );
+
+new TestCase( SECTION, 
+	      "Math.pow(NaN,0)",
+	      1,
+	      Math.pow(Number.NaN,0) );
+
+new TestCase( SECTION,
+	      "Math.pow(NaN,-0)",
+              1,
+	      Math.pow(Number.NaN,-0) );
+
+new TestCase( SECTION, 
+	      "Math.pow(NaN,1)",
+	      Number.NaN,
+              Math.pow(Number.NaN, 1) );
+
+new TestCase( SECTION, 
+	      "Math.pow(NaN,.5)",
+              Number.NaN,
+              Math.pow(Number.NaN, .5) );
+
+new TestCase( SECTION, 
+	      "Math.pow(1.00000001, Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(1.00000001, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(1.00000001, -Infinity)", 
+	      0,
+	      Math.pow(1.00000001, Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-1.00000001, Infinity)", 
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(-1.00000001,Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-1.00000001, -Infinity)",
+	      0,
+	      Math.pow(-1.00000001,Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(1, Infinity)",
+	      Number.NaN,
+              Math.pow(1, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(1, -Infinity)",
+	      Number.NaN,
+              Math.pow(1, Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-1, Infinity)",
+	      Number.NaN,
+              Math.pow(-1, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-1, -Infinity)",
+	      Number.NaN,
+              Math.pow(-1, Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(.0000000009, Infinity)", 
+	      0,
+	      Math.pow(.0000000009, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-.0000000009, Infinity)",
+	      0,
+	      Math.pow(-.0000000009, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(.0000000009, -Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(-.0000000009, Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(Infinity, .00000000001)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(Number.POSITIVE_INFINITY,.00000000001) );
+
+new TestCase( SECTION, 
+	      "Math.pow(Infinity, 1)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(Number.POSITIVE_INFINITY, 1) );
+
+new TestCase( SECTION, 
+	      "Math.pow(Infinity, -.00000000001)",
+	      0,
+	      Math.pow(Number.POSITIVE_INFINITY, -.00000000001) );
+
+new TestCase( SECTION, 
+	      "Math.pow(Infinity, -1)",
+	      0,
+	      Math.pow(Number.POSITIVE_INFINITY, -1) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-Infinity, 1)",
+	      Number.NEGATIVE_INFINITY,
+	      Math.pow(Number.NEGATIVE_INFINITY, 1) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-Infinity, 333)",
+	      Number.NEGATIVE_INFINITY,
+	      Math.pow(Number.NEGATIVE_INFINITY, 333) );
+
+new TestCase( SECTION, 
+	      "Math.pow(Infinity, 2)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(Number.POSITIVE_INFINITY, 2) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-Infinity, 666)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(Number.NEGATIVE_INFINITY, 666) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-Infinity, 0.5)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(Number.NEGATIVE_INFINITY, 0.5) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-Infinity, Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(Number.NEGATIVE_INFINITY, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-Infinity, -1)",
+	      -0,
+	      Math.pow(Number.NEGATIVE_INFINITY, -1) );
+
+new TestCase( SECTION, 
+	      "Infinity/Math.pow(-Infinity, -1)",
+	      -Infinity,
+	      Infinity/Math.pow(Number.NEGATIVE_INFINITY, -1) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-Infinity, -3)",
+	      -0,
+	      Math.pow(Number.NEGATIVE_INFINITY, -3) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-Infinity, -2)",
+	      0,
+	      Math.pow(Number.NEGATIVE_INFINITY, -2) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-Infinity, -0.5)",
+	      0,
+	      Math.pow(Number.NEGATIVE_INFINITY,-0.5) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-Infinity, -Infinity)",
+	      0,
+	      Math.pow(Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(0, 1)",
+	      0,
+	      Math.pow(0,1) );
+
+new TestCase( SECTION, 
+	      "Math.pow(0, 0)",
+	      1,
+	      Math.pow(0,0) );
+
+new TestCase( SECTION, 
+	      "Math.pow(1, 0)",
+	      1,
+	      Math.pow(1,0) );
+
+new TestCase( SECTION,
+	      "Math.pow(-1, 0)",
+	      1,
+	      Math.pow(-1,0) );
+
+new TestCase( SECTION, 
+	      "Math.pow(0, 0.5)",
+              0,
+	      Math.pow(0,0.5) );
+
+new TestCase( SECTION, 
+	      "Math.pow(0, 1000)",
+	      0,
+	      Math.pow(0,1000) );
+
+new TestCase( SECTION,
+	      "Math.pow(0, Infinity)",
+	      0,
+	      Math.pow(0, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(0, -1)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(0, -1) );
+
+new TestCase( SECTION, 
+	      "Math.pow(0, -0.5)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(0, -0.5) );
+
+new TestCase( SECTION, 
+	      "Math.pow(0, -1000)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(0, -1000) );
+
+new TestCase( SECTION, 
+	      "Math.pow(0, -Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.pow(0, Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-0, 1)",
+	      -0,
+	      Math.pow(-0, 1) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-0, 3)",
+	      -0,
+	      Math.pow(-0,3) );
+
+new TestCase( SECTION, 
+	      "Infinity/Math.pow(-0, 1)",
+	      -Infinity,
+	      Infinity/Math.pow(-0, 1) );
+
+new TestCase( SECTION, 
+	      "Infinity/Math.pow(-0, 3)",
+	      -Infinity,
+	      Infinity/Math.pow(-0,3) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-0, 2)",
+	      0,
+	      Math.pow(-0,2) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-0, Infinity)",
+	      0,
+	      Math.pow(-0, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-0, -1)",
+              Number.NEGATIVE_INFINITY,
+	      Math.pow(-0, -1) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-0, -10001)",
+	      Number.NEGATIVE_INFINITY,
+	      Math.pow(-0, -10001) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-0, -2)",
+              Number.POSITIVE_INFINITY,
+	      Math.pow(-0, -2) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-0, 0.5)",
+	      0,
+	      Math.pow(-0, 0.5) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-0, Infinity)",
+	      0,
+	      Math.pow(-0, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-1, 0.5)",
+	      Number.NaN,
+              Math.pow(-1, 0.5) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-1, NaN)",
+	      Number.NaN,
+              Math.pow(-1, Number.NaN) );
+
+new TestCase( SECTION, 
+	      "Math.pow(-1, -0.5)",
+	      Number.NaN,
+              Math.pow(-1, -0.5) );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.14.js b/js/src/tests/ecma/Math/15.8.2.14.js
new file mode 100644
index 000000000..2c15a8481
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.14.js
@@ -0,0 +1,45 @@
+/* -*- tab-width: 2; 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:          15.8.2.14.js
+   ECMA Section:       15.8.2.14 Math.random()
+   returns a number value x with a positive sign
+   with 1 > x >= 0 with approximately uniform
+   distribution over that range, using an
+   implementation-dependent algorithm or strategy.
+   This function takes no arguments.
+
+   Description:
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.8.2.14";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.random()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+for ( var item = 0; item < 100; item++ ) {
+  var testcase = new TestCase( SECTION, 
+			       "Math.random()",   
+			       "pass",   
+			       null );
+  testcase.reason = Math.random();
+  testcase.actual = "pass";
+
+  if ( ! ( testcase.reason >= 0) ) {
+    testcase.actual = "fail";
+  }
+
+  if ( ! (testcase.reason < 1) ) {
+    testcase.actual = "fail";
+  }
+}
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.15.js b/js/src/tests/ecma/Math/15.8.2.15.js
new file mode 100644
index 000000000..4ef748211
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.15.js
@@ -0,0 +1,168 @@
+/* -*- tab-width: 2; 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:          15.8.2.15.js
+   ECMA Section:       15.8.2.15  Math.round(x)
+   Description:        return the greatest number value that is closest to the
+   argument and is an integer.  if two integers are equally
+   close to the argument. then the result is the number value
+   that is closer to Infinity.  if the argument is an integer,
+   return the argument.
+   special cases:
+   - if x is NaN       return NaN
+   - if x = +0         return +0
+   - if x = -0          return -0
+   - if x = Infinity   return Infinity
+   - if x = -Infinity  return -Infinity
+   - if 0 < x < 0.5    return 0
+   - if -0.5 <= x < 0  return -0
+   example:
+   Math.round( 3.5 ) == 4
+   Math.round( -3.5 ) == 3
+   also:
+   - Math.round(x) == Math.floor( x + 0.5 )
+   except if x = -0.  in that case, Math.round(x) = -0
+
+   and Math.floor( x+0.5 ) = +0
+
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.8.2.15";
+var VERSION = "ECMA_1";
+var TITLE   = "Math.round(x)";
+var BUGNUMBER="331411";
+
+var EXCLUDE = "true";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.round.length",
+	      1,
+	      Math.round.length );
+
+new TestCase( SECTION,
+	      "Math.round()",
+	      Number.NaN,
+	      Math.round() );
+
+new TestCase( SECTION,
+	      "Math.round(null)",
+	      0,
+	      Math.round(0) );
+
+new TestCase( SECTION,
+	      "Math.round(void 0)",
+	      Number.NaN,
+	      Math.round(void 0) );
+
+new TestCase( SECTION,
+	      "Math.round(true)",
+	      1,
+	      Math.round(true) );
+
+new TestCase( SECTION,
+	      "Math.round(false)",
+	      0,
+	      Math.round(false) );
+
+new TestCase( SECTION,
+	      "Math.round('.99999')",
+	      1,
+	      Math.round('.99999') );
+
+new TestCase( SECTION,
+	      "Math.round('12345e-2')",
+	      123,
+	      Math.round('12345e-2') );
+
+new TestCase( SECTION,
+	      "Math.round(NaN)",
+	      Number.NaN,
+	      Math.round(Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.round(0)",
+	      0,
+	      Math.round(0) );
+
+new TestCase( SECTION,
+	      "Math.round(-0)",
+	      -0,
+	      Math.round(-0));
+
+new TestCase( SECTION,
+	      "Infinity/Math.round(-0)",
+	      -Infinity,
+	      Infinity/Math.round(-0) );
+
+new TestCase( SECTION,
+	      "Math.round(Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.round(Number.POSITIVE_INFINITY));
+
+new TestCase( SECTION,
+	      "Math.round(-Infinity)",
+	      Number.NEGATIVE_INFINITY,
+	      Math.round(Number.NEGATIVE_INFINITY));
+
+new TestCase( SECTION,
+	      "Math.round(0.49)",
+	      0,
+	      Math.round(0.49));
+
+new TestCase( SECTION,
+	      "Math.round(0.5)",
+	      1,
+	      Math.round(0.5));
+
+new TestCase( SECTION,
+	      "Math.round(0.51)",
+	      1,
+	      Math.round(0.51));
+
+new TestCase( SECTION,
+	      "Math.round(-0.49)",
+	      -0,
+	      Math.round(-0.49));
+
+new TestCase( SECTION,
+	      "Math.round(-0.5)",
+	      -0,
+	      Math.round(-0.5));
+
+new TestCase( SECTION,
+	      "Infinity/Math.round(-0.49)",
+	      -Infinity,
+	      Infinity/Math.round(-0.49));
+
+new TestCase( SECTION,
+	      "Infinity/Math.round(-0.5)",
+	      -Infinity,
+	      Infinity/Math.round(-0.5));
+
+new TestCase( SECTION,
+	      "Math.round(-0.51)",
+	      -1,
+	      Math.round(-0.51));
+
+new TestCase( SECTION,
+	      "Math.round(3.5)",
+	      4,
+	      Math.round(3.5));
+
+new TestCase( SECTION,
+	      "Math.round(-3.5)",
+	      -3,
+	      Math.round(-3));
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.16.js b/js/src/tests/ecma/Math/15.8.2.16.js
new file mode 100644
index 000000000..56a12ee09
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.16.js
@@ -0,0 +1,98 @@
+/* -*- tab-width: 2; 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:          15.8.2.16.js
+   ECMA Section:       15.8.2.16 sin( x )
+   Description:        return an approximation to the sine of the
+   argument.  argument is expressed in radians
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+*/
+var SECTION = "15.8.2.16";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.sin(x)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.sin.length",
+	      1,
+	      Math.sin.length );
+
+new TestCase( SECTION,
+	      "Math.sin()",
+	      Number.NaN,
+	      Math.sin() );
+
+new TestCase( SECTION,
+	      "Math.sin(null)",
+	      0,
+	      Math.sin(null) );
+
+new TestCase( SECTION,
+	      "Math.sin(void 0)",
+	      Number.NaN,
+	      Math.sin(void 0) );
+
+new TestCase( SECTION,
+	      "Math.sin(false)",
+	      0,
+	      Math.sin(false) );
+
+new TestCase( SECTION,
+	      "Math.sin('2.356194490192')",
+	      0.7071067811865,
+	      Math.sin('2.356194490192') );
+
+new TestCase( SECTION,
+	      "Math.sin(NaN)",
+	      Number.NaN,
+	      Math.sin(Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.sin(0)",
+	      0,
+	      Math.sin(0) );
+
+new TestCase( SECTION,
+	      "Math.sin(-0)",
+	      -0,
+	      Math.sin(-0));
+
+new TestCase( SECTION,
+	      "Math.sin(Infinity)",
+	      Number.NaN,
+	      Math.sin(Number.POSITIVE_INFINITY));
+
+new TestCase( SECTION,
+	      "Math.sin(-Infinity)",
+	      Number.NaN,
+	      Math.sin(Number.NEGATIVE_INFINITY));
+
+new TestCase( SECTION,
+	      "Math.sin(0.7853981633974)",
+	      0.7071067811865,
+	      Math.sin(0.7853981633974));
+
+new TestCase( SECTION,
+	      "Math.sin(1.570796326795)",	
+	      1,
+	      Math.sin(1.570796326795));
+
+new TestCase( SECTION,
+	      "Math.sin(2.356194490192)",	
+	      0.7071067811865,
+	      Math.sin(2.356194490192));
+
+new TestCase( SECTION,
+	      "Math.sin(3.14159265359)",
+	      0,
+	      Math.sin(3.14159265359));
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.17.js b/js/src/tests/ecma/Math/15.8.2.17.js
new file mode 100644
index 000000000..10e176098
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.17.js
@@ -0,0 +1,183 @@
+/* -*- tab-width: 2; 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:          15.8.2.17.js
+   ECMA Section:       15.8.2.17  Math.sqrt(x)
+   Description:        return an approximation to the squareroot of the argument.
+   special cases:
+   -   if x is NaN         return NaN
+   -   if x < 0            return NaN
+   -   if x == 0           return 0
+   -   if x == -0          return -0
+   -   if x == Infinity    return Infinity
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.8.2.17";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.sqrt(x)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.sqrt.length",
+	      1,
+	      Math.sqrt.length );
+
+new TestCase( SECTION,
+	      "Math.sqrt()",
+	      Number.NaN,
+	      Math.sqrt() );
+
+new TestCase( SECTION,
+	      "Math.sqrt(void 0)",
+	      Number.NaN,
+	      Math.sqrt(void 0) );
+
+new TestCase( SECTION,
+	      "Math.sqrt(null)",
+	      0,
+	      Math.sqrt(null) );
+
+new TestCase( SECTION,
+	      "Math.sqrt(true)",
+	      1,
+	      Math.sqrt(1) );
+
+new TestCase( SECTION,
+	      "Math.sqrt(false)",
+	      0,
+	      Math.sqrt(false) );
+
+new TestCase( SECTION,
+	      "Math.sqrt('225')",
+	      15,
+	      Math.sqrt('225') );
+
+new TestCase( SECTION,
+	      "Math.sqrt(NaN)",
+	      Number.NaN,
+	      Math.sqrt(Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.sqrt(-Infinity)",
+	      Number.NaN,
+	      Math.sqrt(Number.NEGATIVE_INFINITY));
+
+new TestCase( SECTION,
+	      "Math.sqrt(-1)",
+	      Number.NaN,
+	      Math.sqrt(-1));
+
+new TestCase( SECTION,
+	      "Math.sqrt(-0.5)",
+	      Number.NaN,
+	      Math.sqrt(-0.5));
+
+new TestCase( SECTION,
+	      "Math.sqrt(0)",
+	      0,
+	      Math.sqrt(0));
+
+new TestCase( SECTION,
+	      "Math.sqrt(-0)",
+	      -0,
+	      Math.sqrt(-0));
+
+new TestCase( SECTION,
+	      "Infinity/Math.sqrt(-0)",
+	      -Infinity,
+	      Infinity/Math.sqrt(-0) );
+
+new TestCase( SECTION,
+	      "Math.sqrt(Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.sqrt(Number.POSITIVE_INFINITY));
+
+new TestCase( SECTION,
+	      "Math.sqrt(1)",
+	      1,
+	      Math.sqrt(1));
+
+new TestCase( SECTION,
+	      "Math.sqrt(2)",
+	      Math.SQRT2,
+	      Math.sqrt(2));
+
+new TestCase( SECTION,
+	      "Math.sqrt(0.5)",
+	      Math.SQRT1_2,
+	      Math.sqrt(0.5));
+
+new TestCase( SECTION,
+	      "Math.sqrt(4)",
+	      2,
+	      Math.sqrt(4));
+
+new TestCase( SECTION,
+	      "Math.sqrt(9)",
+	      3,
+	      Math.sqrt(9));
+
+new TestCase( SECTION,
+	      "Math.sqrt(16)",
+	      4,
+	      Math.sqrt(16));
+
+new TestCase( SECTION,
+	      "Math.sqrt(25)",
+	      5,
+	      Math.sqrt(25));
+
+new TestCase( SECTION,
+	      "Math.sqrt(36)",
+	      6,
+	      Math.sqrt(36));
+
+new TestCase( SECTION,
+	      "Math.sqrt(49)",
+	      7,
+	      Math.sqrt(49));
+
+new TestCase( SECTION,
+	      "Math.sqrt(64)",
+	      8,
+	      Math.sqrt(64));
+
+new TestCase( SECTION,
+	      "Math.sqrt(256)",
+	      16,
+	      Math.sqrt(256));
+
+new TestCase( SECTION,
+	      "Math.sqrt(10000)",
+	      100,
+	      Math.sqrt(10000));
+
+new TestCase( SECTION,
+	      "Math.sqrt(65536)",
+	      256,
+	      Math.sqrt(65536));
+
+new TestCase( SECTION,
+	      "Math.sqrt(0.09)",
+	      0.3,
+	      Math.sqrt(0.09));
+
+new TestCase( SECTION,
+	      "Math.sqrt(0.01)",
+	      0.1,
+	      Math.sqrt(0.01));
+
+new TestCase( SECTION,
+	      "Math.sqrt(0.00000001)",
+	      0.0001,
+	      Math.sqrt(0.00000001));
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.18.js b/js/src/tests/ecma/Math/15.8.2.18.js
new file mode 100644
index 000000000..d857599ef
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.18.js
@@ -0,0 +1,131 @@
+/* -*- tab-width: 2; 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:          15.8.2.18.js
+   ECMA Section:       15.8.2.18 tan( x )
+   Description:        return an approximation to the tan of the
+   argument.  argument is expressed in radians
+   special cases:
+   - if x is NaN           result is NaN
+   - if x is 0             result is 0
+   - if x is -0            result is -0
+   - if x is Infinity or -Infinity result is NaN
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.8.2.18";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.tan(x)";
+var EXCLUDE = "true";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.tan.length",
+	      1,
+	      Math.tan.length );
+
+new TestCase( SECTION,
+	      "Math.tan()",
+	      Number.NaN,
+	      Math.tan() );
+
+new TestCase( SECTION,
+	      "Math.tan(void 0)",
+	      Number.NaN,
+	      Math.tan(void 0));
+
+new TestCase( SECTION,
+	      "Math.tan(null)",
+	      0,
+	      Math.tan(null) );
+
+new TestCase( SECTION,
+	      "Math.tan(false)",
+	      0,
+	      Math.tan(false) );
+
+new TestCase( SECTION,
+	      "Math.tan(NaN)",
+	      Number.NaN,
+	      Math.tan(Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.tan(0)",
+	      0,
+	      Math.tan(0));
+
+new TestCase( SECTION,
+	      "Math.tan(-0)",
+	      -0,
+	      Math.tan(-0));
+
+new TestCase( SECTION,
+	      "Math.tan(Infinity)",
+	      Number.NaN,
+	      Math.tan(Number.POSITIVE_INFINITY));
+
+new TestCase( SECTION,
+	      "Math.tan(-Infinity)",
+	      Number.NaN,
+	      Math.tan(Number.NEGATIVE_INFINITY));
+
+new TestCase( SECTION,
+	      "Math.tan(Math.PI/4)",
+	      1,
+	      Math.tan(Math.PI/4));
+
+new TestCase( SECTION,
+	      "Math.tan(3*Math.PI/4)",
+	      -1,
+	      Math.tan(3*Math.PI/4));
+
+new TestCase( SECTION,
+	      "Math.tan(Math.PI)",
+	      -0,
+	      Math.tan(Math.PI));
+
+new TestCase( SECTION,
+	      "Math.tan(5*Math.PI/4)",
+	      1,
+	      Math.tan(5*Math.PI/4));
+
+new TestCase( SECTION,
+	      "Math.tan(7*Math.PI/4)",
+	      -1,
+	      Math.tan(7*Math.PI/4));
+
+new TestCase( SECTION,
+	      "Infinity/Math.tan(-0)",
+	      -Infinity,
+	      Infinity/Math.tan(-0) );
+
+/*
+  Arctan (x) ~ PI/2 - 1/x   for large x.  For x = 1.6x10^16, 1/x is about the last binary digit of double precision PI/2.
+  That is to say, perturbing PI/2 by this much is about the smallest rounding error possible.
+
+  This suggests that the answer Christine is getting and a real Infinity are "adjacent" results from the tangent function.  I
+  suspect that tan (PI/2 + one ulp) is a negative result about the same size as tan (PI/2) and that this pair are the closest
+  results to infinity that the algorithm can deliver.
+
+  In any case, my call is that the answer we're seeing is "right".  I suggest the test pass on any result this size or larger.
+  = C =
+*/
+
+new TestCase( SECTION,
+	      "Math.tan(3*Math.PI/2) >= 5443000000000000",
+	      true,
+	      Math.tan(3*Math.PI/2) >= 5443000000000000 );
+
+new TestCase( SECTION,
+	      "Math.tan(Math.PI/2) >= 5443000000000000",
+	      true,
+	      Math.tan(Math.PI/2) >= 5443000000000000 );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.2.js b/js/src/tests/ecma/Math/15.8.2.2.js
new file mode 100644
index 000000000..0f72734d2
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.2.js
@@ -0,0 +1,122 @@
+/* -*- tab-width: 2; 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:          15.8.2.2.js
+   ECMA Section:       15.8.2.2 acos( x )
+   Description:        return an approximation to the arc cosine of the
+   argument.  the result is expressed in radians and
+   range is from +0 to +PI.  special cases:
+   - if x is NaN, return NaN
+   - if x > 1, the result is NaN
+   - if x < -1, the result is NaN
+   - if x == 1, the result is +0
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+var SECTION = "15.8.2.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.acos()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.acos.length",
+	      1,
+	      Math.acos.length );
+
+new TestCase( SECTION,
+	      "Math.acos(void 0)",
+	      Number.NaN,
+	      Math.acos(void 0) );
+
+new TestCase( SECTION,
+	      "Math.acos()",
+	      Number.NaN,
+	      Math.acos() );
+
+new TestCase( SECTION,
+	      "Math.acos(null)",
+	      Math.PI/2,
+	      Math.acos(null) );
+
+new TestCase( SECTION,
+	      "Math.acos(NaN)",
+	      Number.NaN,
+	      Math.acos(Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.acos(a string)",
+	      Number.NaN,
+	      Math.acos("a string") );
+
+new TestCase( SECTION,
+	      "Math.acos('0')",
+	      Math.PI/2,
+	      Math.acos('0') );
+
+new TestCase( SECTION,
+	      "Math.acos('1')",
+	      0,
+	      Math.acos('1') );
+
+new TestCase( SECTION,
+	      "Math.acos('-1')",
+	      Math.PI,
+	      Math.acos('-1') );
+
+new TestCase( SECTION,
+	      "Math.acos(1.00000001)",
+	      Number.NaN,
+	      Math.acos(1.00000001) );
+
+new TestCase( SECTION,
+	      "Math.acos(11.00000001)",
+	      Number.NaN,
+	      Math.acos(-1.00000001) );
+
+new TestCase( SECTION,
+	      "Math.acos(1)",
+	      0,
+	      Math.acos(1)          );
+
+new TestCase( SECTION,
+	      "Math.acos(-1)",
+	      Math.PI,
+	      Math.acos(-1)         );
+
+new TestCase( SECTION,
+	      "Math.acos(0)",
+	      Math.PI/2,
+	      Math.acos(0)          );
+
+new TestCase( SECTION,
+	      "Math.acos(-0)",
+	      Math.PI/2,
+	      Math.acos(-0)         );
+
+new TestCase( SECTION,
+	      "Math.acos(Math.SQRT1_2)",
+	      Math.PI/4,
+	      Math.acos(Math.SQRT1_2));
+
+new TestCase( SECTION,
+	      "Math.acos(-Math.SQRT1_2)",
+	      Math.PI/4*3,
+	      Math.acos(-Math.SQRT1_2));
+
+new TestCase( SECTION,
+	      "Math.acos(0.9999619230642)",
+	      Math.PI/360,
+	      Math.acos(0.9999619230642));
+
+new TestCase( SECTION,
+	      "Math.acos(-3.0)",
+	      Number.NaN,
+	      Math.acos(-3.0));
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.3.js b/js/src/tests/ecma/Math/15.8.2.3.js
new file mode 100644
index 000000000..f4f61d5a3
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.3.js
@@ -0,0 +1,124 @@
+/* -*- tab-width: 2; 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:          15.8.2.3.js
+   ECMA Section:       15.8.2.3 asin( x )
+   Description:        return an approximation to the arc sine of the
+   argument.  the result is expressed in radians and
+   range is from -PI/2 to +PI/2.  special cases:
+   - if x is NaN,  the result is NaN
+   - if x > 1,     the result is NaN
+   - if x < -1,    the result is NaN
+   - if x == +0,   the result is +0
+   - if x == -0,   the result is -0
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+*/
+var SECTION = "15.8.2.3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.asin()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.asin()",
+	      Number.NaN,
+	      Math.asin() );
+
+new TestCase( SECTION,
+	      "Math.asin(void 0)",
+	      Number.NaN,
+	      Math.asin(void 0) );
+
+new TestCase( SECTION,
+	      "Math.asin(null)",
+	      0,
+	      Math.asin(null) );
+
+new TestCase( SECTION,
+	      "Math.asin(NaN)",
+	      Number.NaN,
+	      Math.asin(Number.NaN)   );
+
+new TestCase( SECTION,
+	      "Math.asin('string')",
+	      Number.NaN,
+	      Math.asin("string")     );
+
+new TestCase( SECTION,
+	      "Math.asin('0')",
+	      0,
+	      Math.asin("0") );
+
+new TestCase( SECTION,
+	      "Math.asin('1')",
+	      Math.PI/2,
+	      Math.asin("1") );
+
+new TestCase( SECTION,
+	      "Math.asin('-1')",
+	      -Math.PI/2,
+	      Math.asin("-1") );
+
+new TestCase( SECTION,
+	      "Math.asin(Math.SQRT1_2+'')",
+	      Math.PI/4,
+	      Math.asin(Math.SQRT1_2+'') );
+
+new TestCase( SECTION,
+	      "Math.asin(-Math.SQRT1_2+'')",
+	      -Math.PI/4,
+	      Math.asin(-Math.SQRT1_2+'') );
+
+new TestCase( SECTION,
+	      "Math.asin(1.000001)",
+	      Number.NaN,
+	      Math.asin(1.000001)     );
+
+new TestCase( SECTION,
+	      "Math.asin(-1.000001)",
+	      Number.NaN,
+	      Math.asin(-1.000001)    );
+
+new TestCase( SECTION,
+	      "Math.asin(0)",
+	      0,
+	      Math.asin(0)            );
+
+new TestCase( SECTION,
+	      "Math.asin(-0)",
+	      -0,
+	      Math.asin(-0)           );
+
+new TestCase( SECTION,
+	      "Infinity/Math.asin(-0)",
+	      -Infinity,
+	      Infinity/Math.asin(-0) );
+
+new TestCase( SECTION,
+	      "Math.asin(1)",
+	      Math.PI/2,
+	      Math.asin(1)            );
+
+new TestCase( SECTION,
+	      "Math.asin(-1)",
+	      -Math.PI/2,
+	      Math.asin(-1)            );
+
+new TestCase( SECTION,
+	      "Math.asin(Math.SQRT1_2))",
+	      Math.PI/4,
+	      Math.asin(Math.SQRT1_2) );
+
+new TestCase( SECTION,
+	      "Math.asin(-Math.SQRT1_2))",
+	      -Math.PI/4,
+	      Math.asin(-Math.SQRT1_2));
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.4.js b/js/src/tests/ecma/Math/15.8.2.4.js
new file mode 100644
index 000000000..5d73424a8
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.4.js
@@ -0,0 +1,122 @@
+/* -*- tab-width: 2; 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:          15.8.2.4.js
+   ECMA Section:       15.8.2.4 atan( x )
+   Description:        return an approximation to the arc tangent of the
+   argument.  the result is expressed in radians and
+   range is from -PI/2 to +PI/2.  special cases:
+   - if x is NaN,  the result is NaN
+   - if x == +0,   the result is +0
+   - if x == -0,   the result is -0
+   - if x == +Infinity,    the result is approximately +PI/2
+   - if x == -Infinity,    the result is approximately -PI/2
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+*/
+
+var SECTION = "15.8.2.4";
+var VERSION = "ECMA_1";
+var TITLE   = "Math.atan()";
+var BUGNUMBER="77391";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.atan.length",
+	      1,
+	      Math.atan.length );
+
+new TestCase( SECTION,
+	      "Math.atan()",
+	      Number.NaN,
+	      Math.atan() );
+
+new TestCase( SECTION,
+	      "Math.atan(void 0)",
+	      Number.NaN,
+	      Math.atan(void 0) );
+
+new TestCase( SECTION,
+	      "Math.atan(null)",
+	      0,
+	      Math.atan(null) );
+
+new TestCase( SECTION,
+	      "Math.atan(NaN)",
+	      Number.NaN,
+	      Math.atan(Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.atan('a string')",
+	      Number.NaN,
+	      Math.atan("a string") );
+
+new TestCase( SECTION,
+	      "Math.atan('0')",
+	      0,
+	      Math.atan('0') );
+
+new TestCase( SECTION,
+	      "Math.atan('1')",
+	      Math.PI/4,
+	      Math.atan('1') );
+
+new TestCase( SECTION,
+	      "Math.atan('-1')",
+	      -Math.PI/4,
+	      Math.atan('-1') );
+
+new TestCase( SECTION,
+	      "Math.atan('Infinity)",
+	      Math.PI/2,
+	      Math.atan('Infinity') );
+
+new TestCase( SECTION,
+	      "Math.atan('-Infinity)",
+	      -Math.PI/2,
+	      Math.atan('-Infinity') );
+
+new TestCase( SECTION,
+	      "Math.atan(0)",
+	      0,
+	      Math.atan(0)          );
+
+new TestCase( SECTION,
+	      "Math.atan(-0)",	
+	      -0,
+	      Math.atan(-0)         );
+
+new TestCase( SECTION,
+	      "Infinity/Math.atan(-0)",
+	      -Infinity,
+	      Infinity/Math.atan(-0) );
+
+new TestCase( SECTION,
+	      "Math.atan(Infinity)",
+	      Math.PI/2,
+	      Math.atan(Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.atan(-Infinity)",
+	      -Math.PI/2,
+	      Math.atan(Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.atan(1)",
+	      Math.PI/4,
+	      Math.atan(1)          );
+
+new TestCase( SECTION,
+	      "Math.atan(-1)",
+	      -Math.PI/4,
+	      Math.atan(-1)         );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.5.js b/js/src/tests/ecma/Math/15.8.2.5.js
new file mode 100644
index 000000000..bae8c688c
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.5.js
@@ -0,0 +1,210 @@
+/* -*- tab-width: 2; 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:          15.8.2.5.js
+   ECMA Section:       15.8.2.5 atan2( y, x )
+   Description:
+
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+*/
+var SECTION = "15.8.2.5";
+var VERSION = "ECMA_1";
+var TITLE   = "Math.atan2(x,y)";
+var BUGNUMBER="76111";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.atan2.length",
+	      2,
+	      Math.atan2.length );
+
+new TestCase( SECTION,
+	      "Math.atan2(NaN, 0)",
+	      Number.NaN,
+	      Math.atan2(Number.NaN,0) );
+
+new TestCase( SECTION,
+	      "Math.atan2(null, null)",
+	      0,
+	      Math.atan2(null, null) );
+
+new TestCase( SECTION,
+	      "Math.atan2(void 0, void 0)",
+	      Number.NaN,
+	      Math.atan2(void 0, void 0) );
+
+new TestCase( SECTION,
+	      "Math.atan2()",
+	      Number.NaN,
+	      Math.atan2() );
+
+new TestCase( SECTION,
+	      "Math.atan2(0, NaN)",
+	      Number.NaN,
+	      Math.atan2(0,Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.atan2(1, 0)",
+	      Math.PI/2,
+	      Math.atan2(1,0)          );
+
+new TestCase( SECTION,
+	      "Math.atan2(1,-0)",
+	      Math.PI/2,
+	      Math.atan2(1,-0)         );
+
+new TestCase( SECTION,
+	      "Math.atan2(0,0.001)",
+	      0,
+	      Math.atan2(0,0.001)      );
+
+new TestCase( SECTION,
+	      "Math.atan2(0,0)",
+	      0,
+	      Math.atan2(0,0)          );
+
+new TestCase( SECTION,
+	      "Math.atan2(0, -0)",
+	      Math.PI,
+	      Math.atan2(0,-0)         );
+
+new TestCase( SECTION,
+	      "Math.atan2(0, -1)",
+	      Math.PI,
+	      Math.atan2(0, -1)        );
+
+new TestCase( SECTION,
+	      "Math.atan2(-0, 1)",
+	      -0,
+	      Math.atan2(-0, 1)        );
+
+new TestCase( SECTION,
+	      "Infinity/Math.atan2(-0, 1)",
+	      -Infinity,
+	      Infinity/Math.atan2(-0,1) );
+
+new TestCase( SECTION,
+	      "Math.atan2(-0,	0)",
+	      -0,
+	      Math.atan2(-0,0)         );
+
+new TestCase( SECTION,
+	      "Math.atan2(-0,	-0)",
+	      -Math.PI,
+	      Math.atan2(-0, -0)       );
+
+new TestCase( SECTION,
+	      "Math.atan2(-0,	-1)",
+	      -Math.PI,
+	      Math.atan2(-0, -1)       );
+
+new TestCase( SECTION,
+	      "Math.atan2(-1,	0)",
+	      -Math.PI/2,
+	      Math.atan2(-1, 0)        );
+
+new TestCase( SECTION,
+	      "Math.atan2(-1,	-0)",
+	      -Math.PI/2,
+	      Math.atan2(-1, -0)       );
+
+new TestCase( SECTION,
+	      "Math.atan2(1, Infinity)",
+	      0,
+	      Math.atan2(1, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.atan2(1,-Infinity)", 
+	      Math.PI,
+	      Math.atan2(1, Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.atan2(-1, Infinity)",
+	      -0,
+	      Math.atan2(-1,Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Infinity/Math.atan2(-1, Infinity)",
+	      -Infinity, 
+	      Infinity/Math.atan2(-1,Infinity) );
+
+new TestCase( SECTION,
+	      "Math.atan2(-1,-Infinity)",
+	      -Math.PI,
+	      Math.atan2(-1,Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.atan2(Infinity, 0)", 
+	      Math.PI/2,
+	      Math.atan2(Number.POSITIVE_INFINITY, 0) );
+
+new TestCase( SECTION,
+	      "Math.atan2(Infinity, 1)", 
+	      Math.PI/2,
+	      Math.atan2(Number.POSITIVE_INFINITY, 1) );
+
+new TestCase( SECTION,
+	      "Math.atan2(Infinity,-1)", 
+	      Math.PI/2,
+	      Math.atan2(Number.POSITIVE_INFINITY,-1) );
+
+new TestCase( SECTION,
+	      "Math.atan2(Infinity,-0)", 
+	      Math.PI/2,
+	      Math.atan2(Number.POSITIVE_INFINITY,-0) );
+
+new TestCase( SECTION,
+	      "Math.atan2(-Infinity, 0)",
+	      -Math.PI/2,
+	      Math.atan2(Number.NEGATIVE_INFINITY, 0) );
+
+new TestCase( SECTION,
+	      "Math.atan2(-Infinity,-0)",
+	      -Math.PI/2,
+	      Math.atan2(Number.NEGATIVE_INFINITY,-0) );
+
+new TestCase( SECTION,
+	      "Math.atan2(-Infinity, 1)",
+	      -Math.PI/2,
+	      Math.atan2(Number.NEGATIVE_INFINITY, 1) );
+
+new TestCase( SECTION,
+	      "Math.atan2(-Infinity, -1)",
+	      -Math.PI/2,
+	      Math.atan2(Number.NEGATIVE_INFINITY,-1) );
+
+new TestCase( SECTION,
+	      "Math.atan2(Infinity, Infinity)",
+	      Math.PI/4,
+	      Math.atan2(Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.atan2(Infinity, -Infinity)", 
+	      3*Math.PI/4,
+	      Math.atan2(Number.POSITIVE_INFINITY, Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.atan2(-Infinity, Infinity)", 
+	      -Math.PI/4,
+	      Math.atan2(Number.NEGATIVE_INFINITY, Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.atan2(-Infinity, -Infinity)",
+	      -3*Math.PI/4,
+	      Math.atan2(Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.atan2(-1, 1)",
+	      -Math.PI/4,
+	      Math.atan2( -1, 1) );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.6.js b/js/src/tests/ecma/Math/15.8.2.6.js
new file mode 100644
index 000000000..1385e63e5
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.6.js
@@ -0,0 +1,198 @@
+/* -*- tab-width: 2; 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:          15.8.2.6.js
+   ECMA Section:       15.8.2.6  Math.ceil(x)
+   Description:        return the smallest number value that is not less than the
+   argument and is equal to a mathematical integer.  if the
+   number is already an integer, return the number itself.
+   special cases:
+   - if x is NaN       return NaN
+   - if x = +0         return +0
+   - if x = 0          return -0
+   - if x = Infinity   return Infinity
+   - if x = -Infinity  return -Infinity
+   - if ( -1 < x < 0 ) return -0
+   also:
+   -   the value of Math.ceil(x) == -Math.ceil(-x)
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+var SECTION = "15.8.2.6";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.ceil(x)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.ceil.length",
+	      1,
+	      Math.ceil.length );
+
+new TestCase( SECTION,
+	      "Math.ceil(NaN)",
+	      Number.NaN,
+	      Math.ceil(Number.NaN)   );
+
+new TestCase( SECTION,
+	      "Math.ceil(null)",
+	      0, 
+	      Math.ceil(null) );
+
+new TestCase( SECTION,
+	      "Math.ceil()",
+	      Number.NaN,
+	      Math.ceil() );
+
+new TestCase( SECTION,
+	      "Math.ceil(void 0)",
+	      Number.NaN,
+	      Math.ceil(void 0) );
+
+new TestCase( SECTION,
+	      "Math.ceil('0')",
+	      0,
+	      Math.ceil('0')            );
+
+new TestCase( SECTION,
+	      "Math.ceil('-0')",
+	      -0,
+	      Math.ceil('-0')           );
+
+new TestCase( SECTION,
+	      "Infinity/Math.ceil('0')",
+	      Infinity,
+	      Infinity/Math.ceil('0'));
+
+new TestCase( SECTION,
+	      "Infinity/Math.ceil('-0')",
+	      -Infinity,
+	      Infinity/Math.ceil('-0'));
+
+new TestCase( SECTION,
+	      "Math.ceil(0)",
+	      0,
+	      Math.ceil(0)            );
+
+new TestCase( SECTION,
+	      "Math.ceil(-0)",
+	      -0,
+	      Math.ceil(-0)           );
+
+new TestCase( SECTION,
+	      "Infinity/Math.ceil(0)",
+	      Infinity,
+	      Infinity/Math.ceil(0));
+
+new TestCase( SECTION,
+	      "Infinity/Math.ceil(-0)",
+	      -Infinity,
+	      Infinity/Math.ceil(-0));
+
+
+new TestCase( SECTION,
+	      "Math.ceil(Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.ceil(Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.ceil(-Infinity)",
+	      Number.NEGATIVE_INFINITY,
+	      Math.ceil(Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.ceil(-Number.MIN_VALUE)",
+	      -0,
+	      Math.ceil(-Number.MIN_VALUE) );
+
+new TestCase( SECTION,
+	      "Infinity/Math.ceil(-Number.MIN_VALUE)",
+	      -Infinity,
+	      Infinity/Math.ceil(-Number.MIN_VALUE) );
+
+new TestCase( SECTION,
+	      "Math.ceil(1)",
+	      1,
+	      Math.ceil(1)   );
+
+new TestCase( SECTION,
+	      "Math.ceil(-1)",
+	      -1,
+	      Math.ceil(-1)   );
+
+new TestCase( SECTION,
+	      "Math.ceil(-0.9)",
+	      -0,
+	      Math.ceil(-0.9) );
+
+new TestCase( SECTION,
+	      "Infinity/Math.ceil(-0.9)",
+	      -Infinity,
+	      Infinity/Math.ceil(-0.9) );
+
+new TestCase( SECTION,
+	      "Math.ceil(0.9 )",
+	      1,
+	      Math.ceil( 0.9) );
+
+new TestCase( SECTION,
+	      "Math.ceil(-1.1)",
+	      -1,
+	      Math.ceil( -1.1));
+
+new TestCase( SECTION,
+	      "Math.ceil( 1.1)",
+	      2,
+	      Math.ceil(  1.1));
+
+new TestCase( SECTION,
+	      "Math.ceil(Infinity)",
+	      -Math.floor(-Infinity),
+	      Math.ceil(Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.ceil(-Infinity)",
+	      -Math.floor(Infinity),
+	      Math.ceil(Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.ceil(-Number.MIN_VALUE)",
+	      -Math.floor(Number.MIN_VALUE),
+	      Math.ceil(-Number.MIN_VALUE) );
+
+new TestCase( SECTION,
+	      "Math.ceil(1)",
+	      -Math.floor(-1),
+	      Math.ceil(1)   );
+
+new TestCase( SECTION,
+	      "Math.ceil(-1)",
+	      -Math.floor(1),
+	      Math.ceil(-1)   );
+
+new TestCase( SECTION,
+	      "Math.ceil(-0.9)",
+	      -Math.floor(0.9),
+	      Math.ceil(-0.9) );
+
+new TestCase( SECTION,
+	      "Math.ceil(0.9 )",
+	      -Math.floor(-0.9),
+	      Math.ceil( 0.9) );
+
+new TestCase( SECTION,
+	      "Math.ceil(-1.1)",
+	      -Math.floor(1.1),
+	      Math.ceil( -1.1));
+
+new TestCase( SECTION,
+	      "Math.ceil( 1.1)",
+	      -Math.floor(-1.1),
+	      Math.ceil(  1.1));
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.7.js b/js/src/tests/ecma/Math/15.8.2.7.js
new file mode 100644
index 000000000..fd1e798c5
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.7.js
@@ -0,0 +1,249 @@
+/* -*- tab-width: 2; 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:          15.8.2.7.js
+   ECMA Section:       15.8.2.7 cos( x )
+   Description:        return an approximation to the cosine of the
+   argument.  argument is expressed in radians
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+
+*/
+
+var SECTION = "15.8.2.7";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.cos(x)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.cos.length",
+	      1,
+	      Math.cos.length );
+
+new TestCase( SECTION,
+	      "Math.cos()",
+	      Number.NaN,
+	      Math.cos() );
+
+new TestCase( SECTION,
+	      "Math.cos(void 0)",
+	      Number.NaN,
+	      Math.cos(void 0) );
+
+new TestCase( SECTION,
+	      "Math.cos(false)",
+	      1,
+	      Math.cos(false) );
+
+new TestCase( SECTION,
+	      "Math.cos(null)",
+	      1,
+	      Math.cos(null) );
+
+new TestCase( SECTION,
+	      "Math.cos('0')",
+	      1,
+	      Math.cos('0') );
+
+new TestCase( SECTION,
+	      "Math.cos('Infinity')",
+	      Number.NaN,
+	      Math.cos("Infinity") );
+
+new TestCase( SECTION,
+	      "Math.cos('3.14159265359')",
+	      -1,
+	      Math.cos('3.14159265359') );
+
+new TestCase( SECTION,
+	      "Math.cos(NaN)",
+	      Number.NaN,
+	      Math.cos(Number.NaN)        );
+
+new TestCase( SECTION,
+	      "Math.cos(0)",
+	      1,
+	      Math.cos(0)                 );
+
+new TestCase( SECTION,
+	      "Math.cos(-0)",
+	      1,
+	      Math.cos(-0)                );
+
+new TestCase( SECTION,
+	      "Math.cos(Infinity)",
+	      Number.NaN,
+	      Math.cos(Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.cos(-Infinity)",
+	      Number.NaN,
+	      Math.cos(Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.cos(0.7853981633974)",
+	      0.7071067811865,
+	      Math.cos(0.7853981633974)   );
+
+new TestCase( SECTION,
+	      "Math.cos(1.570796326795)",
+	      0,
+	      Math.cos(1.570796326795)    );
+
+new TestCase( SECTION,
+	      "Math.cos(2.356194490192)",
+	      -0.7071067811865,
+	      Math.cos(2.356194490192)    );
+
+new TestCase( SECTION,
+	      "Math.cos(3.14159265359)",
+	      -1,
+	      Math.cos(3.14159265359)     );
+
+new TestCase( SECTION,
+	      "Math.cos(3.926990816987)",
+	      -0.7071067811865,
+	      Math.cos(3.926990816987)    );
+
+new TestCase( SECTION,
+	      "Math.cos(4.712388980385)",
+	      0,
+	      Math.cos(4.712388980385)    );
+
+new TestCase( SECTION,
+	      "Math.cos(5.497787143782)",
+	      0.7071067811865,
+	      Math.cos(5.497787143782)    );
+
+new TestCase( SECTION,
+	      "Math.cos(Math.PI*2)",
+	      1,
+	      Math.cos(Math.PI*2)         );
+
+new TestCase( SECTION,
+	      "Math.cos(Math.PI/4)",
+	      Math.SQRT2/2,
+	      Math.cos(Math.PI/4)         );
+
+new TestCase( SECTION,
+	      "Math.cos(Math.PI/2)",
+	      0,
+	      Math.cos(Math.PI/2)         );
+
+new TestCase( SECTION,
+	      "Math.cos(3*Math.PI/4)",
+	      -Math.SQRT2/2,
+	      Math.cos(3*Math.PI/4)       );
+
+new TestCase( SECTION,
+	      "Math.cos(Math.PI)",
+	      -1,
+	      Math.cos(Math.PI)           );
+
+new TestCase( SECTION,
+	      "Math.cos(5*Math.PI/4)",
+	      -Math.SQRT2/2,
+	      Math.cos(5*Math.PI/4)       );
+
+new TestCase( SECTION,
+	      "Math.cos(3*Math.PI/2)",
+	      0,
+	      Math.cos(3*Math.PI/2)       );
+
+new TestCase( SECTION,
+	      "Math.cos(7*Math.PI/4)",
+	      Math.SQRT2/2,
+	      Math.cos(7*Math.PI/4)       );
+
+new TestCase( SECTION,
+	      "Math.cos(Math.PI*2)",
+	      1,
+	      Math.cos(2*Math.PI)         );
+
+new TestCase( SECTION,
+	      "Math.cos(-0.7853981633974)",
+	      0.7071067811865,
+	      Math.cos(-0.7853981633974)  );
+
+new TestCase( SECTION,
+	      "Math.cos(-1.570796326795)",
+	      0,
+	      Math.cos(-1.570796326795)   );
+
+new TestCase( SECTION,
+	      "Math.cos(-2.3561944901920)",
+	      -.7071067811865,
+	      Math.cos(2.3561944901920)   );
+
+new TestCase( SECTION,
+	      "Math.cos(-3.14159265359)",
+	      -1,
+	      Math.cos(3.14159265359)     );
+
+new TestCase( SECTION,
+	      "Math.cos(-3.926990816987)",
+	      -0.7071067811865,
+	      Math.cos(3.926990816987)    );
+
+new TestCase( SECTION,
+	      "Math.cos(-4.712388980385)",
+	      0,
+	      Math.cos(4.712388980385)    );
+
+new TestCase( SECTION,
+	      "Math.cos(-5.497787143782)",
+	      0.7071067811865,
+	      Math.cos(5.497787143782)    );
+
+new TestCase( SECTION,
+	      "Math.cos(-6.28318530718)",
+	      1,
+	      Math.cos(6.28318530718)     );
+
+new TestCase( SECTION,
+	      "Math.cos(-Math.PI/4)",
+	      Math.SQRT2/2,
+	      Math.cos(-Math.PI/4)        );
+
+new TestCase( SECTION,
+	      "Math.cos(-Math.PI/2)",
+	      0,
+	      Math.cos(-Math.PI/2)        );
+
+new TestCase( SECTION,
+	      "Math.cos(-3*Math.PI/4)",
+	      -Math.SQRT2/2,
+	      Math.cos(-3*Math.PI/4)      );
+
+new TestCase( SECTION,
+	      "Math.cos(-Math.PI)",
+	      -1,
+	      Math.cos(-Math.PI)          );
+
+new TestCase( SECTION,
+	      "Math.cos(-5*Math.PI/4)",
+	      -Math.SQRT2/2,
+	      Math.cos(-5*Math.PI/4)      );
+
+new TestCase( SECTION,
+	      "Math.cos(-3*Math.PI/2)",
+	      0,
+	      Math.cos(-3*Math.PI/2)      );
+
+new TestCase( SECTION,
+	      "Math.cos(-7*Math.PI/4)",
+	      Math.SQRT2/2,
+	      Math.cos(-7*Math.PI/4)      );
+
+new TestCase( SECTION,
+	      "Math.cos(-Math.PI*2)",
+	      1,
+	      Math.cos(-Math.PI*2)        );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.8.js b/js/src/tests/ecma/Math/15.8.2.8.js
new file mode 100644
index 000000000..54b68c7e1
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.8.js
@@ -0,0 +1,100 @@
+/* -*- tab-width: 2; 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:          15.8.2.8.js
+   ECMA Section:       15.8.2.8  Math.exp(x)
+   Description:        return an approximation to the exponential function of
+   the argument (e raised to the power of the argument)
+   special cases:
+   -   if x is NaN         return NaN
+   -   if x is 0           return 1
+   -   if x is -0          return 1
+   -   if x is Infinity    return Infinity
+   -   if x is -Infinity   return 0
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+
+var SECTION = "15.8.2.8";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.exp(x)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.exp.length",
+	      1,
+	      Math.exp.length );
+
+new TestCase( SECTION,
+	      "Math.exp()",
+	      Number.NaN,
+	      Math.exp() );
+
+new TestCase( SECTION,
+	      "Math.exp(null)",
+	      1,
+	      Math.exp(null) );
+
+new TestCase( SECTION,
+	      "Math.exp(void 0)",
+	      Number.NaN,
+	      Math.exp(void 0) );
+
+new TestCase( SECTION,
+	      "Math.exp(1)",
+	      Math.E,
+	      Math.exp(1) );
+
+new TestCase( SECTION,
+	      "Math.exp(true)",
+	      Math.E,
+	      Math.exp(true) );
+
+new TestCase( SECTION,
+	      "Math.exp(false)",
+	      1,
+	      Math.exp(false) );
+
+new TestCase( SECTION,
+	      "Math.exp('1')",
+	      Math.E,
+	      Math.exp('1') );
+
+new TestCase( SECTION,
+	      "Math.exp('0')",
+	      1,
+	      Math.exp('0') );
+
+new TestCase( SECTION,
+	      "Math.exp(NaN)",
+	      Number.NaN,
+	      Math.exp(Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.exp(0)",
+	      1,
+	      Math.exp(0)          );
+
+new TestCase( SECTION,
+	      "Math.exp(-0)",
+	      1,
+	      Math.exp(-0)         );
+
+new TestCase( SECTION,
+	      "Math.exp(Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.exp(Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.exp(-Infinity)", 
+	      0,
+	      Math.exp(Number.NEGATIVE_INFINITY) );
+
+test();
diff --git a/js/src/tests/ecma/Math/15.8.2.9.js b/js/src/tests/ecma/Math/15.8.2.9.js
new file mode 100644
index 000000000..9fe0ab1db
--- /dev/null
+++ b/js/src/tests/ecma/Math/15.8.2.9.js
@@ -0,0 +1,157 @@
+/* -*- tab-width: 2; 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:          15.8.2.9.js
+   ECMA Section:       15.8.2.9  Math.floor(x)
+   Description:        return the greatest number value that is not greater
+   than the argument and is equal to a mathematical integer.
+   if the number is already an integer, return the number
+   itself.  special cases:
+   - if x is NaN       return NaN
+   - if x = +0         return +0
+   - if x = -0          return -0
+   - if x = Infinity   return Infinity
+   - if x = -Infinity  return -Infinity
+   - if ( -1 < x < 0 ) return -0
+   also:
+   -   the value of Math.floor(x) == -Math.ceil(-x)
+   Author:             christine@netscape.com
+   Date:               7 july 1997
+*/
+
+var SECTION = "15.8.2.9";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Math.floor(x)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.floor.length",
+	      1,
+	      Math.floor.length );
+
+new TestCase( SECTION,
+	      "Math.floor()",
+	      Number.NaN,
+	      Math.floor() );
+
+new TestCase( SECTION,
+	      "Math.floor(void 0)",
+	      Number.NaN,
+	      Math.floor(void 0) );
+
+new TestCase( SECTION,
+	      "Math.floor(null)",
+	      0,
+	      Math.floor(null) );
+
+new TestCase( SECTION,
+	      "Math.floor(true)",
+	      1,
+	      Math.floor(true) );
+
+new TestCase( SECTION,
+	      "Math.floor(false)",
+	      0,
+	      Math.floor(false) );
+
+new TestCase( SECTION,
+	      "Math.floor('1.1')",
+	      1,
+	      Math.floor("1.1") );
+
+new TestCase( SECTION,
+	      "Math.floor('-1.1')",
+	      -2,
+	      Math.floor("-1.1") );
+
+new TestCase( SECTION,
+	      "Math.floor('0.1')",
+	      0,
+	      Math.floor("0.1") );
+
+new TestCase( SECTION,
+	      "Math.floor('-0.1')",
+	      -1,
+	      Math.floor("-0.1") );
+
+new TestCase( SECTION,
+	      "Math.floor(NaN)",
+	      Number.NaN,
+	      Math.floor(Number.NaN)  );
+
+new TestCase( SECTION,
+	      "Math.floor(NaN)==-Math.ceil(-NaN)",
+	      false,
+	      Math.floor(Number.NaN) == -Math.ceil(-Number.NaN) );
+
+new TestCase( SECTION,
+	      "Math.floor(0)",
+	      0,
+	      Math.floor(0)           );
+
+new TestCase( SECTION,
+	      "Math.floor(0)==-Math.ceil(-0)",
+	      true,
+	      Math.floor(0) == -Math.ceil(-0) );
+
+new TestCase( SECTION,
+	      "Math.floor(-0)",
+	      -0,
+	      Math.floor(-0)          );
+
+new TestCase( SECTION,
+	      "Infinity/Math.floor(-0)",
+	      -Infinity,
+	      Infinity/Math.floor(-0)          );
+
+new TestCase( SECTION,
+	      "Math.floor(-0)==-Math.ceil(0)",
+	      true,
+	      Math.floor(-0)== -Math.ceil(0) );
+
+new TestCase( SECTION,
+	      "Math.floor(Infinity)",
+	      Number.POSITIVE_INFINITY,
+	      Math.floor(Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.floor(Infinity)==-Math.ceil(-Infinity)",
+	      true,
+	      Math.floor(Number.POSITIVE_INFINITY) == -Math.ceil(Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.floor(-Infinity)",
+	      Number.NEGATIVE_INFINITY,
+	      Math.floor(Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.floor(-Infinity)==-Math.ceil(Infinity)",
+	      true,
+	      Math.floor(Number.NEGATIVE_INFINITY) == -Math.ceil(Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION,
+	      "Math.floor(0.0000001)",
+	      0,
+	      Math.floor(0.0000001) );
+
+new TestCase( SECTION,
+	      "Math.floor(0.0000001)==-Math.ceil(0.0000001)", true,
+	      Math.floor(0.0000001)==-Math.ceil(-0.0000001) );
+
+new TestCase( SECTION,
+	      "Math.floor(-0.0000001)",
+	      -1,
+	      Math.floor(-0.0000001) );
+
+new TestCase( SECTION,
+	      "Math.floor(0.0000001)==-Math.ceil(0.0000001)",
+	      true,
+	      Math.floor(-0.0000001)==-Math.ceil(0.0000001) );
+
+test();
diff --git a/js/src/tests/ecma/Math/browser.js b/js/src/tests/ecma/Math/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Math/browser.js
diff --git a/js/src/tests/ecma/Math/shell.js b/js/src/tests/ecma/Math/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Math/shell.js
diff --git a/js/src/tests/ecma/NativeObjects/browser.js b/js/src/tests/ecma/NativeObjects/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/NativeObjects/browser.js
diff --git a/js/src/tests/ecma/NativeObjects/shell.js b/js/src/tests/ecma/NativeObjects/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/NativeObjects/shell.js
diff --git a/js/src/tests/ecma/Number/0x-without-following-hexdigits.js b/js/src/tests/ecma/Number/0x-without-following-hexdigits.js
new file mode 100644
index 000000000..ffb329e5c
--- /dev/null
+++ b/js/src/tests/ecma/Number/0x-without-following-hexdigits.js
@@ -0,0 +1,30 @@
+// Any copyright is dedicated to the Public Domain.
+// http://creativecommons.org/licenses/publicdomain/
+
+//-----------------------------------------------------------------------------
+var BUGNUMBER = 582643;
+var summary = "'0x' not followed by hex digits should be a syntax error";
+
+print(BUGNUMBER + ": " + summary);
+
+/**************
+ * BEGIN TEST *
+ **************/
+
+try
+{
+  eval("0x");
+  throw new Error("didn't throw parsing 0x (with no subsequent hex digits)");
+}
+catch (e)
+{
+  assertEq(e instanceof SyntaxError, true,
+           "bad exception thrown: " + e);
+}
+
+/******************************************************************************/
+
+if (typeof reportCompare === "function")
+  reportCompare(true, true);
+
+print("All tests passed!");
diff --git a/js/src/tests/ecma/Number/15.7.1.js b/js/src/tests/ecma/Number/15.7.1.js
new file mode 100644
index 000000000..a1a7069de
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.1.js
@@ -0,0 +1,54 @@
+/* -*- 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:          15.7.1.js
+   ECMA Section:       15.7.1 The Number Constructor Called as a Function
+   15.7.1.1
+   15.7.1.2
+
+   Description:        When Number is called as a function rather than as a
+   constructor, it performs a type conversion.
+   15.7.1.1    Return a number value (not a Number object)
+   computed by ToNumber( value )
+   15.7.1.2    Number() returns 0.
+
+   need to add more test cases.  see the testcases for
+   TypeConversion ToNumber.
+
+   Author:             christine@netscape.com
+   Date:               29 september 1997
+*/
+
+var SECTION = "15.7.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Number Constructor Called as a Function";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(SECTION, "Number()",                  0,          Number() );
+new TestCase(SECTION, "Number(void 0)",            Number.NaN,  Number(void 0) );
+new TestCase(SECTION, "Number(null)",              0,          Number(null) );
+new TestCase(SECTION, "Number()",                  0,          Number() );
+new TestCase(SECTION, "Number(new Number())",      0,          Number( new Number() ) );
+new TestCase(SECTION, "Number(0)",                 0,          Number(0) );
+new TestCase(SECTION, "Number(1)",                 1,          Number(1) );
+new TestCase(SECTION, "Number(-1)",                -1,         Number(-1) );
+new TestCase(SECTION, "Number(NaN)",               Number.NaN, Number( Number.NaN ) );
+new TestCase(SECTION, "Number('string')",          Number.NaN, Number( "string") );
+new TestCase(SECTION, "Number(new String())",      0,          Number( new String() ) );
+new TestCase(SECTION, "Number('')",                0,          Number( "" ) );
+new TestCase(SECTION, "Number(Infinity)",          Number.POSITIVE_INFINITY,   Number("Infinity") );
+
+new TestCase(SECTION, "Number(new MyObject(100))",  100,        Number(new MyObject(100)) );
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+}
diff --git a/js/src/tests/ecma/Number/15.7.2.js b/js/src/tests/ecma/Number/15.7.2.js
new file mode 100644
index 000000000..4be91d5ae
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.2.js
@@ -0,0 +1,134 @@
+/* -*- tab-width: 2; 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:          15.7.2.js
+   ECMA Section:       15.7.2 The Number Constructor
+   15.7.2.1
+   15.7.2.2
+
+   Description:        15.7.2 When Number is called as part of a new
+   expression, it is a constructor:  it initializes
+   the newly created object.
+
+   15.7.2.1 The [[Prototype]] property of the newly
+   constructed object is set to othe original Number
+   prototype object, the one that is the initial value
+   of Number.prototype(0).  The [[Class]] property is
+   set to "Number".  The [[Value]] property of the
+   newly constructed object is set to ToNumber(value)
+
+   15.7.2.2 new Number().  same as in 15.7.2.1, except
+   the [[Value]] property is set to +0.
+
+   need to add more test cases.  see the testcases for
+   TypeConversion ToNumber.
+
+   Author:             christine@netscape.com
+   Date:               29 september 1997
+*/
+
+var SECTION = "15.7.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Number Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  To verify that the object's prototype is the Number.prototype, check to see if the object's
+//  constructor property is the same as Number.prototype.constructor.
+
+new TestCase(SECTION, "(new Number()).constructor",      Number.prototype.constructor,   (new Number()).constructor );
+
+new TestCase(SECTION, "typeof (new Number())",         "object",           typeof (new Number()) );
+new TestCase(SECTION,  "(new Number()).valueOf()",     0,                   (new Number()).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number();NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number();NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+new TestCase(SECTION, "(new Number(0)).constructor",     Number.prototype.constructor,    (new Number(0)).constructor );
+new TestCase(SECTION, "typeof (new Number(0))",         "object",           typeof (new Number(0)) );
+new TestCase(SECTION,  "(new Number(0)).valueOf()",     0,                   (new Number(0)).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number(0);NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number(0);NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+new TestCase(SECTION, "(new Number(1)).constructor",     Number.prototype.constructor,    (new Number(1)).constructor );
+new TestCase(SECTION, "typeof (new Number(1))",         "object",           typeof (new Number(1)) );
+new TestCase(SECTION,  "(new Number(1)).valueOf()",     1,                   (new Number(1)).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number(1);NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number(1);NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+new TestCase(SECTION, "(new Number(-1)).constructor",     Number.prototype.constructor,    (new Number(-1)).constructor );
+new TestCase(SECTION, "typeof (new Number(-1))",         "object",           typeof (new Number(-1)) );
+new TestCase(SECTION,  "(new Number(-1)).valueOf()",     -1,                   (new Number(-1)).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number(-1);NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number(-1);NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+new TestCase(SECTION, "(new Number(Number.NaN)).constructor",     Number.prototype.constructor,    (new Number(Number.NaN)).constructor );
+new TestCase(SECTION, "typeof (new Number(Number.NaN))",         "object",           typeof (new Number(Number.NaN)) );
+new TestCase(SECTION,  "(new Number(Number.NaN)).valueOf()",     Number.NaN,                   (new Number(Number.NaN)).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number(Number.NaN);NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number(Number.NaN);NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+new TestCase(SECTION, "(new Number('string')).constructor",     Number.prototype.constructor,    (new Number('string')).constructor );
+new TestCase(SECTION, "typeof (new Number('string'))",         "object",           typeof (new Number('string')) );
+new TestCase(SECTION,  "(new Number('string')).valueOf()",     Number.NaN,                   (new Number('string')).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number('string');NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number('string');NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+new TestCase(SECTION, "(new Number(new String())).constructor",     Number.prototype.constructor,    (new Number(new String())).constructor );
+new TestCase(SECTION, "typeof (new Number(new String()))",         "object",           typeof (new Number(new String())) );
+new TestCase(SECTION,  "(new Number(new String())).valueOf()",     0,                   (new Number(new String())).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number(new String());NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number(new String());NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+new TestCase(SECTION, "(new Number('')).constructor",     Number.prototype.constructor,    (new Number('')).constructor );
+new TestCase(SECTION, "typeof (new Number(''))",         "object",           typeof (new Number('')) );
+new TestCase(SECTION,  "(new Number('')).valueOf()",     0,                   (new Number('')).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number('');NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number('');NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+new TestCase(SECTION, "(new Number(Number.POSITIVE_INFINITY)).constructor",     Number.prototype.constructor,    (new Number(Number.POSITIVE_INFINITY)).constructor );
+new TestCase(SECTION, "typeof (new Number(Number.POSITIVE_INFINITY))",         "object",           typeof (new Number(Number.POSITIVE_INFINITY)) );
+new TestCase(SECTION,  "(new Number(Number.POSITIVE_INFINITY)).valueOf()",     Number.POSITIVE_INFINITY,    (new Number(Number.POSITIVE_INFINITY)).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number(Number.POSITIVE_INFINITY);NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number(Number.POSITIVE_INFINITY);NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+new TestCase(SECTION, "(new Number(Number.NEGATIVE_INFINITY)).constructor",     Number.prototype.constructor,    (new Number(Number.NEGATIVE_INFINITY)).constructor );
+new TestCase(SECTION, "typeof (new Number(Number.NEGATIVE_INFINITY))",         "object",           typeof (new Number(Number.NEGATIVE_INFINITY)) );
+new TestCase(SECTION,  "(new Number(Number.NEGATIVE_INFINITY)).valueOf()",     Number.NEGATIVE_INFINITY,                   (new Number(Number.NEGATIVE_INFINITY)).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number(Number.NEGATIVE_INFINITY);NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number(Number.NEGATIVE_INFINITY);NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+
+new TestCase(SECTION, "(new Number()).constructor",     Number.prototype.constructor,    (new Number()).constructor );
+new TestCase(SECTION, "typeof (new Number())",         "object",           typeof (new Number()) );
+new TestCase(SECTION,  "(new Number()).valueOf()",     0,                   (new Number()).valueOf() );
+new TestCase(SECTION,
+	     "NUMB = new Number();NUMB.toString=Object.prototype.toString;NUMB.toString()",
+	     "[object Number]",
+	     eval("NUMB = new Number();NUMB.toString=Object.prototype.toString;NUMB.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.1-1.js b/js/src/tests/ecma/Number/15.7.3.1-1.js
new file mode 100644
index 000000000..7a1249d4d
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.1-1.js
@@ -0,0 +1,37 @@
+/* -*- tab-width: 2; 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:          15.7.3.1-2.js
+   ECMA Section:       15.7.3.1 Number.prototype
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Number.prototype
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+
+var SECTION = "15.7.3.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.prototype";
+
+writeHeaderToLog( SECTION +" "+ TITLE);
+
+new TestCase(SECTION,
+	     "var NUM_PROT = Number.prototype; delete( Number.prototype ); NUM_PROT == Number.prototype",   
+	     true, 
+	     eval("var NUM_PROT = Number.prototype; delete( Number.prototype ); NUM_PROT == Number.prototype") );
+
+new TestCase(SECTION,
+	     "delete( Number.prototype )",         
+	     false,      
+	     eval("delete( Number.prototype )") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.1-2.js b/js/src/tests/ecma/Number/15.7.3.1-2.js
new file mode 100644
index 000000000..51e53a04f
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.1-2.js
@@ -0,0 +1,37 @@
+/* -*- tab-width: 2; 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:          15.7.3.1-2.js
+   ECMA Section:       15.7.3.1 Number.prototype
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Number.prototype
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+
+var SECTION = "15.7.3.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"var NUM_PROT = Number.prototype; Number.prototype = null; Number.prototype == NUM_PROT",
+		true,
+		eval("var NUM_PROT = Number.prototype; Number.prototype = null; Number.prototype == NUM_PROT") );
+
+new TestCase(   SECTION,
+		"Number.prototype=0; Number.prototype",
+		Number.prototype,
+		eval("Number.prototype=0; Number.prototype") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.1-3.js b/js/src/tests/ecma/Number/15.7.3.1-3.js
new file mode 100644
index 000000000..97d890386
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.1-3.js
@@ -0,0 +1,33 @@
+/* -*- 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:          15.7.3.1-4.js
+   ECMA Section:       15.7.3.1 Number.prototype
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontEnum attribute of Number.prototype
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var VERSION = "ECMA_1";
+startTest();
+var SECTION = "15.7.3.1-3";
+var TITLE   = "Number.prototype";
+
+writeHeaderToLog( SECTION + " Number.prototype:  DontEnum Attribute");
+
+new TestCase(
+  SECTION,
+  "var string = ''; for ( prop in Number ) { string += ( prop == 'prototype' ) ? prop: '' } string;",
+  "",
+  eval("var string = ''; for ( prop in Number ) { string += ( prop == 'prototype' ) ? prop : '' } string;")
+  );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.2-1.js b/js/src/tests/ecma/Number/15.7.3.2-1.js
new file mode 100644
index 000000000..f4fe0e227
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.2-1.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.7.3.2-1.js
+   ECMA Section:       15.7.3.2 Number.MAX_VALUE
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the value of MAX_VALUE
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.7.3.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE =  "Number.MAX_VALUE";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Number.MAX_VALUE",     
+	      1.7976931348623157e308,    
+	      Number.MAX_VALUE );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.2-2.js b/js/src/tests/ecma/Number/15.7.3.2-2.js
new file mode 100644
index 000000000..64caa6b6f
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.2-2.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.7.3.2-2.js
+   ECMA Section:       15.7.3.2 Number.MAX_VALUE
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Number.MAX_VALUE
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.7.3.2-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE =  "Number.MAX_VALUE:  DontDelete Attribute";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "delete( Number.MAX_VALUE ); Number.MAX_VALUE",     
+	      1.7976931348623157e308,
+	      eval("delete( Number.MAX_VALUE );Number.MAX_VALUE") );
+
+new TestCase( SECTION,
+	      "delete( Number.MAX_VALUE )", 
+	      false, 
+	      eval("delete( Number.MAX_VALUE )") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.2-3.js b/js/src/tests/ecma/Number/15.7.3.2-3.js
new file mode 100644
index 000000000..48a32a3e7
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.2-3.js
@@ -0,0 +1,33 @@
+/* -*- tab-width: 2; 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:          15.7.3.2-3.js
+   ECMA Section:       15.7.3.2 Number.MAX_VALUE
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Number.MAX_VALUE
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.7.3.2-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.MAX_VALUE";
+
+writeHeaderToLog( SECTION + " "+ TITLE );
+
+var MAX_VAL = 1.7976931348623157e308;
+
+new TestCase( SECTION,
+	      "Number.MAX_VALUE=0; Number.MAX_VALUE",
+	      MAX_VAL,
+	      eval("Number.MAX_VALUE=0; Number.MAX_VALUE") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.2-4.js b/js/src/tests/ecma/Number/15.7.3.2-4.js
new file mode 100644
index 000000000..96bc7071f
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.2-4.js
@@ -0,0 +1,30 @@
+/* -*- tab-width: 2; 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:          15.7.3.2-4.js
+   ECMA Section:       15.7.3.2 Number.MAX_VALUE
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontEnum attribute of Number.MAX_VALUE
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.3.2-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.MAX_VALUE:  DontEnum Attribute";
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "var string = ''; for ( prop in Number ) { string += ( prop == 'MAX_VALUE' ) ? prop : '' } string;",
+	      "",
+	      eval("var string = ''; for ( prop in Number ) { string += ( prop == 'MAX_VALUE' ) ? prop : '' } string;")
+  );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.3-1.js b/js/src/tests/ecma/Number/15.7.3.3-1.js
new file mode 100644
index 000000000..b71fd3db9
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.3-1.js
@@ -0,0 +1,34 @@
+/* -*- tab-width: 2; 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:          15.7.3.3-1.js
+   ECMA Section:       15.7.3.3 Number.MIN_VALUE
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the value of Number.MIN_VALUE
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+
+var SECTION = "15.7.3.3-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.MIN_VALUE";
+
+writeHeaderToLog( SECTION + " "+ TITLE );
+
+var MIN_VAL = 5e-324;
+
+new TestCase(  SECTION,
+	       "Number.MIN_VALUE",    
+	       MIN_VAL,   
+	       Number.MIN_VALUE );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.3-2.js b/js/src/tests/ecma/Number/15.7.3.3-2.js
new file mode 100644
index 000000000..345f70492
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.3-2.js
@@ -0,0 +1,39 @@
+/* -*- tab-width: 2; 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:          15.7.3.3-2.js
+   ECMA Section:       15.7.3.3 Number.MIN_VALUE
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Number.MIN_VALUE
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+
+var SECTION = "15.7.3.3-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.MIN_VALUE";
+
+writeHeaderToLog( SECTION + " "+ TITLE );
+
+var MIN_VAL = 5e-324;
+
+new TestCase(  SECTION,
+	       "delete( Number.MIN_VALUE )",   
+	       false,
+	       eval("delete( Number.MIN_VALUE )") );
+
+new TestCase(  SECTION,
+	       "delete( Number.MIN_VALUE ); Number.MIN_VALUE",
+	       MIN_VAL,
+	       eval("delete( Number.MIN_VALUE );Number.MIN_VALUE") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.3-3.js b/js/src/tests/ecma/Number/15.7.3.3-3.js
new file mode 100644
index 000000000..67cbae26a
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.3-3.js
@@ -0,0 +1,30 @@
+/* -*- tab-width: 2; 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:          15.7.3.3-3.js
+   ECMA Section:       15.7.3.3 Number.MIN_VALUE
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Number.MIN_VALUE
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.3.3-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.MIN_VALUE:  ReadOnly Attribute";
+
+writeHeaderToLog( SECTION + " "+TITLE );
+
+new TestCase( SECTION,
+	      "Number.MIN_VALUE=0; Number.MIN_VALUE",
+	      Number.MIN_VALUE,
+	      eval("Number.MIN_VALUE=0; Number.MIN_VALUE" ));
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.3-4.js b/js/src/tests/ecma/Number/15.7.3.3-4.js
new file mode 100644
index 000000000..13d57bc51
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.3-4.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.7.3.3-4.js
+   ECMA Section:       15.7.3.3 Number.MIN_VALUE
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontEnum attribute of Number.MIN_VALUE
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+
+var SECTION = "15.7.3.3-4";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Number.MIN_VALUE:  DontEnum Attribute");
+
+new TestCase( SECTION,
+	      "var string = ''; for ( prop in Number ) { string += ( prop == 'MIN_VALUE' ) ? prop : '' } string;",
+	      "",
+	      eval("var string = ''; for ( prop in Number ) { string += ( prop == 'MIN_VALUE' ) ? prop : '' } string;")
+  );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.4-1.js b/js/src/tests/ecma/Number/15.7.3.4-1.js
new file mode 100644
index 000000000..c811c05e1
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.4-1.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.7.3.4-1.js
+   ECMA Section:       15.7.3.4 Number.NaN
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the value of Number.NaN
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+
+var SECTION = "15.7.3.4-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.NaN";
+
+writeHeaderToLog( SECTION + " "+ TITLE );
+
+new TestCase(SECTION,
+	     "NaN",       
+	     NaN,       
+	     Number.NaN );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.4-2.js b/js/src/tests/ecma/Number/15.7.3.4-2.js
new file mode 100644
index 000000000..3ce2e5ed4
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.4-2.js
@@ -0,0 +1,37 @@
+/* -*- tab-width: 2; 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:          15.7.3.4-2.js
+   ECMA Section:       15.7.3.4 Number.NaN
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Number.NaN
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+
+var SECTION = "15.7.3.4-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.NaN";
+
+writeHeaderToLog( SECTION + " "+ TITLE );
+
+new TestCase(SECTION,
+	     "delete( Number.NaN ); Number.NaN",      
+	     NaN,       
+	     eval("delete( Number.NaN );Number.NaN" ));
+
+new TestCase( SECTION,
+	      "delete( Number.NaN )",  
+	      false, 
+	      eval("delete( Number.NaN )") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.4-3.js b/js/src/tests/ecma/Number/15.7.3.4-3.js
new file mode 100644
index 000000000..f01506ac7
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.4-3.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.7.3.4-3.js
+   ECMA Section:       15.7.3.4 Number.NaN
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Number.NaN
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.7.3.4-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.NaN";
+
+writeHeaderToLog( SECTION + " "+ TITLE );
+
+new TestCase( SECTION,
+	      "Number.NaN=0; Number.NaN",
+	      Number.NaN,
+	      eval("Number.NaN=0; Number.NaN") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.4-4.js b/js/src/tests/ecma/Number/15.7.3.4-4.js
new file mode 100644
index 000000000..e650b2b55
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.4-4.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.7.3.4-4.js
+   ECMA Section:       15.7.3.4 Number.NaN
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontEnum attribute of Number.NaN
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.7.3.4-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.NaN";
+
+writeHeaderToLog( SECTION + " " + TITLE);
+
+new TestCase( SECTION,
+	      "var string = ''; for ( prop in Number ) { string += ( prop == 'NaN' ) ? prop : '' } string;",
+	      "",
+	      eval("var string = ''; for ( prop in Number ) { string += ( prop == 'NaN' ) ? prop : '' } string;")
+  );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.5-1.js b/js/src/tests/ecma/Number/15.7.3.5-1.js
new file mode 100644
index 000000000..27ab946ac
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.5-1.js
@@ -0,0 +1,30 @@
+/* -*- tab-width: 2; 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:          15.7.3.5-1.js
+   ECMA Section:       15.7.3.5 Number.NEGATIVE_INFINITY
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the  value of Number.NEGATIVE_INFINITY
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.3.5-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.NEGATIVE_INFINITY";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+new TestCase(SECTION,  
+	     "Number.NEGATIVE_INFINITY",    
+	     -Infinity, 
+	     Number.NEGATIVE_INFINITY );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.5-2.js b/js/src/tests/ecma/Number/15.7.3.5-2.js
new file mode 100644
index 000000000..be2ba3964
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.5-2.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.7.3.5-2.js
+   ECMA Section:       15.7.3.5 Number.NEGATIVE_INFINITY
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Number.NEGATIVE_INFINITY
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.7.3.5-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.NEGATIVE_INFINITY";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+new TestCase(   SECTION,
+		"delete( Number.NEGATIVE_INFINITY )",
+		false,
+		eval("delete( Number.NEGATIVE_INFINITY )") );
+
+new TestCase(   SECTION,
+		"delete( Number.NEGATIVE_INFINITY ); Number.NEGATIVE_INFINITY",
+		-Infinity,
+		eval("delete( Number.NEGATIVE_INFINITY );Number.NEGATIVE_INFINITY") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.5-3.js b/js/src/tests/ecma/Number/15.7.3.5-3.js
new file mode 100644
index 000000000..cb2b271a7
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.5-3.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.7.3.5-3.js
+   ECMA Section:       15.7.3.5 Number.NEGATIVE_INFINITY
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Number.NEGATIVE_INFINITY
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.7.3.5-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.NEGATIVE_INFINITY";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+new TestCase( SECTION,
+	      "Number.NEGATIVE_INFINITY=0; Number.NEGATIVE_INFINITY",
+	      -Infinity,
+	      eval("Number.NEGATIVE_INFINITY=0; Number.NEGATIVE_INFINITY") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.5-4.js b/js/src/tests/ecma/Number/15.7.3.5-4.js
new file mode 100644
index 000000000..d44b0f64b
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.5-4.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.7.3.5-4.js
+   ECMA Section:       15.7.3.5 Number.NEGATIVE_INFINITY
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontEnum attribute of Number.NEGATIVE_INFINITY
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.7.3.5-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.NEGATIVE_INFINITY";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+new TestCase( SECTION,
+	      "var string = ''; for ( prop in Number ) { string += ( prop == 'NEGATIVE_INFINITY' ) ? prop : '' } string;",
+	      "",
+	      eval("var string = ''; for ( prop in Number ) { string += ( prop == 'NEGATIVE_INFINITY' ) ? prop : '' } string;")
+  );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.6-1.js b/js/src/tests/ecma/Number/15.7.3.6-1.js
new file mode 100644
index 000000000..2c9f4990e
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.6-1.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.7.3.6-1.js
+   ECMA Section:       15.7.3.6 Number.POSITIVE_INFINITY
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the value of Number.POSITIVE_INFINITY
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.7.3.6-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.POSITIVE_INFINITY";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+new TestCase( SECTION,
+	      "Number.POSITIVE_INFINITY",     
+	      Infinity,  
+	      Number.POSITIVE_INFINITY );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.6-2.js b/js/src/tests/ecma/Number/15.7.3.6-2.js
new file mode 100644
index 000000000..55553adb3
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.6-2.js
@@ -0,0 +1,35 @@
+/* -*- tab-width: 2; 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:          15.7.3.6-2.js
+   ECMA Section:       15.7.3.6 Number.POSITIVE_INFINITY
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontDelete attribute of Number.POSITIVE_INFINITY
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.3.6-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.POSITIVE_INFINITY";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+new TestCase(SECTION,
+	     "delete( Number.POSITIVE_INFINITY )", 
+	     false,   
+	     eval("delete( Number.POSITIVE_INFINITY )") );
+
+new TestCase(SECTION,
+	     "delete( Number.POSITIVE_INFINITY ); Number.POSITIVE_INFINITY",
+	     Infinity, 
+	     eval("delete( Number.POSITIVE_INFINITY );Number.POSITIVE_INFINITY") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.6-3.js b/js/src/tests/ecma/Number/15.7.3.6-3.js
new file mode 100644
index 000000000..b08b4a96c
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.6-3.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.7.3.6-3.js
+   ECMA Section:       15.7.3.6 Number.POSITIVE_INFINITY
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the ReadOnly attribute of Number.POSITIVE_INFINITY
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+var SECTION = "15.7.3.6-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.POSITIVE_INFINITY";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+new TestCase( SECTION,
+	      "Number.POSITIVE_INFINITY=0; Number.POSITIVE_INFINITY",
+	      Number.POSITIVE_INFINITY,
+	      eval("Number.POSITIVE_INFINITY=0; Number.POSITIVE_INFINITY") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.6-4.js b/js/src/tests/ecma/Number/15.7.3.6-4.js
new file mode 100644
index 000000000..79250d9eb
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.6-4.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.7.3.6-4.js
+   ECMA Section:       15.7.3.6 Number.POSITIVE_INFINITY
+   Description:        All value properties of the Number object should have
+   the attributes [DontEnum, DontDelete, ReadOnly]
+
+   this test checks the DontEnum attribute of Number.POSITIVE_INFINITY
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.3.6-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.POSITIVE_INFINITY";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+new TestCase( SECTION,
+	      "var string = ''; for ( prop in Number ) { string += ( prop == 'POSITIVE_INFINITY' ) ? prop : '' } string;",
+	      "",
+	      eval("var string = ''; for ( prop in Number ) { string += ( prop == 'POSITIVE_INFINITY' ) ? prop : '' } string;")
+  );
+
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.3.js b/js/src/tests/ecma/Number/15.7.3.js
new file mode 100644
index 000000000..9ac4c4b18
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.3.js
@@ -0,0 +1,35 @@
+/* -*- tab-width: 2; 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:          15.7.3.js
+   15.7.3  Properties of the Number Constructor
+
+   Description:        The value of the internal [[Prototype]] property
+   of the Number constructor is the Function prototype
+   object.  The Number constructor also has the internal
+   [[Call]] and [[Construct]] properties, and the length
+   property.
+
+   Other properties are in subsequent tests.
+
+   Author:             christine@netscape.com
+   Date:               29 september 1997
+*/
+
+var SECTION = "15.7.3";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "Properties of the Number Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(SECTION,
+	     "Number.length",     
+	     1,                 
+	     Number.length );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.4-1.js b/js/src/tests/ecma/Number/15.7.4-1.js
new file mode 100644
index 000000000..05d16a5c2
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.4-1.js
@@ -0,0 +1,26 @@
+/* -*- 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:          15.7.4-1.js
+   ECMA Section:       15.7.4.1 Properties of the Number Prototype Object
+   Description:
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+
+
+var SECTION = "15.7.4-1";
+var VERSION = "ECMA_1";
+startTest();
+writeHeaderToLog( SECTION + "Properties of the Number prototype object");
+
+new TestCase(SECTION, "Number.prototype.valueOf()",      0,                  Number.prototype.valueOf() );
+new TestCase(SECTION, "typeof(Number.prototype)",        "object",           typeof(Number.prototype) );
+new TestCase(SECTION, "Number.prototype.constructor == Number",    true,     Number.prototype.constructor == Number );
+//    new TestCase(SECTION, "Number.prototype == Number.__proto__",      true,   Number.prototype == Number.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.4.1.js b/js/src/tests/ecma/Number/15.7.4.1.js
new file mode 100644
index 000000000..da8c20501
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.4.1.js
@@ -0,0 +1,28 @@
+/* -*- tab-width: 2; 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:          15.7.4.1.js
+   ECMA Section:       15.7.4.1.1 Number.prototype.constructor
+
+   Number.prototype.constructor is the built-in Number constructor.
+
+   Description:
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.4.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Number.prototype.constructor";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+new TestCase(   SECTION,
+		"Number.prototype.constructor",
+		Number,
+		Number.prototype.constructor );
+test();
diff --git a/js/src/tests/ecma/Number/15.7.4.2-1.js b/js/src/tests/ecma/Number/15.7.4.2-1.js
new file mode 100644
index 000000000..05939a6e6
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.4.2-1.js
@@ -0,0 +1,77 @@
+/* -*- tab-width: 2; 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:          15.7.4.2.js
+   ECMA Section:       15.7.4.2.1 Number.prototype.toString()
+   Description:
+   If the radix is the number 10 or not supplied, then this number value is
+   given as an argument to the ToString operator; the resulting string value
+   is returned.
+
+   If the radix is supplied and is an integer from 2 to 36, but not 10, the
+   result is a string, the choice of which is implementation dependent.
+
+   The toString function is not generic; it generates a runtime error if its
+   this value is not a Number object. Therefore it cannot be transferred to
+   other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.4.2-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Number.prototype.toString()");
+
+//  the following two lines cause navigator to crash -- cmb 9/16/97
+new TestCase(SECTION,
+	     "Number.prototype.toString()",      
+	     "0",       
+	     eval("Number.prototype.toString()") );
+
+new TestCase(SECTION,
+	     "typeof(Number.prototype.toString())",
+	     "string",     
+	     eval("typeof(Number.prototype.toString())") );
+
+new TestCase(SECTION, 
+	     "s = Number.prototype.toString; o = new Number(); o.toString = s; o.toString()", 
+	     "0",         
+	     eval("s = Number.prototype.toString; o = new Number(); o.toString = s; o.toString()") );
+
+new TestCase(SECTION, 
+	     "s = Number.prototype.toString; o = new Number(1); o.toString = s; o.toString()",
+	     "1",         
+	     eval("s = Number.prototype.toString; o = new Number(1); o.toString = s; o.toString()") );
+
+new TestCase(SECTION, 
+	     "s = Number.prototype.toString; o = new Number(-1); o.toString = s; o.toString()",
+	     "-1",        
+	     eval("s = Number.prototype.toString; o = new Number(-1); o.toString = s; o.toString()") );
+
+new TestCase(SECTION,
+	     "var MYNUM = new Number(255); MYNUM.toString(10)",         
+	     "255",     
+	     eval("var MYNUM = new Number(255); MYNUM.toString(10)") );
+
+new TestCase(SECTION,
+	     "var MYNUM = new Number(Number.NaN); MYNUM.toString(10)",  
+	     "NaN",     
+	     eval("var MYNUM = new Number(Number.NaN); MYNUM.toString(10)") );
+
+new TestCase(SECTION,
+	     "var MYNUM = new Number(Infinity); MYNUM.toString(10)",  
+	     "Infinity",  
+	     eval("var MYNUM = new Number(Infinity); MYNUM.toString(10)") );
+
+new TestCase(SECTION,
+	     "var MYNUM = new Number(-Infinity); MYNUM.toString(10)",  
+	     "-Infinity",
+	     eval("var MYNUM = new Number(-Infinity); MYNUM.toString(10)") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.4.2-2-n.js b/js/src/tests/ecma/Number/15.7.4.2-2-n.js
new file mode 100644
index 000000000..83eef466d
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.4.2-2-n.js
@@ -0,0 +1,42 @@
+/* -*- tab-width: 2; 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:          15.7.4.2-2-n.js
+   ECMA Section:       15.7.4.2.1 Number.prototype.toString()
+   Description:
+   If the radix is the number 10 or not supplied, then this number value is
+   given as an argument to the ToString operator; the resulting string value
+   is returned.
+
+   If the radix is supplied and is an integer from 2 to 36, but not 10, the
+   result is a string, the choice of which is implementation dependent.
+
+   The toString function is not generic; it generates a runtime error if its
+   this value is not a Number object. Therefore it cannot be transferred to
+   other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.4.2-2-n";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Number.prototype.toString()");
+
+DESCRIPTION = "o = new Object(); o.toString = Number.prototype.toString; o.toString()";
+EXPECTED = "error";
+
+new TestCase(SECTION, 
+	     "o = new Object(); o.toString = Number.prototype.toString; o.toString()", 
+	     "error",   
+	     eval("o = new Object(); o.toString = Number.prototype.toString; o.toString()") );
+
+//    new TestCase(SECTION,  "o = new String(); o.toString = Number.prototype.toString; o.toString()",  "error",    eval("o = new String(); o.toString = Number.prototype.toString; o.toString()") );
+//    new TestCase(SECTION,  "o = 3; o.toString = Number.prototype.toString; o.toString()",             "error",    eval("o = 3; o.toString = Number.prototype.toString; o.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.4.2-3-n.js b/js/src/tests/ecma/Number/15.7.4.2-3-n.js
new file mode 100644
index 000000000..adaf443e5
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.4.2-3-n.js
@@ -0,0 +1,39 @@
+/* -*- tab-width: 2; 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:          15.7.4.2-3-n.js
+   ECMA Section:       15.7.4.2.1 Number.prototype.toString()
+   Description:
+   If the radix is the number 10 or not supplied, then this number value is
+   given as an argument to the ToString operator; the resulting string value
+   is returned.
+
+   If the radix is supplied and is an integer from 2 to 36, but not 10, the
+   result is a string, the choice of which is implementation dependent.
+
+   The toString function is not generic; it generates a runtime error if its
+   this value is not a Number object. Therefore it cannot be transferred to
+   other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.4.2-3-n";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Number.prototype.toString()");
+
+DESCRIPTION = "o = new String(); o.toString = Number.prototype.toString; o.toString()";
+EXPECTED = "error";
+
+new TestCase(SECTION, 
+	     "o = new String(); o.toString = Number.prototype.toString; o.toString()", 
+	     "error",   
+	     eval("o = new String(); o.toString = Number.prototype.toString; o.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.4.2-4.js b/js/src/tests/ecma/Number/15.7.4.2-4.js
new file mode 100644
index 000000000..9eaee4d60
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.4.2-4.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.7.4.2-4.js
+   ECMA Section:       15.7.4.2.1 Number.prototype.toString()
+   Description:
+   If the radix is the number 10 or not supplied, then this number value is
+   given as an argument to the ToString operator; the resulting string value
+   is returned.
+
+   If the radix is supplied and is an integer from 2 to 36, but not 10, the
+   result is a string, the choice of which is implementation dependent.
+
+   The toString function is not generic; it generates a runtime error if its
+   this value is not a Number object. Therefore it cannot be transferred to
+   other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.4.2-4";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Number.prototype.toString()");
+
+new TestCase(SECTION, 
+	     "o = 3; o.toString = Number.prototype.toString; o.toString()",            
+	     "3",   
+	     eval("o = 3; o.toString = Number.prototype.toString; o.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.4.3-1.js b/js/src/tests/ecma/Number/15.7.4.3-1.js
new file mode 100644
index 000000000..04d5e125d
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.4.3-1.js
@@ -0,0 +1,63 @@
+/* -*- tab-width: 2; 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:          15.7.4.3-1.js
+   ECMA Section:       15.7.4.3.1 Number.prototype.valueOf()
+   Description:
+   Returns this number value.
+
+   The valueOf function is not generic; it generates a runtime error if its
+   this value is not a Number object. Therefore it cannot be transferred to
+   other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.4.3-1";
+var VERSION = "ECMA_1";
+startTest();
+
+
+writeHeaderToLog( SECTION + " Number.prototype.valueOf()");
+
+//  the following two line causes navigator to crash -- cmb 9/16/97
+new TestCase("SECTION",
+	     "Number.prototype.valueOf()",       
+	     0,       
+	     eval("Number.prototype.valueOf()") );
+
+new TestCase("SECTION",
+	     "(new Number(1)).valueOf()",        
+	     1,      
+	     eval("(new Number(1)).valueOf()") );
+
+new TestCase("SECTION",
+	     "(new Number(-1)).valueOf()",       
+	     -1,     
+	     eval("(new Number(-1)).valueOf()") );
+
+new TestCase("SECTION",
+	     "(new Number(0)).valueOf()",        
+	     0,      
+	     eval("(new Number(0)).valueOf()") );
+
+new TestCase("SECTION",
+	     "(new Number(Number.POSITIVE_INFINITY)).valueOf()",
+	     Number.POSITIVE_INFINITY,
+	     eval("(new Number(Number.POSITIVE_INFINITY)).valueOf()") );
+
+new TestCase("SECTION",
+	     "(new Number(Number.NaN)).valueOf()", 
+	     Number.NaN,
+	     eval("(new Number(Number.NaN)).valueOf()") );
+
+new TestCase("SECTION",
+	     "(new Number()).valueOf()",        
+	     0,      
+	     eval("(new Number()).valueOf()") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.4.3-2.js b/js/src/tests/ecma/Number/15.7.4.3-2.js
new file mode 100644
index 000000000..4af1a2fc1
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.4.3-2.js
@@ -0,0 +1,31 @@
+/* -*- tab-width: 2; 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:          15.7.4.3-2.js
+   ECMA Section:       15.7.4.3.1 Number.prototype.valueOf()
+   Description:
+   Returns this number value.
+
+   The valueOf function is not generic; it generates a runtime error if its
+   this value is not a Number object. Therefore it cannot be transferred to
+   other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.4.3-2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Number.prototype.valueOf()");
+
+new TestCase(SECTION,
+	     "v = Number.prototype.valueOf; num = 3; num.valueOf = v; num.valueOf()",
+	     3, 
+	     eval("v = Number.prototype.valueOf; num = 3; num.valueOf = v; num.valueOf()") );
+
+test();
diff --git a/js/src/tests/ecma/Number/15.7.4.3-3-n.js b/js/src/tests/ecma/Number/15.7.4.3-3-n.js
new file mode 100644
index 000000000..ded89575d
--- /dev/null
+++ b/js/src/tests/ecma/Number/15.7.4.3-3-n.js
@@ -0,0 +1,38 @@
+/* -*- tab-width: 2; 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:          15.7.4.3-3.js
+   ECMA Section:       15.7.4.3.1 Number.prototype.valueOf()
+   Description:
+   Returns this number value.
+
+   The valueOf function is not generic; it generates a runtime error if its
+   this value is not a Number object. Therefore it cannot be transferred to
+   other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.7.4.3-3-n";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Number.prototype.valueOf()");
+
+//    new TestCase("15.7.4.1", "v = Number.prototype.valueOf; num = 3; num.valueOf = v; num.valueOf()", "error",  eval("v = Number.prototype.valueOf; num = 3; num.valueOf = v; num.valueOf()") );
+
+DESCRIPTION = "v = Number.prototype.valueOf; o = new String('Infinity'); o.valueOf = v; o.valueOf()";
+EXPECTED = "error";
+
+new TestCase("15.7.4.1",
+	     "v = Number.prototype.valueOf; o = new String('Infinity'); o.valueOf = v; o.valueOf()",
+	     "error", 
+	     eval("v = Number.prototype.valueOf; o = new String('Infinity'); o.valueOf = v; o.valueOf()") );
+
+//    new TestCase("15.7.4.1", "v = Number.prototype.valueOf; o = new Object(); o.valueOf = v; o.valueOf()", "error",  eval("v = Number.prototype.valueOf; o = new Object(); o.valueOf = v; o.valueOf()") );
+
+test();
diff --git a/js/src/tests/ecma/Number/browser.js b/js/src/tests/ecma/Number/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Number/browser.js
diff --git a/js/src/tests/ecma/Number/shell.js b/js/src/tests/ecma/Number/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Number/shell.js
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.1.1.js b/js/src/tests/ecma/ObjectObjects/15.2.1.1.js
new file mode 100644
index 000000000..11195e018
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.1.1.js
@@ -0,0 +1,112 @@
+/* -*- 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:          15.2.1.1.js
+   ECMA Section:       15.2.1.1  The Object Constructor Called as a Function:
+   Object(value)
+   Description:        When Object is called as a function rather than as a
+   constructor, the following steps are taken:
+
+   1.  If value is null or undefined, create and return a
+   new object with no properties other than internal
+   properties exactly as if the object constructor
+   had been called on that same value (15.2.2.1).
+   2.  Return ToObject (value), whose rules are:
+
+   undefined   generate a runtime error
+   null        generate a runtime error
+   boolean     create a new Boolean object whose default
+   value is the value of the boolean.
+   number      Create a new Number object whose default
+   value is the value of the number.
+   string      Create a new String object whose default
+   value is the value of the string.
+   object      Return the input argument (no conversion).
+
+   Author:             christine@netscape.com
+   Date:               17 july 1997
+*/
+
+var SECTION = "15.2.1.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Object( value )";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var NULL_OBJECT = Object(null);
+
+new TestCase( SECTION, "Object(null).valueOf()",    NULL_OBJECT,           (NULL_OBJECT).valueOf() );
+new TestCase( SECTION, "typeof Object(null)",       "object",               typeof (Object(null)) );
+
+var UNDEFINED_OBJECT = Object( void 0 );
+
+new TestCase( SECTION, "Object(void 0).valueOf()",    UNDEFINED_OBJECT,           (UNDEFINED_OBJECT).valueOf() );
+new TestCase( SECTION, "typeof Object(void 0)",       "object",               typeof (Object(void 0)) );
+
+new TestCase( SECTION, "Object(true).valueOf()",    true,                   (Object(true)).valueOf() );
+new TestCase( SECTION, "typeof Object(true)",       "object",               typeof Object(true) );
+new TestCase( SECTION, "var MYOB = Object(true); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Boolean]",      eval("var MYOB = Object(true); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object(false).valueOf()",    false,                  (Object(false)).valueOf() );
+new TestCase( SECTION, "typeof Object(false)",      "object",               typeof Object(false) );
+new TestCase( SECTION, "var MYOB = Object(false); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Boolean]",      eval("var MYOB = Object(false); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object(0).valueOf()",       0,                      (Object(0)).valueOf() );
+new TestCase( SECTION, "typeof Object(0)",          "object",               typeof Object(0) );
+new TestCase( SECTION, "var MYOB = Object(0); MYOB.toString = Object.prototype.toString; MYOB.toString()",      "[object Number]",      eval("var MYOB = Object(0); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object(-0).valueOf()",      -0,                     (Object(-0)).valueOf() );
+new TestCase( SECTION, "typeof Object(-0)",         "object",               typeof Object(-0) );
+new TestCase( SECTION, "var MYOB = Object(-0); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object Number]",      eval("var MYOB = Object(-0); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object(1).valueOf()",       1,                      (Object(1)).valueOf() );
+new TestCase( SECTION, "typeof Object(1)",          "object",               typeof Object(1) );
+new TestCase( SECTION, "var MYOB = Object(1); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object Number]",      eval("var MYOB = Object(1); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object(-1).valueOf()",      -1,                     (Object(-1)).valueOf() );
+new TestCase( SECTION, "typeof Object(-1)",         "object",               typeof Object(-1) );
+new TestCase( SECTION, "var MYOB = Object(-1); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object Number]",      eval("var MYOB = Object(-1); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object(Number.MAX_VALUE).valueOf()",    1.7976931348623157e308,         (Object(Number.MAX_VALUE)).valueOf() );
+new TestCase( SECTION, "typeof Object(Number.MAX_VALUE)",       "object",                       typeof Object(Number.MAX_VALUE) );
+new TestCase( SECTION, "var MYOB = Object(Number.MAX_VALUE); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object Number]",      eval("var MYOB = Object(Number.MAX_VALUE); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object(Number.MIN_VALUE).valueOf()",     5e-324,           (Object(Number.MIN_VALUE)).valueOf() );
+new TestCase( SECTION, "typeof Object(Number.MIN_VALUE)",       "object",         typeof Object(Number.MIN_VALUE) );
+new TestCase( SECTION, "var MYOB = Object(Number.MIN_VALUE); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object Number]",      eval("var MYOB = Object(Number.MIN_VALUE); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object(Number.POSITIVE_INFINITY).valueOf()",    Number.POSITIVE_INFINITY,       (Object(Number.POSITIVE_INFINITY)).valueOf() );
+new TestCase( SECTION, "typeof Object(Number.POSITIVE_INFINITY)",       "object",                       typeof Object(Number.POSITIVE_INFINITY) );
+new TestCase( SECTION, "var MYOB = Object(Number.POSITIVE_INFINITY); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object Number]",      eval("var MYOB = Object(Number.POSITIVE_INFINITY); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object(Number.NEGATIVE_INFINITY).valueOf()",    Number.NEGATIVE_INFINITY,       (Object(Number.NEGATIVE_INFINITY)).valueOf() );
+new TestCase( SECTION, "typeof Object(Number.NEGATIVE_INFINITY)",       "object",            typeof Object(Number.NEGATIVE_INFINITY) );
+new TestCase( SECTION, "var MYOB = Object(Number.NEGATIVE_INFINITY); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object Number]",      eval("var MYOB = Object(Number.NEGATIVE_INFINITY); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object(Number.NaN).valueOf()",      Number.NaN,                (Object(Number.NaN)).valueOf() );
+new TestCase( SECTION, "typeof Object(Number.NaN)",         "object",                  typeof Object(Number.NaN) );
+new TestCase( SECTION, "var MYOB = Object(Number.NaN); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object Number]",      eval("var MYOB = Object(Number.NaN); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object('a string').valueOf()",      "a string",         (Object("a string")).valueOf() );
+new TestCase( SECTION, "typeof Object('a string')",         "object",           typeof (Object("a string")) );
+new TestCase( SECTION, "var MYOB = Object('a string'); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object String]",      eval("var MYOB = Object('a string'); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object('').valueOf()",              "",                 (Object("")).valueOf() );
+new TestCase( SECTION, "typeof Object('')",                 "object",           typeof (Object("")) );
+new TestCase( SECTION, "var MYOB = Object(''); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object String]",      eval("var MYOB = Object(''); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION, "Object('\\r\\t\\b\\n\\v\\f').valueOf()",   "\r\t\b\n\v\f",   (Object("\r\t\b\n\v\f")).valueOf() );
+new TestCase( SECTION, "typeof Object('\\r\\t\\b\\n\\v\\f')",      "object",           typeof (Object("\\r\\t\\b\\n\\v\\f")) );
+new TestCase( SECTION, "var MYOB = Object('\\r\\t\\b\\n\\v\\f'); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object String]",      eval("var MYOB = Object('\\r\\t\\b\\n\\v\\f'); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION,  "Object( '\\\'\\\"\\' ).valueOf()",      "\'\"\\",          (Object("\'\"\\")).valueOf() );
+new TestCase( SECTION,  "typeof Object( '\\\'\\\"\\' )",        "object",           typeof Object("\'\"\\") );
+//    new TestCase( SECTION, "var MYOB = Object(  '\\\'\\\"\\' ); MYOB.toString = Object.prototype.toString; MYOB.toString()",     "[object String]",      eval("var MYOB = Object( '\\\'\\\"\\' ); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.1.2.js b/js/src/tests/ecma/ObjectObjects/15.2.1.2.js
new file mode 100644
index 000000000..2cbbe06d7
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.1.2.js
@@ -0,0 +1,47 @@
+/* -*- 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:          15.2.1.2.js
+   ECMA Section:       15.2.1.2  The Object Constructor Called as a Function:
+   Object(value)
+   Description:        When Object is called as a function rather than as a
+   constructor, the following steps are taken:
+
+   1.  If value is null or undefined, create and return a
+   new object with no proerties other than internal
+   properties exactly as if the object constructor
+   had been called on that same value (15.2.2.1).
+   2.  Return ToObject (value), whose rules are:
+
+   undefined   generate a runtime error
+   null        generate a runtime error
+   boolean     create a new Boolean object whose default
+   value is the value of the boolean.
+   number      Create a new Number object whose default
+   value is the value of the number.
+   string      Create a new String object whose default
+   value is the value of the string.
+   object      Return the input argument (no conversion).
+
+   Author:             christine@netscape.com
+   Date:               17 july 1997
+*/
+
+var SECTION = "15.2.1.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Object()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var MYOB = Object();
+
+new TestCase( SECTION, "var MYOB = Object(); MYOB.valueOf()",    MYOB,      MYOB.valueOf()      );
+new TestCase( SECTION, "typeof Object()",       "object",               typeof (Object(null)) );
+new TestCase( SECTION, "var MYOB = Object(); MYOB.toString()",    "[object Object]",       eval("var MYOB = Object(); MYOB.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.2.1.js b/js/src/tests/ecma/ObjectObjects/15.2.2.1.js
new file mode 100644
index 000000000..f9d15c9e0
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.2.1.js
@@ -0,0 +1,104 @@
+/* -*- 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:          15.2.2.1.js
+   ECMA Section:       15.2.2.1 The Object Constructor:  new Object( value )
+
+   1.If the type of the value is not Object, go to step 4.
+   2.If the value is a native ECMAScript object, do not create a new object; simply return value.
+   3.If the value is a host object, then actions are taken and a result is returned in an
+   implementation-dependent manner that may depend on the host object.
+   4.If the type of the value is String, return ToObject(value).
+   5.If the type of the value is Boolean, return ToObject(value).
+   6.If the type of the value is Number, return ToObject(value).
+   7.(The type of the value must be Null or Undefined.) Create a new native ECMAScript object.
+   The [[Prototype]] property of the newly constructed object is set to the Object prototype object.
+   The [[Class]] property of the newly constructed object is set to "Object".
+   The newly constructed object has no [[Value]] property.
+   Return the newly created native object.
+
+   Description:        This does not test cases where the object is a host object.
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.2.2.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "new Object( value )";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION,  "typeof new Object(null)",      "object",           typeof new Object(null) );
+new TestCase( SECTION,  "MYOB = new Object(null); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Object]",   eval("MYOB = new Object(null); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION,  "typeof new Object(void 0)",      "object",           typeof new Object(void 0) );
+new TestCase( SECTION,  "MYOB = new Object(new Object(void 0)); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Object]",   eval("MYOB = new Object(new Object(void 0)); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+
+new TestCase( SECTION,  "typeof new Object('string')",      "object",           typeof new Object('string') );
+new TestCase( SECTION,  "MYOB = (new Object('string'); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object String]",   eval("MYOB = new Object('string'); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+new TestCase( SECTION,  "(new Object('string').valueOf()",  "string",           (new Object('string')).valueOf() );
+
+new TestCase( SECTION,  "typeof new Object('')",            "object",           typeof new Object('') );
+new TestCase( SECTION,  "MYOB = (new Object(''); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object String]",   eval("MYOB = new Object(''); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+new TestCase( SECTION,  "(new Object('').valueOf()",        "",                 (new Object('')).valueOf() );
+
+new TestCase( SECTION,  "typeof new Object(Number.NaN)",      "object",                 typeof new Object(Number.NaN) );
+new TestCase( SECTION,  "MYOB = (new Object(Number.NaN); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Number]",   eval("MYOB = new Object(Number.NaN); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+new TestCase( SECTION,  "(new Object(Number.NaN).valueOf()",  Number.NaN,               (new Object(Number.NaN)).valueOf() );
+
+new TestCase( SECTION,  "typeof new Object(0)",      "object",                 typeof new Object(0) );
+new TestCase( SECTION,  "MYOB = (new Object(0); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Number]",   eval("MYOB = new Object(0); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+new TestCase( SECTION,  "(new Object(0).valueOf()",  0,               (new Object(0)).valueOf() );
+
+new TestCase( SECTION,  "typeof new Object(-0)",      "object",                 typeof new Object(-0) );
+new TestCase( SECTION,  "MYOB = (new Object(-0); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Number]",   eval("MYOB = new Object(-0); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+new TestCase( SECTION,  "(new Object(-0).valueOf()",  -0,               (new Object(-0)).valueOf() );
+
+new TestCase( SECTION,  "typeof new Object(1)",      "object",                 typeof new Object(1) );
+new TestCase( SECTION,  "MYOB = (new Object(1); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Number]",   eval("MYOB = new Object(1); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+new TestCase( SECTION,  "(new Object(1).valueOf()",  1,               (new Object(1)).valueOf() );
+
+new TestCase( SECTION,  "typeof new Object(-1)",      "object",                 typeof new Object(-1) );
+new TestCase( SECTION,  "MYOB = (new Object(-1); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Number]",   eval("MYOB = new Object(-1); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+new TestCase( SECTION,  "(new Object(-1).valueOf()",  -1,               (new Object(-1)).valueOf() );
+
+new TestCase( SECTION,  "typeof new Object(true)",      "object",                 typeof new Object(true) );
+new TestCase( SECTION,  "MYOB = (new Object(true); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Boolean]",   eval("MYOB = new Object(true); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+new TestCase( SECTION,  "(new Object(true).valueOf()",  true,               (new Object(true)).valueOf() );
+
+new TestCase( SECTION,  "typeof new Object(false)",      "object",              typeof new Object(false) );
+new TestCase( SECTION,  "MYOB = (new Object(false); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Boolean]",   eval("MYOB = new Object(false); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+new TestCase( SECTION,  "(new Object(false).valueOf()",  false,                 (new Object(false)).valueOf() );
+
+new TestCase( SECTION,  "typeof new Object(Boolean())",         "object",               typeof new Object(Boolean()) );
+new TestCase( SECTION,  "MYOB = (new Object(Boolean()); MYOB.toString = Object.prototype.toString; MYOB.toString()",  "[object Boolean]",   eval("MYOB = new Object(Boolean()); MYOB.toString = Object.prototype.toString; MYOB.toString()") );
+new TestCase( SECTION,  "(new Object(Boolean()).valueOf()",     Boolean(),              (new Object(Boolean())).valueOf() );
+
+
+var myglobal    = this;
+var myobject    = new Object( "my new object" );
+var myarray     = new Array();
+var myboolean   = new Boolean();
+var mynumber    = new Number();
+var mystring    = new String();
+var myobject    = new Object();
+var myfunction  = new Function( "x", "return x");
+var mymath      = Math;
+
+new TestCase( SECTION, "myglobal = new Object( this )",                     myglobal,       new Object(this) );
+new TestCase( SECTION, "myobject = new Object('my new object'); new Object(myobject)",            myobject,       new Object(myobject) );
+new TestCase( SECTION, "myarray = new Array(); new Object(myarray)",        myarray,        new Object(myarray) );
+new TestCase( SECTION, "myboolean = new Boolean(); new Object(myboolean)",  myboolean,      new Object(myboolean) );
+new TestCase( SECTION, "mynumber = new Number(); new Object(mynumber)",     mynumber,       new Object(mynumber) );
+new TestCase( SECTION, "mystring = new String9); new Object(mystring)",     mystring,       new Object(mystring) );
+new TestCase( SECTION, "myobject = new Object(); new Object(mynobject)",    myobject,       new Object(myobject) );
+new TestCase( SECTION, "myfunction = new Function(); new Object(myfunction)", myfunction,   new Object(myfunction) );
+new TestCase( SECTION, "mymath = Math; new Object(mymath)",                 mymath,         new Object(mymath) );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.2.2.js b/js/src/tests/ecma/ObjectObjects/15.2.2.2.js
new file mode 100644
index 000000000..f93895e7b
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.2.2.js
@@ -0,0 +1,40 @@
+/* -*- 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:          15.2.2.2.js
+   ECMA Section:       15.2.2.2 new Object()
+   Description:
+
+   When the Object constructor is called with no argument, the following
+   step is taken:
+
+   1.  Create a new native ECMAScript object.
+   The [[Prototype]] property of the newly constructed object is set to
+   the Object prototype object.
+
+   The [[Class]] property of the newly constructed object is set
+   to "Object".
+
+   The newly constructed object has no [[Value]] property.
+
+   Return the newly created native object.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+var SECTION = "15.2.2.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "new Object()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "typeof new Object()",   "object",       typeof new Object() );
+new TestCase( SECTION, "Object.prototype.toString()",   "[object Object]",  Object.prototype.toString() );
+new TestCase( SECTION, "(new Object()).toString()",  "[object Object]",   (new Object()).toString() );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.3-1.js b/js/src/tests/ecma/ObjectObjects/15.2.3-1.js
new file mode 100644
index 000000000..1e48b82b8
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.3-1.js
@@ -0,0 +1,30 @@
+/* -*- 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:          15.2.3-1.js
+   ECMA Section:       15.2.3 Properties of the Object Constructor
+
+   Description:        The value of the internal [[Prototype]] property of the
+   Object constructor is the Function prototype object.
+
+   Besides the call and construct propreties and the length
+   property, the Object constructor has properties described
+   in 15.2.3.1.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.2.3";
+var VERSION = "ECMA_2";
+startTest();
+
+writeHeaderToLog( SECTION + " Properties of the Object Constructor");
+
+new TestCase( SECTION,  "Object.length",        1,                      Object.length );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.3.1-1.js b/js/src/tests/ecma/ObjectObjects/15.2.3.1-1.js
new file mode 100644
index 000000000..8742b37e4
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.3.1-1.js
@@ -0,0 +1,35 @@
+/* -*- tab-width: 2; 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:          15.2.3.1-1.js
+   ECMA Section:       15.2.3.1 Object.prototype
+
+   Description:        The initial value of Object.prototype is the built-in
+   Object prototype object.
+
+   This property shall have the attributes [ DontEnum,
+   DontDelete ReadOnly ]
+
+   This tests the [DontEnum] property of Object.prototype
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.2.3.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Object.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, 
+	      "var str = '';for ( p in Object ) { str += p; }; str",
+	      "",
+	      eval( "var str = ''; for ( p in Object ) { str += p; }; str" ) );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.3.1-2.js b/js/src/tests/ecma/ObjectObjects/15.2.3.1-2.js
new file mode 100644
index 000000000..8dae5f2fd
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.3.1-2.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.2.3.1-2.js
+   ECMA Section:       15.2.3.1 Object.prototype
+
+   Description:        The initial value of Object.prototype is the built-in
+   Object prototype object.
+
+   This property shall have the attributes [ DontEnum,
+   DontDelete ReadOnly ]
+
+   This tests the [DontDelete] property of Object.prototype
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.2.3.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Object.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, 
+	      "delete( Object.prototype )",
+	      false,
+	      eval("delete( Object.prototype )") );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.3.1-3.js b/js/src/tests/ecma/ObjectObjects/15.2.3.1-3.js
new file mode 100644
index 000000000..609f49d3d
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.3.1-3.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.2.3.1-3.js
+   ECMA Section:       15.2.3.1 Object.prototype
+
+   Description:        The initial value of Object.prototype is the built-in
+   Object prototype object.
+
+   This property shall have the attributes [ DontEnum,
+   DontDelete ReadOnly ]
+
+   This tests the [ReadOnly] property of Object.prototype
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.2.3.1-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Object.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, 
+	      "Object.prototype = null; Object.prototype",
+	      Object.prototype,
+	      eval("Object.prototype = null; Object.prototype"));
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.3.1-4.js b/js/src/tests/ecma/ObjectObjects/15.2.3.1-4.js
new file mode 100644
index 000000000..6c0320642
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.3.1-4.js
@@ -0,0 +1,36 @@
+/* -*- tab-width: 2; 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:          15.2.3.1-4.js
+   ECMA Section:       15.2.3.1 Object.prototype
+
+   Description:        The initial value of Object.prototype is the built-in
+   Object prototype object.
+
+   This property shall have the attributes [ DontEnum,
+   DontDelete ReadOnly ]
+
+   This tests the [DontDelete] property of Object.prototype
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.2.3.1-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Object.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, 
+	      "delete( Object.prototype ); Object.prototype",
+	      Object.prototype,
+	      eval("delete(Object.prototype); Object.prototype") );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.3.js b/js/src/tests/ecma/ObjectObjects/15.2.3.js
new file mode 100644
index 000000000..2dcd9dfb9
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.3.js
@@ -0,0 +1,33 @@
+/* -*- 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:          15.2.3.js
+   ECMA Section:       15.2.3 Properties of the Object Constructor
+
+   Description:        The value of the internal [[Prototype]] property of the
+   Object constructor is the Function prototype object.
+
+   Besides the call and construct propreties and the length
+   property, the Object constructor has properties described
+   in 15.2.3.1.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.2.3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the Object Constructor";
+
+writeHeaderToLog( SECTION + " " + TITLE);
+
+//    new TestCase( SECTION,  "Object.__proto__",     Function.prototype,     Object.__proto__ );
+new TestCase( SECTION,  "Object.length",        1,                      Object.length );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.4.1.js b/js/src/tests/ecma/ObjectObjects/15.2.4.1.js
new file mode 100644
index 000000000..1fda30d39
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.4.1.js
@@ -0,0 +1,30 @@
+/* -*- tab-width: 2; 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:          15.2.4.1.js
+   ECMA Section:       15.2.4 Object.prototype.constructor
+
+   Description:        The initial value of the Object.prototype.constructor
+   is the built-in Object constructor.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.2.4.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Object.prototype.constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, 
+	      "Object.prototype.constructor",
+	      Object,
+	      Object.prototype.constructor );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.4.2.js b/js/src/tests/ecma/ObjectObjects/15.2.4.2.js
new file mode 100644
index 000000000..eb461f7ea
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.4.2.js
@@ -0,0 +1,96 @@
+/* -*- tab-width: 2; 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:          15.2.4.2.js
+   ECMA Section:       15.2.4.2 Object.prototype.toString()
+
+   Description:        When the toString method is called, the following
+   steps are taken:
+   1.  Get the [[Class]] property of this object
+   2.  Call ToString( Result(1) )
+   3.  Compute a string value by concatenating the three
+   strings "[object " + Result(2) + "]"
+   4.  Return Result(3).
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.2.4.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Object.prototype.toString()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,  "(new Object()).toString()",    "[object Object]",  (new Object()).toString() );
+
+new TestCase( SECTION,  "myvar = this;  myvar.toString = Object.prototype.toString; myvar.toString()",
+	      GLOBAL.replace(/ @ 0x[0-9a-fA-F]+ \(native @ 0x[0-9a-fA-F]+\)/, ''),
+	      eval("myvar = this;  myvar.toString = Object.prototype.toString; myvar.toString()")
+  );
+
+new TestCase( SECTION,  "myvar = MyObject; myvar.toString = Object.prototype.toString; myvar.toString()",
+	      "[object Function]",
+	      eval("myvar = MyObject; myvar.toString = Object.prototype.toString; myvar.toString()") );
+
+new TestCase( SECTION,  "myvar = new MyObject( true ); myvar.toString = Object.prototype.toString; myvar.toString()",
+	      '[object Object]',
+	      eval("myvar = new MyObject( true ); myvar.toString = Object.prototype.toString; myvar.toString()") );
+
+new TestCase( SECTION,  "myvar = new Number(0); myvar.toString = Object.prototype.toString; myvar.toString()",
+	      "[object Number]",
+	      eval("myvar = new Number(0); myvar.toString = Object.prototype.toString; myvar.toString()") );
+
+new TestCase( SECTION,  "myvar = new String(''); myvar.toString = Object.prototype.toString; myvar.toString()",
+	      "[object String]",
+	      eval("myvar = new String(''); myvar.toString = Object.prototype.toString; myvar.toString()") );
+
+new TestCase( SECTION,  "myvar = Math; myvar.toString = Object.prototype.toString; myvar.toString()",
+	      "[object Math]",
+	      eval("myvar = Math; myvar.toString = Object.prototype.toString; myvar.toString()") );
+
+new TestCase( SECTION,  "myvar = new Function(); myvar.toString = Object.prototype.toString; myvar.toString()",
+	      "[object Function]",
+	      eval("myvar = new Function(); myvar.toString = Object.prototype.toString; myvar.toString()") );
+
+new TestCase( SECTION,  "myvar = new Array(); myvar.toString = Object.prototype.toString; myvar.toString()",
+	      "[object Array]",
+	      eval("myvar = new Array(); myvar.toString = Object.prototype.toString; myvar.toString()") );
+
+new TestCase( SECTION,  "myvar = new Boolean(); myvar.toString = Object.prototype.toString; myvar.toString()",
+	      "[object Boolean]",
+	      eval("myvar = new Boolean(); myvar.toString = Object.prototype.toString; myvar.toString()") );
+
+new TestCase( SECTION,  "myvar = new Date(); myvar.toString = Object.prototype.toString; myvar.toString()",
+	      "[object Date]",
+	      eval("myvar = new Date(); myvar.toString = Object.prototype.toString; myvar.toString()") );
+
+new TestCase( SECTION,  "var MYVAR = new Object( this ); MYVAR.toString()",
+	      GLOBAL.replace(/ @ 0x[0-9a-fA-F]+ \(native @ 0x[0-9a-fA-F]+\)/, ''),
+	      eval("var MYVAR = new Object( this ); MYVAR.toString()")
+  );
+
+new TestCase( SECTION,  "var MYVAR = new Object(); MYVAR.toString()",
+	      "[object Object]",
+	      eval("var MYVAR = new Object(); MYVAR.toString()") );
+
+new TestCase( SECTION,  "var MYVAR = new Object(void 0); MYVAR.toString()",
+	      "[object Object]",
+	      eval("var MYVAR = new Object(void 0); MYVAR.toString()") );
+
+new TestCase( SECTION,  "var MYVAR = new Object(null); MYVAR.toString()",
+	      "[object Object]",
+	      eval("var MYVAR = new Object(null); MYVAR.toString()") );
+
+
+function MyObject( value ) {
+  this.value = new Function( "return this.value" );
+  this.toString = new Function ( "return this.value+''");
+}
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/15.2.4.3.js b/js/src/tests/ecma/ObjectObjects/15.2.4.3.js
new file mode 100644
index 000000000..6842a6f1a
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/15.2.4.3.js
@@ -0,0 +1,83 @@
+/* -*- tab-width: 2; 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:          15.2.4.3.js
+   ECMA Section:       15.2.4.3 Object.prototype.valueOf()
+
+   Description:        As a rule, the valueOf method for an object simply
+   returns the object; but if the object is a "wrapper"
+   for a host object, as may perhaps be created by the
+   Object constructor, then the contained host object
+   should be returned.
+
+   This only covers native objects.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.2.4.3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Object.prototype.valueOf()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var myarray = new Array();
+myarray.valueOf = Object.prototype.valueOf;
+var myboolean = new Boolean();
+myboolean.valueOf = Object.prototype.valueOf;
+var myfunction = new Function();
+myfunction.valueOf = Object.prototype.valueOf;
+var myobject = new Object();
+myobject.valueOf = Object.prototype.valueOf;
+var mymath = Math;
+mymath.valueOf = Object.prototype.valueOf;
+var mydate = new Date();
+mydate.valueOf = Object.prototype.valueOf;
+var mynumber = new Number();
+mynumber.valueOf = Object.prototype.valueOf;
+var mystring = new String();
+mystring.valueOf = Object.prototype.valueOf;
+
+new TestCase( SECTION,  "Object.prototype.valueOf.length",      0,      Object.prototype.valueOf.length );
+
+new TestCase( SECTION,
+	      "myarray = new Array(); myarray.valueOf = Object.prototype.valueOf; myarray.valueOf()",
+	      myarray,
+	      myarray.valueOf() );
+new TestCase( SECTION,
+	      "myboolean = new Boolean(); myboolean.valueOf = Object.prototype.valueOf; myboolean.valueOf()",
+	      myboolean,
+	      myboolean.valueOf() );
+new TestCase( SECTION,
+	      "myfunction = new Function(); myfunction.valueOf = Object.prototype.valueOf; myfunction.valueOf()",
+	      myfunction,
+	      myfunction.valueOf() );
+new TestCase( SECTION,
+	      "myobject = new Object(); myobject.valueOf = Object.prototype.valueOf; myobject.valueOf()",
+	      myobject,
+	      myobject.valueOf() );
+new TestCase( SECTION,
+	      "mymath = Math; mymath.valueOf = Object.prototype.valueOf; mymath.valueOf()",
+	      mymath,
+	      mymath.valueOf() );
+new TestCase( SECTION,
+	      "mynumber = new Number(); mynumber.valueOf = Object.prototype.valueOf; mynumber.valueOf()",
+	      mynumber,
+	      mynumber.valueOf() );
+new TestCase( SECTION,
+	      "mystring = new String(); mystring.valueOf = Object.prototype.valueOf; mystring.valueOf()",
+	      mystring,
+	      mystring.valueOf() );
+new TestCase( SECTION,
+	      "mydate = new Date(); mydate.valueOf = Object.prototype.valueOf; mydate.valueOf()",
+	      mydate,
+	      mydate.valueOf() );
+
+test();
diff --git a/js/src/tests/ecma/ObjectObjects/browser.js b/js/src/tests/ecma/ObjectObjects/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/browser.js
diff --git a/js/src/tests/ecma/ObjectObjects/shell.js b/js/src/tests/ecma/ObjectObjects/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/ObjectObjects/shell.js
diff --git a/js/src/tests/ecma/README b/js/src/tests/ecma/README
new file mode 100644
index 000000000..91f174ab6
--- /dev/null
+++ b/js/src/tests/ecma/README
@@ -0,0 +1 @@
+ECMA 262 Edition 1
diff --git a/js/src/tests/ecma/SourceText/6-1.js b/js/src/tests/ecma/SourceText/6-1.js
new file mode 100644
index 000000000..d618e7daa
--- /dev/null
+++ b/js/src/tests/ecma/SourceText/6-1.js
@@ -0,0 +1,94 @@
+/* -*- tab-width: 2; 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:          6-1.js
+   ECMA Section:       Source Text
+   Description:
+
+   ECMAScript source text is represented as a sequence of characters
+   representable using the Unicode version 2.0 character encoding.
+
+   SourceCharacter ::
+   any Unicode character
+
+   However, it is possible to represent every ECMAScript program using
+   only ASCII characters (which are equivalent to the first 128 Unicode
+   characters). Non-ASCII Unicode characters may appear only within comments
+   and string literals. In string literals, any Unicode character may also be
+   expressed as a Unicode escape sequence consisting of six ASCII characters,
+   namely \u plus four hexadecimal digits. Within a comment, such an escape
+   sequence is effectively ignored as part of the comment. Within a string
+   literal, the Unicode escape sequence contributes one character to the string
+   value of the literal.
+
+   Note that ECMAScript differs from the Java programming language in the
+   behavior of Unicode escape sequences. In a Java program, if the Unicode escape
+   sequence \u000A, for example, occurs within a single-line comment, it is
+   interpreted as a line terminator (Unicode character 000A is line feed) and
+   therefore the next character is not part of the comment. Similarly, if the
+   Unicode escape sequence \u000A occurs within a string literal in a Java
+   program, it is likewise interpreted as a line terminator, which is not
+   allowed within a string literal-one must write \n instead of \u000A to
+   cause a line feed to be part of the string value of a string literal. In
+   an ECMAScript program, a Unicode escape sequence occurring within a comment
+   is never interpreted and therefore cannot contribute to termination of the
+   comment. Similarly, a Unicode escape sequence occurring within a string literal
+   in an ECMAScript program always contributes a character to the string value of
+   the literal and is never interpreted as a line terminator or as a quote mark
+   that might terminate the string literal.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "6-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Source Text";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var testcase = new TestCase( SECTION,
+			     "// the following character should not be interpreted as a line terminator in a comment: \u000A",
+			     'PASSED',
+			     "PASSED" );
+
+// \u000A testcase.actual = "FAILED!";
+
+testcase =
+  new TestCase( SECTION,
+		"// the following character should not be interpreted as a line terminator in a comment: \\n 'FAILED'",
+		'PASSED',
+		'PASSED' );
+
+// the following character should noy be interpreted as a line terminator: \\n testcase.actual = "FAILED"
+
+testcase =
+  new TestCase( SECTION,
+		"// the following character should not be interpreted as a line terminator in a comment: \\u000A 'FAILED'",
+		'PASSED',
+		'PASSED' );
+
+// the following character should not be interpreted as a line terminator:   \u000A testcase.actual = "FAILED"
+
+testcase =
+  new TestCase( SECTION,
+		"// the following character should not be interpreted as a line terminator in a comment: \n 'PASSED'",
+		'PASSED',
+		'PASSED' );
+// the following character should not be interpreted as a line terminator: \n testcase.actual = 'FAILED'
+
+testcase =
+  new TestCase(   SECTION,
+		  "// the following character should not be interpreted as a line terminator in a comment: u000D",
+		  'PASSED',
+		  'PASSED' );
+
+// the following character should not be interpreted as a line terminator:   \u000D testcase.actual = "FAILED"
+
+test();
+
diff --git a/js/src/tests/ecma/SourceText/6-2.js b/js/src/tests/ecma/SourceText/6-2.js
new file mode 100644
index 000000000..d7bb09077
--- /dev/null
+++ b/js/src/tests/ecma/SourceText/6-2.js
@@ -0,0 +1,97 @@
+/* -*- tab-width: 2; 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:          6-1.js
+   ECMA Section:       Source Text
+   Description:
+
+   ECMAScript source text is represented as a sequence of characters
+   representable using the Unicode version 2.0 character encoding.
+
+   SourceCharacter ::
+   any Unicode character
+
+   However, it is possible to represent every ECMAScript program using
+   only ASCII characters (which are equivalent to the first 128 Unicode
+   characters). Non-ASCII Unicode characters may appear only within comments
+   and string literals. In string literals, any Unicode character may also be
+   expressed as a Unicode escape sequence consisting of six ASCII characters,
+   namely \u plus four hexadecimal digits. Within a comment, such an escape
+   sequence is effectively ignored as part of the comment. Within a string
+   literal, the Unicode escape sequence contributes one character to the string
+   value of the literal.
+
+   Note that ECMAScript differs from the Java programming language in the
+   behavior of Unicode escape sequences. In a Java program, if the Unicode escape
+   sequence \u000A, for example, occurs within a single-line comment, it is
+   interpreted as a line terminator (Unicode character 000A is line feed) and
+   therefore the next character is not part of the comment. Similarly, if the
+   Unicode escape sequence \u000A occurs within a string literal in a Java
+   program, it is likewise interpreted as a line terminator, which is not
+   allowed within a string literal-one must write \n instead of \u000A to
+   cause a line feed to be part of the string value of a string literal. In
+   an ECMAScript program, a Unicode escape sequence occurring within a comment
+   is never interpreted and therefore cannot contribute to termination of the
+   comment. Similarly, a Unicode escape sequence occurring within a string literal
+   in an ECMAScript program always contributes a character to the string value of
+   the literal and is never interpreted as a line terminator or as a quote mark
+   that might terminate the string literal.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "6-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Source Text";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// encoded quotes should not end a quote
+
+new TestCase(  SECTION,
+	       "var s = 'PAS\\u0022SED'; s",
+	       "PAS\"SED",
+	       eval("var s = 'PAS\\u0022SED'; s") );
+
+new TestCase(  SECTION,
+	       'var s = "PAS\\u0022SED"; s',
+	       "PAS\"SED",
+	       eval('var s = "PAS\\u0022SED"; s') );
+
+
+new TestCase(  SECTION,
+	       "var s = 'PAS\\u0027SED'; s",
+	       "PAS\'SED",
+	       eval("var s = 'PAS\\u0027SED'; s") );
+
+
+new TestCase(  SECTION,
+	       'var s = "PAS\\u0027SED"; s',
+	       "PAS\'SED",
+	       eval('var s = "PAS\\u0027SED"; s') );
+
+var testcase =  new TestCase( SECTION,
+			      'var s="PAS\\u0027SED"; s',
+			      "PAS\'SED",
+			      "" );
+var s = "PAS\u0027SED";
+
+testcase.actual =  s;
+
+testcase = new TestCase(  SECTION,
+			  'var s = "PAS\\u0022SED"; s',
+			  "PAS\"SED",
+			  "" );
+var s = "PAS\u0022SED";
+
+testcase.actual = s;
+
+
+test();
+
diff --git a/js/src/tests/ecma/SourceText/browser.js b/js/src/tests/ecma/SourceText/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/SourceText/browser.js
diff --git a/js/src/tests/ecma/SourceText/shell.js b/js/src/tests/ecma/SourceText/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/SourceText/shell.js
diff --git a/js/src/tests/ecma/Statements/12.10-1.js b/js/src/tests/ecma/Statements/12.10-1.js
new file mode 100644
index 000000000..8e4f67c87
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.10-1.js
@@ -0,0 +1,117 @@
+/* -*- tab-width: 2; 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:          12.10-1.js
+   ECMA Section:       12.10 The with statement
+   Description:
+   WithStatement :
+   with ( Expression ) Statement
+
+   The with statement adds a computed object to the front of the scope chain
+   of the current execution context, then executes a statement with this
+   augmented scope chain, then restores the scope chain.
+
+   Semantics
+
+   The production WithStatement : with ( Expression ) Statement is evaluated
+   as follows:
+   1.  Evaluate Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Add Result(3) to the front of the scope chain.
+   5.  Evaluate Statement using the augmented scope chain from step 4.
+   6.  Remove Result(3) from the front of the scope chain.
+   7.  Return Result(5).
+
+   Discussion
+   Note that no matter how control leaves the embedded Statement, whether
+   normally or by some form of abrupt completion, the scope chain is always
+   restored to its former state.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "12.10-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The with statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+// although the scope chain changes, the this value is immutable for a given
+// execution context.
+
+new TestCase( SECTION,
+	      "with( new Number() ) { this +'' }",
+	      GLOBAL,
+	      eval("with( new Number() ) { this +'' }") );
+
+// the object's functions and properties should override those of the
+// global object.
+
+new TestCase(
+  SECTION,
+  "var MYOB = new WithObject(true); with (MYOB) { parseInt() }",
+  true,
+  eval("var MYOB = new WithObject(true); with (MYOB) { parseInt() }") );
+
+new TestCase(
+  SECTION,
+  "var MYOB = new WithObject(false); with (MYOB) { NaN }",
+  false,
+  eval("var MYOB = new WithObject(false); with (MYOB) { NaN }") );
+
+new TestCase(
+  SECTION,
+  "var MYOB = new WithObject(NaN); with (MYOB) { Infinity }",
+  Number.NaN,
+  eval("var MYOB = new WithObject(NaN); with (MYOB) { Infinity }") );
+
+new TestCase(
+  SECTION,
+  "var MYOB = new WithObject(false); with (MYOB) { }; Infinity",
+  Number.POSITIVE_INFINITY,
+  eval("var MYOB = new WithObject(false); with (MYOB) { }; Infinity") );
+
+
+new TestCase(
+  SECTION,
+  "var MYOB = new WithObject(0); with (MYOB) { delete Infinity; Infinity }",
+  Number.POSITIVE_INFINITY,
+  eval("var MYOB = new WithObject(0); with (MYOB) { delete Infinity; Infinity }") );
+
+// let us leave the with block via a break.
+
+new TestCase(
+  SECTION,
+  "var MYOB = new WithObject(0); while (true) { with (MYOB) { Infinity; break; } } Infinity",
+  Number.POSITIVE_INFINITY,
+  eval("var MYOB = new WithObject(0); while (true) { with (MYOB) { Infinity; break; } } Infinity") );
+
+
+test();
+
+function WithObject( value ) {
+  this.prop1 = 1;
+  this.prop2 = new Boolean(true);
+  this.prop3 = "a string";
+  this.value = value;
+
+  // now we will override global functions
+
+  this.parseInt = new Function( "return this.value" );
+  this.NaN = value;
+  this.Infinity = value;
+  this.unescape = new Function( "return this.value" );
+  this.escape   = new Function( "return this.value" );
+  this.eval     = new Function( "return this.value" );
+  this.parseFloat = new Function( "return this.value" );
+  this.isNaN      = new Function( "return this.value" );
+  this.isFinite   = new Function( "return this.value" );
+}
diff --git a/js/src/tests/ecma/Statements/12.10.js b/js/src/tests/ecma/Statements/12.10.js
new file mode 100644
index 000000000..906430924
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.10.js
@@ -0,0 +1,27 @@
+/* -*- tab-width: 2; 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:          12.10-1.js
+   ECMA Section:       12.10 The with statement
+   Description:
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.10-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The with statement";
+
+writeHeaderToLog( SECTION +" "+ TITLE);
+
+new TestCase(   SECTION,
+		"var x; with (7) x = valueOf(); typeof x;",
+		"number",
+		eval("var x; with(7) x = valueOf(); typeof x;") );
+
+test();
diff --git a/js/src/tests/ecma/Statements/12.2-1.js b/js/src/tests/ecma/Statements/12.2-1.js
new file mode 100644
index 000000000..a0ece24fa
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.2-1.js
@@ -0,0 +1,40 @@
+/* -*- tab-width: 2; 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:          12.2-1.js
+   ECMA Section:       The variable statement
+   Description:
+
+   If the variable statement occurs inside a FunctionDeclaration, the
+   variables are defined with function-local scope in that function, as
+   described in section 10.1.3. Otherwise, they are defined with global
+   scope, that is, they are created as members of the global object, as
+   described in section 0. Variables are created when the execution scope
+   is entered. A Block does not define a new execution scope. Only Program and
+   FunctionDeclaration produce a new scope. Variables are initialized to the
+   undefined value when created. A variable with an Initializer is assigned
+   the value of its AssignmentExpression when the VariableStatement is executed,
+   not when the variable is created.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "12.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The variable statement";
+
+writeHeaderToLog( SECTION +" "+ TITLE);
+
+new TestCase(    "SECTION",
+		 "var x = 3; function f() { var a = x; var x = 23; return a; }; f()",
+		 void 0,
+		 eval("var x = 3; function f() { var a = x; var x = 23; return a; }; f()") );
+
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.5-1.js b/js/src/tests/ecma/Statements/12.5-1.js
new file mode 100644
index 000000000..c5bd6b593
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.5-1.js
@@ -0,0 +1,68 @@
+/* -*- tab-width: 2; 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:          12.5-1.js
+   ECMA Section:       The if statement
+   Description:
+
+   The production IfStatement : if ( Expression ) Statement else Statement
+   is evaluated as follows:
+
+   1.Evaluate Expression.
+   2.Call GetValue(Result(1)).
+   3.Call ToBoolean(Result(2)).
+   4.If Result(3) is false, go to step 7.
+   5.Evaluate the first Statement.
+   6.Return Result(5).
+   7.Evaluate the second Statement.
+   8.Return Result(7).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+
+var SECTION = "12.5-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The if statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase(   SECTION,
+		"var MYVAR; if ( true ) MYVAR='PASSED'; else MYVAR= 'FAILED';",
+		"PASSED",
+		eval("var MYVAR; if ( true ) MYVAR='PASSED'; else MYVAR= 'FAILED';") );
+
+new TestCase(  SECTION,
+	       "var MYVAR; if ( false ) MYVAR='FAILED'; else MYVAR= 'PASSED';",
+	       "PASSED",
+	       eval("var MYVAR; if ( false ) MYVAR='FAILED'; else MYVAR= 'PASSED';") );
+
+new TestCase(   SECTION,
+		"var MYVAR; if ( new Boolean(true) ) MYVAR='PASSED'; else MYVAR= 'FAILED';",
+		"PASSED",
+		eval("var MYVAR; if ( new Boolean(true) ) MYVAR='PASSED'; else MYVAR= 'FAILED';") );
+
+new TestCase(  SECTION,
+	       "var MYVAR; if ( new Boolean(false) ) MYVAR='PASSED'; else MYVAR= 'FAILED';",
+	       "PASSED",
+	       eval("var MYVAR; if ( new Boolean(false) ) MYVAR='PASSED'; else MYVAR= 'FAILED';") );
+
+new TestCase(   SECTION,
+		"var MYVAR; if ( 1 ) MYVAR='PASSED'; else MYVAR= 'FAILED';",
+		"PASSED",
+		eval("var MYVAR; if ( 1 ) MYVAR='PASSED'; else MYVAR= 'FAILED';") );
+
+new TestCase(  SECTION,
+	       "var MYVAR; if ( 0 ) MYVAR='FAILED'; else MYVAR= 'PASSED';",
+	       "PASSED",
+	       eval("var MYVAR; if ( 0 ) MYVAR='FAILED'; else MYVAR= 'PASSED';") );
+
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.5-2.js b/js/src/tests/ecma/Statements/12.5-2.js
new file mode 100644
index 000000000..f7c58b02d
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.5-2.js
@@ -0,0 +1,65 @@
+/* -*- tab-width: 2; 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:          12.5-2.js
+   ECMA Section:       The if statement
+   Description:
+
+   The production IfStatement : if ( Expression ) Statement else Statement
+   is evaluated as follows:
+
+   1.Evaluate Expression.
+   2.Call GetValue(Result(1)).
+   3.Call ToBoolean(Result(2)).
+   4.If Result(3) is false, go to step 7.
+   5.Evaluate the first Statement.
+   6.Return Result(5).
+   7.Evaluate the second Statement.
+   8.Return Result(7).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "12.5-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "The if statement" ;
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"var MYVAR; if ( true ) MYVAR='PASSED'; MYVAR",
+		"PASSED",
+		eval("var MYVAR; if ( true ) MYVAR='PASSED'; MYVAR") );
+
+new TestCase(  SECTION,
+	       "var MYVAR; if ( false ) MYVAR='FAILED'; MYVAR;",
+	       "PASSED",
+	       eval("var MYVAR=\"PASSED\"; if ( false ) MYVAR='FAILED'; MYVAR;") );
+
+new TestCase(   SECTION,
+		"var MYVAR; if ( new Boolean(true) ) MYVAR='PASSED'; MYVAR",
+		"PASSED",
+		eval("var MYVAR; if ( new Boolean(true) ) MYVAR='PASSED'; MYVAR") );
+
+new TestCase(   SECTION,
+		"var MYVAR; if ( new Boolean(false) ) MYVAR='PASSED'; MYVAR",
+		"PASSED",
+		eval("var MYVAR; if ( new Boolean(false) ) MYVAR='PASSED'; MYVAR") );
+
+new TestCase(   SECTION,
+		"var MYVAR; if ( 1 ) MYVAR='PASSED'; MYVAR",
+		"PASSED",
+		eval("var MYVAR; if ( 1 ) MYVAR='PASSED'; MYVAR") );
+
+new TestCase(  SECTION,
+	       "var MYVAR; if ( 0 ) MYVAR='FAILED'; MYVAR;",
+	       "PASSED",
+	       eval("var MYVAR=\"PASSED\"; if ( 0 ) MYVAR='FAILED'; MYVAR;") );
+
+test();
diff --git a/js/src/tests/ecma/Statements/12.6.1-1.js b/js/src/tests/ecma/Statements/12.6.1-1.js
new file mode 100644
index 000000000..5a575f050
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.1-1.js
@@ -0,0 +1,40 @@
+/* -*- tab-width: 2; 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:          12.6.1-1.js
+   ECMA Section:       The while statement
+   Description:
+
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "12.6.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The While statement";
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION,
+	      "var MYVAR = 0; while( MYVAR++ < 100) { if ( MYVAR < 100 ) break; } MYVAR ",
+	      1,
+	      eval("var MYVAR = 0; while( MYVAR++ < 100) { if ( MYVAR < 100 ) break; } MYVAR "));
+
+new TestCase( SECTION,
+	      "var MYVAR = 0; while( MYVAR++ < 100) { if ( MYVAR < 100 ) continue; else break; } MYVAR ",
+	      100,
+	      eval("var MYVAR = 0; while( MYVAR++ < 100) { if ( MYVAR < 100 ) continue; else break; } MYVAR "));
+
+new TestCase( SECTION,
+	      "function MYFUN( arg1 ) { while ( arg1++ < 100 ) { if ( arg1 < 100 ) return arg1; } }; MYFUN(1)",
+	      2,
+	      eval("function MYFUN( arg1 ) { while ( arg1++ < 100 ) { if ( arg1 < 100 ) return arg1; } }; MYFUN(1)"));
+
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.6.2-1.js b/js/src/tests/ecma/Statements/12.6.2-1.js
new file mode 100644
index 000000000..53f623412
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.2-1.js
@@ -0,0 +1,41 @@
+/* -*- 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:          12.6.2-1.js
+   ECMA Section:       12.6.2 The for Statement
+
+   1. first expression is not present.
+   2. second expression is not present
+   3. third expression is not present
+
+
+   Author:             christine@netscape.com
+   Date:               15 september 1997
+*/
+
+var SECTION = "12.6.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( "12.6.2-1", "for statement",  99,     testprogram() );
+
+test();
+
+
+function testprogram() {
+  myVar = 0;
+
+  for ( ; ; ) {
+    if ( ++myVar == 99 )
+      break;
+  }
+
+  return myVar;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.2-2.js b/js/src/tests/ecma/Statements/12.6.2-2.js
new file mode 100644
index 000000000..04a958c93
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.2-2.js
@@ -0,0 +1,42 @@
+/* -*- 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:          12.6.2-2.js
+   ECMA Section:       12.6.2 The for Statement
+
+   1. first expression is not present.
+   2. second expression is not present
+   3. third expression is present
+
+
+   Author:             christine@netscape.com
+   Date:               15 september 1997
+*/
+var SECTION = "12.6.2-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "for statement",  99,     testprogram() );
+
+test();
+
+function testprogram() {
+  myVar = 0;
+
+  for ( ; ; myVar++ ) {
+    if ( myVar < 99 ) {
+      continue;
+    } else {
+      break;
+    }
+  }
+
+  return myVar;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.2-3.js b/js/src/tests/ecma/Statements/12.6.2-3.js
new file mode 100644
index 000000000..049ba2500
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.2-3.js
@@ -0,0 +1,38 @@
+/* -*- 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:          12.6.2-3.js
+   ECMA Section:       12.6.2 The for Statement
+
+   1. first expression is not present.
+   2. second expression is present
+   3. third expression is present
+
+
+   Author:             christine@netscape.com
+   Date:               15 september 1997
+*/
+var SECTION = "12.6.2-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "for statement",  100,     testprogram() );
+
+test();
+
+function testprogram() {
+  myVar = 0;
+
+  for ( ; myVar < 100 ; myVar++ ) {
+    continue;
+  }
+
+  return myVar;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.2-4.js b/js/src/tests/ecma/Statements/12.6.2-4.js
new file mode 100644
index 000000000..e9a0e7cf3
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.2-4.js
@@ -0,0 +1,38 @@
+/* -*- 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:          12.6.2-4.js
+   ECMA Section:       12.6.2 The for Statement
+
+   1. first expression is not present.
+   2. second expression is present
+   3. third expression is present
+
+
+   Author:             christine@netscape.com
+   Date:               15 september 1997
+*/
+
+var SECTION = "12.6.2-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "for statement",  100,     testprogram() );
+
+test();
+
+function testprogram() {
+  myVar = 0;
+
+  for ( ; myVar < 100 ; myVar++ ) {
+  }
+
+  return myVar;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.2-5.js b/js/src/tests/ecma/Statements/12.6.2-5.js
new file mode 100644
index 000000000..1386f04bd
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.2-5.js
@@ -0,0 +1,39 @@
+/* -*- 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:          12.6.2-5.js
+   ECMA Section:       12.6.2 The for Statement
+
+   1. first expression is not present.
+   2. second expression is present
+   3. third expression is present
+
+
+   Author:             christine@netscape.com
+   Date:               15 september 1997
+*/
+var SECTION = "12.6.2-5";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "for statement",  99,     testprogram() );
+
+test();
+
+function testprogram() {
+  myVar = 0;
+
+  for ( ; myVar < 100 ; myVar++ ) {
+    if (myVar == 99)
+      break;
+  }
+
+  return myVar;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.2-6.js b/js/src/tests/ecma/Statements/12.6.2-6.js
new file mode 100644
index 000000000..624ccbfba
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.2-6.js
@@ -0,0 +1,41 @@
+/* -*- 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:          12.6.2-6.js
+   ECMA Section:       12.6.2 The for Statement
+
+   1. first expression is present.
+   2. second expression is not present
+   3. third expression is present
+
+
+   Author:             christine@netscape.com
+   Date:               15 september 1997
+*/
+var SECTION = "12.6.2-6";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( "12.6.2-6", "for statement",  256,     testprogram() );
+
+test();
+
+function testprogram() {
+  var myVar;
+
+  for ( myVar=2; ; myVar *= myVar ) {
+
+    if (myVar > 100)
+      break;
+    continue;
+  }
+
+  return myVar;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.2-7.js b/js/src/tests/ecma/Statements/12.6.2-7.js
new file mode 100644
index 000000000..1038723b5
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.2-7.js
@@ -0,0 +1,39 @@
+/* -*- 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:          12.6.2-7.js
+   ECMA Section:       12.6.2 The for Statement
+
+   1. first expression is present.
+   2. second expression is not present
+   3. third expression is present
+
+
+   Author:             christine@netscape.com
+   Date:               15 september 1997
+*/
+var SECTION = "12.6.2-7";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "for statement",  256,     testprogram() );
+
+test();
+
+function testprogram() {
+  var myVar;
+
+  for ( myVar=2; myVar < 100 ; myVar *= myVar ) {
+
+    continue;
+  }
+
+  return myVar;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.2-8.js b/js/src/tests/ecma/Statements/12.6.2-8.js
new file mode 100644
index 000000000..d76fb35ab
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.2-8.js
@@ -0,0 +1,37 @@
+/* -*- 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:          12.6.2-8.js
+   ECMA Section:       12.6.2 The for Statement
+
+   1. first expression is present.
+   2. second expression is present
+   3. third expression is present
+
+
+   Author:             christine@netscape.com
+   Date:               15 september 1997
+*/
+var SECTION = "12.6.2-8";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "for statement",  256,     testprogram() );
+
+test();
+
+function testprogram() {
+  var myVar;
+
+  for ( myVar=2;  myVar < 256; myVar *= myVar ) {
+  }
+
+  return myVar;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.2-9-n.js b/js/src/tests/ecma/Statements/12.6.2-9-n.js
new file mode 100644
index 000000000..2b5941111
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.2-9-n.js
@@ -0,0 +1,42 @@
+/* -*- tab-width: 2; 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:          12.6.2-9-n.js
+   ECMA Section:       12.6.2 The for Statement
+
+   1. first expression is not present.
+   2. second expression is not present
+   3. third expression is not present
+
+
+   Author:             christine@netscape.com
+   Date:               15 september 1997
+*/
+
+
+var SECTION = "12.6.2-9-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "for (i)";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "for (i)",
+	      "error",
+	      eval("for (i) { }") );
+
+/*
+  for (i) {
+  }
+
+*/
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.6.3-1.js b/js/src/tests/ecma/Statements/12.6.3-1.js
new file mode 100644
index 000000000..06294d6d6
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-1.js
@@ -0,0 +1,29 @@
+/* -*- tab-width: 2; 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:          12.6.3-1.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+
+var SECTION = "12.6.3-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "var x; Number.prototype.foo = 34; for ( j in 7 ) x = j; x",
+	      "foo",
+	      eval("var x; Number.prototype.foo = 34; for ( j in 7 ){x = j;} x") );
+
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.6.3-10.js b/js/src/tests/ecma/Statements/12.6.3-10.js
new file mode 100644
index 000000000..8481458cf
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-10.js
@@ -0,0 +1,81 @@
+/* -*- tab-width: 2; 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:          12.6.3-10.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+   The production IterationStatement : for ( LeftHandSideExpression in Expression )
+   Statement is evaluated as follows:
+
+   1.  Evaluate the Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Let C be "normal completion".
+   5.  Get the name of the next property of Result(3) that doesn't have the
+   DontEnum attribute. If there is no such property, go to step 14.
+   6.  Evaluate the LeftHandSideExpression (it may be evaluated repeatedly).
+   7.  Call PutValue(Result(6), Result(5)).  PutValue( V, W ):
+   1.  If Type(V) is not Reference, generate a runtime error.
+   2.  Call GetBase(V).
+   3.  If Result(2) is null, go to step 6.
+   4.  Call the [[Put]] method of Result(2), passing GetPropertyName(V)
+   for the property name and W for the value.
+   5.  Return.
+   6.  Call the [[Put]] method for the global object, passing
+   GetPropertyName(V) for the property name and W for the value.
+   7.  Return.
+   8.  Evaluate Statement.
+   9.  If Result(8) is a value completion, change C to be "normal completion
+   after value V" where V is the value carried by Result(8).
+   10. If Result(8) is a break completion, go to step 14.
+   11. If Result(8) is a continue completion, go to step 5.
+   12. If Result(8) is a return completion, return Result(8).
+   13. Go to step 5.
+   14. Return C.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.6.3-10";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  for ( LeftHandSideExpression in Expression )
+//  LeftHandSideExpression:NewExpression:MemberExpression
+
+var count = 0;
+function f() {     count++; return new Array("h","e","l","l","o"); }
+
+var result = "";
+for ( p in f() ) { result += f()[p] };
+
+new TestCase( SECTION,
+	      "count = 0; result = \"\"; "+
+	      "function f() { count++; return new Array(\"h\",\"e\",\"l\",\"l\",\"o\"); }"+
+	      "for ( p in f() ) { result += f()[p] }; count",
+	      6,
+	      count );
+
+new TestCase( SECTION,
+	      "result",
+	      "hello",
+	      result );
+
+//  LeftHandSideExpression:NewExpression:MemberExpression [ Expression ]
+//  LeftHandSideExpression:NewExpression:MemberExpression . Identifier
+//  LeftHandSideExpression:NewExpression:new MemberExpression Arguments
+//  LeftHandSideExpression:NewExpression:PrimaryExpression:( Expression )
+//  LeftHandSideExpression:CallExpression:MemberExpression Arguments
+//  LeftHandSideExpression:CallExpression Arguments
+//  LeftHandSideExpression:CallExpression [ Expression ]
+//  LeftHandSideExpression:CallExpression . Identifier
+
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.6.3-11.js b/js/src/tests/ecma/Statements/12.6.3-11.js
new file mode 100644
index 000000000..8e92635a9
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-11.js
@@ -0,0 +1,64 @@
+/* -*- tab-width: 2; 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:          12.6.3-11.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+   The production IterationStatement : for ( LeftHandSideExpression in Expression )
+   Statement is evaluated as follows:
+
+   1.  Evaluate the Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Let C be "normal completion".
+   5.  Get the name of the next property of Result(3) that doesn't have the
+   DontEnum attribute. If there is no such property, go to step 14.
+   6.  Evaluate the LeftHandSideExpression (it may be evaluated repeatedly).
+   7.  Call PutValue(Result(6), Result(5)).  PutValue( V, W ):
+   1.  If Type(V) is not Reference, generate a runtime error.
+   2.  Call GetBase(V).
+   3.  If Result(2) is null, go to step 6.
+   4.  Call the [[Put]] method of Result(2), passing GetPropertyName(V)
+   for the property name and W for the value.
+   5.  Return.
+   6.  Call the [[Put]] method for the global object, passing
+   GetPropertyName(V) for the property name and W for the value.
+   7.  Return.
+   8.  Evaluate Statement.
+   9.  If Result(8) is a value completion, change C to be "normal completion
+   after value V" where V is the value carried by Result(8).
+   10. If Result(8) is a break completion, go to step 14.
+   11. If Result(8) is a continue completion, go to step 5.
+   12. If Result(8) is a return completion, return Result(8).
+   13. Go to step 5.
+   14. Return C.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.6.3-11";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+//    5.  Get the name of the next property of Result(3) that doesn't have the
+//        DontEnum attribute. If there is no such property, go to step 14.
+
+var result = "";
+
+for ( p in Number ) { result += String(p) };
+
+new TestCase( SECTION,
+	      "result = \"\"; for ( p in Number ) { result += String(p) };",
+	      "",
+	      result );
+
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.6.3-12.js b/js/src/tests/ecma/Statements/12.6.3-12.js
new file mode 100644
index 000000000..140355800
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-12.js
@@ -0,0 +1,69 @@
+/* -*- 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:          12.6.3-12.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+
+   This is a regression test for http://bugzilla.mozilla.org/show_bug.cgi?id=9802.
+
+   The production IterationStatement : for ( LeftHandSideExpression in Expression )
+   Statement is evaluated as follows:
+
+   1.  Evaluate the Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Let C be "normal completion".
+   5.  Get the name of the next property of Result(3) that doesn't have the
+   DontEnum attribute. If there is no such property, go to step 14.
+   6.  Evaluate the LeftHandSideExpression (it may be evaluated repeatedly).
+   7.  Call PutValue(Result(6), Result(5)).  PutValue( V, W ):
+   1.  If Type(V) is not Reference, generate a runtime error.
+   2.  Call GetBase(V).
+   3.  If Result(2) is null, go to step 6.
+   4.  Call the [[Put]] method of Result(2), passing GetPropertyName(V)
+   for the property name and W for the value.
+   5.  Return.
+   6.  Call the [[Put]] method for the global object, passing
+   GetPropertyName(V) for the property name and W for the value.
+   7.  Return.
+   8.  Evaluate Statement.
+   9.  If Result(8) is a value completion, change C to be "normal completion
+   after value V" where V is the value carried by Result(8).
+   10. If Result(8) is a break completion, go to step 14.
+   11. If Result(8) is a continue completion, go to step 5.
+   12. If Result(8) is a return completion, return Result(8).
+   13. Go to step 5.
+   14. Return C.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.6.3-12";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var result = "PASSED";
+
+for ( aVar in this ) {
+  if (aVar == "aVar") {
+    result = "FAILED"
+      }
+};
+
+new TestCase(
+  SECTION,
+  "var result=''; for ( aVar in this ) { " +
+  "if (aVar == 'aVar') {return a failure}; result",
+  "PASSED",
+  result );
+
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.6.3-19.js b/js/src/tests/ecma/Statements/12.6.3-19.js
new file mode 100644
index 000000000..fce562cbb
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-19.js
@@ -0,0 +1,83 @@
+/* -*- tab-width: 2; 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:          12.6.3-1.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+   The production IterationStatement : for ( LeftHandSideExpression in Expression )
+   Statement is evaluated as follows:
+
+   1.  Evaluate the Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Let C be "normal completion".
+   5.  Get the name of the next property of Result(3) that doesn't have the
+   DontEnum attribute. If there is no such property, go to step 14.
+   6.  Evaluate the LeftHandSideExpression (it may be evaluated repeatedly).
+   7.  Call PutValue(Result(6), Result(5)).  PutValue( V, W ):
+   1.  If Type(V) is not Reference, generate a runtime error.
+   2.  Call GetBase(V).
+   3.  If Result(2) is null, go to step 6.
+   4.  Call the [[Put]] method of Result(2), passing GetPropertyName(V)
+   for the property name and W for the value.
+   5.  Return.
+   6.  Call the [[Put]] method for the global object, passing
+   GetPropertyName(V) for the property name and W for the value.
+   7.  Return.
+   8.  Evaluate Statement.
+   9.  If Result(8) is a value completion, change C to be "normal completion
+   after value V" where V is the value carried by Result(8).
+   10. If Result(8) is a break completion, go to step 14.
+   11. If Result(8) is a continue completion, go to step 5.
+   12. If Result(8) is a return completion, return Result(8).
+   13. Go to step 5.
+   14. Return C.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.6.3-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  for ( LeftHandSideExpression in Expression )
+//  LeftHandSideExpression:NewExpression:MemberExpression
+
+var count = 0;
+function f() {     count++; return new Array("h","e","l","l","o"); }
+
+var result = "";
+for ( p in f() ) { result += f()[p] };
+
+new TestCase( SECTION,
+	      "count = 0; result = \"\"; "+
+	      "function f() { count++; return new Array(\"h\",\"e\",\"l\",\"l\",\"o\"); }"+
+	      "for ( p in f() ) { result += f()[p] }; count",
+	      6,
+	      count );
+
+new TestCase( SECTION,
+	      "result",
+	      "hello",
+	      result );
+
+
+
+//  LeftHandSideExpression:NewExpression:MemberExpression [ Expression ]
+//  LeftHandSideExpression:NewExpression:MemberExpression . Identifier
+//  LeftHandSideExpression:NewExpression:new MemberExpression Arguments
+//  LeftHandSideExpression:NewExpression:PrimaryExpression:( Expression )
+//  LeftHandSideExpression:CallExpression:MemberExpression Arguments
+//  LeftHandSideExpression:CallExpression Arguments
+//  LeftHandSideExpression:CallExpression [ Expression ]
+//  LeftHandSideExpression:CallExpression . Identifier
+
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.6.3-2.js b/js/src/tests/ecma/Statements/12.6.3-2.js
new file mode 100644
index 000000000..bbd0a1bed
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-2.js
@@ -0,0 +1,29 @@
+/* -*- tab-width: 2; 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:          12.6.3-2.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:        Check the Boolean Object
+
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+
+var SECTION = "12.6.3-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"Boolean.prototype.foo = 34; for ( j in Boolean ) Boolean[j]",
+		34,
+		eval("Boolean.prototype.foo = 34; for ( j in Boolean ) Boolean[j] ") );
+
+test();
diff --git a/js/src/tests/ecma/Statements/12.6.3-3.js b/js/src/tests/ecma/Statements/12.6.3-3.js
new file mode 100644
index 000000000..6adb35c9f
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-3.js
@@ -0,0 +1,39 @@
+/* -*- tab-width: 2; 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:          12.6.3-3.js
+   ECMA Section:       for..in loops
+   Description:
+
+   This verifies the fix to
+   http://scopus.mcom.com/bugsplat/show_bug.cgi?id=112156
+   for..in should take general lvalue for first argument
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "12.6.3-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var o = {};
+
+var result = "";
+
+for ( o.a in [1,2,3] ) { result += String( [1,2,3][o.a] ); }
+
+new TestCase( SECTION,
+	      "for ( o.a in [1,2,3] ) { result += String( [1,2,3][o.a] ); } result",
+	      "123",
+	      result );
+
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.6.3-4.js b/js/src/tests/ecma/Statements/12.6.3-4.js
new file mode 100644
index 000000000..e56b6a6cd
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-4.js
@@ -0,0 +1,168 @@
+/* -*- tab-width: 2; 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:          12.6.3-1.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+   The production IterationStatement : for ( LeftHandSideExpression in Expression )
+   Statement is evaluated as follows:
+
+   1.  Evaluate the Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Let C be "normal completion".
+   5.  Get the name of the next property of Result(3) that doesn't have the
+   DontEnum attribute. If there is no such property, go to step 14.
+   6.  Evaluate the LeftHandSideExpression (it may be evaluated repeatedly).
+   7.  Call PutValue(Result(6), Result(5)).  PutValue( V, W ):
+   1.  If Type(V) is not Reference, generate a runtime error.
+   2.  Call GetBase(V).
+   3.  If Result(2) is null, go to step 6.
+   4.  Call the [[Put]] method of Result(2), passing GetPropertyName(V)
+   for the property name and W for the value.
+   5.  Return.
+   6.  Call the [[Put]] method for the global object, passing
+   GetPropertyName(V) for the property name and W for the value.
+   7.  Return.
+   8.  Evaluate Statement.
+   9.  If Result(8) is a value completion, change C to be "normal completion
+   after value V" where V is the value carried by Result(8).
+   10. If Result(8) is a break completion, go to step 14.
+   11. If Result(8) is a continue completion, go to step 5.
+   12. If Result(8) is a return completion, return Result(8).
+   13. Go to step 5.
+   14. Return C.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.6.3-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+var BUGNUMBER="http://scopus.mcom.com/bugsplat/show_bug.cgi?id=344855";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  for ( LeftHandSideExpression in Expression )
+//  LeftHandSideExpression:NewExpression:MemberExpression
+
+var o = new MyObject();
+var result = 0;
+
+for ( MyObject in o ) {
+  result += o[MyObject];
+}
+
+new TestCase( SECTION,
+	      "for ( MyObject in o ) { result += o[MyObject] }",
+	      6,
+	      result );
+
+var result = 0;
+
+for ( value in o ) {
+  result += o[value];
+}
+
+new TestCase( SECTION,
+	      "for ( value in o ) { result += o[value]",
+	      6,
+	      result );
+
+var value = "value";
+var result = 0;
+for ( value in o ) {
+  result += o[value];
+}
+
+new TestCase( SECTION,
+	      "value = \"value\"; for ( value in o ) { result += o[value]",
+	      6,
+	      result );
+
+var value = 0;
+var result = 0;
+for ( value in o ) {
+  result += o[value];
+}
+
+new TestCase( SECTION,
+	      "value = 0; for ( value in o ) { result += o[value]",
+	      6,
+	      result );
+
+// this causes a segv
+
+var ob = { 0:"hello" };
+var result = 0;
+for ( ob[0] in o ) {
+  result += o[ob[0]];
+}
+
+new TestCase( SECTION,
+	      "ob = { 0:\"hello\" }; for ( ob[0] in o ) { result += o[ob[0]]",
+	      6,
+	      result );
+
+var result = 0;
+for ( ob["0"] in o ) {
+  result += o[ob["0"]];
+}
+
+new TestCase( SECTION,
+	      "value = 0; for ( ob[\"0\"] in o ) { result += o[o[\"0\"]]",
+	      6,
+	      result );
+
+var result = 0;
+var ob = { value:"hello" };
+for ( ob[value] in o ) {
+  result += o[ob[value]];
+}
+
+new TestCase( SECTION,
+	      "ob = { 0:\"hello\" }; for ( ob[value] in o ) { result += o[ob[value]]",
+	      6,
+	      result );
+
+var result = 0;
+for ( ob["value"] in o ) {
+  result += o[ob["value"]];
+}
+
+new TestCase( SECTION,
+	      "value = 0; for ( ob[\"value\"] in o ) { result += o[ob[\"value\"]]",
+	      6,
+	      result );
+
+var result = 0;
+for ( ob.value in o ) {
+  result += o[ob.value];
+}
+
+new TestCase( SECTION,
+	      "value = 0; for ( ob.value in o ) { result += o[ob.value]",
+	      6,
+	      result );
+
+//  LeftHandSideExpression:NewExpression:MemberExpression [ Expression ]
+//  LeftHandSideExpression:NewExpression:MemberExpression . Identifier
+//  LeftHandSideExpression:NewExpression:new MemberExpression Arguments
+//  LeftHandSideExpression:NewExpression:PrimaryExpression:( Expression )
+//  LeftHandSideExpression:CallExpression:MemberExpression Arguments
+//  LeftHandSideExpression:CallExpression Arguments
+//  LeftHandSideExpression:CallExpression [ Expression ]
+//  LeftHandSideExpression:CallExpression . Identifier
+
+test();
+
+function MyObject() {
+  this.value = 2;
+  this[0] = 4;
+  return this;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.3-5-n.js b/js/src/tests/ecma/Statements/12.6.3-5-n.js
new file mode 100644
index 000000000..2465b628b
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-5-n.js
@@ -0,0 +1,76 @@
+/* -*- tab-width: 2; 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:          12.6.3-1.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+   The production IterationStatement : for ( LeftHandSideExpression in Expression )
+   Statement is evaluated as follows:
+
+   1.  Evaluate the Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Let C be "normal completion".
+   5.  Get the name of the next property of Result(3) that doesn't have the
+   DontEnum attribute. If there is no such property, go to step 14.
+   6.  Evaluate the LeftHandSideExpression ( it may be evaluated repeatedly).
+   7.  Call PutValue(Result(6), Result(5)).  PutValue( V, W ):
+   1.  If Type(V) is not Reference, generate a runtime error.
+   2.  Call GetBase(V).
+   3.  If Result(2) is null, go to step 6.
+   4.  Call the [[Put]] method of Result(2), passing GetPropertyName(V)
+   for the property name and W for the value.
+   5.  Return.
+   6.  Call the [[Put]] method for the global object, passing
+   GetPropertyName(V) for the property name and W for the value.
+   7.  Return.
+   8.  Evaluate Statement.
+   9.  If Result(8) is a value completion, change C to be "normal completion
+   after value V" where V is the value carried by Result(8).
+   10. If Result(8) is a break completion, go to step 14.
+   11. If Result(8) is a continue completion, go to step 5.
+   12. If Result(8) is a return completion, return Result(8).
+   13. Go to step 5.
+   14. Return C.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.6.3-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  for ( LeftHandSideExpression in Expression )
+//  LeftHandSideExpression:NewExpression:MemberExpression
+
+DESCRIPTION = "more than one member expression";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "more than one member expression",
+	      "error",
+	      eval("var o = new MyObject(); var result = 0; for ( var i, p in this) { result += this[p]; }") );
+
+/*
+  var o = new MyObject();
+  var result = 0;
+
+  for ( var i, p in this) {
+  result += this[p];
+  }
+*/
+
+test();
+
+function MyObject() {
+  this.value = 2;
+  this[0] = 4;
+  return this;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.3-6-n.js b/js/src/tests/ecma/Statements/12.6.3-6-n.js
new file mode 100644
index 000000000..c217f49bc
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-6-n.js
@@ -0,0 +1,75 @@
+/* -*- tab-width: 2; 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:          12.6.3-1.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+   The production IterationStatement : for ( LeftHandSideExpression in Expression )
+   Statement is evaluated as follows:
+
+   1.  Evaluate the Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Let C be "normal completion".
+   5.  Get the name of the next property of Result(3) that doesn't have the
+   DontEnum attribute. If there is no such property, go to step 14.
+   6.  Evaluate the LeftHandSideExpression ( it may be evaluated repeatedly).
+   7.  Call PutValue(Result(6), Result(5)).  PutValue( V, W ):
+   1.  If Type(V) is not Reference, generate a runtime error.
+   2.  Call GetBase(V).
+   3.  If Result(2) is null, go to step 6.
+   4.  Call the [[Put]] method of Result(2), passing GetPropertyName(V)
+   for the property name and W for the value.
+   5.  Return.
+   6.  Call the [[Put]] method for the global object, passing
+   GetPropertyName(V) for the property name and W for the value.
+   7.  Return.
+   8.  Evaluate Statement.
+   9.  If Result(8) is a value completion, change C to be "normal completion
+   after value V" where V is the value carried by Result(8).
+   10. If Result(8) is a break completion, go to step 14.
+   11. If Result(8) is a continue completion, go to step 5.
+   12. If Result(8) is a return completion, return Result(8).
+   13. Go to step 5.
+   14. Return C.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.6.3-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  for ( LeftHandSideExpression in Expression )
+//  LeftHandSideExpression:NewExpression:MemberExpression
+
+DESCRIPTION = "bad left-hand side expression";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "bad left-hand side expression",
+	      "error",
+	      eval("var o = new MyObject(); var result = 0; for ( this in o) { result += this[p]; }") );
+/*
+  var o = new MyObject();
+  var result = 0;
+
+  for ( this in o) {
+  result += this[p];
+  }
+*/
+
+test();
+
+function MyObject() {
+  this.value = 2;
+  this[0] = 4;
+  return this;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.3-7-n.js b/js/src/tests/ecma/Statements/12.6.3-7-n.js
new file mode 100644
index 000000000..f420ccbab
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-7-n.js
@@ -0,0 +1,76 @@
+/* -*- tab-width: 2; 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:          12.6.3-1.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+   The production IterationStatement : for ( LeftHandSideExpression in Expression )
+   Statement is evaluated as follows:
+
+   1.  Evaluate the Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Let C be "normal completion".
+   5.  Get the name of the next property of Result(3) that doesn't have the
+   DontEnum attribute. If there is no such property, go to step 14.
+   6.  Evaluate the LeftHandSideExpression ( it may be evaluated repeatedly).
+   7.  Call PutValue(Result(6), Result(5)).  PutValue( V, W ):
+   1.  If Type(V) is not Reference, generate a runtime error.
+   2.  Call GetBase(V).
+   3.  If Result(2) is null, go to step 6.
+   4.  Call the [[Put]] method of Result(2), passing GetPropertyName(V)
+   for the property name and W for the value.
+   5.  Return.
+   6.  Call the [[Put]] method for the global object, passing
+   GetPropertyName(V) for the property name and W for the value.
+   7.  Return.
+   8.  Evaluate Statement.
+   9.  If Result(8) is a value completion, change C to be "normal completion
+   after value V" where V is the value carried by Result(8).
+   10. If Result(8) is a break completion, go to step 14.
+   11. If Result(8) is a continue completion, go to step 5.
+   12. If Result(8) is a return completion, return Result(8).
+   13. Go to step 5.
+   14. Return C.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.6.3-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  for ( LeftHandSideExpression in Expression )
+//  LeftHandSideExpression:NewExpression:MemberExpression
+
+DESCRIPTION = "bad left-hand side expression";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "bad left-hand side expression",
+	      "error",
+	      eval("var o = new MyObject(); var result = 0; for ( \"a\" in o) { result += this[p]; } ") );
+
+/*
+  var o = new MyObject();
+  var result = 0;
+
+  for ( "a" in o) {
+  result += this[p];
+  }
+*/
+
+test();
+
+function MyObject() {
+  this.value = 2;
+  this[0] = 4;
+  return this;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.3-8-n.js b/js/src/tests/ecma/Statements/12.6.3-8-n.js
new file mode 100644
index 000000000..c427bbf6d
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-8-n.js
@@ -0,0 +1,76 @@
+/* -*- tab-width: 2; 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:          12.6.3-8-n.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+   The production IterationStatement : for ( LeftHandSideExpression in Expression )
+   Statement is evaluated as follows:
+
+   1.  Evaluate the Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Let C be "normal completion".
+   5.  Get the name of the next property of Result(3) that doesn't have the
+   DontEnum attribute. If there is no such property, go to step 14.
+   6.  Evaluate the LeftHandSideExpression ( it may be evaluated repeatedly).
+   7.  Call PutValue(Result(6), Result(5)).  PutValue( V, W ):
+   1.  If Type(V) is not Reference, generate a runtime error.
+   2.  Call GetBase(V).
+   3.  If Result(2) is null, go to step 6.
+   4.  Call the [[Put]] method of Result(2), passing GetPropertyName(V)
+   for the property name and W for the value.
+   5.  Return.
+   6.  Call the [[Put]] method for the global object, passing
+   GetPropertyName(V) for the property name and W for the value.
+   7.  Return.
+   8.  Evaluate Statement.
+   9.  If Result(8) is a value completion, change C to be "normal completion
+   after value V" where V is the value carried by Result(8).
+   10. If Result(8) is a break completion, go to step 14.
+   11. If Result(8) is a continue completion, go to step 5.
+   12. If Result(8) is a return completion, return Result(8).
+   13. Go to step 5.
+   14. Return C.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.6.3-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  for ( LeftHandSideExpression in Expression )
+//  LeftHandSideExpression:NewExpression:MemberExpression
+
+DESCRIPTION = "bad left-hand side expression";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "bad left-hand side expression",
+	      "error",
+	      eval("var o = new MyObject(); var result = 0; for ( 1 in o) { result += this[p]; } ") );
+
+/*
+  var o = new MyObject();
+  var result = 0;
+
+  for ( 1 in o) {
+  result += this[p];
+  }
+*/
+
+test();
+
+function MyObject() {
+  this.value = 2;
+  this[0] = 4;
+  return this;
+}
diff --git a/js/src/tests/ecma/Statements/12.6.3-9-n.js b/js/src/tests/ecma/Statements/12.6.3-9-n.js
new file mode 100644
index 000000000..c356c3d79
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.6.3-9-n.js
@@ -0,0 +1,75 @@
+/* -*- tab-width: 2; 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:          12.6.3-9-n.js
+   ECMA Section:       12.6.3 The for...in Statement
+   Description:
+   The production IterationStatement : for ( LeftHandSideExpression in Expression )
+   Statement is evaluated as follows:
+
+   1.  Evaluate the Expression.
+   2.  Call GetValue(Result(1)).
+   3.  Call ToObject(Result(2)).
+   4.  Let C be "normal completion".
+   5.  Get the name of the next property of Result(3) that doesn't have the
+   DontEnum attribute. If there is no such property, go to step 14.
+   6.  Evaluate the LeftHandSideExpression ( it may be evaluated repeatedly).
+   7.  Call PutValue(Result(6), Result(5)).  PutValue( V, W ):
+   1.  If Type(V) is not Reference, generate a runtime error.
+   2.  Call GetBase(V).
+   3.  If Result(2) is null, go to step 6.
+   4.  Call the [[Put]] method of Result(2), passing GetPropertyName(V)
+   for the property name and W for the value.
+   5.  Return.
+   6.  Call the [[Put]] method for the global object, passing
+   GetPropertyName(V) for the property name and W for the value.
+   7.  Return.
+   8.  Evaluate Statement.
+   9.  If Result(8) is a value completion, change C to be "normal completion
+   after value V" where V is the value carried by Result(8).
+   10. If Result(8) is a break completion, go to step 14.
+   11. If Result(8) is a continue completion, go to step 5.
+   12. If Result(8) is a return completion, return Result(8).
+   13. Go to step 5.
+   14. Return C.
+
+   Author:             christine@netscape.com
+   Date:               11 september 1997
+*/
+var SECTION = "12.6.3-9-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The for..in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+//  for ( LeftHandSideExpression in Expression )
+//  LeftHandSideExpression:NewExpression:MemberExpression
+
+DESCRIPTION = "object is not defined";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "object is not defined",
+	      "error",
+	      eval("var o = new MyObject(); var result = 0; for ( var o in foo) { result += this[o]; } ") );
+/*
+  var o = new MyObject();
+  var result = 0;
+
+  for ( var o in foo) {
+  result += this[o];
+  }
+*/
+
+test();
+
+function MyObject() {
+  this.value = 2;
+  this[0] = 4;
+  return this;
+}
diff --git a/js/src/tests/ecma/Statements/12.7-1-n.js b/js/src/tests/ecma/Statements/12.7-1-n.js
new file mode 100644
index 000000000..3a01aceab
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.7-1-n.js
@@ -0,0 +1,30 @@
+/* -*- tab-width: 2; 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:          12.7-1-n.js
+   ECMA Section:       12.7 The continue statement
+   Description:
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "12.7.1-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The continue statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "continue";
+EXPECTED = "error";
+
+new TestCase(   SECTION,
+		"continue",
+		"error",
+		eval("continue") );
+
+test();
diff --git a/js/src/tests/ecma/Statements/12.8-1-n.js b/js/src/tests/ecma/Statements/12.8-1-n.js
new file mode 100644
index 000000000..ea8a47436
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.8-1-n.js
@@ -0,0 +1,33 @@
+/* -*- tab-width: 2; 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:          12.8-1-n.js
+   ECMA Section:       12.8 The break statement
+   Description:
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "12.8-1-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The break in statement";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "break";
+EXPECTED = "error";
+
+new TestCase(   SECTION,
+		"break",
+		"error",
+		eval("break") );
+
+
+test();
+
diff --git a/js/src/tests/ecma/Statements/12.9-1-n.js b/js/src/tests/ecma/Statements/12.9-1-n.js
new file mode 100644
index 000000000..d47f21e9d
--- /dev/null
+++ b/js/src/tests/ecma/Statements/12.9-1-n.js
@@ -0,0 +1,29 @@
+/* -*- tab-width: 2; 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:          12.9-1-n.js
+   ECMA Section:       12.9 The return statement
+   Description:
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "12.9-1-n";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The return statement");
+
+DESCRIPTION = "return";
+EXPECTED = "error";
+
+new TestCase(   SECTION,
+		"return",
+		"error",
+		eval("return") );
+
+test();
diff --git a/js/src/tests/ecma/Statements/browser.js b/js/src/tests/ecma/Statements/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Statements/browser.js
diff --git a/js/src/tests/ecma/Statements/shell.js b/js/src/tests/ecma/Statements/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Statements/shell.js
diff --git a/js/src/tests/ecma/String/15.5.1.js b/js/src/tests/ecma/String/15.5.1.js
new file mode 100644
index 000000000..b5be9aabd
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.1.js
@@ -0,0 +1,100 @@
+/* -*- tab-width: 2; 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:          15.5.1.js
+   ECMA Section:       15.5.1 The String Constructor called as a Function
+   15.5.1.1 String(value)
+   15.5.1.2 String()
+
+   Description:	When String is called as a function rather than as
+   a constructor, it performs a type conversion.
+   - String(value) returns a string value (not a String
+   object) computed by ToString(value)
+   - String() returns the empty string ""
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The String Constructor Called as a Function";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,	"String('string primitive')",	"string primitive",	String('string primitive') );
+new TestCase( SECTION,	"String(void 0)",		"undefined",		String( void 0) );
+new TestCase( SECTION,	"String(null)",			    "null",			String( null ) );
+new TestCase( SECTION,	"String(true)",			    "true",			String( true) );
+new TestCase( SECTION,	"String(false)",		    "false",		String( false ) );
+new TestCase( SECTION,	"String(Boolean(true))",	"true",			String(Boolean(true)) );
+new TestCase( SECTION,	"String(Boolean(false))",	"false",		String(Boolean(false)) );
+new TestCase( SECTION,	"String(Boolean())",		"false",		String(Boolean(false)) );
+new TestCase( SECTION,	"String(new Array())",		"",			    String( new Array()) );
+new TestCase( SECTION,	"String(new Array(1,2,3))",	"1,2,3",		String( new Array(1,2,3)) );
+
+
+new TestCase( SECTION,    "String( Number.NaN )",       "NaN",                  String( Number.NaN ) );
+new TestCase( SECTION,    "String( 0 )",                "0",                    String( 0 ) );
+new TestCase( SECTION,    "String( -0 )",               "0",                   String( -0 ) );
+new TestCase( SECTION,    "String( Number.POSITIVE_INFINITY )", "Infinity",     String( Number.POSITIVE_INFINITY ) );
+new TestCase( SECTION,    "String( Number.NEGATIVE_INFINITY )", "-Infinity",    String( Number.NEGATIVE_INFINITY ) );
+new TestCase( SECTION,    "String( -1 )",               "-1",                   String( -1 ) );
+
+// cases in step 6:  integers  1e21 > x >= 1 or -1 >= x > -1e21
+
+new TestCase( SECTION,    "String( 1 )",                    "1",                    String( 1 ) );
+new TestCase( SECTION,    "String( 10 )",                   "10",                   String( 10 ) );
+new TestCase( SECTION,    "String( 100 )",                  "100",                  String( 100 ) );
+new TestCase( SECTION,    "String( 1000 )",                 "1000",                 String( 1000 ) );
+new TestCase( SECTION,    "String( 10000 )",                "10000",                String( 10000 ) );
+new TestCase( SECTION,    "String( 10000000000 )",          "10000000000",          String( 10000000000 ) );
+new TestCase( SECTION,    "String( 10000000000000000000 )", "10000000000000000000", String( 10000000000000000000 ) );
+new TestCase( SECTION,    "String( 100000000000000000000 )","100000000000000000000",String( 100000000000000000000 ) );
+
+new TestCase( SECTION,    "String( 12345 )",                    "12345",                    String( 12345 ) );
+new TestCase( SECTION,    "String( 1234567890 )",               "1234567890",               String( 1234567890 ) );
+
+new TestCase( SECTION,    "String( -1 )",                       "-1",                       String( -1 ) );
+new TestCase( SECTION,    "String( -10 )",                      "-10",                      String( -10 ) );
+new TestCase( SECTION,    "String( -100 )",                     "-100",                     String( -100 ) );
+new TestCase( SECTION,    "String( -1000 )",                    "-1000",                    String( -1000 ) );
+new TestCase( SECTION,    "String( -1000000000 )",              "-1000000000",              String( -1000000000 ) );
+new TestCase( SECTION,    "String( -1000000000000000 )",        "-1000000000000000",        String( -1000000000000000 ) );
+new TestCase( SECTION,    "String( -100000000000000000000 )",   "-100000000000000000000",   String( -100000000000000000000 ) );
+new TestCase( SECTION,    "String( -1000000000000000000000 )",  "-1e+21",                   String( -1000000000000000000000 ) );
+
+new TestCase( SECTION,    "String( -12345 )",                    "-12345",                  String( -12345 ) );
+new TestCase( SECTION,    "String( -1234567890 )",               "-1234567890",             String( -1234567890 ) );
+
+// cases in step 7: numbers with a fractional component, 1e21> x >1 or  -1 > x > -1e21,
+new TestCase( SECTION,    "String( 1.0000001 )",                "1.0000001",                String( 1.0000001 ) );
+
+
+// cases in step 8:  fractions between 1 > x > -1, exclusive of 0 and -0
+
+// cases in step 9:  numbers with 1 significant digit >= 1e+21 or <= 1e-6
+
+new TestCase( SECTION,    "String( 1000000000000000000000 )",   "1e+21",             String( 1000000000000000000000 ) );
+new TestCase( SECTION,    "String( 10000000000000000000000 )",   "1e+22",            String( 10000000000000000000000 ) );
+
+//  cases in step 10:  numbers with more than 1 significant digit >= 1e+21 or <= 1e-6
+new TestCase( SECTION,    "String( 1.2345 )",                    "1.2345",                  String( 1.2345));
+new TestCase( SECTION,    "String( 1.234567890 )",               "1.23456789",             String( 1.234567890 ));
+
+new TestCase( SECTION,    "String( .12345 )",                   "0.12345",               String(.12345 )     );
+new TestCase( SECTION,    "String( .012345 )",                  "0.012345",              String(.012345)     );
+new TestCase( SECTION,    "String( .0012345 )",                 "0.0012345",             String(.0012345)    );
+new TestCase( SECTION,    "String( .00012345 )",                "0.00012345",            String(.00012345)   );
+new TestCase( SECTION,    "String( .000012345 )",               "0.000012345",           String(.000012345)  );
+new TestCase( SECTION,    "String( .0000012345 )",              "0.0000012345",          String(.0000012345) );
+new TestCase( SECTION,    "String( .00000012345 )",             "1.2345e-7",            String(.00000012345));
+
+new TestCase( "15.5.2",	"String()",			        "",			    String() );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.2.js b/js/src/tests/ecma/String/15.5.2.js
new file mode 100644
index 000000000..de065b813
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.2.js
@@ -0,0 +1,76 @@
+/* -*- tab-width: 2; 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:          15.5.2.js
+   ECMA Section:       15.5.2 The String Constructor
+   15.5.2.1 new String(value)
+   15.5.2.2 new String()
+
+   Description:	When String is called as part of a new expression, it
+   is a constructor; it initializes the newly constructed
+   object.
+
+   - The prototype property of the newly constructed
+   object is set to the original String prototype object,
+   the one that is the intial value of String.prototype
+   - The internal [[Class]] property of the object is "String"
+   - The value of the object is ToString(value).
+   - If no value is specified, its value is the empty string.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The String Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION,	"typeof new String('string primitive')",	    "object",	        typeof new String('string primitive') );
+new TestCase( SECTION,	"var TESTSTRING = new String('string primitive'); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()", "[object String]",   eval("var TESTSTRING = new String('string primitive'); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()") );
+new TestCase( SECTION,  "(new String('string primitive')).valueOf()",   'string primitive', (new String('string primitive')).valueOf() );
+new TestCase( SECTION,  "(new String('string primitive')).substring",   String.prototype.substring,   (new String('string primitive')).substring );
+
+new TestCase( SECTION,	"typeof new String(void 0)",	                "object",	        typeof new String(void 0) );
+new TestCase( SECTION,	"var TESTSTRING = new String(void 0); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()", "[object String]",   eval("var TESTSTRING = new String(void 0); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()") );
+new TestCase( SECTION,  "(new String(void 0)).valueOf()",               "undefined", (new String(void 0)).valueOf() );
+new TestCase( SECTION,  "(new String(void 0)).toString",               String.prototype.toString,   (new String(void 0)).toString );
+
+new TestCase( SECTION,	"typeof new String(null)",	            "object",	        typeof new String(null) );
+new TestCase( SECTION,	"var TESTSTRING = new String(null); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()", "[object String]",   eval("var TESTSTRING = new String(null); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()") );
+new TestCase( SECTION,  "(new String(null)).valueOf()",         "null",             (new String(null)).valueOf() );
+new TestCase( SECTION,  "(new String(null)).valueOf",         String.prototype.valueOf,   (new String(null)).valueOf );
+
+new TestCase( SECTION,	"typeof new String(true)",	            "object",	        typeof new String(true) );
+new TestCase( SECTION,	"var TESTSTRING = new String(true); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()", "[object String]",   eval("var TESTSTRING = new String(true); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()") );
+new TestCase( SECTION,  "(new String(true)).valueOf()",         "true",             (new String(true)).valueOf() );
+new TestCase( SECTION,  "(new String(true)).charAt",         String.prototype.charAt,   (new String(true)).charAt );
+
+new TestCase( SECTION,	"typeof new String(false)",	            "object",	        typeof new String(false) );
+new TestCase( SECTION,	"var TESTSTRING = new String(false); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()", "[object String]",   eval("var TESTSTRING = new String(false); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()") );
+new TestCase( SECTION,  "(new String(false)).valueOf()",        "false",            (new String(false)).valueOf() );
+new TestCase( SECTION,  "(new String(false)).charCodeAt",        String.prototype.charCodeAt,   (new String(false)).charCodeAt );
+
+new TestCase( SECTION,	"typeof new String(new Boolean(true))",	       "object",	        typeof new String(new Boolean(true)) );
+new TestCase( SECTION,	"var TESTSTRING = new String(new Boolean(true)); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()", "[object String]",   eval("var TESTSTRING = new String(new Boolean(true)); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()") );
+new TestCase( SECTION,  "(new String(new Boolean(true))).valueOf()",   "true",              (new String(new Boolean(true))).valueOf() );
+new TestCase( SECTION,  "(new String(new Boolean(true))).indexOf",   String.prototype.indexOf,    (new String(new Boolean(true))).indexOf );
+
+new TestCase( SECTION,	"typeof new String()",	                        "object",	        typeof new String() );
+new TestCase( SECTION,	"var TESTSTRING = new String(); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()", "[object String]",   eval("var TESTSTRING = new String(); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()") );
+new TestCase( SECTION,  "(new String()).valueOf()",   '',                 (new String()).valueOf() );
+new TestCase( SECTION,  "(new String()).lastIndexOf",   String.prototype.lastIndexOf,   (new String()).lastIndexOf );
+
+new TestCase( SECTION,	"typeof new String('')",	    "object",	        typeof new String('') );
+new TestCase( SECTION,	"var TESTSTRING = new String(''); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()", "[object String]",   eval("var TESTSTRING = new String(''); TESTSTRING.toString=Object.prototype.toString;TESTSTRING.toString()") );
+new TestCase( SECTION,  "(new String('')).valueOf()",   '',                 (new String('')).valueOf() );
+new TestCase( SECTION,  "(new String('')).split",   String.prototype.split,   (new String('')).split );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.3.1-1.js b/js/src/tests/ecma/String/15.5.3.1-1.js
new file mode 100644
index 000000000..f95feb508
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.3.1-1.js
@@ -0,0 +1,37 @@
+/* -*- tab-width: 2; 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:          15.5.3.1-1.js
+   ECMA Section:       15.5.3.1 Properties of the String Constructor
+
+   Description:        The initial value of String.prototype is the built-in
+   String prototype object.
+
+   This property shall have the attributes [ DontEnum,
+   DontDelete, ReadOnly]
+
+   This tests the DontEnum attribute.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.3.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the String Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "String.prototype.length",   0,  String.prototype.length );
+
+new TestCase(   SECTION,
+		"var str='';for ( p in String ) { if ( p == 'prototype' ) str += p; } str",
+		"",
+		eval("var str='';for ( p in String ) { if ( p == 'prototype' ) str += p; } str") );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.3.1-2.js b/js/src/tests/ecma/String/15.5.3.1-2.js
new file mode 100644
index 000000000..d3b24e42a
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.3.1-2.js
@@ -0,0 +1,35 @@
+/* -*- tab-width: 2; 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:          15.5.3.1-2.js
+   ECMA Section:       15.5.3.1 Properties of the String Constructor
+
+   Description:        The initial value of String.prototype is the built-in
+   String prototype object.
+
+   This property shall have the attributes [ DontEnum,
+   DontDelete, ReadOnly]
+
+   This tests the ReadOnly attribute.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.3.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the String Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "String.prototype=null;String.prototype",
+	      String.prototype,
+	      eval("String.prototype=null;String.prototype") );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.3.1-3.js b/js/src/tests/ecma/String/15.5.3.1-3.js
new file mode 100644
index 000000000..69066091d
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.3.1-3.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.5.3.1-3.js
+   ECMA Section:       15.5.3.1 Properties of the String Constructor
+
+   Description:        The initial value of String.prototype is the built-in
+   String prototype object.
+
+   This property shall have the attributes [ DontEnum,
+   DontDelete, ReadOnly]
+
+   This tests the DontDelete attribute.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.3.1-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the String Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,	"delete( String.prototype )",   false,   eval("delete ( String.prototype )") );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.3.1-4.js b/js/src/tests/ecma/String/15.5.3.1-4.js
new file mode 100644
index 000000000..7605de7a3
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.3.1-4.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.5.3.1-4.js
+   ECMA Section:       15.5.3.1 Properties of the String Constructor
+
+   Description:        The initial value of String.prototype is the built-in
+   String prototype object.
+
+   This property shall have the attributes [ DontEnum,
+   DontDelete, ReadOnly]
+
+   This tests the DontDelete attribute.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.3.1-4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the String Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,	"delete( String.prototype );String.prototype",   String.prototype,   eval("delete ( String.prototype );String.prototype") );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.3.2-1.js b/js/src/tests/ecma/String/15.5.3.2-1.js
new file mode 100644
index 000000000..c74010730
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.3.2-1.js
@@ -0,0 +1,176 @@
+/* -*- 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:          15.5.3.2-1.js
+   ECMA Section:       15.5.3.2  String.fromCharCode( char0, char1, ... )
+   Description:        Return a string value containing as many characters
+   as the number of arguments.  Each argument specifies
+   one character of the resulting string, with the first
+   argument specifying the first character, and so on,
+   from left to right.  An argument is converted to a
+   character by applying the operation ToUint16_t and
+   regarding the resulting 16bit integeras the Unicode
+   encoding of a character.  If no arguments are supplied,
+   the result is the empty string.
+
+   This test covers Basic Latin (range U+0020 - U+007F)
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+
+var SECTION = "15.5.3.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.fromCharCode()";
+
+new TestCase( SECTION,   "typeof String.fromCharCode",      "function", typeof String.fromCharCode );
+new TestCase( SECTION,   "typeof String.prototype.fromCharCode",        "undefined", typeof String.prototype.fromCharCode );
+new TestCase( SECTION,   "var x = new String(); typeof x.fromCharCode", "undefined", eval("var x = new String(); typeof x.fromCharCode") );
+new TestCase( SECTION,   "String.fromCharCode.length",      1,      String.fromCharCode.length );
+
+new TestCase( SECTION,    "String.fromCharCode()",          "",     String.fromCharCode() );
+new TestCase( SECTION,   "String.fromCharCode(0x0020)",     " ",   String.fromCharCode(0x0020) );
+new TestCase( SECTION,   "String.fromCharCode(0x0021)",     "!",   String.fromCharCode(0x0021) );
+new TestCase( SECTION,   "String.fromCharCode(0x0022)",     "\"",   String.fromCharCode(0x0022) );
+new TestCase( SECTION,   "String.fromCharCode(0x0023)",     "#",   String.fromCharCode(0x0023) );
+new TestCase( SECTION,   "String.fromCharCode(0x0024)",     "$",   String.fromCharCode(0x0024) );
+new TestCase( SECTION,   "String.fromCharCode(0x0025)",     "%",   String.fromCharCode(0x0025) );
+new TestCase( SECTION,   "String.fromCharCode(0x0026)",     "&",   String.fromCharCode(0x0026) );
+new TestCase( SECTION,   "String.fromCharCode(0x0027)",     "\'",   String.fromCharCode(0x0027) );
+new TestCase( SECTION,   "String.fromCharCode(0x0028)",     "(",   String.fromCharCode(0x0028) );
+new TestCase( SECTION,   "String.fromCharCode(0x0029)",     ")",   String.fromCharCode(0x0029) );
+new TestCase( SECTION,   "String.fromCharCode(0x002A)",     "*",   String.fromCharCode(0x002A) );
+new TestCase( SECTION,   "String.fromCharCode(0x002B)",     "+",   String.fromCharCode(0x002B) );
+new TestCase( SECTION,   "String.fromCharCode(0x002C)",     ",",   String.fromCharCode(0x002C) );
+new TestCase( SECTION,   "String.fromCharCode(0x002D)",     "-",   String.fromCharCode(0x002D) );
+new TestCase( SECTION,   "String.fromCharCode(0x002E)",     ".",   String.fromCharCode(0x002E) );
+new TestCase( SECTION,   "String.fromCharCode(0x002F)",     "/",   String.fromCharCode(0x002F) );
+
+new TestCase( SECTION,   "String.fromCharCode(0x0030)",     "0",   String.fromCharCode(0x0030) );
+new TestCase( SECTION,   "String.fromCharCode(0x0031)",     "1",   String.fromCharCode(0x0031) );
+new TestCase( SECTION,   "String.fromCharCode(0x0032)",     "2",   String.fromCharCode(0x0032) );
+new TestCase( SECTION,   "String.fromCharCode(0x0033)",     "3",   String.fromCharCode(0x0033) );
+new TestCase( SECTION,   "String.fromCharCode(0x0034)",     "4",   String.fromCharCode(0x0034) );
+new TestCase( SECTION,   "String.fromCharCode(0x0035)",     "5",   String.fromCharCode(0x0035) );
+new TestCase( SECTION,   "String.fromCharCode(0x0036)",     "6",   String.fromCharCode(0x0036) );
+new TestCase( SECTION,   "String.fromCharCode(0x0037)",     "7",   String.fromCharCode(0x0037) );
+new TestCase( SECTION,   "String.fromCharCode(0x0038)",     "8",   String.fromCharCode(0x0038) );
+new TestCase( SECTION,   "String.fromCharCode(0x0039)",     "9",   String.fromCharCode(0x0039) );
+new TestCase( SECTION,   "String.fromCharCode(0x003A)",     ":",   String.fromCharCode(0x003A) );
+new TestCase( SECTION,   "String.fromCharCode(0x003B)",     ";",   String.fromCharCode(0x003B) );
+new TestCase( SECTION,   "String.fromCharCode(0x003C)",     "<",   String.fromCharCode(0x003C) );
+new TestCase( SECTION,   "String.fromCharCode(0x003D)",     "=",   String.fromCharCode(0x003D) );
+new TestCase( SECTION,   "String.fromCharCode(0x003E)",     ">",   String.fromCharCode(0x003E) );
+new TestCase( SECTION,   "String.fromCharCode(0x003F)",     "?",   String.fromCharCode(0x003F) );
+
+new TestCase( SECTION,   "String.fromCharCode(0x0040)",     "@",   String.fromCharCode(0x0040) );
+new TestCase( SECTION,   "String.fromCharCode(0x0041)",     "A",   String.fromCharCode(0x0041) );
+new TestCase( SECTION,   "String.fromCharCode(0x0042)",     "B",   String.fromCharCode(0x0042) );
+new TestCase( SECTION,   "String.fromCharCode(0x0043)",     "C",   String.fromCharCode(0x0043) );
+new TestCase( SECTION,   "String.fromCharCode(0x0044)",     "D",   String.fromCharCode(0x0044) );
+new TestCase( SECTION,   "String.fromCharCode(0x0045)",     "E",   String.fromCharCode(0x0045) );
+new TestCase( SECTION,   "String.fromCharCode(0x0046)",     "F",   String.fromCharCode(0x0046) );
+new TestCase( SECTION,   "String.fromCharCode(0x0047)",     "G",   String.fromCharCode(0x0047) );
+new TestCase( SECTION,   "String.fromCharCode(0x0048)",     "H",   String.fromCharCode(0x0048) );
+new TestCase( SECTION,   "String.fromCharCode(0x0049)",     "I",   String.fromCharCode(0x0049) );
+new TestCase( SECTION,   "String.fromCharCode(0x004A)",     "J",   String.fromCharCode(0x004A) );
+new TestCase( SECTION,   "String.fromCharCode(0x004B)",     "K",   String.fromCharCode(0x004B) );
+new TestCase( SECTION,   "String.fromCharCode(0x004C)",     "L",   String.fromCharCode(0x004C) );
+new TestCase( SECTION,   "String.fromCharCode(0x004D)",     "M",   String.fromCharCode(0x004D) );
+new TestCase( SECTION,   "String.fromCharCode(0x004E)",     "N",   String.fromCharCode(0x004E) );
+new TestCase( SECTION,   "String.fromCharCode(0x004F)",     "O",   String.fromCharCode(0x004F) );
+
+new TestCase( SECTION,   "String.fromCharCode(0x0040)",     "@",   String.fromCharCode(0x0040) );
+new TestCase( SECTION,   "String.fromCharCode(0x0041)",     "A",   String.fromCharCode(0x0041) );
+new TestCase( SECTION,   "String.fromCharCode(0x0042)",     "B",   String.fromCharCode(0x0042) );
+new TestCase( SECTION,   "String.fromCharCode(0x0043)",     "C",   String.fromCharCode(0x0043) );
+new TestCase( SECTION,   "String.fromCharCode(0x0044)",     "D",   String.fromCharCode(0x0044) );
+new TestCase( SECTION,   "String.fromCharCode(0x0045)",     "E",   String.fromCharCode(0x0045) );
+new TestCase( SECTION,   "String.fromCharCode(0x0046)",     "F",   String.fromCharCode(0x0046) );
+new TestCase( SECTION,   "String.fromCharCode(0x0047)",     "G",   String.fromCharCode(0x0047) );
+new TestCase( SECTION,   "String.fromCharCode(0x0048)",     "H",   String.fromCharCode(0x0048) );
+new TestCase( SECTION,   "String.fromCharCode(0x0049)",     "I",   String.fromCharCode(0x0049) );
+new TestCase( SECTION,   "String.fromCharCode(0x004A)",     "J",   String.fromCharCode(0x004A) );
+new TestCase( SECTION,   "String.fromCharCode(0x004B)",     "K",   String.fromCharCode(0x004B) );
+new TestCase( SECTION,   "String.fromCharCode(0x004C)",     "L",   String.fromCharCode(0x004C) );
+new TestCase( SECTION,   "String.fromCharCode(0x004D)",     "M",   String.fromCharCode(0x004D) );
+new TestCase( SECTION,   "String.fromCharCode(0x004E)",     "N",   String.fromCharCode(0x004E) );
+new TestCase( SECTION,   "String.fromCharCode(0x004F)",     "O",   String.fromCharCode(0x004F) );
+
+new TestCase( SECTION,   "String.fromCharCode(0x0050)",     "P",   String.fromCharCode(0x0050) );
+new TestCase( SECTION,   "String.fromCharCode(0x0051)",     "Q",   String.fromCharCode(0x0051) );
+new TestCase( SECTION,   "String.fromCharCode(0x0052)",     "R",   String.fromCharCode(0x0052) );
+new TestCase( SECTION,   "String.fromCharCode(0x0053)",     "S",   String.fromCharCode(0x0053) );
+new TestCase( SECTION,   "String.fromCharCode(0x0054)",     "T",   String.fromCharCode(0x0054) );
+new TestCase( SECTION,   "String.fromCharCode(0x0055)",     "U",   String.fromCharCode(0x0055) );
+new TestCase( SECTION,   "String.fromCharCode(0x0056)",     "V",   String.fromCharCode(0x0056) );
+new TestCase( SECTION,   "String.fromCharCode(0x0057)",     "W",   String.fromCharCode(0x0057) );
+new TestCase( SECTION,   "String.fromCharCode(0x0058)",     "X",   String.fromCharCode(0x0058) );
+new TestCase( SECTION,   "String.fromCharCode(0x0059)",     "Y",   String.fromCharCode(0x0059) );
+new TestCase( SECTION,   "String.fromCharCode(0x005A)",     "Z",   String.fromCharCode(0x005A) );
+new TestCase( SECTION,   "String.fromCharCode(0x005B)",     "[",   String.fromCharCode(0x005B) );
+new TestCase( SECTION,   "String.fromCharCode(0x005C)",     "\\",   String.fromCharCode(0x005C) );
+new TestCase( SECTION,   "String.fromCharCode(0x005D)",     "]",   String.fromCharCode(0x005D) );
+new TestCase( SECTION,   "String.fromCharCode(0x005E)",     "^",   String.fromCharCode(0x005E) );
+new TestCase( SECTION,   "String.fromCharCode(0x005F)",     "_",   String.fromCharCode(0x005F) );
+
+new TestCase( SECTION,   "String.fromCharCode(0x0060)",     "`",   String.fromCharCode(0x0060) );
+new TestCase( SECTION,   "String.fromCharCode(0x0061)",     "a",   String.fromCharCode(0x0061) );
+new TestCase( SECTION,   "String.fromCharCode(0x0062)",     "b",   String.fromCharCode(0x0062) );
+new TestCase( SECTION,   "String.fromCharCode(0x0063)",     "c",   String.fromCharCode(0x0063) );
+new TestCase( SECTION,   "String.fromCharCode(0x0064)",     "d",   String.fromCharCode(0x0064) );
+new TestCase( SECTION,   "String.fromCharCode(0x0065)",     "e",   String.fromCharCode(0x0065) );
+new TestCase( SECTION,   "String.fromCharCode(0x0066)",     "f",   String.fromCharCode(0x0066) );
+new TestCase( SECTION,   "String.fromCharCode(0x0067)",     "g",   String.fromCharCode(0x0067) );
+new TestCase( SECTION,   "String.fromCharCode(0x0068)",     "h",   String.fromCharCode(0x0068) );
+new TestCase( SECTION,   "String.fromCharCode(0x0069)",     "i",   String.fromCharCode(0x0069) );
+new TestCase( SECTION,   "String.fromCharCode(0x006A)",     "j",   String.fromCharCode(0x006A) );
+new TestCase( SECTION,   "String.fromCharCode(0x006B)",     "k",   String.fromCharCode(0x006B) );
+new TestCase( SECTION,   "String.fromCharCode(0x006C)",     "l",   String.fromCharCode(0x006C) );
+new TestCase( SECTION,   "String.fromCharCode(0x006D)",     "m",   String.fromCharCode(0x006D) );
+new TestCase( SECTION,   "String.fromCharCode(0x006E)",     "n",   String.fromCharCode(0x006E) );
+new TestCase( SECTION,   "String.fromCharCode(0x006F)",     "o",   String.fromCharCode(0x006F) );
+
+new TestCase( SECTION,   "String.fromCharCode(0x0070)",     "p",   String.fromCharCode(0x0070) );
+new TestCase( SECTION,   "String.fromCharCode(0x0071)",     "q",   String.fromCharCode(0x0071) );
+new TestCase( SECTION,   "String.fromCharCode(0x0072)",     "r",   String.fromCharCode(0x0072) );
+new TestCase( SECTION,   "String.fromCharCode(0x0073)",     "s",   String.fromCharCode(0x0073) );
+new TestCase( SECTION,   "String.fromCharCode(0x0074)",     "t",   String.fromCharCode(0x0074) );
+new TestCase( SECTION,   "String.fromCharCode(0x0075)",     "u",   String.fromCharCode(0x0075) );
+new TestCase( SECTION,   "String.fromCharCode(0x0076)",     "v",   String.fromCharCode(0x0076) );
+new TestCase( SECTION,   "String.fromCharCode(0x0077)",     "w",   String.fromCharCode(0x0077) );
+new TestCase( SECTION,   "String.fromCharCode(0x0078)",     "x",   String.fromCharCode(0x0078) );
+new TestCase( SECTION,   "String.fromCharCode(0x0079)",     "y",   String.fromCharCode(0x0079) );
+new TestCase( SECTION,   "String.fromCharCode(0x007A)",     "z",   String.fromCharCode(0x007A) );
+new TestCase( SECTION,   "String.fromCharCode(0x007B)",     "{",   String.fromCharCode(0x007B) );
+new TestCase( SECTION,   "String.fromCharCode(0x007C)",     "|",   String.fromCharCode(0x007C) );
+new TestCase( SECTION,   "String.fromCharCode(0x007D)",     "}",   String.fromCharCode(0x007D) );
+new TestCase( SECTION,   "String.fromCharCode(0x007E)",     "~",   String.fromCharCode(0x007E) );
+//    new TestCase( SECTION,   "String.fromCharCode(0x0020, 0x007F)",     "",   String.fromCharCode(0x0040, 0x007F) );
+
+new TestCase( SECTION,   "String.fromCharCode(<2 args>)",   "ab",                   String.fromCharCode(97,98));
+new TestCase( SECTION,   "String.fromCharCode(<3 args>)",   "abc",                  String.fromCharCode(97,98,99));
+new TestCase( SECTION,   "String.fromCharCode(<4 args>)",   "abcd",                 String.fromCharCode(97,98,99,100));
+new TestCase( SECTION,   "String.fromCharCode(<5 args>)",   "abcde",                String.fromCharCode(97,98,99,100,101));
+new TestCase( SECTION,   "String.fromCharCode(<6 args>)",   "abcdef",               String.fromCharCode(97,98,99,100,101,102));
+new TestCase( SECTION,   "String.fromCharCode(<7 args>)",   "abcdefg",              String.fromCharCode(97,98,99,100,101,102,103));
+new TestCase( SECTION,   "String.fromCharCode(<8 args>)",   "abcdefgh",             String.fromCharCode(97,98,99,100,101,102,103,104));
+new TestCase( SECTION,   "String.fromCharCode(<9 args>)",   "abcdefghi",            String.fromCharCode(97,98,99,100,101,102,103,104,105));
+new TestCase( SECTION,   "String.fromCharCode(<10 args>)",  "abcdefghij",           String.fromCharCode(97,98,99,100,101,102,103,104,105,106));
+new TestCase( SECTION,   "String.fromCharCode(<11 args>)",  "abcdefghijk",          String.fromCharCode(97,98,99,100,101,102,103,104,105,106,107));
+new TestCase( SECTION,   "String.fromCharCode(<12 args>)",  "abcdefghijkl",         String.fromCharCode(97,98,99,100,101,102,103,104,105,106,107,108));
+new TestCase( SECTION,   "String.fromCharCode(<13 args>)",  "abcdefghijklm",        String.fromCharCode(97,98,99,100,101,102,103,104,105,106,107,108,109));
+new TestCase( SECTION,   "String.fromCharCode(<14 args>)",  "abcdefghijklmn",       String.fromCharCode(97,98,99,100,101,102,103,104,105,106,107,108,109,110));
+new TestCase( SECTION,   "String.fromCharCode(<15 args>)",  "abcdefghijklmno",      String.fromCharCode(97,98,99,100,101,102,103,104,105,106,107,108,109,110,111));
+new TestCase( SECTION,   "String.fromCharCode(<16 args>)",  "abcdefghijklmnop",     String.fromCharCode(97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112));
+new TestCase( SECTION,   "String.fromCharCode(<17 args>)",  "abcdefghijklmnopq",    String.fromCharCode(97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113));
+new TestCase( SECTION,   "String.fromCharCode(<18 args>)",  "abcdefghijklmnopqr",   String.fromCharCode(97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114));
+new TestCase( SECTION,   "String.fromCharCode(<19 args>)",  "abcdefghijklmnopqrs",  String.fromCharCode(97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115));
+new TestCase( SECTION,   "String.fromCharCode(<20 args>)",  "abcdefghijklmnopqrst", String.fromCharCode(97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116));
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.3.2-2.js b/js/src/tests/ecma/String/15.5.3.2-2.js
new file mode 100644
index 000000000..624a418e2
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.3.2-2.js
@@ -0,0 +1,43 @@
+/* -*- tab-width: 2; 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:          15.5.3.2-2.js
+   ECMA Section:       15.5.3.2  String.fromCharCode( char0, char1, ... )
+   Description:        Return a string value containing as many characters
+   as the number of arguments.  Each argument specifies
+   one character of the resulting string, with the first
+   argument specifying the first character, and so on,
+   from left to right.  An argument is converted to a
+   character by applying the operation ToUint16_t and
+   regarding the resulting 16bit integeras the Unicode
+   encoding of a character.  If no arguments are supplied,
+   the result is the empty string.
+
+   This tests String.fromCharCode with multiple arguments.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+
+var SECTION = "15.5.3.2-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.fromCharCode()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "var MYSTRING = String.fromCharCode(eval(\"var args=''; for ( i = 0x0020; i < 0x007f; i++ ) { args += ( i == 0x007e ) ? i : i + ', '; } args;\")); MYSTRING",
+	      " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~",
+	      eval( "var MYSTRING = String.fromCharCode(" + eval("var args=''; for ( i = 0x0020; i < 0x007f; i++ ) { args += ( i == 0x007e ) ? i : i + ', '; } args;") +"); MYSTRING" ));
+
+new TestCase( SECTION,
+	      "MYSTRING.length",
+	      0x007f - 0x0020,
+	      MYSTRING.length );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.3.2-3.js b/js/src/tests/ecma/String/15.5.3.2-3.js
new file mode 100644
index 000000000..8a7312362
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.3.2-3.js
@@ -0,0 +1,87 @@
+/* -*- tab-width: 2; 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:          15.5.3.2-1.js
+   ECMA Section:       15.5.3.2  String.fromCharCode( char0, char1, ... )
+   Description:        Return a string value containing as many characters
+   as the number of arguments.  Each argument specifies
+   one character of the resulting string, with the first
+   argument specifying the first character, and so on,
+   from left to right.  An argument is converted to a
+   character by applying the operation ToUint16_t and
+   regarding the resulting 16bit integeras the Unicode
+   encoding of a character.  If no arguments are supplied,
+   the result is the empty string.
+
+   This test covers Basic Latin (range U+0020 - U+007F)
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+
+var SECTION = "15.5.3.2-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.fromCharCode()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+for ( CHARCODE = 0; CHARCODE < 256; CHARCODE++ ) {
+  new TestCase(   SECTION,
+		  "(String.fromCharCode(" + CHARCODE +")).charCodeAt(0)",
+		  ToUint16(CHARCODE),
+		  (String.fromCharCode(CHARCODE)).charCodeAt(0)
+    );
+}
+for ( CHARCODE = 256; CHARCODE < 65536; CHARCODE+=333 ) {
+  new TestCase(   SECTION,
+		  "(String.fromCharCode(" + CHARCODE +")).charCodeAt(0)",
+		  ToUint16(CHARCODE),
+		  (String.fromCharCode(CHARCODE)).charCodeAt(0)
+    );
+}
+for ( CHARCODE = 65535; CHARCODE < 65538; CHARCODE++ ) {
+  new TestCase(   SECTION,
+		  "(String.fromCharCode(" + CHARCODE +")).charCodeAt(0)",
+		  ToUint16(CHARCODE),
+		  (String.fromCharCode(CHARCODE)).charCodeAt(0)
+    );
+}
+for ( CHARCODE = Math.pow(2,32)-1; CHARCODE < Math.pow(2,32)+1; CHARCODE++ ) {
+  new TestCase(   SECTION,
+		  "(String.fromCharCode(" + CHARCODE +")).charCodeAt(0)",
+		  ToUint16(CHARCODE),
+		  (String.fromCharCode(CHARCODE)).charCodeAt(0)
+    );
+}
+for ( CHARCODE = 0; CHARCODE > -65536; CHARCODE-=3333 ) {
+  new TestCase(   SECTION,
+		  "(String.fromCharCode(" + CHARCODE +")).charCodeAt(0)",
+		  ToUint16(CHARCODE),
+		  (String.fromCharCode(CHARCODE)).charCodeAt(0)
+    );
+}
+new TestCase( SECTION, "(String.fromCharCode(65535)).charCodeAt(0)",    65535,  (String.fromCharCode(65535)).charCodeAt(0) );
+new TestCase( SECTION, "(String.fromCharCode(65536)).charCodeAt(0)",    0,      (String.fromCharCode(65536)).charCodeAt(0) );
+new TestCase( SECTION, "(String.fromCharCode(65537)).charCodeAt(0)",    1,      (String.fromCharCode(65537)).charCodeAt(0) );
+
+test();
+
+function ToUint16( num ) {
+  num = Number( num );
+  if ( isNaN( num ) || num == 0 || num == Number.POSITIVE_INFINITY || num == Number.NEGATIVE_INFINITY ) {
+    return 0;
+  }
+
+  var sign = ( num < 0 ) ? -1 : 1;
+
+  num = sign * Math.floor( Math.abs( num ) );
+  num = num % Math.pow(2,16);
+  num = ( num > -65536 && num < 0) ? 65536 + num : num;
+  return num;
+}
+
diff --git a/js/src/tests/ecma/String/15.5.3.js b/js/src/tests/ecma/String/15.5.3.js
new file mode 100644
index 000000000..097f15b85
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.3.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.5.3.1.js
+   ECMA Section:       15.5.3 Properties of the String Constructor
+
+   Description:	    The value of the internal [[Prototype]] property of
+   the String constructor is the Function prototype
+   object.
+
+   In addition to the internal [[Call]] and [[Construct]]
+   properties, the String constructor also has the length
+   property, as well as properties described in 15.5.3.1
+   and 15.5.3.2.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.3";
+var VERSION = "ECMA_2";
+startTest();
+var passed = true;
+writeHeaderToLog( SECTION + " Properties of the String Constructor" );
+
+new TestCase( SECTION,	"String.length",                1,                      String.length );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.1.js b/js/src/tests/ecma/String/15.5.4.1.js
new file mode 100644
index 000000000..4bc73fa8f
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.1.js
@@ -0,0 +1,29 @@
+/* -*- tab-width: 2; 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:          15.5.4.1.js
+   ECMA Section:       15.5.4.1 String.prototype.constructor
+
+   Description:
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.5.4.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "String.prototype.constructor == String",  true, String.prototype.constructor == String );
+
+new TestCase( SECTION, "var STRING = new String.prototype.constructor('hi'); STRING.getClass = Object.prototype.toString; STRING.getClass()",
+	      "[object String]",
+	      eval("var STRING = new String.prototype.constructor('hi'); STRING.getClass = Object.prototype.toString; STRING.getClass()") );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.10-1.js b/js/src/tests/ecma/String/15.5.4.10-1.js
new file mode 100644
index 000000000..90ad5f026
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.10-1.js
@@ -0,0 +1,181 @@
+/* -*- tab-width: 2; 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:          15.5.4.10-1.js
+   ECMA Section:       15.5.4.10 String.prototype.substring( start, end )
+   Description:
+
+   15.5.4.10 String.prototype.substring(start, end)
+
+   Returns a substring of the result of converting this object to a string,
+   starting from character position start and running to character position
+   end of the string. The result is a string value, not a String object.
+
+   If either argument is NaN or negative, it is replaced with zero; if either
+   argument is larger than the length of the string, it is replaced with the
+   length of the string.
+
+   If start is larger than end, they are swapped.
+
+   When the substring method is called with two arguments start and end, the
+   following steps are taken:
+
+   1.  Call ToString, giving it the this value as its argument.
+   2.  Call ToInteger(start).
+   3.  Call ToInteger (end).
+   4.  Compute the number of characters in Result(1).
+   5.  Compute min(max(Result(2), 0), Result(4)).
+   6.  Compute min(max(Result(3), 0), Result(4)).
+   7.  Compute min(Result(5), Result(6)).
+   8.  Compute max(Result(5), Result(6)).
+   9.  Return a string whose length is the difference between Result(8) and
+   Result(7), containing characters from Result(1), namely the characters
+   with indices Result(7) through Result(8)1, in ascending order.
+
+   Note that the substring function is intentionally generic; it does not require
+   that its this value be a String object. Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.10-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.substring( start, end )";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,  "String.prototype.substring.length",        2,          String.prototype.substring.length );
+
+// test cases for when substring is called with no arguments.
+
+// this is a string object
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); typeof s.substring()",
+		"string",
+		eval("var s = new String('this is a string object'); typeof s.substring()") );
+
+new TestCase(   SECTION,
+		"var s = new String(''); s.substring(1,0)",
+		"",
+		eval("var s = new String(''); s.substring(1,0)") );
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(true, false)",
+		"t",
+		eval("var s = new String('this is a string object'); s.substring(false, true)") );
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(NaN, Infinity)",
+		"this is a string object",
+		eval("var s = new String('this is a string object'); s.substring(NaN, Infinity)") );
+
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(Infinity, NaN)",
+		"this is a string object",
+		eval("var s = new String('this is a string object'); s.substring(Infinity, NaN)") );
+
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(Infinity, Infinity)",
+		"",
+		eval("var s = new String('this is a string object'); s.substring(Infinity, Infinity)") );
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(-0.01, 0)",
+		"",
+		eval("var s = new String('this is a string object'); s.substring(-0.01,0)") );
+
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(s.length, s.length)",
+		"",
+		eval("var s = new String('this is a string object'); s.substring(s.length, s.length)") );
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(s.length+1, 0)",
+		"this is a string object",
+		eval("var s = new String('this is a string object'); s.substring(s.length+1, 0)") );
+
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(-Infinity, -Infinity)",
+		"",
+		eval("var s = new String('this is a string object'); s.substring(-Infinity, -Infinity)") );
+
+// this is not a String object, start is not an integer
+
+
+new TestCase(   SECTION,
+		"var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring(Infinity,-Infinity)",
+		"1,2,3,4,5",
+		eval("var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring(Infinity,-Infinity)") );
+
+new TestCase(   SECTION,
+		"var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring(true, false)",
+		"1",
+		eval("var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring(true, false)") );
+
+new TestCase(   SECTION,
+		"var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring('4', '5')",
+		"3",
+		eval("var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring('4', '5')") );
+
+
+// this is an object object
+new TestCase(   SECTION,
+		"var obj = new Object(); obj.substring = String.prototype.substring; obj.substring(8,0)",
+		"[object ",
+		eval("var obj = new Object(); obj.substring = String.prototype.substring; obj.substring(8,0)") );
+
+new TestCase(   SECTION,
+		"var obj = new Object(); obj.substring = String.prototype.substring; obj.substring(8,obj.toString().length)",
+		"Object]",
+		eval("var obj = new Object(); obj.substring = String.prototype.substring; obj.substring(8, obj.toString().length)") );
+
+// this is a function object
+new TestCase(   SECTION,
+		"var obj = new Function(); obj.substring = String.prototype.substring; obj.toString = Object.prototype.toString; obj.substring(8, Infinity)",
+		"Function]",
+		eval("var obj = new Function(); obj.substring = String.prototype.substring; obj.toString = Object.prototype.toString; obj.substring(8,Infinity)") );
+// this is a number object
+new TestCase(   SECTION,
+		"var obj = new Number(NaN); obj.substring = String.prototype.substring; obj.substring(Infinity, NaN)",
+		"NaN",
+		eval("var obj = new Number(NaN); obj.substring = String.prototype.substring; obj.substring(Infinity, NaN)") );
+
+// this is the Math object
+new TestCase(   SECTION,
+		"var obj = Math; obj.substring = String.prototype.substring; obj.substring(Math.PI, -10)",
+		"[ob",
+		eval("var obj = Math; obj.substring = String.prototype.substring; obj.substring(Math.PI, -10)") );
+
+// this is a Boolean object
+
+new TestCase(   SECTION,
+		"var obj = new Boolean(); obj.substring = String.prototype.substring; obj.substring(new Array(), new Boolean(1))",
+		"f",
+		eval("var obj = new Boolean(); obj.substring = String.prototype.substring; obj.substring(new Array(), new Boolean(1))") );
+
+// this is a user defined object
+
+new TestCase( SECTION,
+	      "var obj = new MyObject( void 0 ); obj.substring(0, 100)",
+	      "undefined",
+	      eval( "var obj = new MyObject( void 0 ); obj.substring(0,100)") );
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.substring = String.prototype.substring;
+  this.toString = new Function ( "return this.value+''" );
+}
diff --git a/js/src/tests/ecma/String/15.5.4.11-1.js b/js/src/tests/ecma/String/15.5.4.11-1.js
new file mode 100644
index 000000000..08b1fa68d
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.11-1.js
@@ -0,0 +1,482 @@
+/* -*- tab-width: 2; 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:          15.5.4.11-1.js
+   ECMA Section:       15.5.4.11 String.prototype.toLowerCase()
+   Description:
+
+   Returns a string equal in length to the length of the result of converting
+   this object to a string. The result is a string value, not a String object.
+
+   Every character of the result is equal to the corresponding character of the
+   string, unless that character has a Unicode 2.0 uppercase equivalent, in which
+   case the uppercase equivalent is used instead. (The canonical Unicode 2.0 case
+   mapping shall be used, which does not depend on implementation or locale.)
+
+   Note that the toLowerCase function is intentionally generic; it does not require
+   that its this value be a String object. Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.11-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.toLowerCase()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,  "String.prototype.toLowerCase.length",        0,          String.prototype.toLowerCase.length );
+
+// Basic Latin, Latin-1 Supplement, Latin Extended A
+for ( var i = 0; i <= 0x017f; i++ ) {
+  var U = new Unicode(i);
+/*
+  new TestCase(   SECTION,
+  "var s = new String( String.fromCharCode("+i+") ); s.toLowerCase()",
+  String.fromCharCode(U.lower),
+  eval("var s = new String( String.fromCharCode("+i+") ); s.toLowerCase()") );
+*/
+  new TestCase(   SECTION,
+		  "var s = new String( String.fromCharCode("+i+") ); s.toLowerCase().charCodeAt(0)",
+		  U.lower,
+		  eval("var s = new String( String.fromCharCode(i) ); s.toLowerCase().charCodeAt(0)") );
+
+}
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.substring = String.prototype.substring;
+  this.toString = new Function ( "return this.value+''" );
+}
+function Unicode( c ) {
+  u = GetUnicodeValues( c );
+  this.upper = u[0];
+  this.lower = u[1]
+    return this;
+}
+function GetUnicodeValues( c ) {
+  u = new Array();
+
+  u[0] = c;
+  u[1] = c;
+
+  // upper case Basic Latin
+
+  if ( c >= 0x0041 && c <= 0x005A) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Basic Latin
+  if ( c >= 0x0061 && c <= 0x007a ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // upper case Latin-1 Supplement
+  if ( (c >= 0x00C0 && c <= 0x00D6) || (c >= 0x00D8 && c<=0x00DE) ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Latin-1 Supplement
+  if ( (c >= 0x00E0 && c <= 0x00F6) || (c >= 0x00F8 && c <= 0x00FE) ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+  if ( c == 0x00FF ) {
+    u[0] = 0x0178;
+    u[1] = c;
+    return u;
+  }
+  // Latin Extended A
+  if ( (c >= 0x0100 && c < 0x0138) || (c > 0x0149 && c < 0x0178) ) {
+    // special case for capital I
+    if ( c == 0x0130 ) {
+      u[0] = c;
+      u[1] = 0x0069;
+      return u;
+    }
+    if ( c == 0x0131 ) {
+      u[0] = 0x0049;
+      u[1] = c;
+      return u;
+    }
+
+    if ( c % 2 == 0 ) {
+      // if it's even, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's odd, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x0178 ) {
+    u[0] = c;
+    u[1] = 0x00FF;
+    return u;
+  }
+
+  if ( (c >= 0x0139 && c < 0x0149) || (c > 0x0178 && c < 0x017F) ) {
+    if ( c % 2 == 1 ) {
+      // if it's odd, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's even, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x017F ) {
+    u[0] = 0x0053;
+    u[1] = c;
+  }
+
+  // Latin Extended B
+  // need to improve this set
+
+  if ( c >= 0x0200 && c <= 0x0217 ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Latin Extended Additional
+  // Range: U+1E00 to U+1EFF
+  // http://www.unicode.org/Unicode.charts/glyphless/U1E00.html
+
+  // Spacing Modifier Leters
+  // Range: U+02B0 to U+02FF
+
+  // Combining Diacritical Marks
+  // Range: U+0300 to U+036F
+
+  // skip Greek for now
+  // Greek
+  // Range: U+0370 to U+03FF
+
+  // Cyrillic
+  // Range: U+0400 to U+04FF
+
+  if ( (c >= 0x0401 && c <= 0x040C) || ( c>= 0x040E && c <= 0x040F ) ) {
+    u[0] = c;
+    u[1] = c + 80;
+    return u;
+  }
+
+
+  if ( c >= 0x0410  && c <= 0x042F ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0x0430 && c<= 0x044F ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+
+  }
+  if ( (c >= 0x0451 && c <= 0x045C) || (c >=0x045E && c<= 0x045F) ) {
+    u[0] = c -80;
+    u[1] = c;
+    return u;
+  }
+
+  if ( c >= 0x0460 && c <= 0x047F ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c +1;
+    } else {
+      u[0] = c - 1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Armenian
+  // Range: U+0530 to U+058F
+  if ( c >= 0x0531 && c <= 0x0556 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x0561 && c < 0x0587 ) {
+    u[0] = c - 48;
+    u[1] = c;
+    return u;
+  }
+
+  // Hebrew
+  // Range: U+0590 to U+05FF
+
+
+  // Arabic
+  // Range: U+0600 to U+06FF
+
+  // Devanagari
+  // Range: U+0900 to U+097F
+
+
+  // Bengali
+  // Range: U+0980 to U+09FF
+
+
+  // Gurmukhi
+  // Range: U+0A00 to U+0A7F
+
+
+  // Gujarati
+  // Range: U+0A80 to U+0AFF
+
+
+  // Oriya
+  // Range: U+0B00 to U+0B7F
+  // no capital / lower case
+
+
+  // Tamil
+  // Range: U+0B80 to U+0BFF
+  // no capital / lower case
+
+
+  // Telugu
+  // Range: U+0C00 to U+0C7F
+  // no capital / lower case
+
+
+  // Kannada
+  // Range: U+0C80 to U+0CFF
+  // no capital / lower case
+
+
+  // Malayalam
+  // Range: U+0D00 to U+0D7F
+
+  // Thai
+  // Range: U+0E00 to U+0E7F
+
+
+  // Lao
+  // Range: U+0E80 to U+0EFF
+
+
+  // Tibetan
+  // Range: U+0F00 to U+0FBF
+
+  // Georgian
+  // Range: U+10A0 to U+10F0
+  if ( c >= 0x10A0 && c <= 0x10C5 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x10D0 && c <= 0x10F5 ) {
+    u[0] = c;
+    u[1] = c;
+    return u;
+  }
+
+  // Hangul Jamo
+  // Range: U+1100 to U+11FF
+
+  // Greek Extended
+  // Range: U+1F00 to U+1FFF
+  // skip for now
+
+
+  // General Punctuation
+  // Range: U+2000 to U+206F
+
+  // Superscripts and Subscripts
+  // Range: U+2070 to U+209F
+
+  // Currency Symbols
+  // Range: U+20A0 to U+20CF
+
+
+  // Combining Diacritical Marks for Symbols
+  // Range: U+20D0 to U+20FF
+  // skip for now
+
+
+  // Number Forms
+  // Range: U+2150 to U+218F
+  // skip for now
+
+
+  // Arrows
+  // Range: U+2190 to U+21FF
+
+  // Mathematical Operators
+  // Range: U+2200 to U+22FF
+
+  // Miscellaneous Technical
+  // Range: U+2300 to U+23FF
+
+  // Control Pictures
+  // Range: U+2400 to U+243F
+
+  // Optical Character Recognition
+  // Range: U+2440 to U+245F
+
+  // Enclosed Alphanumerics
+  // Range: U+2460 to U+24FF
+
+  // Box Drawing
+  // Range: U+2500 to U+257F
+
+  // Block Elements
+  // Range: U+2580 to U+259F
+
+  // Geometric Shapes
+  // Range: U+25A0 to U+25FF
+
+  // Miscellaneous Symbols
+  // Range: U+2600 to U+26FF
+
+  // Dingbats
+  // Range: U+2700 to U+27BF
+
+  // CJK Symbols and Punctuation
+  // Range: U+3000 to U+303F
+
+  // Hiragana
+  // Range: U+3040 to U+309F
+
+  // Katakana
+  // Range: U+30A0 to U+30FF
+
+  // Bopomofo
+  // Range: U+3100 to U+312F
+
+  // Hangul Compatibility Jamo
+  // Range: U+3130 to U+318F
+
+  // Kanbun
+  // Range: U+3190 to U+319F
+
+
+  // Enclosed CJK Letters and Months
+  // Range: U+3200 to U+32FF
+
+  // CJK Compatibility
+  // Range: U+3300 to U+33FF
+
+  // Hangul Syllables
+  // Range: U+AC00 to U+D7A3
+
+  // High Surrogates
+  // Range: U+D800 to U+DB7F
+
+  // Private Use High Surrogates
+  // Range: U+DB80 to U+DBFF
+
+  // Low Surrogates
+  // Range: U+DC00 to U+DFFF
+
+  // Private Use Area
+  // Range: U+E000 to U+F8FF
+
+  // CJK Compatibility Ideographs
+  // Range: U+F900 to U+FAFF
+
+  // Alphabetic Presentation Forms
+  // Range: U+FB00 to U+FB4F
+
+  // Arabic Presentation Forms-A
+  // Range: U+FB50 to U+FDFF
+
+  // Combining Half Marks
+  // Range: U+FE20 to U+FE2F
+
+  // CJK Compatibility Forms
+  // Range: U+FE30 to U+FE4F
+
+  // Small Form Variants
+  // Range: U+FE50 to U+FE6F
+
+  // Arabic Presentation Forms-B
+  // Range: U+FE70 to U+FEFF
+
+  // Halfwidth and Fullwidth Forms
+  // Range: U+FF00 to U+FFEF
+
+  if ( c >= 0xFF21 && c <= 0xFF3A ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0xFF41 && c <= 0xFF5A ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // Specials
+  // Range: U+FFF0 to U+FFFF
+
+  return u;
+}
+
+function DecimalToHexString( n ) {
+  n = Number( n );
+  var h = "0x";
+
+  for ( var i = 3; i >= 0; i-- ) {
+    if ( n >= Math.pow(16, i) ){
+      var t = Math.floor( n  / Math.pow(16, i));
+      n -= t * Math.pow(16, i);
+      if ( t >= 10 ) {
+	if ( t == 10 ) {
+	  h += "A";
+	}
+	if ( t == 11 ) {
+	  h += "B";
+	}
+	if ( t == 12 ) {
+	  h += "C";
+	}
+	if ( t == 13 ) {
+	  h += "D";
+	}
+	if ( t == 14 ) {
+	  h += "E";
+	}
+	if ( t == 15 ) {
+	  h += "F";
+	}
+      } else {
+	h += String( t );
+      }
+    } else {
+      h += "0";
+    }
+  }
+
+  return h;
+}
diff --git a/js/src/tests/ecma/String/15.5.4.11-3.js b/js/src/tests/ecma/String/15.5.4.11-3.js
new file mode 100644
index 000000000..d7fe9e02f
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.11-3.js
@@ -0,0 +1,480 @@
+/* -*- tab-width: 2; 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:          15.5.4.11-2.js
+   ECMA Section:       15.5.4.11 String.prototype.toLowerCase()
+   Description:
+
+   Returns a string equal in length to the length of the result of converting
+   this object to a string. The result is a string value, not a String object.
+
+   Every character of the result is equal to the corresponding character of the
+   string, unless that character has a Unicode 2.0 uppercase equivalent, in which
+   case the uppercase equivalent is used instead. (The canonical Unicode 2.0 case
+   mapping shall be used, which does not depend on implementation or locale.)
+
+   Note that the toLowerCase function is intentionally generic; it does not require
+   that its this value be a String object. Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.11-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.toLowerCase()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// Halfwidth and Fullwidth Forms
+// Range: U+FF00 to U+FFEF
+for ( var i = 0xFF00; i <= 0xFFEF; i++ ) {
+  var U = new Unicode(i);
+/*
+  new TestCase(   SECTION,
+  "var s = new String( String.fromCharCode("+i+") ); s.toLowerCase()",
+  String.fromCharCode(U.lower),
+  eval("var s = new String( String.fromCharCode("+i+") ); s.toLowerCase()") );
+*/
+  new TestCase(   SECTION,
+		  "var s = new String( String.fromCharCode("+i+") ); s.toLowerCase().charCodeAt(0)",
+		  U.lower,
+		  eval("var s = new String( String.fromCharCode(i) ); s.toLowerCase().charCodeAt(0)") );
+}
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.substring = String.prototype.substring;
+  this.toString = new Function ( "return this.value+''" );
+}
+function Unicode( c ) {
+  u = GetUnicodeValues( c );
+  this.upper = u[0];
+  this.lower = u[1]
+    return this;
+}
+function GetUnicodeValues( c ) {
+  u = new Array();
+
+  u[0] = c;
+  u[1] = c;
+
+  // upper case Basic Latin
+
+  if ( c >= 0x0041 && c <= 0x005A) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Basic Latin
+  if ( c >= 0x0061 && c <= 0x007a ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // upper case Latin-1 Supplement
+  if ( (c >= 0x00C0 && c <= 0x00D6) || (c >= 0x00D8 && c<=0x00DE) ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Latin-1 Supplement
+  if ( (c >= 0x00E0 && c <= 0x00F6) || (c >= 0x00F8 && c <= 0x00FE) ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+  if ( c == 0x00FF ) {
+    u[0] = 0x0178;
+    u[1] = c;
+    return u;
+  }
+  // Latin Extended A
+  if ( (c >= 0x0100 && c < 0x0138) || (c > 0x0149 && c < 0x0178) ) {
+    // special case for capital I
+    if ( c == 0x0130 ) {
+      u[0] = c;
+      u[1] = 0x0069;
+      return u;
+    }
+    if ( c == 0x0131 ) {
+      u[0] = 0x0049;
+      u[1] = c;
+      return u;
+    }
+
+    if ( c % 2 == 0 ) {
+      // if it's even, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's odd, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x0178 ) {
+    u[0] = c;
+    u[1] = 0x00FF;
+    return u;
+  }
+
+  if ( (c >= 0x0139 && c < 0x0149) || (c > 0x0178 && c < 0x017F) ) {
+    if ( c % 2 == 1 ) {
+      // if it's odd, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's even, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x017F ) {
+    u[0] = 0x0053;
+    u[1] = c;
+  }
+
+  // Latin Extended B
+  // need to improve this set
+
+  if ( c >= 0x0200 && c <= 0x0217 ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Latin Extended Additional
+  // Range: U+1E00 to U+1EFF
+  // http://www.unicode.org/Unicode.charts/glyphless/U1E00.html
+
+  // Spacing Modifier Leters
+  // Range: U+02B0 to U+02FF
+
+  // Combining Diacritical Marks
+  // Range: U+0300 to U+036F
+
+  // skip Greek for now
+  // Greek
+  // Range: U+0370 to U+03FF
+
+  // Cyrillic
+  // Range: U+0400 to U+04FF
+
+  if ( (c >= 0x0401 && c <= 0x040C) || ( c>= 0x040E && c <= 0x040F ) ) {
+    u[0] = c;
+    u[1] = c + 80;
+    return u;
+  }
+
+
+  if ( c >= 0x0410  && c <= 0x042F ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0x0430 && c<= 0x044F ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+
+  }
+  if ( (c >= 0x0451 && c <= 0x045C) || (c >=0x045E && c<= 0x045F) ) {
+    u[0] = c -80;
+    u[1] = c;
+    return u;
+  }
+
+  if ( c >= 0x0460 && c <= 0x047F ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c +1;
+    } else {
+      u[0] = c - 1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Armenian
+  // Range: U+0530 to U+058F
+  if ( c >= 0x0531 && c <= 0x0556 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x0561 && c < 0x0587 ) {
+    u[0] = c - 48;
+    u[1] = c;
+    return u;
+  }
+
+  // Hebrew
+  // Range: U+0590 to U+05FF
+
+
+  // Arabic
+  // Range: U+0600 to U+06FF
+
+  // Devanagari
+  // Range: U+0900 to U+097F
+
+
+  // Bengali
+  // Range: U+0980 to U+09FF
+
+
+  // Gurmukhi
+  // Range: U+0A00 to U+0A7F
+
+
+  // Gujarati
+  // Range: U+0A80 to U+0AFF
+
+
+  // Oriya
+  // Range: U+0B00 to U+0B7F
+  // no capital / lower case
+
+
+  // Tamil
+  // Range: U+0B80 to U+0BFF
+  // no capital / lower case
+
+
+  // Telugu
+  // Range: U+0C00 to U+0C7F
+  // no capital / lower case
+
+
+  // Kannada
+  // Range: U+0C80 to U+0CFF
+  // no capital / lower case
+
+
+  // Malayalam
+  // Range: U+0D00 to U+0D7F
+
+  // Thai
+  // Range: U+0E00 to U+0E7F
+
+
+  // Lao
+  // Range: U+0E80 to U+0EFF
+
+
+  // Tibetan
+  // Range: U+0F00 to U+0FBF
+
+  // Georgian
+  // Range: U+10A0 to U+10F0
+  if ( c >= 0x10A0 && c <= 0x10C5 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x10D0 && c <= 0x10F5 ) {
+    u[0] = c;
+    u[1] = c;
+    return u;
+  }
+
+  // Hangul Jamo
+  // Range: U+1100 to U+11FF
+
+  // Greek Extended
+  // Range: U+1F00 to U+1FFF
+  // skip for now
+
+
+  // General Punctuation
+  // Range: U+2000 to U+206F
+
+  // Superscripts and Subscripts
+  // Range: U+2070 to U+209F
+
+  // Currency Symbols
+  // Range: U+20A0 to U+20CF
+
+
+  // Combining Diacritical Marks for Symbols
+  // Range: U+20D0 to U+20FF
+  // skip for now
+
+
+  // Number Forms
+  // Range: U+2150 to U+218F
+  // skip for now
+
+
+  // Arrows
+  // Range: U+2190 to U+21FF
+
+  // Mathematical Operators
+  // Range: U+2200 to U+22FF
+
+  // Miscellaneous Technical
+  // Range: U+2300 to U+23FF
+
+  // Control Pictures
+  // Range: U+2400 to U+243F
+
+  // Optical Character Recognition
+  // Range: U+2440 to U+245F
+
+  // Enclosed Alphanumerics
+  // Range: U+2460 to U+24FF
+
+  // Box Drawing
+  // Range: U+2500 to U+257F
+
+  // Block Elements
+  // Range: U+2580 to U+259F
+
+  // Geometric Shapes
+  // Range: U+25A0 to U+25FF
+
+  // Miscellaneous Symbols
+  // Range: U+2600 to U+26FF
+
+  // Dingbats
+  // Range: U+2700 to U+27BF
+
+  // CJK Symbols and Punctuation
+  // Range: U+3000 to U+303F
+
+  // Hiragana
+  // Range: U+3040 to U+309F
+
+  // Katakana
+  // Range: U+30A0 to U+30FF
+
+  // Bopomofo
+  // Range: U+3100 to U+312F
+
+  // Hangul Compatibility Jamo
+  // Range: U+3130 to U+318F
+
+  // Kanbun
+  // Range: U+3190 to U+319F
+
+
+  // Enclosed CJK Letters and Months
+  // Range: U+3200 to U+32FF
+
+  // CJK Compatibility
+  // Range: U+3300 to U+33FF
+
+  // Hangul Syllables
+  // Range: U+AC00 to U+D7A3
+
+  // High Surrogates
+  // Range: U+D800 to U+DB7F
+
+  // Private Use High Surrogates
+  // Range: U+DB80 to U+DBFF
+
+  // Low Surrogates
+  // Range: U+DC00 to U+DFFF
+
+  // Private Use Area
+  // Range: U+E000 to U+F8FF
+
+  // CJK Compatibility Ideographs
+  // Range: U+F900 to U+FAFF
+
+  // Alphabetic Presentation Forms
+  // Range: U+FB00 to U+FB4F
+
+  // Arabic Presentation Forms-A
+  // Range: U+FB50 to U+FDFF
+
+  // Combining Half Marks
+  // Range: U+FE20 to U+FE2F
+
+  // CJK Compatibility Forms
+  // Range: U+FE30 to U+FE4F
+
+  // Small Form Variants
+  // Range: U+FE50 to U+FE6F
+
+  // Arabic Presentation Forms-B
+  // Range: U+FE70 to U+FEFF
+
+  // Halfwidth and Fullwidth Forms
+  // Range: U+FF00 to U+FFEF
+
+  if ( c >= 0xFF21 && c <= 0xFF3A ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0xFF41 && c <= 0xFF5A ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // Specials
+  // Range: U+FFF0 to U+FFFF
+
+  return u;
+}
+
+function DecimalToHexString( n ) {
+  n = Number( n );
+  var h = "0x";
+
+  for ( var i = 3; i >= 0; i-- ) {
+    if ( n >= Math.pow(16, i) ){
+      var t = Math.floor( n  / Math.pow(16, i));
+      n -= t * Math.pow(16, i);
+      if ( t >= 10 ) {
+	if ( t == 10 ) {
+	  h += "A";
+	}
+	if ( t == 11 ) {
+	  h += "B";
+	}
+	if ( t == 12 ) {
+	  h += "C";
+	}
+	if ( t == 13 ) {
+	  h += "D";
+	}
+	if ( t == 14 ) {
+	  h += "E";
+	}
+	if ( t == 15 ) {
+	  h += "F";
+	}
+      } else {
+	h += String( t );
+      }
+    } else {
+      h += "0";
+    }
+  }
+
+  return h;
+}
diff --git a/js/src/tests/ecma/String/15.5.4.11-4.js b/js/src/tests/ecma/String/15.5.4.11-4.js
new file mode 100644
index 000000000..f51116ca0
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.11-4.js
@@ -0,0 +1,473 @@
+/* -*- tab-width: 2; 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:          15.5.4.11-2.js
+   ECMA Section:       15.5.4.11 String.prototype.toLowerCase()
+   Description:
+
+   Returns a string equal in length to the length of the result of converting
+   this object to a string. The result is a string value, not a String object.
+
+   Every character of the result is equal to the corresponding character of the
+   string, unless that character has a Unicode 2.0 uppercase equivalent, in which
+   case the uppercase equivalent is used instead. (The canonical Unicode 2.0 case
+   mapping shall be used, which does not depend on implementation or locale.)
+
+   Note that the toLowerCase function is intentionally generic; it does not require
+   that its this value be a String object. Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.11-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.toLowerCase()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// Hiragana (no upper / lower case)
+// Range: U+3040 to U+309F
+
+for ( var i = 0x3040; i <= 0x309F; i++ ) {
+  var U = new Unicode( i );
+/*
+  new TestCase(   SECTION,
+  "var s = new String( String.fromCharCode("+i+") ); s.toLowerCase()",
+  String.fromCharCode(U.lower),
+  eval("var s = new String( String.fromCharCode("+i+") ); s.toLowerCase()") );
+*/
+  new TestCase(   SECTION,
+		  "var s = new String( String.fromCharCode("+i+") ); s.toLowerCase().charCodeAt(0)",
+		  U.lower,
+		  eval("var s = new String( String.fromCharCode(i) ); s.toLowerCase().charCodeAt(0)") );
+}
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.substring = String.prototype.substring;
+  this.toString = new Function ( "return this.value+''" );
+}
+function Unicode( c ) {
+  this.upper = c;
+  this.lower = c;
+
+  // upper case Basic Latin
+
+  if ( c >= 0x0041 && c <= 0x005A) {
+    this.upper = c;
+    this.lower = c + 32;
+    return this;
+  }
+
+  // lower case Basic Latin
+  if ( c >= 0x0061 && c <= 0x007a ) {
+    this.upper = c - 32;
+    this.lower = c;
+    return this;
+  }
+
+  // upper case Latin-1 Supplement
+  if ( (c >= 0x00C0 && c <= 0x00D6) || (c >= 0x00D8 && c<=0x00DE) ) {
+    this.upper = c;
+    this.lower = c + 32;
+    return this;
+  }
+
+  // lower case Latin-1 Supplement
+  if ( (c >= 0x00E0 && c <= 0x00F6) || (c >= 0x00F8 && c <= 0x00FE) ) {
+    this.upper = c - 32;
+    this.lower = c;
+    return this;
+  }
+  if ( c == 0x00FF ) {
+    this.upper = 0x0178;
+    this.lower = c;
+    return this;
+  }
+  // Latin Extended A
+  if ( (c >= 0x0100 && c < 0x0138) || (c > 0x0149 && c < 0x0178) ) {
+    // special case for capital I
+    if ( c == 0x0130 ) {
+      this.upper = c;
+      this.lower = 0x0069;
+      return this;
+    }
+    if ( c == 0x0131 ) {
+      this.upper = 0x0049;
+      this.lower = c;
+      return this;
+    }
+
+    if ( c % 2 == 0 ) {
+      // if it's even, it's a capital and the lower case is c +1
+      this.upper = c;
+      this.lower = c+1;
+    } else {
+      // if it's odd, it's a lower case and upper case is c-1
+      this.upper = c-1;
+      this.lower = c;
+    }
+    return this;
+  }
+  if ( c == 0x0178 ) {
+    this.upper = c;
+    this.lower = 0x00FF;
+    return this;
+  }
+
+  if ( (c >= 0x0139 && c < 0x0149) || (c > 0x0178 && c < 0x017F) ) {
+    if ( c % 2 == 1 ) {
+      // if it's odd, it's a capital and the lower case is c +1
+      this.upper = c;
+      this.lower = c+1;
+    } else {
+      // if it's even, it's a lower case and upper case is c-1
+      this.upper = c-1;
+      this.lower = c;
+    }
+    return this;
+  }
+  if ( c == 0x017F ) {
+    this.upper = 0x0053;
+    this.lower = c;
+  }
+
+  // Latin Extended B
+  // need to improve this set
+
+  if ( c >= 0x0200 && c <= 0x0217 ) {
+    if ( c % 2 == 0 ) {
+      this.upper = c;
+      this.lower = c+1;
+    } else {
+      this.upper = c-1;
+      this.lower = c;
+    }
+    return this;
+  }
+
+  // Latin Extended Additional
+  // Range: U+1E00 to U+1EFF
+  // http://www.unicode.org/Unicode.charts/glyphless/U1E00.html
+
+  // Spacing Modifier Leters
+  // Range: U+02B0 to U+02FF
+
+  // Combining Diacritical Marks
+  // Range: U+0300 to U+036F
+
+  // skip Greek for now
+  // Greek
+  // Range: U+0370 to U+03FF
+
+  // Cyrillic
+  // Range: U+0400 to U+04FF
+
+  if ( (c >= 0x0401 && c <= 0x040C) || ( c>= 0x040E && c <= 0x040F ) ) {
+    this.upper = c;
+    this.lower = c + 80;
+    return this;
+  }
+
+
+  if ( c >= 0x0410  && c <= 0x042F ) {
+    this.upper = c;
+    this.lower = c + 32;
+    return this;
+  }
+
+  if ( c >= 0x0430 && c<= 0x044F ) {
+    this.upper = c - 32;
+    this.lower = c;
+    return this;
+
+  }
+  if ( (c >= 0x0451 && c <= 0x045C) || (c >=0x045E && c<= 0x045F) ) {
+    this.upper = c -80;
+    this.lower = c;
+    return this;
+  }
+
+  if ( c >= 0x0460 && c <= 0x047F ) {
+    if ( c % 2 == 0 ) {
+      this.upper = c;
+      this.lower = c +1;
+    } else {
+      this.upper = c - 1;
+      this.lower = c;
+    }
+    return this;
+  }
+
+  // Armenian
+  // Range: U+0530 to U+058F
+  if ( c >= 0x0531 && c <= 0x0556 ) {
+    this.upper = c;
+    this.lower = c + 48;
+    return this;
+  }
+  if ( c >= 0x0561 && c < 0x0587 ) {
+    this.upper = c - 48;
+    this.lower = c;
+    return this;
+  }
+
+  // Hebrew
+  // Range: U+0590 to U+05FF
+
+
+  // Arabic
+  // Range: U+0600 to U+06FF
+
+  // Devanagari
+  // Range: U+0900 to U+097F
+
+
+  // Bengali
+  // Range: U+0980 to U+09FF
+
+
+  // Gurmukhi
+  // Range: U+0A00 to U+0A7F
+
+
+  // Gujarati
+  // Range: U+0A80 to U+0AFF
+
+
+  // Oriya
+  // Range: U+0B00 to U+0B7F
+  // no capital / lower case
+
+
+  // Tamil
+  // Range: U+0B80 to U+0BFF
+  // no capital / lower case
+
+
+  // Telugu
+  // Range: U+0C00 to U+0C7F
+  // no capital / lower case
+
+
+  // Kannada
+  // Range: U+0C80 to U+0CFF
+  // no capital / lower case
+
+
+  // Malayalam
+  // Range: U+0D00 to U+0D7F
+
+  // Thai
+  // Range: U+0E00 to U+0E7F
+
+
+  // Lao
+  // Range: U+0E80 to U+0EFF
+
+
+  // Tibetan
+  // Range: U+0F00 to U+0FBF
+
+  // Georgian
+  // Range: U+10A0 to U+10F0
+  if ( c >= 0x10A0 && c <= 0x10C5 ) {
+    this.upper = c;
+    this.lower = c + 48;
+    return this;
+  }
+  if ( c >= 0x10D0 && c <= 0x10F5 ) {
+    this.upper = c;
+    this.lower = c;
+    return this;
+  }
+
+  // Hangul Jamo
+  // Range: U+1100 to U+11FF
+
+  // Greek Extended
+  // Range: U+1F00 to U+1FFF
+  // skip for now
+
+
+  // General Punctuation
+  // Range: U+2000 to U+206F
+
+  // Superscripts and Subscripts
+  // Range: U+2070 to U+209F
+
+  // Currency Symbols
+  // Range: U+20A0 to U+20CF
+
+
+  // Combining Diacritical Marks for Symbols
+  // Range: U+20D0 to U+20FF
+  // skip for now
+
+
+  // Number Forms
+  // Range: U+2150 to U+218F
+  // skip for now
+
+
+  // Arrows
+  // Range: U+2190 to U+21FF
+
+  // Mathematical Operators
+  // Range: U+2200 to U+22FF
+
+  // Miscellaneous Technical
+  // Range: U+2300 to U+23FF
+
+  // Control Pictures
+  // Range: U+2400 to U+243F
+
+  // Optical Character Recognition
+  // Range: U+2440 to U+245F
+
+  // Enclosed Alphanumerics
+  // Range: U+2460 to U+24FF
+
+  // Box Drawing
+  // Range: U+2500 to U+257F
+
+  // Block Elements
+  // Range: U+2580 to U+259F
+
+  // Geometric Shapes
+  // Range: U+25A0 to U+25FF
+
+  // Miscellaneous Symbols
+  // Range: U+2600 to U+26FF
+
+  // Dingbats
+  // Range: U+2700 to U+27BF
+
+  // CJK Symbols and Punctuation
+  // Range: U+3000 to U+303F
+
+  // Hiragana
+  // Range: U+3040 to U+309F
+
+  // Katakana
+  // Range: U+30A0 to U+30FF
+
+  // Bopomofo
+  // Range: U+3100 to U+312F
+
+  // Hangul Compatibility Jamo
+  // Range: U+3130 to U+318F
+
+  // Kanbun
+  // Range: U+3190 to U+319F
+
+
+  // Enclosed CJK Letters and Months
+  // Range: U+3200 to U+32FF
+
+  // CJK Compatibility
+  // Range: U+3300 to U+33FF
+
+  // Hangul Syllables
+  // Range: U+AC00 to U+D7A3
+
+  // High Surrogates
+  // Range: U+D800 to U+DB7F
+
+  // Private Use High Surrogates
+  // Range: U+DB80 to U+DBFF
+
+  // Low Surrogates
+  // Range: U+DC00 to U+DFFF
+
+  // Private Use Area
+  // Range: U+E000 to U+F8FF
+
+  // CJK Compatibility Ideographs
+  // Range: U+F900 to U+FAFF
+
+  // Alphabetic Presentation Forms
+  // Range: U+FB00 to U+FB4F
+
+  // Arabic Presentation Forms-A
+  // Range: U+FB50 to U+FDFF
+
+  // Combining Half Marks
+  // Range: U+FE20 to U+FE2F
+
+  // CJK Compatibility Forms
+  // Range: U+FE30 to U+FE4F
+
+  // Small Form Variants
+  // Range: U+FE50 to U+FE6F
+
+  // Arabic Presentation Forms-B
+  // Range: U+FE70 to U+FEFF
+
+  // Halfwidth and Fullwidth Forms
+  // Range: U+FF00 to U+FFEF
+
+  if ( c >= 0xFF21 && c <= 0xFF3A ) {
+    this.upper = c;
+    this.lower = c + 32;
+    return this;
+  }
+
+  if ( c >= 0xFF41 && c <= 0xFF5A ) {
+    this.upper = c - 32;
+    this.lower = c;
+    return this;
+  }
+
+  // Specials
+  // Range: U+FFF0 to U+FFFF
+
+  return this;
+}
+
+function DecimalToHexString( n ) {
+  n = Number( n );
+  var h = "0x";
+
+  for ( var i = 3; i >= 0; i-- ) {
+    if ( n >= Math.pow(16, i) ){
+      var t = Math.floor( n  / Math.pow(16, i));
+      n -= t * Math.pow(16, i);
+      if ( t >= 10 ) {
+	if ( t == 10 ) {
+	  h += "A";
+	}
+	if ( t == 11 ) {
+	  h += "B";
+	}
+	if ( t == 12 ) {
+	  h += "C";
+	}
+	if ( t == 13 ) {
+	  h += "D";
+	}
+	if ( t == 14 ) {
+	  h += "E";
+	}
+	if ( t == 15 ) {
+	  h += "F";
+	}
+      } else {
+	h += String( t );
+      }
+    } else {
+      h += "0";
+    }
+  }
+
+  return h;
+}
diff --git a/js/src/tests/ecma/String/15.5.4.11-6.js b/js/src/tests/ecma/String/15.5.4.11-6.js
new file mode 100644
index 000000000..8432e76fd
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.11-6.js
@@ -0,0 +1,482 @@
+/* -*- tab-width: 2; 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:          15.5.4.11-6.js
+   ECMA Section:       15.5.4.11 String.prototype.toLowerCase()
+   Description:
+
+   Returns a string equal in length to the length of the result of converting
+   this object to a string. The result is a string value, not a String object.
+
+   Every character of the result is equal to the corresponding character of the
+   string, unless that character has a Unicode 2.0 uppercase equivalent, in which
+   case the uppercase equivalent is used instead. (The canonical Unicode 2.0 case
+   mapping shall be used, which does not depend on implementation or locale.)
+
+   Note that the toLowerCase function is intentionally generic; it does not require
+   that its this value be a String object. Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.11-6";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.toLowerCase()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// Armenian
+// Range: U+0530 to U+058F
+for ( var i = 0x0530; i <= 0x058F; i++ ) {
+
+  var U = new Unicode( i );
+/*
+  new TestCase(   SECTION,
+  "var s = new String( String.fromCharCode("+i+") ); s.toLowerCase()",
+  String.fromCharCode(U.lower),
+  eval("var s = new String( String.fromCharCode("+i+") ); s.toLowerCase()") );
+*/
+  new TestCase(   SECTION,
+		  "var s = new String( String.fromCharCode("+i+") ); s.toLowerCase().charCodeAt(0)",
+		  U.lower,
+		  eval("var s = new String( String.fromCharCode(i) ); s.toLowerCase().charCodeAt(0)") );
+
+}
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.substring = String.prototype.substring;
+  this.toString = new Function ( "return this.value+''" );
+}
+function Unicode( c ) {
+  u = GetUnicodeValues( c );
+  this.upper = u[0];
+  this.lower = u[1]
+    return this;
+}
+function GetUnicodeValues( c ) {
+  u = new Array();
+
+  u[0] = c;
+  u[1] = c;
+
+  // upper case Basic Latin
+
+  if ( c >= 0x0041 && c <= 0x005A) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Basic Latin
+  if ( c >= 0x0061 && c <= 0x007a ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // upper case Latin-1 Supplement
+  if ( (c >= 0x00C0 && c <= 0x00D6) || (c >= 0x00D8 && c<=0x00DE) ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Latin-1 Supplement
+  if ( (c >= 0x00E0 && c <= 0x00F6) || (c >= 0x00F8 && c <= 0x00FE) ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+  if ( c == 0x00FF ) {
+    u[0] = 0x0178;
+    u[1] = c;
+    return u;
+  }
+  // Latin Extended A
+  if ( (c >= 0x0100 && c < 0x0138) || (c > 0x0149 && c < 0x0178) ) {
+    // special case for capital I
+    if ( c == 0x0130 ) {
+      u[0] = c;
+      u[1] = 0x0069;
+      return u;
+    }
+    if ( c == 0x0131 ) {
+      u[0] = 0x0049;
+      u[1] = c;
+      return u;
+    }
+
+    if ( c % 2 == 0 ) {
+      // if it's even, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's odd, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x0178 ) {
+    u[0] = c;
+    u[1] = 0x00FF;
+    return u;
+  }
+
+  if ( (c >= 0x0139 && c < 0x0149) || (c > 0x0178 && c < 0x017F) ) {
+    if ( c % 2 == 1 ) {
+      // if it's odd, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's even, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x017F ) {
+    u[0] = 0x0053;
+    u[1] = c;
+  }
+
+  // Latin Extended B
+  // need to improve this set
+
+  if ( c >= 0x0200 && c <= 0x0217 ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Latin Extended Additional
+  // Range: U+1E00 to U+1EFF
+  // http://www.unicode.org/Unicode.charts/glyphless/U1E00.html
+
+  // Spacing Modifier Leters
+  // Range: U+02B0 to U+02FF
+
+  // Combining Diacritical Marks
+  // Range: U+0300 to U+036F
+
+  // skip Greek for now
+  // Greek
+  // Range: U+0370 to U+03FF
+
+  // Cyrillic
+  // Range: U+0400 to U+04FF
+
+  if ( (c >= 0x0401 && c <= 0x040C) || ( c>= 0x040E && c <= 0x040F ) ) {
+    u[0] = c;
+    u[1] = c + 80;
+    return u;
+  }
+
+
+  if ( c >= 0x0410  && c <= 0x042F ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0x0430 && c<= 0x044F ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+
+  }
+  if ( (c >= 0x0451 && c <= 0x045C) || (c >=0x045E && c<= 0x045F) ) {
+    u[0] = c -80;
+    u[1] = c;
+    return u;
+  }
+
+  if ( c >= 0x0460 && c <= 0x047F ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c +1;
+    } else {
+      u[0] = c - 1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Armenian
+  // Range: U+0530 to U+058F
+  if ( c >= 0x0531 && c <= 0x0556 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x0561 && c < 0x0587 ) {
+    u[0] = c - 48;
+    u[1] = c;
+    return u;
+  }
+
+  // Hebrew
+  // Range: U+0590 to U+05FF
+
+
+  // Arabic
+  // Range: U+0600 to U+06FF
+
+  // Devanagari
+  // Range: U+0900 to U+097F
+
+
+  // Bengali
+  // Range: U+0980 to U+09FF
+
+
+  // Gurmukhi
+  // Range: U+0A00 to U+0A7F
+
+
+  // Gujarati
+  // Range: U+0A80 to U+0AFF
+
+
+  // Oriya
+  // Range: U+0B00 to U+0B7F
+  // no capital / lower case
+
+
+  // Tamil
+  // Range: U+0B80 to U+0BFF
+  // no capital / lower case
+
+
+  // Telugu
+  // Range: U+0C00 to U+0C7F
+  // no capital / lower case
+
+
+  // Kannada
+  // Range: U+0C80 to U+0CFF
+  // no capital / lower case
+
+
+  // Malayalam
+  // Range: U+0D00 to U+0D7F
+
+  // Thai
+  // Range: U+0E00 to U+0E7F
+
+
+  // Lao
+  // Range: U+0E80 to U+0EFF
+
+
+  // Tibetan
+  // Range: U+0F00 to U+0FBF
+
+  // Georgian
+  // Range: U+10A0 to U+10F0
+  if ( c >= 0x10A0 && c <= 0x10C5 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x10D0 && c <= 0x10F5 ) {
+    u[0] = c;
+    u[1] = c;
+    return u;
+  }
+
+  // Hangul Jamo
+  // Range: U+1100 to U+11FF
+
+  // Greek Extended
+  // Range: U+1F00 to U+1FFF
+  // skip for now
+
+
+  // General Punctuation
+  // Range: U+2000 to U+206F
+
+  // Superscripts and Subscripts
+  // Range: U+2070 to U+209F
+
+  // Currency Symbols
+  // Range: U+20A0 to U+20CF
+
+
+  // Combining Diacritical Marks for Symbols
+  // Range: U+20D0 to U+20FF
+  // skip for now
+
+
+  // Number Forms
+  // Range: U+2150 to U+218F
+  // skip for now
+
+
+  // Arrows
+  // Range: U+2190 to U+21FF
+
+  // Mathematical Operators
+  // Range: U+2200 to U+22FF
+
+  // Miscellaneous Technical
+  // Range: U+2300 to U+23FF
+
+  // Control Pictures
+  // Range: U+2400 to U+243F
+
+  // Optical Character Recognition
+  // Range: U+2440 to U+245F
+
+  // Enclosed Alphanumerics
+  // Range: U+2460 to U+24FF
+
+  // Box Drawing
+  // Range: U+2500 to U+257F
+
+  // Block Elements
+  // Range: U+2580 to U+259F
+
+  // Geometric Shapes
+  // Range: U+25A0 to U+25FF
+
+  // Miscellaneous Symbols
+  // Range: U+2600 to U+26FF
+
+  // Dingbats
+  // Range: U+2700 to U+27BF
+
+  // CJK Symbols and Punctuation
+  // Range: U+3000 to U+303F
+
+  // Hiragana
+  // Range: U+3040 to U+309F
+
+  // Katakana
+  // Range: U+30A0 to U+30FF
+
+  // Bopomofo
+  // Range: U+3100 to U+312F
+
+  // Hangul Compatibility Jamo
+  // Range: U+3130 to U+318F
+
+  // Kanbun
+  // Range: U+3190 to U+319F
+
+
+  // Enclosed CJK Letters and Months
+  // Range: U+3200 to U+32FF
+
+  // CJK Compatibility
+  // Range: U+3300 to U+33FF
+
+  // Hangul Syllables
+  // Range: U+AC00 to U+D7A3
+
+  // High Surrogates
+  // Range: U+D800 to U+DB7F
+
+  // Private Use High Surrogates
+  // Range: U+DB80 to U+DBFF
+
+  // Low Surrogates
+  // Range: U+DC00 to U+DFFF
+
+  // Private Use Area
+  // Range: U+E000 to U+F8FF
+
+  // CJK Compatibility Ideographs
+  // Range: U+F900 to U+FAFF
+
+  // Alphabetic Presentation Forms
+  // Range: U+FB00 to U+FB4F
+
+  // Arabic Presentation Forms-A
+  // Range: U+FB50 to U+FDFF
+
+  // Combining Half Marks
+  // Range: U+FE20 to U+FE2F
+
+  // CJK Compatibility Forms
+  // Range: U+FE30 to U+FE4F
+
+  // Small Form Variants
+  // Range: U+FE50 to U+FE6F
+
+  // Arabic Presentation Forms-B
+  // Range: U+FE70 to U+FEFF
+
+  // Halfwidth and Fullwidth Forms
+  // Range: U+FF00 to U+FFEF
+
+  if ( c >= 0xFF21 && c <= 0xFF3A ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0xFF41 && c <= 0xFF5A ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // Specials
+  // Range: U+FFF0 to U+FFFF
+
+  return u;
+}
+
+function DecimalToHexString( n ) {
+  n = Number( n );
+  var h = "0x";
+
+  for ( var i = 3; i >= 0; i-- ) {
+    if ( n >= Math.pow(16, i) ){
+      var t = Math.floor( n  / Math.pow(16, i));
+      n -= t * Math.pow(16, i);
+      if ( t >= 10 ) {
+	if ( t == 10 ) {
+	  h += "A";
+	}
+	if ( t == 11 ) {
+	  h += "B";
+	}
+	if ( t == 12 ) {
+	  h += "C";
+	}
+	if ( t == 13 ) {
+	  h += "D";
+	}
+	if ( t == 14 ) {
+	  h += "E";
+	}
+	if ( t == 15 ) {
+	  h += "F";
+	}
+      } else {
+	h += String( t );
+      }
+    } else {
+      h += "0";
+    }
+  }
+
+  return h;
+}
diff --git a/js/src/tests/ecma/String/15.5.4.12-2.js b/js/src/tests/ecma/String/15.5.4.12-2.js
new file mode 100644
index 000000000..476a6786f
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.12-2.js
@@ -0,0 +1,484 @@
+/* -*- tab-width: 2; 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:          15.5.4.12-2.js
+   ECMA Section:       15.5.4.12 String.prototype.toUpperCase()
+   Description:
+
+   Returns a string equal in length to the length of the result of converting
+   this object to a string. The result is a string value, not a String object.
+
+   Every character of the result is equal to the corresponding character of the
+   string, unless that character has a Unicode 2.0 uppercase equivalent, in which
+   case the uppercase equivalent is used instead. (The canonical Unicode 2.0 case
+   mapping shall be used, which does not depend on implementation or locale.)
+
+   Note that the toUpperCase function is intentionally generic; it does not require
+   that its this value be a String object. Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.12-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.toUpperCase()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var TEST_STRING = "";
+var EXPECT_STRING = "";
+
+// basic latin test
+
+for ( var i = 0; i < 0x007A; i++ ) {
+  var u = new Unicode(i);
+  TEST_STRING += String.fromCharCode(i);
+  EXPECT_STRING += String.fromCharCode( u.upper );
+}
+
+// don't print out the value of the strings since they contain control
+// characters that break the driver
+var isEqual = EXPECT_STRING == (new String( TEST_STRING )).toUpperCase();
+
+new TestCase( SECTION,
+	      "isEqual",
+	      true,
+	      isEqual);
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.substring = String.prototype.substring;
+  this.toString = new Function ( "return this.value+''" );
+}
+function Unicode( c ) {
+  u = GetUnicodeValues( c );
+  this.upper = u[0];
+  this.lower = u[1]
+    return this;
+}
+function GetUnicodeValues( c ) {
+  u = new Array();
+
+  u[0] = c;
+  u[1] = c;
+
+  // upper case Basic Latin
+
+  if ( c >= 0x0041 && c <= 0x005A) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Basic Latin
+  if ( c >= 0x0061 && c <= 0x007a ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // upper case Latin-1 Supplement
+  if ( (c >= 0x00C0 && c <= 0x00D6) || (c >= 0x00D8 && c<=0x00DE) ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Latin-1 Supplement
+  if ( (c >= 0x00E0 && c <= 0x00F6) || (c >= 0x00F8 && c <= 0x00FE) ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+  if ( c == 0x00FF ) {
+    u[0] = 0x0178;
+    u[1] = c;
+    return u;
+  }
+  // Latin Extended A
+  if ( (c >= 0x0100 && c < 0x0138) || (c > 0x0149 && c < 0x0178) ) {
+    // special case for capital I
+    if ( c == 0x0130 ) {
+      u[0] = c;
+      u[1] = 0x0069;
+      return u;
+    }
+    if ( c == 0x0131 ) {
+      u[0] = 0x0049;
+      u[1] = c;
+      return u;
+    }
+
+    if ( c % 2 == 0 ) {
+      // if it's even, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's odd, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x0178 ) {
+    u[0] = c;
+    u[1] = 0x00FF;
+    return u;
+  }
+
+  if ( (c >= 0x0139 && c < 0x0149) || (c > 0x0178 && c < 0x017F) ) {
+    if ( c % 2 == 1 ) {
+      // if it's odd, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's even, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x017F ) {
+    u[0] = 0x0053;
+    u[1] = c;
+  }
+
+  // Latin Extended B
+  // need to improve this set
+
+  if ( c >= 0x0200 && c <= 0x0217 ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Latin Extended Additional
+  // Range: U+1E00 to U+1EFF
+  // http://www.unicode.org/Unicode.charts/glyphless/U1E00.html
+
+  // Spacing Modifier Leters
+  // Range: U+02B0 to U+02FF
+
+  // Combining Diacritical Marks
+  // Range: U+0300 to U+036F
+
+  // skip Greek for now
+  // Greek
+  // Range: U+0370 to U+03FF
+
+  // Cyrillic
+  // Range: U+0400 to U+04FF
+
+  if ( (c >= 0x0401 && c <= 0x040C) || ( c>= 0x040E && c <= 0x040F ) ) {
+    u[0] = c;
+    u[1] = c + 80;
+    return u;
+  }
+
+
+  if ( c >= 0x0410  && c <= 0x042F ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0x0430 && c<= 0x044F ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+
+  }
+  if ( (c >= 0x0451 && c <= 0x045C) || (c >=0x045E && c<= 0x045F) ) {
+    u[0] = c -80;
+    u[1] = c;
+    return u;
+  }
+
+  if ( c >= 0x0460 && c <= 0x047F ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c +1;
+    } else {
+      u[0] = c - 1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Armenian
+  // Range: U+0530 to U+058F
+  if ( c >= 0x0531 && c <= 0x0556 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x0561 && c < 0x0587 ) {
+    u[0] = c - 48;
+    u[1] = c;
+    return u;
+  }
+
+  // Hebrew
+  // Range: U+0590 to U+05FF
+
+
+  // Arabic
+  // Range: U+0600 to U+06FF
+
+  // Devanagari
+  // Range: U+0900 to U+097F
+
+
+  // Bengali
+  // Range: U+0980 to U+09FF
+
+
+  // Gurmukhi
+  // Range: U+0A00 to U+0A7F
+
+
+  // Gujarati
+  // Range: U+0A80 to U+0AFF
+
+
+  // Oriya
+  // Range: U+0B00 to U+0B7F
+  // no capital / lower case
+
+
+  // Tamil
+  // Range: U+0B80 to U+0BFF
+  // no capital / lower case
+
+
+  // Telugu
+  // Range: U+0C00 to U+0C7F
+  // no capital / lower case
+
+
+  // Kannada
+  // Range: U+0C80 to U+0CFF
+  // no capital / lower case
+
+
+  // Malayalam
+  // Range: U+0D00 to U+0D7F
+
+  // Thai
+  // Range: U+0E00 to U+0E7F
+
+
+  // Lao
+  // Range: U+0E80 to U+0EFF
+
+
+  // Tibetan
+  // Range: U+0F00 to U+0FBF
+
+  // Georgian
+  // Range: U+10A0 to U+10F0
+  if ( c >= 0x10A0 && c <= 0x10C5 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x10D0 && c <= 0x10F5 ) {
+    u[0] = c;
+    u[1] = c;
+    return u;
+  }
+
+  // Hangul Jamo
+  // Range: U+1100 to U+11FF
+
+  // Greek Extended
+  // Range: U+1F00 to U+1FFF
+  // skip for now
+
+
+  // General Punctuation
+  // Range: U+2000 to U+206F
+
+  // Superscripts and Subscripts
+  // Range: U+2070 to U+209F
+
+  // Currency Symbols
+  // Range: U+20A0 to U+20CF
+
+
+  // Combining Diacritical Marks for Symbols
+  // Range: U+20D0 to U+20FF
+  // skip for now
+
+
+  // Number Forms
+  // Range: U+2150 to U+218F
+  // skip for now
+
+
+  // Arrows
+  // Range: U+2190 to U+21FF
+
+  // Mathematical Operators
+  // Range: U+2200 to U+22FF
+
+  // Miscellaneous Technical
+  // Range: U+2300 to U+23FF
+
+  // Control Pictures
+  // Range: U+2400 to U+243F
+
+  // Optical Character Recognition
+  // Range: U+2440 to U+245F
+
+  // Enclosed Alphanumerics
+  // Range: U+2460 to U+24FF
+
+  // Box Drawing
+  // Range: U+2500 to U+257F
+
+  // Block Elements
+  // Range: U+2580 to U+259F
+
+  // Geometric Shapes
+  // Range: U+25A0 to U+25FF
+
+  // Miscellaneous Symbols
+  // Range: U+2600 to U+26FF
+
+  // Dingbats
+  // Range: U+2700 to U+27BF
+
+  // CJK Symbols and Punctuation
+  // Range: U+3000 to U+303F
+
+  // Hiragana
+  // Range: U+3040 to U+309F
+
+  // Katakana
+  // Range: U+30A0 to U+30FF
+
+  // Bopomofo
+  // Range: U+3100 to U+312F
+
+  // Hangul Compatibility Jamo
+  // Range: U+3130 to U+318F
+
+  // Kanbun
+  // Range: U+3190 to U+319F
+
+
+  // Enclosed CJK Letters and Months
+  // Range: U+3200 to U+32FF
+
+  // CJK Compatibility
+  // Range: U+3300 to U+33FF
+
+  // Hangul Syllables
+  // Range: U+AC00 to U+D7A3
+
+  // High Surrogates
+  // Range: U+D800 to U+DB7F
+
+  // Private Use High Surrogates
+  // Range: U+DB80 to U+DBFF
+
+  // Low Surrogates
+  // Range: U+DC00 to U+DFFF
+
+  // Private Use Area
+  // Range: U+E000 to U+F8FF
+
+  // CJK Compatibility Ideographs
+  // Range: U+F900 to U+FAFF
+
+  // Alphabetic Presentation Forms
+  // Range: U+FB00 to U+FB4F
+
+  // Arabic Presentation Forms-A
+  // Range: U+FB50 to U+FDFF
+
+  // Combining Half Marks
+  // Range: U+FE20 to U+FE2F
+
+  // CJK Compatibility Forms
+  // Range: U+FE30 to U+FE4F
+
+  // Small Form Variants
+  // Range: U+FE50 to U+FE6F
+
+  // Arabic Presentation Forms-B
+  // Range: U+FE70 to U+FEFF
+
+  // Halfwidth and Fullwidth Forms
+  // Range: U+FF00 to U+FFEF
+
+  if ( c >= 0xFF21 && c <= 0xFF3A ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0xFF41 && c <= 0xFF5A ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // Specials
+  // Range: U+FFF0 to U+FFFF
+
+  return u;
+}
+
+function DecimalToHexString( n ) {
+  n = Number( n );
+  var h = "0x";
+
+  for ( var i = 3; i >= 0; i-- ) {
+    if ( n >= Math.pow(16, i) ){
+      var t = Math.floor( n  / Math.pow(16, i));
+      n -= t * Math.pow(16, i);
+      if ( t >= 10 ) {
+	if ( t == 10 ) {
+	  h += "A";
+	}
+	if ( t == 11 ) {
+	  h += "B";
+	}
+	if ( t == 12 ) {
+	  h += "C";
+	}
+	if ( t == 13 ) {
+	  h += "D";
+	}
+	if ( t == 14 ) {
+	  h += "E";
+	}
+	if ( t == 15 ) {
+	  h += "F";
+	}
+      } else {
+	h += String( t );
+      }
+    } else {
+      h += "0";
+    }
+  }
+
+  return h;
+}
+
diff --git a/js/src/tests/ecma/String/15.5.4.12-3.js b/js/src/tests/ecma/String/15.5.4.12-3.js
new file mode 100644
index 000000000..ea7a5d448
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.12-3.js
@@ -0,0 +1,525 @@
+/* -*- tab-width: 2; 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:          15.5.4.12-3.js
+   ECMA Section:       15.5.4.12 String.prototype.toUpperCase()
+   Description:
+
+   Returns a string equal in length to the length of the result of converting
+   this object to a string. The result is a string value, not a String object.
+
+   Every character of the result is equal to the corresponding character of the
+   string, unless that character has a Unicode 2.0 uppercase equivalent, in which
+   case the uppercase equivalent is used instead. (The canonical Unicode 2.0 case
+   mapping shall be used, which does not depend on implementation or locale.)
+
+   Note that the toUpperCase function is intentionally generic; it does not require
+   that its this value be a String object. Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.12-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.toUpperCase()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// Georgian
+// Range: U+10A0 to U+10FF
+for ( var i = 0x10A0; i <= 0x10FF; i++ ) {
+  var U = new Unicode( i );
+/*
+  new TestCase(   SECTION,
+  "var s = new String( String.fromCharCode("+i+") ); s.toUpperCase()",
+  String.fromCharCode(U.upper),
+  eval("var s = new String( String.fromCharCode("+i+") ); s.toUpperCase()") );
+*/
+  new TestCase(   SECTION,
+		  "var s = new String( String.fromCharCode("+i+") ); s.toUpperCase().charCodeAt(0)",
+		  U.upper,
+		  eval("var s = new String( String.fromCharCode(i) ); s.toUpperCase().charCodeAt(0)") );
+
+}
+
+// Halfwidth and Fullwidth Forms
+// Range: U+FF00 to U+FFEF
+for ( var i = 0xFF00; i <= 0xFFEF; i++ ) {
+  new TestCase(   SECTION,
+		  "var s = new String( String.fromCharCode("+i+") ); s.toUpperCase()",
+		  eval( "var u = new Unicode( i ); String.fromCharCode(u.upper)" ),
+		  eval("var s = new String( String.fromCharCode("+i+") ); s.toUpperCase()") );
+
+  new TestCase(   SECTION,
+		  "var s = new String( String.fromCharCode("+i+") ); s.toUpperCase().charCodeAt(0)",
+		  eval( "var u = new Unicode( i ); u.upper" ),
+		  eval("var s = new String( String.fromCharCode("+i+") ); s.toUpperCase().charCodeAt(0)") );
+}
+
+// Hiragana (no upper / lower case)
+// Range: U+3040 to U+309F
+
+for ( var i = 0x3040; i <= 0x309F; i++ ) {
+  new TestCase(   SECTION,
+		  "var s = new String( String.fromCharCode("+i+") ); s.toUpperCase()",
+		  eval( "var u = new Unicode( i ); String.fromCharCode(u.upper)" ),
+		  eval("var s = new String( String.fromCharCode("+i+") ); s.toUpperCase()") );
+
+  new TestCase(   SECTION,
+		  "var s = new String( String.fromCharCode("+i+") ); s.toUpperCase().charCodeAt(0)",
+		  eval( "var u = new Unicode( i ); u.upper" ),
+		  eval("var s = new String( String.fromCharCode("+i+") ); s.toUpperCase().charCodeAt(0)") );
+}
+
+
+/*
+  var TEST_STRING = "";
+  var EXPECT_STRING = "";
+
+  // basic latin test
+
+  for ( var i = 0; i < 0x007A; i++ ) {
+  var u = new Unicode(i);
+  TEST_STRING += String.fromCharCode(i);
+  EXPECT_STRING += String.fromCharCode( u.upper );
+  }
+*/
+
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.substring = String.prototype.substring;
+  this.toString = new Function ( "return this.value+''" );
+}
+function Unicode( c ) {
+  u = GetUnicodeValues( c );
+  this.upper = u[0];
+  this.lower = u[1]
+    return this;
+}
+function GetUnicodeValues( c ) {
+  u = new Array();
+
+  u[0] = c;
+  u[1] = c;
+
+  // upper case Basic Latin
+
+  if ( c >= 0x0041 && c <= 0x005A) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Basic Latin
+  if ( c >= 0x0061 && c <= 0x007a ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // upper case Latin-1 Supplement
+  if ( (c >= 0x00C0 && c <= 0x00D6) || (c >= 0x00D8 && c<=0x00DE) ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Latin-1 Supplement
+  if ( (c >= 0x00E0 && c <= 0x00F6) || (c >= 0x00F8 && c <= 0x00FE) ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+  if ( c == 0x00FF ) {
+    u[0] = 0x0178;
+    u[1] = c;
+    return u;
+  }
+  // Latin Extended A
+  if ( (c >= 0x0100 && c < 0x0138) || (c > 0x0149 && c < 0x0178) ) {
+    // special case for capital I
+    if ( c == 0x0130 ) {
+      u[0] = c;
+      u[1] = 0x0069;
+      return u;
+    }
+    if ( c == 0x0131 ) {
+      u[0] = 0x0049;
+      u[1] = c;
+      return u;
+    }
+
+    if ( c % 2 == 0 ) {
+      // if it's even, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's odd, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x0178 ) {
+    u[0] = c;
+    u[1] = 0x00FF;
+    return u;
+  }
+
+  if ( (c >= 0x0139 && c < 0x0149) || (c > 0x0178 && c < 0x017F) ) {
+    if ( c % 2 == 1 ) {
+      // if it's odd, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's even, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x017F ) {
+    u[0] = 0x0053;
+    u[1] = c;
+  }
+
+  // Latin Extended B
+  // need to improve this set
+
+  if ( c >= 0x0200 && c <= 0x0217 ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Latin Extended Additional
+  // Range: U+1E00 to U+1EFF
+  // http://www.unicode.org/Unicode.charts/glyphless/U1E00.html
+
+  // Spacing Modifier Leters
+  // Range: U+02B0 to U+02FF
+
+  // Combining Diacritical Marks
+  // Range: U+0300 to U+036F
+
+  // skip Greek for now
+  // Greek
+  // Range: U+0370 to U+03FF
+
+  // Cyrillic
+  // Range: U+0400 to U+04FF
+
+  if ( (c >= 0x0401 && c <= 0x040C) || ( c>= 0x040E && c <= 0x040F ) ) {
+    u[0] = c;
+    u[1] = c + 80;
+    return u;
+  }
+
+
+  if ( c >= 0x0410  && c <= 0x042F ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0x0430 && c<= 0x044F ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+
+  }
+  if ( (c >= 0x0451 && c <= 0x045C) || (c >=0x045E && c<= 0x045F) ) {
+    u[0] = c -80;
+    u[1] = c;
+    return u;
+  }
+
+  if ( c >= 0x0460 && c <= 0x047F ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c +1;
+    } else {
+      u[0] = c - 1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Armenian
+  // Range: U+0530 to U+058F
+  if ( c >= 0x0531 && c <= 0x0556 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x0561 && c < 0x0587 ) {
+    u[0] = c - 48;
+    u[1] = c;
+    return u;
+  }
+
+  // Hebrew
+  // Range: U+0590 to U+05FF
+
+
+  // Arabic
+  // Range: U+0600 to U+06FF
+
+  // Devanagari
+  // Range: U+0900 to U+097F
+
+
+  // Bengali
+  // Range: U+0980 to U+09FF
+
+
+  // Gurmukhi
+  // Range: U+0A00 to U+0A7F
+
+
+  // Gujarati
+  // Range: U+0A80 to U+0AFF
+
+
+  // Oriya
+  // Range: U+0B00 to U+0B7F
+  // no capital / lower case
+
+
+  // Tamil
+  // Range: U+0B80 to U+0BFF
+  // no capital / lower case
+
+
+  // Telugu
+  // Range: U+0C00 to U+0C7F
+  // no capital / lower case
+
+
+  // Kannada
+  // Range: U+0C80 to U+0CFF
+  // no capital / lower case
+
+
+  // Malayalam
+  // Range: U+0D00 to U+0D7F
+
+  // Thai
+  // Range: U+0E00 to U+0E7F
+
+
+  // Lao
+  // Range: U+0E80 to U+0EFF
+
+
+  // Tibetan
+  // Range: U+0F00 to U+0FBF
+
+  // Georgian
+  // Range: U+10A0 to U+10F0
+  if ( c >= 0x10A0 && c <= 0x10C5 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x10D0 && c <= 0x10F5 ) {
+    u[0] = c;
+    u[1] = c;
+    return u;
+  }
+
+  // Hangul Jamo
+  // Range: U+1100 to U+11FF
+
+  // Greek Extended
+  // Range: U+1F00 to U+1FFF
+  // skip for now
+
+
+  // General Punctuation
+  // Range: U+2000 to U+206F
+
+  // Superscripts and Subscripts
+  // Range: U+2070 to U+209F
+
+  // Currency Symbols
+  // Range: U+20A0 to U+20CF
+
+
+  // Combining Diacritical Marks for Symbols
+  // Range: U+20D0 to U+20FF
+  // skip for now
+
+
+  // Number Forms
+  // Range: U+2150 to U+218F
+  // skip for now
+
+
+  // Arrows
+  // Range: U+2190 to U+21FF
+
+  // Mathematical Operators
+  // Range: U+2200 to U+22FF
+
+  // Miscellaneous Technical
+  // Range: U+2300 to U+23FF
+
+  // Control Pictures
+  // Range: U+2400 to U+243F
+
+  // Optical Character Recognition
+  // Range: U+2440 to U+245F
+
+  // Enclosed Alphanumerics
+  // Range: U+2460 to U+24FF
+
+  // Box Drawing
+  // Range: U+2500 to U+257F
+
+  // Block Elements
+  // Range: U+2580 to U+259F
+
+  // Geometric Shapes
+  // Range: U+25A0 to U+25FF
+
+  // Miscellaneous Symbols
+  // Range: U+2600 to U+26FF
+
+  // Dingbats
+  // Range: U+2700 to U+27BF
+
+  // CJK Symbols and Punctuation
+  // Range: U+3000 to U+303F
+
+  // Hiragana
+  // Range: U+3040 to U+309F
+
+  // Katakana
+  // Range: U+30A0 to U+30FF
+
+  // Bopomofo
+  // Range: U+3100 to U+312F
+
+  // Hangul Compatibility Jamo
+  // Range: U+3130 to U+318F
+
+  // Kanbun
+  // Range: U+3190 to U+319F
+
+
+  // Enclosed CJK Letters and Months
+  // Range: U+3200 to U+32FF
+
+  // CJK Compatibility
+  // Range: U+3300 to U+33FF
+
+  // Hangul Syllables
+  // Range: U+AC00 to U+D7A3
+
+  // High Surrogates
+  // Range: U+D800 to U+DB7F
+
+  // Private Use High Surrogates
+  // Range: U+DB80 to U+DBFF
+
+  // Low Surrogates
+  // Range: U+DC00 to U+DFFF
+
+  // Private Use Area
+  // Range: U+E000 to U+F8FF
+
+  // CJK Compatibility Ideographs
+  // Range: U+F900 to U+FAFF
+
+  // Alphabetic Presentation Forms
+  // Range: U+FB00 to U+FB4F
+
+  // Arabic Presentation Forms-A
+  // Range: U+FB50 to U+FDFF
+
+  // Combining Half Marks
+  // Range: U+FE20 to U+FE2F
+
+  // CJK Compatibility Forms
+  // Range: U+FE30 to U+FE4F
+
+  // Small Form Variants
+  // Range: U+FE50 to U+FE6F
+
+  // Arabic Presentation Forms-B
+  // Range: U+FE70 to U+FEFF
+
+  // Halfwidth and Fullwidth Forms
+  // Range: U+FF00 to U+FFEF
+
+  if ( c >= 0xFF21 && c <= 0xFF3A ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0xFF41 && c <= 0xFF5A ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // Specials
+  // Range: U+FFF0 to U+FFFF
+
+  return u;
+}
+
+function DecimalToHexString( n ) {
+  n = Number( n );
+  var h = "0x";
+
+  for ( var i = 3; i >= 0; i-- ) {
+    if ( n >= Math.pow(16, i) ){
+      var t = Math.floor( n  / Math.pow(16, i));
+      n -= t * Math.pow(16, i);
+      if ( t >= 10 ) {
+	if ( t == 10 ) {
+	  h += "A";
+	}
+	if ( t == 11 ) {
+	  h += "B";
+	}
+	if ( t == 12 ) {
+	  h += "C";
+	}
+	if ( t == 13 ) {
+	  h += "D";
+	}
+	if ( t == 14 ) {
+	  h += "E";
+	}
+	if ( t == 15 ) {
+	  h += "F";
+	}
+      } else {
+	h += String( t );
+      }
+    } else {
+      h += "0";
+    }
+  }
+
+  return h;
+}
diff --git a/js/src/tests/ecma/String/15.5.4.12-5.js b/js/src/tests/ecma/String/15.5.4.12-5.js
new file mode 100644
index 000000000..505fadd0d
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.12-5.js
@@ -0,0 +1,481 @@
+/* -*- tab-width: 2; 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:          15.5.4.12-1.js
+   ECMA Section:       15.5.4.12 String.prototype.toUpperCase()
+   Description:
+
+   Returns a string equal in length to the length of the result of converting
+   this object to a string. The result is a string value, not a String object.
+
+   Every character of the result is equal to the corresponding character of the
+   string, unless that character has a Unicode 2.0 uppercase equivalent, in which
+   case the uppercase equivalent is used instead. (The canonical Unicode 2.0 case
+   mapping shall be used, which does not depend on implementation or locale.)
+
+   Note that the toUpperCase function is intentionally generic; it does not require
+   that its this value be a String object. Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.12-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.toUpperCase()";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// Armenian
+// Range: U+0530 to U+058F
+for ( var i = 0x0530; i <= 0x058F; i++ ) {
+  var U = new Unicode( i );
+/*
+  new TestCase(   SECTION,
+  "var s = new String( String.fromCharCode("+i+") ); s.toUpperCase()",
+  String.fromCharCode(U.upper),
+  eval("var s = new String( String.fromCharCode("+i+") ); s.toUpperCase()") );
+*/
+  new TestCase(   SECTION,
+		  "var s = new String( String.fromCharCode("+i+") ); s.toUpperCase().charCodeAt(0)",
+		  U.upper,
+		  eval("var s = new String( String.fromCharCode(i) ); s.toUpperCase().charCodeAt(0)") );
+
+}
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.substring = String.prototype.substring;
+  this.toString = new Function ( "return this.value+''" );
+}
+function Unicode( c ) {
+  u = GetUnicodeValues( c );
+  this.upper = u[0];
+  this.lower = u[1]
+    return this;
+}
+function GetUnicodeValues( c ) {
+  u = new Array();
+
+  u[0] = c;
+  u[1] = c;
+
+  // upper case Basic Latin
+
+  if ( c >= 0x0041 && c <= 0x005A) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Basic Latin
+  if ( c >= 0x0061 && c <= 0x007a ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // upper case Latin-1 Supplement
+  if ( (c >= 0x00C0 && c <= 0x00D6) || (c >= 0x00D8 && c<=0x00DE) ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  // lower case Latin-1 Supplement
+  if ( (c >= 0x00E0 && c <= 0x00F6) || (c >= 0x00F8 && c <= 0x00FE) ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+  if ( c == 0x00FF ) {
+    u[0] = 0x0178;
+    u[1] = c;
+    return u;
+  }
+  // Latin Extended A
+  if ( (c >= 0x0100 && c < 0x0138) || (c > 0x0149 && c < 0x0178) ) {
+    // special case for capital I
+    if ( c == 0x0130 ) {
+      u[0] = c;
+      u[1] = 0x0069;
+      return u;
+    }
+    if ( c == 0x0131 ) {
+      u[0] = 0x0049;
+      u[1] = c;
+      return u;
+    }
+
+    if ( c % 2 == 0 ) {
+      // if it's even, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's odd, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x0178 ) {
+    u[0] = c;
+    u[1] = 0x00FF;
+    return u;
+  }
+
+  if ( (c >= 0x0139 && c < 0x0149) || (c > 0x0178 && c < 0x017F) ) {
+    if ( c % 2 == 1 ) {
+      // if it's odd, it's a capital and the lower case is c +1
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      // if it's even, it's a lower case and upper case is c-1
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+  if ( c == 0x017F ) {
+    u[0] = 0x0053;
+    u[1] = c;
+  }
+
+  // Latin Extended B
+  // need to improve this set
+
+  if ( c >= 0x0200 && c <= 0x0217 ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c+1;
+    } else {
+      u[0] = c-1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Latin Extended Additional
+  // Range: U+1E00 to U+1EFF
+  // http://www.unicode.org/Unicode.charts/glyphless/U1E00.html
+
+  // Spacing Modifier Leters
+  // Range: U+02B0 to U+02FF
+
+  // Combining Diacritical Marks
+  // Range: U+0300 to U+036F
+
+  // skip Greek for now
+  // Greek
+  // Range: U+0370 to U+03FF
+
+  // Cyrillic
+  // Range: U+0400 to U+04FF
+
+  if ( (c >= 0x0401 && c <= 0x040C) || ( c>= 0x040E && c <= 0x040F ) ) {
+    u[0] = c;
+    u[1] = c + 80;
+    return u;
+  }
+
+
+  if ( c >= 0x0410  && c <= 0x042F ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0x0430 && c<= 0x044F ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+
+  }
+  if ( (c >= 0x0451 && c <= 0x045C) || (c >=0x045E && c<= 0x045F) ) {
+    u[0] = c -80;
+    u[1] = c;
+    return u;
+  }
+
+  if ( c >= 0x0460 && c <= 0x047F ) {
+    if ( c % 2 == 0 ) {
+      u[0] = c;
+      u[1] = c +1;
+    } else {
+      u[0] = c - 1;
+      u[1] = c;
+    }
+    return u;
+  }
+
+  // Armenian
+  // Range: U+0530 to U+058F
+  if ( c >= 0x0531 && c <= 0x0556 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x0561 && c < 0x0587 ) {
+    u[0] = c - 48;
+    u[1] = c;
+    return u;
+  }
+
+  // Hebrew
+  // Range: U+0590 to U+05FF
+
+
+  // Arabic
+  // Range: U+0600 to U+06FF
+
+  // Devanagari
+  // Range: U+0900 to U+097F
+
+
+  // Bengali
+  // Range: U+0980 to U+09FF
+
+
+  // Gurmukhi
+  // Range: U+0A00 to U+0A7F
+
+
+  // Gujarati
+  // Range: U+0A80 to U+0AFF
+
+
+  // Oriya
+  // Range: U+0B00 to U+0B7F
+  // no capital / lower case
+
+
+  // Tamil
+  // Range: U+0B80 to U+0BFF
+  // no capital / lower case
+
+
+  // Telugu
+  // Range: U+0C00 to U+0C7F
+  // no capital / lower case
+
+
+  // Kannada
+  // Range: U+0C80 to U+0CFF
+  // no capital / lower case
+
+
+  // Malayalam
+  // Range: U+0D00 to U+0D7F
+
+  // Thai
+  // Range: U+0E00 to U+0E7F
+
+
+  // Lao
+  // Range: U+0E80 to U+0EFF
+
+
+  // Tibetan
+  // Range: U+0F00 to U+0FBF
+
+  // Georgian
+  // Range: U+10A0 to U+10F0
+  if ( c >= 0x10A0 && c <= 0x10C5 ) {
+    u[0] = c;
+    u[1] = c + 48;
+    return u;
+  }
+  if ( c >= 0x10D0 && c <= 0x10F5 ) {
+    u[0] = c;
+    u[1] = c;
+    return u;
+  }
+
+  // Hangul Jamo
+  // Range: U+1100 to U+11FF
+
+  // Greek Extended
+  // Range: U+1F00 to U+1FFF
+  // skip for now
+
+
+  // General Punctuation
+  // Range: U+2000 to U+206F
+
+  // Superscripts and Subscripts
+  // Range: U+2070 to U+209F
+
+  // Currency Symbols
+  // Range: U+20A0 to U+20CF
+
+
+  // Combining Diacritical Marks for Symbols
+  // Range: U+20D0 to U+20FF
+  // skip for now
+
+
+  // Number Forms
+  // Range: U+2150 to U+218F
+  // skip for now
+
+
+  // Arrows
+  // Range: U+2190 to U+21FF
+
+  // Mathematical Operators
+  // Range: U+2200 to U+22FF
+
+  // Miscellaneous Technical
+  // Range: U+2300 to U+23FF
+
+  // Control Pictures
+  // Range: U+2400 to U+243F
+
+  // Optical Character Recognition
+  // Range: U+2440 to U+245F
+
+  // Enclosed Alphanumerics
+  // Range: U+2460 to U+24FF
+
+  // Box Drawing
+  // Range: U+2500 to U+257F
+
+  // Block Elements
+  // Range: U+2580 to U+259F
+
+  // Geometric Shapes
+  // Range: U+25A0 to U+25FF
+
+  // Miscellaneous Symbols
+  // Range: U+2600 to U+26FF
+
+  // Dingbats
+  // Range: U+2700 to U+27BF
+
+  // CJK Symbols and Punctuation
+  // Range: U+3000 to U+303F
+
+  // Hiragana
+  // Range: U+3040 to U+309F
+
+  // Katakana
+  // Range: U+30A0 to U+30FF
+
+  // Bopomofo
+  // Range: U+3100 to U+312F
+
+  // Hangul Compatibility Jamo
+  // Range: U+3130 to U+318F
+
+  // Kanbun
+  // Range: U+3190 to U+319F
+
+
+  // Enclosed CJK Letters and Months
+  // Range: U+3200 to U+32FF
+
+  // CJK Compatibility
+  // Range: U+3300 to U+33FF
+
+  // Hangul Syllables
+  // Range: U+AC00 to U+D7A3
+
+  // High Surrogates
+  // Range: U+D800 to U+DB7F
+
+  // Private Use High Surrogates
+  // Range: U+DB80 to U+DBFF
+
+  // Low Surrogates
+  // Range: U+DC00 to U+DFFF
+
+  // Private Use Area
+  // Range: U+E000 to U+F8FF
+
+  // CJK Compatibility Ideographs
+  // Range: U+F900 to U+FAFF
+
+  // Alphabetic Presentation Forms
+  // Range: U+FB00 to U+FB4F
+
+  // Arabic Presentation Forms-A
+  // Range: U+FB50 to U+FDFF
+
+  // Combining Half Marks
+  // Range: U+FE20 to U+FE2F
+
+  // CJK Compatibility Forms
+  // Range: U+FE30 to U+FE4F
+
+  // Small Form Variants
+  // Range: U+FE50 to U+FE6F
+
+  // Arabic Presentation Forms-B
+  // Range: U+FE70 to U+FEFF
+
+  // Halfwidth and Fullwidth Forms
+  // Range: U+FF00 to U+FFEF
+
+  if ( c >= 0xFF21 && c <= 0xFF3A ) {
+    u[0] = c;
+    u[1] = c + 32;
+    return u;
+  }
+
+  if ( c >= 0xFF41 && c <= 0xFF5A ) {
+    u[0] = c - 32;
+    u[1] = c;
+    return u;
+  }
+
+  // Specials
+  // Range: U+FFF0 to U+FFFF
+
+  return u;
+}
+
+function DecimalToHexString( n ) {
+  n = Number( n );
+  var h = "0x";
+
+  for ( var i = 3; i >= 0; i-- ) {
+    if ( n >= Math.pow(16, i) ){
+      var t = Math.floor( n  / Math.pow(16, i));
+      n -= t * Math.pow(16, i);
+      if ( t >= 10 ) {
+	if ( t == 10 ) {
+	  h += "A";
+	}
+	if ( t == 11 ) {
+	  h += "B";
+	}
+	if ( t == 12 ) {
+	  h += "C";
+	}
+	if ( t == 13 ) {
+	  h += "D";
+	}
+	if ( t == 14 ) {
+	  h += "E";
+	}
+	if ( t == 15 ) {
+	  h += "F";
+	}
+      } else {
+	h += String( t );
+      }
+    } else {
+      h += "0";
+    }
+  }
+
+  return h;
+}
diff --git a/js/src/tests/ecma/String/15.5.4.2-1.js b/js/src/tests/ecma/String/15.5.4.2-1.js
new file mode 100644
index 000000000..1dc7e118a
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.2-1.js
@@ -0,0 +1,38 @@
+/* -*- 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:          15.5.4.2-1.js
+   ECMA Section:       15.5.4.2 String.prototype.toString()
+
+   Description:        Returns this string value.  Note that, for a String
+   object, the toString() method happens to return the same
+   thing as the valueOf() method.
+
+   The toString function is not generic; it generates a
+   runtime error if its this value is not a String object.
+   Therefore it connot be transferred to the other kinds of
+   objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.4.2-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.toString";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,   "String.prototype.toString()",        "",     String.prototype.toString() );
+new TestCase( SECTION,   "(new String()).toString()",          "",     (new String()).toString() );
+new TestCase( SECTION,   "(new String(\"\")).toString()",      "",     (new String("")).toString() );
+new TestCase( SECTION,   "(new String( String() )).toString()","",    (new String(String())).toString() );
+new TestCase( SECTION,  "(new String( \"h e l l o\" )).toString()",       "h e l l o",    (new String("h e l l o")).toString() );
+new TestCase( SECTION,   "(new String( 0 )).toString()",       "0",    (new String(0)).toString() );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.2-2-n.js b/js/src/tests/ecma/String/15.5.4.2-2-n.js
new file mode 100644
index 000000000..61b26ca07
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.2-2-n.js
@@ -0,0 +1,39 @@
+/* -*- tab-width: 2; 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:          15.5.4.2-2-n.js
+   ECMA Section:       15.5.4.2 String.prototype.toString()
+
+   Description:        Returns this string value.  Note that, for a String
+   object, the toString() method happens to return the same
+   thing as the valueOf() method.
+
+   The toString function is not generic; it generates a
+   runtime error if its this value is not a String object.
+   Therefore it connot be transferred to the other kinds of
+   objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.4.2-3-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.toString";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var tostr=String.prototype.toString; astring=new Number(); astring.toString = tostr; astring.toString()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "var tostr=String.prototype.toString; astring=new Number(); astring.toString = tostr; astring.toString()",
+	      "error",
+	      eval("var tostr=String.prototype.toString; astring=new Number(); astring.toString = tostr; astring.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.2-3.js b/js/src/tests/ecma/String/15.5.4.2-3.js
new file mode 100644
index 000000000..3c28c8a32
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.2-3.js
@@ -0,0 +1,49 @@
+/* -*- tab-width: 2; 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:          15.5.4.2-3.js
+   ECMA Section:       15.5.4.2 String.prototype.toString()
+
+   Description:        Returns this string value.  Note that, for a String
+   object, the toString() method happens to return the same
+   thing as the valueOf() method.
+
+   The toString function is not generic; it generates a
+   runtime error if its this value is not a String object.
+   Therefore it connot be transferred to the other kinds of
+   objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+
+var SECTION = "15.5.4.2-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.toString";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "var tostr=String.prototype.toString; astring=new String(); astring.toString = tostr; astring.toString()",
+	      "",
+	      eval("var tostr=String.prototype.toString; astring=new String(); astring.toString = tostr; astring.toString()") );
+new TestCase( SECTION,
+	      "var tostr=String.prototype.toString; astring=new String(0); astring.toString = tostr; astring.toString()",
+	      "0",
+	      eval("var tostr=String.prototype.toString; astring=new String(0); astring.toString = tostr; astring.toString()") );
+new TestCase( SECTION,
+	      "var tostr=String.prototype.toString; astring=new String('hello'); astring.toString = tostr; astring.toString()",
+	      "hello",
+	      eval("var tostr=String.prototype.toString; astring=new String('hello'); astring.toString = tostr; astring.toString()") );
+new TestCase( SECTION,
+	      "var tostr=String.prototype.toString; astring=new String(''); astring.toString = tostr; astring.toString()",
+	      "",
+	      eval("var tostr=String.prototype.toString; astring=new String(''); astring.toString = tostr; astring.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.2.js b/js/src/tests/ecma/String/15.5.4.2.js
new file mode 100644
index 000000000..e431e0277
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.2.js
@@ -0,0 +1,53 @@
+/* -*- tab-width: 2; 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:          15.5.4.2.js
+   ECMA Section:       15.5.4.2 String.prototype.toString
+
+   Description:
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.5.4.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.tostring";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"String.prototype.toString() == String.prototype.valueOf()",
+		true,
+		String.prototype.toString() == String.prototype.valueOf() );
+
+new TestCase(   SECTION, "String.prototype.toString()",     "",     String.prototype.toString() );
+new TestCase(   SECTION, "String.prototype.toString.length",    0,  String.prototype.toString.length );
+
+
+new TestCase(   SECTION,
+		"TESTSTRING = new String();TESTSTRING.valueOf() == TESTSTRING.toString()",
+		true,
+		eval("TESTSTRING = new String();TESTSTRING.valueOf() == TESTSTRING.toString()") );
+new TestCase(   SECTION,
+		"TESTSTRING = new String(true);TESTSTRING.valueOf() == TESTSTRING.toString()",
+		true,
+		eval("TESTSTRING = new String(true);TESTSTRING.valueOf() == TESTSTRING.toString()") );
+new TestCase(   SECTION,
+		"TESTSTRING = new String(false);TESTSTRING.valueOf() == TESTSTRING.toString()",
+		true,
+		eval("TESTSTRING = new String(false);TESTSTRING.valueOf() == TESTSTRING.toString()") );
+new TestCase(   SECTION,
+		"TESTSTRING = new String(Math.PI);TESTSTRING.valueOf() == TESTSTRING.toString()",
+		true,
+		eval("TESTSTRING = new String(Math.PI);TESTSTRING.valueOf() == TESTSTRING.toString()") );
+new TestCase(   SECTION,
+		"TESTSTRING = new String();TESTSTRING.valueOf() == TESTSTRING.toString()",
+		true,
+		eval("TESTSTRING = new String();TESTSTRING.valueOf() == TESTSTRING.toString()") );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.3-1.js b/js/src/tests/ecma/String/15.5.4.3-1.js
new file mode 100644
index 000000000..c52bc2830
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.3-1.js
@@ -0,0 +1,38 @@
+/* -*- 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:          15.5.4.3-1.js
+   ECMA Section:       15.5.4.3 String.prototype.valueOf()
+
+   Description:        Returns this string value.
+
+   The valueOf function is not generic; it generates a
+   runtime error if its this value is not a String object.
+   Therefore it connot be transferred to the other kinds of
+   objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.4.3-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.valueOf";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,   "String.prototype.valueOf.length", 0,      String.prototype.valueOf.length );
+
+new TestCase( SECTION,   "String.prototype.valueOf()",        "",     String.prototype.valueOf() );
+new TestCase( SECTION,   "(new String()).valueOf()",          "",     (new String()).valueOf() );
+new TestCase( SECTION,   "(new String(\"\")).valueOf()",      "",     (new String("")).valueOf() );
+new TestCase( SECTION,   "(new String( String() )).valueOf()","",    (new String(String())).valueOf() );
+new TestCase( SECTION,   "(new String( \"h e l l o\" )).valueOf()",       "h e l l o",    (new String("h e l l o")).valueOf() );
+new TestCase( SECTION,   "(new String( 0 )).valueOf()",       "0",    (new String(0)).valueOf() );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.3-2.js b/js/src/tests/ecma/String/15.5.4.3-2.js
new file mode 100644
index 000000000..d1a3774e8
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.3-2.js
@@ -0,0 +1,56 @@
+/* -*- tab-width: 2; 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:          15.5.4.3-2.js
+   ECMA Section:       15.5.4.3 String.prototype.valueOf()
+
+   Description:        Returns this string value.
+
+   The valueOf function is not generic; it generates a
+   runtime error if its this value is not a String object.
+   Therefore it connot be transferred to the other kinds of
+   objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+
+var SECTION = "15.5.4.3-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.valueOf";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "var valof=String.prototype.valueOf; astring=new String(); astring.valueOf = valof; astring.valof()",
+	      "",
+	      eval("var valof=String.prototype.valueOf; astring=new String(); astring.valueOf = valof; astring.valueOf()") );
+
+new TestCase( SECTION,
+	      "var valof=String.prototype.valueOf; astring=new String(0); astring.valueOf = valof; astring.valof()",
+	      "0",
+	      eval("var valof=String.prototype.valueOf; astring=new String(0); astring.valueOf = valof; astring.valueOf()") );
+
+new TestCase( SECTION,
+	      "var valof=String.prototype.valueOf; astring=new String('hello'); astring.valueOf = valof; astring.valof()",
+	      "hello",
+	      eval("var valof=String.prototype.valueOf; astring=new String('hello'); astring.valueOf = valof; astring.valueOf()") );
+
+new TestCase( SECTION,
+	      "var valof=String.prototype.valueOf; astring=new String(''); astring.valueOf = valof; astring.valof()",
+	      "",
+	      eval("var valof=String.prototype.valueOf; astring=new String(''); astring.valueOf = valof; astring.valueOf()") );
+/*
+  new TestCase( SECTION,
+  "var valof=String.prototype.valueOf; astring=new Number(); astring.valueOf = valof; astring.valof()",
+  "error",
+  eval("var valof=String.prototype.valueOf; astring=new Number(); astring.valueOf = valof; astring.valueOf()") );
+*/
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.3-3-n.js b/js/src/tests/ecma/String/15.5.4.3-3-n.js
new file mode 100644
index 000000000..e4e410de4
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.3-3-n.js
@@ -0,0 +1,38 @@
+/* -*- tab-width: 2; 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:          15.5.4.3-3-n.js
+   ECMA Section:       15.5.4.3 String.prototype.valueOf()
+
+   Description:        Returns this string value.
+
+   The valueOf function is not generic; it generates a
+   runtime error if its this value is not a String object.
+   Therefore it connot be transferred to the other kinds of
+   objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+
+var SECTION = "15.5.4.3-3-n";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.valueOf";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+DESCRIPTION = "var valof=String.prototype.valueOf; astring=new Number(); astring.valueOf = valof; astring.valof()";
+EXPECTED = "error";
+
+new TestCase( SECTION,
+	      "var valof=String.prototype.valueOf; astring=new Number(); astring.valueOf = valof; astring.valof()",
+	      "error",
+	      eval("var valof=String.prototype.valueOf; astring=new Number(); astring.valueOf = valof; astring.valueOf()") );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.4-1.js b/js/src/tests/ecma/String/15.5.4.4-1.js
new file mode 100644
index 000000000..762c1461d
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.4-1.js
@@ -0,0 +1,58 @@
+/* -*- tab-width: 2; 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:          15.5.4.4-1.js
+   ECMA Section:       15.5.4.4 String.prototype.charAt(pos)
+   Description:        Returns a string containing the character at position
+   pos in the string.  If there is no character at that
+   string, the result is the empty string.  The result is
+   a string value, not a String object.
+
+   When the charAt method is called with one argument,
+   pos, the following steps are taken:
+   1. Call ToString, with this value as its argument
+   2. Call ToInteger pos
+
+   In this test, this is a String, pos is an integer, and
+   all pos are in range.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.4-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.charAt";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var TEST_STRING = new String( " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~" );
+
+var item = 0;
+var i;
+
+for (  i = 0x0020; i < 0x007e; i++, item++) {
+  new TestCase( SECTION,
+		"TEST_STRING.charAt("+item+")",
+		String.fromCharCode( i ),
+		TEST_STRING.charAt( item ) );
+}
+
+for ( i = 0x0020; i < 0x007e; i++, item++) {
+  new TestCase( SECTION,
+		"TEST_STRING.charAt("+item+") == TEST_STRING.substring( "+item +", "+ (item+1) + ")",
+		true,
+		TEST_STRING.charAt( item )  == TEST_STRING.substring( item, item+1 )
+    );
+}
+
+new TestCase( SECTION,  "String.prototype.charAt.length",       1,  String.prototype.charAt.length );
+
+print( "TEST_STRING = new String(\" !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~\")" );
+
+test();
+
diff --git a/js/src/tests/ecma/String/15.5.4.4-2.js b/js/src/tests/ecma/String/15.5.4.4-2.js
new file mode 100644
index 000000000..70f801a34
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.4-2.js
@@ -0,0 +1,102 @@
+/* -*- 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:          15.5.4.4-1.js
+   ECMA Section:       15.5.4.4 String.prototype.charAt(pos)
+   Description:        Returns a string containing the character at position
+   pos in the string.  If there is no character at that
+   string, the result is the empty string.  The result is
+   a string value, not a String object.
+
+   When the charAt method is called with one argument,
+   pos, the following steps are taken:
+   1. Call ToString, with this value as its argument
+   2. Call ToInteger pos
+   3. Compute the number of characters  in Result(1)
+   4. If Result(2) is less than 0 is or not less than
+   Result(3), return the empty string
+   5. Return a string of length 1 containing one character
+   from result (1), the character at position Result(2).
+
+   Note that the charAt function is intentionally generic;
+   it does not require that its this value be a String
+   object.  Therefore it can be transferred to other kinds
+   of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.4-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.charAt";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,     "x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(0)", "t",    eval("x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(0)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(1)", "r",    eval("x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(1)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(2)", "u",    eval("x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(2)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(3)", "e",    eval("x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(3)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(4)", "",     eval("x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(4)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(-1)", "",    eval("x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(-1)") );
+
+new TestCase( SECTION,     "x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(true)", "r",    eval("x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(true)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(false)", "t",    eval("x = new Boolean(true); x.charAt=String.prototype.charAt;x.charAt(false)") );
+
+new TestCase( SECTION,     "x = new String(); x.charAt(0)",    "",     eval("x=new String();x.charAt(0)") );
+new TestCase( SECTION,     "x = new String(); x.charAt(1)",    "",     eval("x=new String();x.charAt(1)") );
+new TestCase( SECTION,     "x = new String(); x.charAt(-1)",   "",     eval("x=new String();x.charAt(-1)") );
+
+new TestCase( SECTION,     "x = new String(); x.charAt(NaN)",  "",     eval("x=new String();x.charAt(Number.NaN)") );
+new TestCase( SECTION,     "x = new String(); x.charAt(Number.POSITIVE_INFINITY)",   "",     eval("x=new String();x.charAt(Number.POSITIVE_INFINITY)") );
+new TestCase( SECTION,     "x = new String(); x.charAt(Number.NEGATIVE_INFINITY)",   "",     eval("x=new String();x.charAt(Number.NEGATIVE_INFINITY)") );
+
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(0)",  "1",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(0)") );
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(1)",  "2",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(1)") );
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(2)",  "3",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(2)") );
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(3)",  "4",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(3)") );
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(4)",  "5",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(4)") );
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(5)",  "6",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(5)") );
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(6)",  "7",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(6)") );
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(7)",  "8",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(7)") );
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(8)",  "9",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(8)") );
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(9)",  "0",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(9)") );
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(10)",  "",       eval("var MYOB = new MyObject(1234567890); MYOB.charAt(10)") );
+
+new TestCase( SECTION,      "var MYOB = new MyObject(1234567890); MYOB.charAt(Math.PI)",  "4",        eval("var MYOB = new MyObject(1234567890); MYOB.charAt(Math.PI)") );
+
+// MyOtherObject.toString will return "[object Object]
+
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(0)",  "[",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(0)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(1)",  "o",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(1)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(2)",  "b",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(2)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(3)",  "j",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(3)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(4)",  "e",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(4)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(5)",  "c",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(5)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(6)",  "t",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(6)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(7)",  " ",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(7)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(8)",  "O",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(8)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(9)",  "b",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(9)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(10)",  "j",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(10)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(11)",  "e",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(11)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(12)",  "c",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(12)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(13)",  "t",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(13)") );
+new TestCase( SECTION,      "var MYOB = new MyOtherObject(1234567890); MYOB.charAt(14)",  "]",        eval("var MYOB = new MyOtherObject(1234567890); MYOB.charAt(14)") );
+
+test();
+
+function MyObject( value ) {
+  this.value      = value;
+  this.valueOf    = new Function( "return this.value;" );
+  this.toString   = new Function( "return this.value +''" );
+  this.charAt     = String.prototype.charAt;
+}
+function MyOtherObject(value) {
+  this.value      = value;
+  this.valueOf    = new Function( "return this.value;" );
+  this.charAt     = String.prototype.charAt;
+}
diff --git a/js/src/tests/ecma/String/15.5.4.4-3.js b/js/src/tests/ecma/String/15.5.4.4-3.js
new file mode 100644
index 000000000..795d4e085
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.4-3.js
@@ -0,0 +1,78 @@
+/* -*- 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:          15.5.4.4-3.js
+   ECMA Section:       15.5.4.4 String.prototype.charAt(pos)
+   Description:        Returns a string containing the character at position
+   pos in the string.  If there is no character at that
+   string, the result is the empty string.  The result is
+   a string value, not a String object.
+
+   When the charAt method is called with one argument,
+   pos, the following steps are taken:
+   1. Call ToString, with this value as its argument
+   2. Call ToInteger pos
+   3. Compute the number of characters  in Result(1)
+   4. If Result(2) is less than 0 is or not less than
+   Result(3), return the empty string
+   5. Return a string of length 1 containing one character
+   from result (1), the character at position Result(2).
+
+   Note that the charAt function is intentionally generic;
+   it does not require that its this value be a String
+   object.  Therefore it can be transferred to other kinds
+   of objects for use as a method.
+
+   This tests assiging charAt to a user-defined function.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.4-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.charAt";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var foo = new MyObject('hello');
+
+
+new TestCase( SECTION, "var foo = new MyObject('hello'); ", "h", foo.charAt(0)  );
+new TestCase( SECTION, "var foo = new MyObject('hello'); ", "e", foo.charAt(1)  );
+new TestCase( SECTION, "var foo = new MyObject('hello'); ", "l", foo.charAt(2)  );
+new TestCase( SECTION, "var foo = new MyObject('hello'); ", "l", foo.charAt(3)  );
+new TestCase( SECTION, "var foo = new MyObject('hello'); ", "o", foo.charAt(4)  );
+new TestCase( SECTION, "var foo = new MyObject('hello'); ", "",  foo.charAt(-1)  );
+new TestCase( SECTION, "var foo = new MyObject('hello'); ", "",  foo.charAt(5)  );
+
+var boo = new MyObject(true);
+
+new TestCase( SECTION, "var boo = new MyObject(true); ", "t", boo.charAt(0)  );
+new TestCase( SECTION, "var boo = new MyObject(true); ", "r", boo.charAt(1)  );
+new TestCase( SECTION, "var boo = new MyObject(true); ", "u", boo.charAt(2)  );
+new TestCase( SECTION, "var boo = new MyObject(true); ", "e", boo.charAt(3)  );
+
+var noo = new MyObject( Math.PI );
+
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); ", "3", noo.charAt(0)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); ", ".", noo.charAt(1)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); ", "1", noo.charAt(2)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); ", "4", noo.charAt(3)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); ", "1", noo.charAt(4)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); ", "5", noo.charAt(5)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); ", "9", noo.charAt(6)  );
+
+test();
+
+function MyObject (v) {
+  this.value      = v;
+  this.toString   = new Function( "return this.value +'';" );
+  this.valueOf    = new Function( "return this.value" );
+  this.charAt     = String.prototype.charAt;
+}
+
diff --git a/js/src/tests/ecma/String/15.5.4.4-4.js b/js/src/tests/ecma/String/15.5.4.4-4.js
new file mode 100644
index 000000000..d06a9f935
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.4-4.js
@@ -0,0 +1,90 @@
+/* -*- 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:          15.5.4.4-4.js
+   ECMA Section:       15.5.4.4 String.prototype.charAt(pos)
+   Description:        Returns a string containing the character at position
+   pos in the string.  If there is no character at that
+   string, the result is the empty string.  The result is
+   a string value, not a String object.
+
+   When the charAt method is called with one argument,
+   pos, the following steps are taken:
+   1. Call ToString, with this value as its argument
+   2. Call ToInteger pos
+   3. Compute the number of characters  in Result(1)
+   4. If Result(2) is less than 0 is or not less than
+   Result(3), return the empty string
+   5. Return a string of length 1 containing one character
+   from result (1), the character at position Result(2).
+
+   Note that the charAt function is intentionally generic;
+   it does not require that its this value be a String
+   object.  Therefore it can be transferred to other kinds
+   of objects for use as a method.
+
+   This tests assiging charAt to primitive types..
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.4-4";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "String.prototype.charAt";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,     "x = new Array(1,2,3); x.charAt = String.prototype.charAt; x.charAt(0)",            "1",     eval("x=new Array(1,2,3); x.charAt = String.prototype.charAt; x.charAt(0)") );
+new TestCase( SECTION,     "x = new Array(1,2,3); x.charAt = String.prototype.charAt; x.charAt(1)",            ",",     eval("x=new Array(1,2,3); x.charAt = String.prototype.charAt; x.charAt(1)") );
+new TestCase( SECTION,     "x = new Array(1,2,3); x.charAt = String.prototype.charAt; x.charAt(2)",            "2",     eval("x=new Array(1,2,3); x.charAt = String.prototype.charAt; x.charAt(2)") );
+new TestCase( SECTION,     "x = new Array(1,2,3); x.charAt = String.prototype.charAt; x.charAt(3)",            ",",     eval("x=new Array(1,2,3); x.charAt = String.prototype.charAt; x.charAt(3)") );
+new TestCase( SECTION,     "x = new Array(1,2,3); x.charAt = String.prototype.charAt; x.charAt(4)",            "3",     eval("x=new Array(1,2,3); x.charAt = String.prototype.charAt; x.charAt(4)") );
+
+new TestCase( SECTION,  "x = new Array(); x.charAt = String.prototype.charAt; x.charAt(0)",                    "",      eval("x = new Array(); x.charAt = String.prototype.charAt; x.charAt(0)") );
+
+new TestCase( SECTION,     "x = new Number(123); x.charAt = String.prototype.charAt; x.charAt(0)",            "1",     eval("x=new Number(123); x.charAt = String.prototype.charAt; x.charAt(0)") );
+new TestCase( SECTION,     "x = new Number(123); x.charAt = String.prototype.charAt; x.charAt(1)",            "2",     eval("x=new Number(123); x.charAt = String.prototype.charAt; x.charAt(1)") );
+new TestCase( SECTION,     "x = new Number(123); x.charAt = String.prototype.charAt; x.charAt(2)",            "3",     eval("x=new Number(123); x.charAt = String.prototype.charAt; x.charAt(2)") );
+
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(0)",            "[",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(0)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(1)",            "o",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(1)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(2)",            "b",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(2)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(3)",            "j",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(3)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(4)",            "e",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(4)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(5)",            "c",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(5)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(6)",            "t",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(6)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(7)",            " ",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(7)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(8)",            "O",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(8)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(9)",            "b",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(9)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(10)",            "j",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(10)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(11)",            "e",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(11)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(12)",            "c",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(12)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(13)",            "t",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(13)") );
+new TestCase( SECTION,     "x = new Object(); x.charAt = String.prototype.charAt; x.charAt(14)",            "]",     eval("x=new Object(); x.charAt = String.prototype.charAt; x.charAt(14)") );
+
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(0)",            "[",    eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(0)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(1)",            "o",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(1)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(2)",            "b",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(2)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(3)",            "j",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(3)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(4)",            "e",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(4)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(5)",            "c",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(5)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(6)",            "t",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(6)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(7)",            " ",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(7)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(8)",            "F",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(8)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(9)",            "u",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(9)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(10)",            "n",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(10)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(11)",            "c",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(11)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(12)",            "t",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(12)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(13)",            "i",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(13)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(14)",            "o",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(14)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(15)",            "n",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(15)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(16)",            "]",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(16)") );
+new TestCase( SECTION,     "x = new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(17)",            "",     eval("x=new Function(); x.toString = Object.prototype.toString; x.charAt = String.prototype.charAt; x.charAt(17)") );
+
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.5-1.js b/js/src/tests/ecma/String/15.5.4.5-1.js
new file mode 100644
index 000000000..937f4be49
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.5-1.js
@@ -0,0 +1,53 @@
+/* -*- 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:          15.5.4.5.1.js
+   ECMA Section:       15.5.4.5 String.prototype.charCodeAt(pos)
+   Description:        Returns a number (a nonnegative integer less than 2^16)
+   representing the Unicode encoding of the character at
+   position pos in this string.  If there is no character
+   at that position, the number is NaN.
+
+   When the charCodeAt method is called with one argument
+   pos, the following steps are taken:
+   1. Call ToString, giving it the theis value as its
+   argument
+   2. Call ToInteger(pos)
+   3. Compute the number of characters in result(1).
+   4. If Result(2) is less than 0 or is not less than
+   Result(3), return NaN.
+   5. Return a value of Number type, of positive sign, whose
+   magnitude is the Unicode encoding of one character
+   from result 1, namely the characer at position Result
+   (2), where the first character in Result(1) is
+   considered to be at position 0.
+
+   Note that the charCodeAt function is intentionally
+   generic; it does not require that its this value be a
+   String object.  Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.5-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.charCodeAt";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var TEST_STRING = new String( " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~" );
+
+for ( j = 0, i = 0x0020; i < 0x007e; i++, j++ ) {
+  new TestCase( SECTION, "TEST_STRING.charCodeAt("+j+")", i, TEST_STRING.charCodeAt( j ) );
+}
+
+new TestCase( SECTION, 'TEST_STRING.charCodeAt('+i+')', NaN,    TEST_STRING.charCodeAt( i ) );
+
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.5-2.js b/js/src/tests/ecma/String/15.5.4.5-2.js
new file mode 100644
index 000000000..75590c3df
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.5-2.js
@@ -0,0 +1,87 @@
+/* -*- 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:          15.5.4.5.1.js
+   ECMA Section:       15.5.4.5 String.prototype.charCodeAt(pos)
+   Description:        Returns a number (a nonnegative integer less than 2^16)
+   representing the Unicode encoding of the character at
+   position pos in this string.  If there is no character
+   at that position, the number is NaN.
+
+   When the charCodeAt method is called with one argument
+   pos, the following steps are taken:
+   1. Call ToString, giving it the theis value as its
+   argument
+   2. Call ToInteger(pos)
+   3. Compute the number of characters in result(1).
+   4. If Result(2) is less than 0 or is not less than
+   Result(3), return NaN.
+   5. Return a value of Number type, of positive sign, whose
+   magnitude is the Unicode encoding of one character
+   from result 1, namely the characer at position Result
+   (2), where the first character in Result(1) is
+   considered to be at position 0.
+
+   Note that the charCodeAt function is intentionally
+   generic; it does not require that its this value be a
+   String object.  Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.5-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.charCodeAt";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var TEST_STRING = new String( " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~" );
+
+var x;
+
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(0)", 0x0074,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(0)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(1)", 0x0072,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(1)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(2)", 0x0075,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(2)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(3)", 0x0065,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(3)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(4)", Number.NaN,     eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(4)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(-1)", Number.NaN,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(-1)") );
+
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(true)",  0x0072,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(true)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(false)", 0x0074,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(false)") );
+
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(0)",    Number.NaN,     eval("x=new String();x.charCodeAt(0)") );
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(1)",    Number.NaN,     eval("x=new String();x.charCodeAt(1)") );
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(-1)",   Number.NaN,     eval("x=new String();x.charCodeAt(-1)") );
+
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(NaN)",                       Number.NaN,     eval("x=new String();x.charCodeAt(Number.NaN)") );
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(Number.POSITIVE_INFINITY)",  Number.NaN,     eval("x=new String();x.charCodeAt(Number.POSITIVE_INFINITY)") );
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(Number.NEGATIVE_INFINITY)",  Number.NaN,     eval("x=new String();x.charCodeAt(Number.NEGATIVE_INFINITY)") );
+
+new TestCase( SECTION,  "x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(0)",    0x0031,   eval("x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(0)") );
+new TestCase( SECTION,  "x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(1)",    0x002C,   eval("x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(1)") );
+new TestCase( SECTION,  "x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(2)",    0x0032,   eval("x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(2)") );
+new TestCase( SECTION,  "x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(3)",    0x002C,   eval("x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(3)") );
+new TestCase( SECTION,  "x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(4)",    0x0033,   eval("x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(4)") );
+new TestCase( SECTION,  "x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(5)",    NaN,   eval("x = new Array(1,2,3); x.charCodeAt = String.prototype.charCodeAt; x.charCodeAt(5)") );
+
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(0)", 0x005B, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(0)") );
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(1)", 0x006F, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(1)") );
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(2)", 0x0062, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(2)") );
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(3)", 0x006A, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(3)") );
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(4)", 0x0065, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(4)") );
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(5)", 0x0063, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(5)") );
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(6)", 0x0074, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(6)") );
+
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(7)", 0x0020, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(7)") );
+
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(8)", 0x004F, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(8)") );
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(9)", 0x0062, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(9)") );
+new TestCase( SECTION,  "x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(10)", 0x006A, eval("x = new Function( 'this.charCodeAt = String.prototype.charCodeAt' ); f = new x(); f.charCodeAt(10)") );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.5-3.js b/js/src/tests/ecma/String/15.5.4.5-3.js
new file mode 100644
index 000000000..aa40c8b51
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.5-3.js
@@ -0,0 +1,97 @@
+/* -*- 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:          15.5.4.5-3.js
+   ECMA Section:       15.5.4.5 String.prototype.charCodeAt(pos)
+   Description:        Returns a number (a nonnegative integer less than 2^16)
+   representing the Unicode encoding of the character at
+   position pos in this string.  If there is no character
+   at that position, the number is NaN.
+
+   When the charCodeAt method is called with one argument
+   pos, the following steps are taken:
+   1. Call ToString, giving it the theis value as its
+   argument
+   2. Call ToInteger(pos)
+   3. Compute the number of characters in result(1).
+   4. If Result(2) is less than 0 or is not less than
+   Result(3), return NaN.
+   5. Return a value of Number type, of positive sign, whose
+   magnitude is the Unicode encoding of one character
+   from result 1, namely the characer at position Result
+   (2), where the first character in Result(1) is
+   considered to be at position 0.
+
+   Note that the charCodeAt function is intentionally
+   generic; it does not require that its this value be a
+   String object.  Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.5-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.charCodeAt";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var TEST_STRING = new String( " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~" );
+
+
+var foo = new MyObject('hello');
+
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.charCodeAt(0)", 0x0068, foo.charCodeAt(0)  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.charCodeAt(1)", 0x0065, foo.charCodeAt(1)  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.charCodeAt(2)", 0x006c, foo.charCodeAt(2)  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.charCodeAt(3)", 0x006c, foo.charCodeAt(3)  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.charCodeAt(4)", 0x006f, foo.charCodeAt(4)  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.charCodeAt(-1)", Number.NaN,  foo.charCodeAt(-1)  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.charCodeAt(5)", Number.NaN,  foo.charCodeAt(5)  );
+
+var boo = new MyObject(true);
+
+new TestCase( SECTION, "var boo = new MyObject(true);boo.charCodeAt(0)", 0x0074, boo.charCodeAt(0)  );
+new TestCase( SECTION, "var boo = new MyObject(true);boo.charCodeAt(1)", 0x0072, boo.charCodeAt(1)  );
+new TestCase( SECTION, "var boo = new MyObject(true);boo.charCodeAt(2)", 0x0075, boo.charCodeAt(2)  );
+new TestCase( SECTION, "var boo = new MyObject(true);boo.charCodeAt(3)", 0x0065, boo.charCodeAt(3)  );
+
+var noo = new MyObject( Math.PI );
+
+new TestCase( SECTION, "var noo = new MyObject(Math.PI);noo.charCodeAt(0)", 0x0033, noo.charCodeAt(0)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI);noo.charCodeAt(1)", 0x002E, noo.charCodeAt(1)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI);noo.charCodeAt(2)", 0x0031, noo.charCodeAt(2)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI);noo.charCodeAt(3)", 0x0034, noo.charCodeAt(3)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI);noo.charCodeAt(4)", 0x0031, noo.charCodeAt(4)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI);noo.charCodeAt(5)", 0x0035, noo.charCodeAt(5)  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI);noo.charCodeAt(6)", 0x0039, noo.charCodeAt(6)  );
+
+var noo = new MyObject( null );
+
+new TestCase( SECTION, "var noo = new MyObject(null);noo.charCodeAt(0)", 0x006E, noo.charCodeAt(0)  );
+new TestCase( SECTION, "var noo = new MyObject(null);noo.charCodeAt(1)", 0x0075, noo.charCodeAt(1)  );
+new TestCase( SECTION, "var noo = new MyObject(null);noo.charCodeAt(2)", 0x006C, noo.charCodeAt(2)  );
+new TestCase( SECTION, "var noo = new MyObject(null);noo.charCodeAt(3)", 0x006C, noo.charCodeAt(3)  );
+new TestCase( SECTION, "var noo = new MyObject(null);noo.charCodeAt(4)", NaN, noo.charCodeAt(4)  );
+
+var noo = new MyObject( void 0 );
+
+new TestCase( SECTION, "var noo = new MyObject(void 0);noo.charCodeAt(0)", 0x0075, noo.charCodeAt(0)  );
+new TestCase( SECTION, "var noo = new MyObject(void 0);noo.charCodeAt(1)", 0x006E, noo.charCodeAt(1)  );
+new TestCase( SECTION, "var noo = new MyObject(void 0);noo.charCodeAt(2)", 0x0064, noo.charCodeAt(2)  );
+new TestCase( SECTION, "var noo = new MyObject(void 0);noo.charCodeAt(3)", 0x0065, noo.charCodeAt(3)  );
+new TestCase( SECTION, "var noo = new MyObject(void 0);noo.charCodeAt(4)", 0x0066, noo.charCodeAt(4)  );
+
+test();
+
+
+function MyObject (v) {
+  this.value      = v;
+  this.toString   = new Function ( "return this.value +\"\"" );
+  this.charCodeAt     = String.prototype.charCodeAt;
+}
diff --git a/js/src/tests/ecma/String/15.5.4.5-4.js b/js/src/tests/ecma/String/15.5.4.5-4.js
new file mode 100644
index 000000000..bf6bb0521
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.5-4.js
@@ -0,0 +1,41 @@
+/* -*- tab-width: 2; 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:          15.5.4.5-4.js
+   ECMA Section:       15.5.4.5 String.prototype.charCodeAt(pos)
+
+   Description:        Returns a nonnegative integer less than 2^16.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var VERSION = "0697";
+startTest();
+var SECTION = "15.5.4.5-4";
+
+writeHeaderToLog( SECTION + " String.prototype.charCodeAt(pos)" );
+
+var MAXCHARCODE = Math.pow(2,16);
+var item=0, CHARCODE;
+
+for ( CHARCODE=0; CHARCODE <256; CHARCODE++ ) {
+  new TestCase( SECTION,
+		"(String.fromCharCode("+CHARCODE+")).charCodeAt(0)",
+		CHARCODE,
+		(String.fromCharCode(CHARCODE)).charCodeAt(0) );
+}
+for ( CHARCODE=256; CHARCODE < 65536; CHARCODE+=999 ) {
+  new TestCase( SECTION,
+		"(String.fromCharCode("+CHARCODE+")).charCodeAt(0)",
+		CHARCODE,
+		(String.fromCharCode(CHARCODE)).charCodeAt(0) );
+}
+
+new TestCase( SECTION, "(String.fromCharCode(65535)).charCodeAt(0)", 65535,     (String.fromCharCode(65535)).charCodeAt(0) );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.5-5.js b/js/src/tests/ecma/String/15.5.4.5-5.js
new file mode 100644
index 000000000..74ec5c7e5
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.5-5.js
@@ -0,0 +1,72 @@
+/* -*- 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:          15.5.4.5.1.js
+   ECMA Section:       15.5.4.5 String.prototype.charCodeAt(pos)
+   Description:        Returns a number (a nonnegative integer less than 2^16)
+   representing the Unicode encoding of the character at
+   position pos in this string.  If there is no character
+   at that position, the number is NaN.
+
+   When the charCodeAt method is called with one argument
+   pos, the following steps are taken:
+   1. Call ToString, giving it the theis value as its
+   argument
+   2. Call ToInteger(pos)
+   3. Compute the number of characters in result(1).
+   4. If Result(2) is less than 0 or is not less than
+   Result(3), return NaN.
+   5. Return a value of Number type, of positive sign, whose
+   magnitude is the Unicode encoding of one character
+   from result 1, namely the characer at position Result
+   (2), where the first character in Result(1) is
+   considered to be at position 0.
+
+   Note that the charCodeAt function is intentionally
+   generic; it does not require that its this value be a
+   String object.  Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.5-5";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.charCodeAt";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var TEST_STRING = "";
+
+for ( var i = 0x0000; i < 255; i++ ) {
+  TEST_STRING += String.fromCharCode( i );
+}
+
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(0)", 0x0074,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(0)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(1)", 0x0072,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(1)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(2)", 0x0075,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(2)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(3)", 0x0065,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(3)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(4)", Number.NaN,     eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(4)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(-1)", Number.NaN,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(-1)") );
+
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(true)",  0x0072,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(true)") );
+new TestCase( SECTION,     "x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(false)", 0x0074,    eval("x = new Boolean(true); x.charCodeAt=String.prototype.charCodeAt;x.charCodeAt(false)") );
+
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(0)",    Number.NaN,     eval("x=new String();x.charCodeAt(0)") );
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(1)",    Number.NaN,     eval("x=new String();x.charCodeAt(1)") );
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(-1)",   Number.NaN,     eval("x=new String();x.charCodeAt(-1)") );
+
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(NaN)",  Number.NaN,     eval("x=new String();x.charCodeAt(Number.NaN)") );
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(Number.POSITIVE_INFINITY)",   Number.NaN,     eval("x=new String();x.charCodeAt(Number.POSITIVE_INFINITY)") );
+new TestCase( SECTION,     "x = new String(); x.charCodeAt(Number.NEGATIVE_INFINITY)",   Number.NaN,     eval("x=new String();x.charCodeAt(Number.NEGATIVE_INFINITY)") );
+
+for ( var j = 0; j < 255; j++ ) {
+  new TestCase( SECTION,  "TEST_STRING.charCodeAt("+j+")",    j,     TEST_STRING.charCodeAt(j) );
+}
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.6-1.js b/js/src/tests/ecma/String/15.5.4.6-1.js
new file mode 100644
index 000000000..2e616df4a
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.6-1.js
@@ -0,0 +1,121 @@
+/* -*- tab-width: 2; 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:          15.5.4.6-1.js
+   ECMA Section:       15.5.4.6 String.prototype.indexOf( searchString, pos)
+   Description:        If the given searchString appears as a substring of the
+   result of converting this object to a string, at one or
+   more positions that are at or to the right of the
+   specified position, then the index of the leftmost such
+   position is returned; otherwise -1 is returned.  If
+   positionis undefined or not supplied, 0 is assumed, so
+   as to search all of the string.
+
+   When the indexOf method is called with two arguments,
+   searchString and pos, the following steps are taken:
+
+   1. Call ToString, giving it the this value as its
+   argument.
+   2. Call ToString(searchString).
+   3. Call ToInteger(position). (If position is undefined
+   or not supplied, this step produces the value 0).
+   4. Compute the number of characters in Result(1).
+   5. Compute min(max(Result(3), 0), Result(4)).
+   6. Compute the number of characters in the string that
+   is Result(2).
+   7. Compute the smallest possible integer k not smaller
+   than Result(5) such that k+Result(6) is not greater
+   than Result(4), and for all nonnegative integers j
+   less than Result(6), the character at position k+j
+   of Result(1) is the same as the character at position
+   j of Result(2); but if there is no such integer k,
+   then compute the value -1.
+   8. Return Result(7).
+
+   Note that the indexOf function is intentionally generic;
+   it does not require that its this value be a String object.
+   Therefore it can be transferred to other kinds of objects
+   for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.6-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.protoype.indexOf";
+
+var TEST_STRING = new String( " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~" );
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var j = 0;
+
+for ( k = 0, i = 0x0020; i < 0x007e; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf(" +String.fromCharCode(i)+ ", 0)",
+		k,
+		TEST_STRING.indexOf( String.fromCharCode(i), 0 ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007e; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf("+String.fromCharCode(i)+ ", "+ k +")",
+		k,
+		TEST_STRING.indexOf( String.fromCharCode(i), k ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007e; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf("+String.fromCharCode(i)+ ", "+k+1+")",
+		-1,
+		TEST_STRING.indexOf( String.fromCharCode(i), k+1 ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf("+(String.fromCharCode(i) +
+				   String.fromCharCode(i+1)+
+				   String.fromCharCode(i+2)) +", "+0+")",
+		k,
+		TEST_STRING.indexOf( (String.fromCharCode(i)+
+				      String.fromCharCode(i+1)+
+				      String.fromCharCode(i+2)),
+				     0 ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf("+(String.fromCharCode(i) +
+				   String.fromCharCode(i+1)+
+				   String.fromCharCode(i+2)) +", "+ k +")",
+		k,
+		TEST_STRING.indexOf( (String.fromCharCode(i)+
+				      String.fromCharCode(i+1)+
+				      String.fromCharCode(i+2)),
+				     k ) );
+}
+for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf("+(String.fromCharCode(i) +
+				   String.fromCharCode(i+1)+
+				   String.fromCharCode(i+2)) +", "+ k+1 +")",
+		-1,
+		TEST_STRING.indexOf( (String.fromCharCode(i)+
+				      String.fromCharCode(i+1)+
+				      String.fromCharCode(i+2)),
+				     k+1 ) );
+}
+
+new TestCase( SECTION,  "String.indexOf(" +TEST_STRING + ", 0 )", 0, TEST_STRING.indexOf( TEST_STRING, 0 ) );
+
+new TestCase( SECTION,  "String.indexOf(" +TEST_STRING + ", 1 )", -1, TEST_STRING.indexOf( TEST_STRING, 1 ));
+
+print( "TEST_STRING = new String(\" !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~\")" );
+
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.6-2.js b/js/src/tests/ecma/String/15.5.4.6-2.js
new file mode 100644
index 000000000..ee78b2b39
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.6-2.js
@@ -0,0 +1,218 @@
+/* -*- tab-width: 2; 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:          15.5.4.6-1.js
+   ECMA Section:       15.5.4.6 String.prototype.indexOf( searchString, pos)
+   Description:        If the given searchString appears as a substring of the
+   result of converting this object to a string, at one or
+   more positions that are at or to the right of the
+   specified position, then the index of the leftmost such
+   position is returned; otherwise -1 is returned.  If
+   positionis undefined or not supplied, 0 is assumed, so
+   as to search all of the string.
+
+   When the indexOf method is called with two arguments,
+   searchString and pos, the following steps are taken:
+
+   1. Call ToString, giving it the this value as its
+   argument.
+   2. Call ToString(searchString).
+   3. Call ToInteger(position). (If position is undefined
+   or not supplied, this step produces the value 0).
+   4. Compute the number of characters in Result(1).
+   5. Compute min(max(Result(3), 0), Result(4)).
+   6. Compute the number of characters in the string that
+   is Result(2).
+   7. Compute the smallest possible integer k not smaller
+   than Result(5) such that k+Result(6) is not greater
+   than Result(4), and for all nonnegative integers j
+   less than Result(6), the character at position k+j
+   of Result(1) is the same as the character at position
+   j of Result(2); but if there is no such integer k,
+   then compute the value -1.
+   8. Return Result(7).
+
+   Note that the indexOf function is intentionally generic;
+   it does not require that its this value be a String object.
+   Therefore it can be transferred to other kinds of objects
+   for use as a method.
+
+   Author:             christine@netscape.com, pschwartau@netscape.com
+   Date:               02 October 1997
+   Modified:           14 July 2002
+   Reason:             See http://bugzilla.mozilla.org/show_bug.cgi?id=155289
+   ECMA-262 Ed.3  Section 15.5.4.7
+   The length property of the indexOf method is 1
+   *
+   */
+var SECTION = "15.5.4.6-2";
+var VERSION = "ECMA_1";
+var TITLE   = "String.protoype.indexOf";
+var BUGNUMBER="105721";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+// the following test regresses http://scopus/bugsplat/show_bug.cgi?id=105721
+
+// regress http://scopus/bugsplat/show_bug.cgi?id=105721
+
+new TestCase( SECTION,
+              "function f() { return this; }; function g() { var h = f; return h(); }; g().toString()",   
+              GLOBAL, 
+              g().toString()
+  );
+
+
+new TestCase( SECTION, "String.prototype.indexOf.length",                                               1,     String.prototype.indexOf.length );
+new TestCase( SECTION, "String.prototype.indexOf.length = null; String.prototype.indexOf.length",       1,     eval("String.prototype.indexOf.length = null; String.prototype.indexOf.length") );
+
+new TestCase( SECTION,
+              "var s = new String(); s.indexOf()",    
+              -1,    
+              eval("var s = new String(); s.indexOf()") );
+
+// some Unicode tests.
+
+// generate a test string.
+
+var TEST_STRING = "";
+
+for ( var u = 0x00A1; u <= 0x00FF; u++ ) {
+  TEST_STRING += String.fromCharCode( u );
+}
+
+for ( var u = 0x00A1, i = 0; u <= 0x00FF; u++, i++ ) {
+  new TestCase(   SECTION,
+		  "TEST_STRING.indexOf( " + String.fromCharCode(u) + " )",
+		  i,
+		  TEST_STRING.indexOf( String.fromCharCode(u) ) );
+}
+for ( var u = 0x00A1, i = 0; u <= 0x00FF; u++, i++ ) {
+  new TestCase(   SECTION,
+		  "TEST_STRING.indexOf( " + String.fromCharCode(u) + ", void 0 )",
+		  i,
+		  TEST_STRING.indexOf( String.fromCharCode(u), void 0 ) );
+}
+
+
+
+var foo = new MyObject('hello');
+
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.indexOf('h')", 0, foo.indexOf("h")  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.indexOf('e')", 1, foo.indexOf("e")  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.indexOf('l')", 2, foo.indexOf("l")  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.indexOf('l')", 2, foo.indexOf("l")  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.indexOf('o')", 4, foo.indexOf("o")  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.indexOf('X')", -1,  foo.indexOf("X")  );
+new TestCase( SECTION, "var foo = new MyObject('hello');foo.indexOf(5) ", -1,  foo.indexOf(5)  );
+
+var boo = new MyObject(true);
+
+new TestCase( SECTION, "var boo = new MyObject(true);boo.indexOf('t')", 0, boo.indexOf("t")  );
+new TestCase( SECTION, "var boo = new MyObject(true);boo.indexOf('r')", 1, boo.indexOf("r")  );
+new TestCase( SECTION, "var boo = new MyObject(true);boo.indexOf('u')", 2, boo.indexOf("u")  );
+new TestCase( SECTION, "var boo = new MyObject(true);boo.indexOf('e')", 3, boo.indexOf("e")  );
+new TestCase( SECTION, "var boo = new MyObject(true);boo.indexOf('true')", 0, boo.indexOf("true")  );
+new TestCase( SECTION, "var boo = new MyObject(true);boo.indexOf('rue')", 1, boo.indexOf("rue")  );
+new TestCase( SECTION, "var boo = new MyObject(true);boo.indexOf('ue')", 2, boo.indexOf("ue")  );
+new TestCase( SECTION, "var boo = new MyObject(true);boo.indexOf('oy')", -1, boo.indexOf("oy")  );
+
+
+var noo = new MyObject( Math.PI );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); noo.indexOf('3') ", 0, noo.indexOf('3')  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); noo.indexOf('.') ", 1, noo.indexOf('.')  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); noo.indexOf('1') ", 2, noo.indexOf('1')  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); noo.indexOf('4') ", 3, noo.indexOf('4')  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); noo.indexOf('1') ", 2, noo.indexOf('1')  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); noo.indexOf('5') ", 5, noo.indexOf('5')  );
+new TestCase( SECTION, "var noo = new MyObject(Math.PI); noo.indexOf('9') ", 6, noo.indexOf('9')  );
+
+new TestCase( SECTION,
+	      "var arr = new Array('new','zoo','revue'); arr.indexOf = String.prototype.indexOf; arr.indexOf('new')",
+	      0,
+	      eval("var arr = new Array('new','zoo','revue'); arr.indexOf = String.prototype.indexOf; arr.indexOf('new')") );
+
+new TestCase( SECTION,
+	      "var arr = new Array('new','zoo','revue'); arr.indexOf = String.prototype.indexOf; arr.indexOf(',zoo,')",
+	      3,
+	      eval("var arr = new Array('new','zoo','revue'); arr.indexOf = String.prototype.indexOf; arr.indexOf(',zoo,')") );
+
+new TestCase( SECTION,
+	      "var obj = new Object(); obj.indexOf = String.prototype.indexOf; obj.indexOf('[object Object]')",
+	      0,
+	      eval("var obj = new Object(); obj.indexOf = String.prototype.indexOf; obj.indexOf('[object Object]')") );
+
+new TestCase( SECTION,
+	      "var obj = new Object(); obj.indexOf = String.prototype.indexOf; obj.indexOf('bject')",
+	      2,
+	      eval("var obj = new Object(); obj.indexOf = String.prototype.indexOf; obj.indexOf('bject')") );
+
+new TestCase( SECTION,
+	      "var f = new Function(); f.toString = Object.prototype.toString; f.indexOf = String.prototype.indexOf; f.indexOf('[object Function]')",
+	      0,
+	      eval("var f = new Function(); f.toString = Object.prototype.toString; f.indexOf = String.prototype.indexOf; f.indexOf('[object Function]')") );
+
+new TestCase( SECTION,
+	      "var b = new Boolean(); b.indexOf = String.prototype.indexOf; b.indexOf('true')",
+	      -1,
+	      eval("var b = new Boolean(); b.indexOf = String.prototype.indexOf; b.indexOf('true')") );
+
+new TestCase( SECTION,
+	      "var b = new Boolean(); b.indexOf = String.prototype.indexOf; b.indexOf('false', 1)",
+	      -1,
+	      eval("var b = new Boolean(); b.indexOf = String.prototype.indexOf; b.indexOf('false', 1)") );
+
+new TestCase( SECTION,
+	      "var b = new Boolean(); b.indexOf = String.prototype.indexOf; b.indexOf('false', 0)",
+	      0,
+	      eval("var b = new Boolean(); b.indexOf = String.prototype.indexOf; b.indexOf('false', 0)") );
+
+new TestCase( SECTION,
+	      "var n = new Number(1e21); n.indexOf = String.prototype.indexOf; n.indexOf('e')",
+	      1,
+	      eval("var n = new Number(1e21); n.indexOf = String.prototype.indexOf; n.indexOf('e')") );
+
+new TestCase( SECTION,
+	      "var n = new Number(-Infinity); n.indexOf = String.prototype.indexOf; n.indexOf('-')",
+	      0,
+	      eval("var n = new Number(-Infinity); n.indexOf = String.prototype.indexOf; n.indexOf('-')") );
+
+new TestCase( SECTION,
+	      "var n = new Number(0xFF); n.indexOf = String.prototype.indexOf; n.indexOf('5')",
+	      1,
+	      eval("var n = new Number(0xFF); n.indexOf = String.prototype.indexOf; n.indexOf('5')") );
+
+new TestCase( SECTION,
+	      "var m = Math; m.indexOf = String.prototype.indexOf; m.indexOf( 'Math' )",
+	      8,
+	      eval("var m = Math; m.indexOf = String.prototype.indexOf; m.indexOf( 'Math' )") );
+
+// new Date(0) has '31' or '01' at index 8 depending on whether tester is (GMT-) or (GMT+), respectively
+new TestCase( SECTION,
+	      "var d = new Date(0); d.indexOf = String.prototype.indexOf; d.getTimezoneOffset()>0 ? d.indexOf('31') : d.indexOf('01')",
+	      8,
+	      eval("var d = new Date(0); d.indexOf = String.prototype.indexOf; d.getTimezoneOffset()>0 ? d.indexOf('31') : d.indexOf('01')") );
+
+test();
+
+function f() {
+  return this;
+}
+function g() {
+  var h = f;
+  return h();
+}
+
+function MyObject (v) {
+  this.value      = v;
+  this.toString   = new Function ( "return this.value +\"\"");
+  this.indexOf     = String.prototype.indexOf;
+}
+
diff --git a/js/src/tests/ecma/String/15.5.4.7-1.js b/js/src/tests/ecma/String/15.5.4.7-1.js
new file mode 100644
index 000000000..8559bea69
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.7-1.js
@@ -0,0 +1,185 @@
+/* -*- tab-width: 2; 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:          15.5.4.7-1.js
+   ECMA Section:       15.5.4.7 String.prototype.lastIndexOf( searchString, pos)
+   Description:
+
+   If the given searchString appears as a substring of the result of
+   converting this object to a string, at one or more positions that are
+   at or to the left of the specified position, then the index of the
+   rightmost such position is returned; otherwise -1 is returned. If position
+   is undefined or not supplied, the length of this string value is assumed,
+   so as to search all of the string.
+
+   When the lastIndexOf method is called with two arguments searchString and
+   position, the following steps are taken:
+
+   1.Call ToString, giving it the this value as its argument.
+   2.Call ToString(searchString).
+   3.Call ToNumber(position). (If position is undefined or not supplied, this step produces the value NaN).
+   4.If Result(3) is NaN, use +; otherwise, call ToInteger(Result(3)).
+   5.Compute the number of characters in Result(1).
+   6.Compute min(max(Result(4), 0), Result(5)).
+   7.Compute the number of characters in the string that is Result(2).
+   8.Compute the largest possible integer k not larger than Result(6) such that k+Result(7) is not greater
+   than Result(5), and for all nonnegative integers j less than Result(7), the character at position k+j of
+   Result(1) is the same as the character at position j of Result(2); but if there is no such integer k, then
+   compute the value -1.
+
+   1.Return Result(8).
+
+   Note that the lastIndexOf function is intentionally generic; it does not require that its this value be a
+   String object. Therefore it can be transferred to other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.7-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.protoype.lastIndexOf";
+
+var TEST_STRING = new String( " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~" );
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var j = 0;
+
+for ( k = 0, i = 0x0021; i < 0x007e; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.lastIndexOf(" +String.fromCharCode(i)+ ", 0)",
+		-1,
+		TEST_STRING.lastIndexOf( String.fromCharCode(i), 0 ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007e; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.lastIndexOf("+String.fromCharCode(i)+ ", "+ k +")",
+		k,
+		TEST_STRING.lastIndexOf( String.fromCharCode(i), k ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007e; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.lastIndexOf("+String.fromCharCode(i)+ ", "+k+1+")",
+		k,
+		TEST_STRING.lastIndexOf( String.fromCharCode(i), k+1 ) );
+}
+
+for ( k = 9, i = 0x0021; i < 0x007d; i++, j++, k++ ) {
+  new TestCase( SECTION,
+
+		"String.lastIndexOf("+(String.fromCharCode(i) +
+				       String.fromCharCode(i+1)+
+				       String.fromCharCode(i+2)) +", "+ 0 + ")",
+		LastIndexOf( TEST_STRING, String.fromCharCode(i) +
+			     String.fromCharCode(i+1)+String.fromCharCode(i+2), 0),
+		TEST_STRING.lastIndexOf( (String.fromCharCode(i)+
+					  String.fromCharCode(i+1)+
+					  String.fromCharCode(i+2)),
+					 0 ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.lastIndexOf("+(String.fromCharCode(i) +
+				       String.fromCharCode(i+1)+
+				       String.fromCharCode(i+2)) +", "+ k +")",
+		k,
+		TEST_STRING.lastIndexOf( (String.fromCharCode(i)+
+					  String.fromCharCode(i+1)+
+					  String.fromCharCode(i+2)),
+					 k ) );
+}
+for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.lastIndexOf("+(String.fromCharCode(i) +
+				       String.fromCharCode(i+1)+
+				       String.fromCharCode(i+2)) +", "+ k+1 +")",
+		k,
+		TEST_STRING.lastIndexOf( (String.fromCharCode(i)+
+					  String.fromCharCode(i+1)+
+					  String.fromCharCode(i+2)),
+					 k+1 ) );
+}
+for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.lastIndexOf("+
+		(String.fromCharCode(i) +
+		 String.fromCharCode(i+1)+
+		 String.fromCharCode(i+2)) +", "+ (k-1) +")",
+		LastIndexOf( TEST_STRING, String.fromCharCode(i) +
+			     String.fromCharCode(i+1)+String.fromCharCode(i+2), k-1),
+		TEST_STRING.lastIndexOf( (String.fromCharCode(i)+
+					  String.fromCharCode(i+1)+
+					  String.fromCharCode(i+2)),
+					 k-1 ) );
+}
+
+new TestCase( SECTION,  "String.lastIndexOf(" +TEST_STRING + ", 0 )", 0, TEST_STRING.lastIndexOf( TEST_STRING, 0 ) );
+
+// new TestCase( SECTION,  "String.lastIndexOf(" +TEST_STRING + ", 1 )", 0, TEST_STRING.lastIndexOf( TEST_STRING, 1 ));
+ 
+new TestCase( SECTION,  "String.lastIndexOf(" +TEST_STRING + ")", 0, TEST_STRING.lastIndexOf( TEST_STRING ));
+
+print( "TEST_STRING = new String(\" !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~\")" );
+
+test();
+
+function LastIndexOf( string, search, position ) {
+  string = String( string );
+  search = String( search );
+
+  position = Number( position )
+
+    if ( isNaN( position ) ) {
+      position = Infinity;
+    } else {
+      position = ToInteger( position );
+    }
+
+  result5= string.length;
+  result6 = Math.min(Math.max(position, 0), result5);
+  result7 = search.length;
+
+  if (result7 == 0) {
+    return Math.min(position, result5);
+  }
+
+  result8 = -1;
+
+  for ( k = 0; k <= result6; k++ ) {
+    if ( k+ result7 > result5 ) {
+      break;
+    }
+    for ( j = 0; j < result7; j++ ) {
+      if ( string.charAt(k+j) != search.charAt(j) ){
+	break;
+      }   else  {
+	if ( j == result7 -1 ) {
+	  result8 = k;
+	}
+      }
+    }
+  }
+
+  return result8;
+}
+function ToInteger( n ) {
+  n = Number( n );
+  if ( isNaN(n) ) {
+    return 0;
+  }
+  if ( Math.abs(n) == 0 || Math.abs(n) == Infinity ) {
+    return n;
+  }
+
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  return ( sign * Math.floor(Math.abs(n)) );
+}
diff --git a/js/src/tests/ecma/String/15.5.4.7-2.js b/js/src/tests/ecma/String/15.5.4.7-2.js
new file mode 100644
index 000000000..eda13ebd1
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.7-2.js
@@ -0,0 +1,181 @@
+/* -*- tab-width: 2; 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:          15.5.4.7-2.js
+   ECMA Section:       15.5.4.7 String.prototype.lastIndexOf( searchString, pos)
+   Description:
+
+   If the given searchString appears as a substring of the result of
+   converting this object to a string, at one or more positions that are
+   at or to the left of the specified position, then the index of the
+   rightmost such position is returned; otherwise -1 is returned. If position
+   is undefined or not supplied, the length of this string value is assumed,
+   so as to search all of the string.
+
+   When the lastIndexOf method is called with two arguments searchString and
+   position, the following steps are taken:
+
+   1.Call ToString, giving it the this value as its argument.
+   2.Call ToString(searchString).
+   3.Call ToNumber(position). (If position is undefined or not supplied, this step produces the value NaN).
+   4.If Result(3) is NaN, use +; otherwise, call ToInteger(Result(3)).
+   5.Compute the number of characters in Result(1).
+   6.Compute min(max(Result(4), 0), Result(5)).
+   7.Compute the number of characters in the string that is Result(2).
+   8.Compute the largest possible integer k not larger than Result(6) such that k+Result(7) is not greater
+   than Result(5), and for all nonnegative integers j less than Result(7), the character at position k+j of
+   Result(1) is the same as the character at position j of Result(2); but if there is no such integer k, then
+   compute the value -1.
+
+   1.Return Result(8).
+
+   Note that the lastIndexOf function is intentionally generic; it does not require that its this value be a
+   String object. Therefore it can be transferred to other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com, pschwartau@netscape.com
+   Date:               02 October 1997
+   Modified:           14 July 2002
+   Reason:             See http://bugzilla.mozilla.org/show_bug.cgi?id=155289
+   ECMA-262 Ed.3  Section 15.5.4.8
+   The length property of the lastIndexOf method is 1
+   *
+   */
+var SECTION = "15.5.4.7-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.protoype.lastIndexOf";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION, "String.prototype.lastIndexOf.length",           1,          String.prototype.lastIndexOf.length );
+
+new TestCase( SECTION, "var s = new String(''); s.lastIndexOf('', 0)",          LastIndexOf("","",0),  eval("var s = new String(''); s.lastIndexOf('', 0)") );
+new TestCase( SECTION, "var s = new String(''); s.lastIndexOf('')",             LastIndexOf("",""),  eval("var s = new String(''); s.lastIndexOf('')") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('', 0)",     LastIndexOf("hello","",0),  eval("var s = new String('hello'); s.lastIndexOf('',0)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('')",        LastIndexOf("hello",""),  eval("var s = new String('hello'); s.lastIndexOf('')") );
+
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll')",     LastIndexOf("hello","ll"),  eval("var s = new String('hello'); s.lastIndexOf('ll')") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 0)",  LastIndexOf("hello","ll",0),  eval("var s = new String('hello'); s.lastIndexOf('ll', 0)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 1)",  LastIndexOf("hello","ll",1),  eval("var s = new String('hello'); s.lastIndexOf('ll', 1)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 2)",  LastIndexOf("hello","ll",2),  eval("var s = new String('hello'); s.lastIndexOf('ll', 2)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 3)",  LastIndexOf("hello","ll",3),  eval("var s = new String('hello'); s.lastIndexOf('ll', 3)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 4)",  LastIndexOf("hello","ll",4),  eval("var s = new String('hello'); s.lastIndexOf('ll', 4)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 5)",  LastIndexOf("hello","ll",5),  eval("var s = new String('hello'); s.lastIndexOf('ll', 5)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 6)",  LastIndexOf("hello","ll",6),  eval("var s = new String('hello'); s.lastIndexOf('ll', 6)") );
+
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 1.5)", LastIndexOf('hello','ll', 1.5), eval("var s = new String('hello'); s.lastIndexOf('ll', 1.5)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 2.5)", LastIndexOf('hello','ll', 2.5),  eval("var s = new String('hello'); s.lastIndexOf('ll', 2.5)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', -1)",  LastIndexOf('hello','ll', -1), eval("var s = new String('hello'); s.lastIndexOf('ll', -1)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', -1.5)",LastIndexOf('hello','ll', -1.5), eval("var s = new String('hello'); s.lastIndexOf('ll', -1.5)") );
+
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', -Infinity)",    LastIndexOf("hello","ll",-Infinity), eval("var s = new String('hello'); s.lastIndexOf('ll', -Infinity)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', Infinity)",    LastIndexOf("hello","ll",Infinity), eval("var s = new String('hello'); s.lastIndexOf('ll', Infinity)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', NaN)",    LastIndexOf("hello","ll",NaN), eval("var s = new String('hello'); s.lastIndexOf('ll', NaN)") );
+new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', -0)",    LastIndexOf("hello","ll",-0), eval("var s = new String('hello'); s.lastIndexOf('ll', -0)") );
+for ( var i = 0; i < ( "[object Object]" ).length; i++ ) {
+  new TestCase(   SECTION,
+		  "var o = new Object(); o.lastIndexOf = String.prototype.lastIndexOf; o.lastIndexOf('b', "+ i + ")",
+		  ( i < 2 ? -1 : ( i < 9  ? 2 : 9 )) ,
+		  eval("var o = new Object(); o.lastIndexOf = String.prototype.lastIndexOf; o.lastIndexOf('b', "+ i + ")") );
+}
+for ( var i = 0; i < 5; i ++ ) {
+  new TestCase(   SECTION,
+		  "var b = new Boolean(); b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('l', "+ i + ")",
+		  ( i < 2 ? -1 : 2 ),
+		  eval("var b = new Boolean(); b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('l', "+ i + ")") );
+}
+for ( var i = 0; i < 5; i ++ ) {
+  new TestCase(   SECTION,
+		  "var b = new Boolean(); b.toString = Object.prototype.toString; b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('o', "+ i + ")",
+		  ( i < 1 ? -1 : ( i < 9 ? 1 : ( i < 10 ? 9 : 10 ) ) ),
+		  eval("var b = new Boolean();  b.toString = Object.prototype.toString; b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('o', "+ i + ")") );
+}
+for ( var i = 0; i < 9; i++ ) {
+  new TestCase(   SECTION,
+		  "var n = new Number(Infinity); n.lastIndexOf = String.prototype.lastIndexOf; n.lastIndexOf( 'i', " + i + " )",
+		  ( i < 3 ? -1 : ( i < 5 ? 3 : 5 ) ),
+		  eval("var n = new Number(Infinity); n.lastIndexOf = String.prototype.lastIndexOf; n.lastIndexOf( 'i', " + i + " )") );
+}
+var a = new Array( "abc","def","ghi","jkl","mno","pqr","stu","vwx","yz" );
+
+for ( var i = 0; i < (a.toString()).length; i++ ) {
+  new TestCase( SECTION,
+		"var a = new Array( 'abc','def','ghi','jkl','mno','pqr','stu','vwx','yz' ); a.lastIndexOf = String.prototype.lastIndexOf; a.lastIndexOf( ',mno,p', "+i+" )",
+		( i < 15 ? -1 : 15 ),
+		eval("var a = new Array( 'abc','def','ghi','jkl','mno','pqr','stu','vwx','yz' ); a.lastIndexOf = String.prototype.lastIndexOf; a.lastIndexOf( ',mno,p', "+i+" )") );
+}
+
+for ( var i = 0; i < 15; i ++ ) {
+  new TestCase(   SECTION,
+		  "var m = Math; m.lastIndexOf = String.prototype.lastIndexOf; m.lastIndexOf('t', "+ i + ")",
+		  ( i < 6 ? -1 : ( i < 10 ? 6 : 10 ) ),
+		  eval("var m = Math; m.lastIndexOf = String.prototype.lastIndexOf; m.lastIndexOf('t', "+ i + ")") );
+}
+/*
+  for ( var i = 0; i < 15; i++ ) {
+  new TestCase(   SECTION,
+  "var d = new Date(); d.lastIndexOf = String.prototype.lastIndexOf; d.lastIndexOf( '0' )",
+  )
+  }
+
+*/
+
+test();
+
+function LastIndexOf( string, search, position ) {
+  string = String( string );
+  search = String( search );
+
+  position = Number( position )
+
+    if ( isNaN( position ) ) {
+      position = Infinity;
+    } else {
+      position = ToInteger( position );
+    }
+
+  result5= string.length;
+  result6 = Math.min(Math.max(position, 0), result5);
+  result7 = search.length;
+
+  if (result7 == 0) {
+    return Math.min(position, result5);
+  }
+
+  result8 = -1;
+
+  for ( k = 0; k <= result6; k++ ) {
+    if ( k+ result7 > result5 ) {
+      break;
+    }
+    for ( j = 0; j < result7; j++ ) {
+      if ( string.charAt(k+j) != search.charAt(j) ){
+	break;
+      }   else  {
+	if ( j == result7 -1 ) {
+	  result8 = k;
+	}
+      }
+    }
+  }
+
+  return result8;
+}
+function ToInteger( n ) {
+  n = Number( n );
+  if ( isNaN(n) ) {
+    return 0;
+  }
+  if ( Math.abs(n) == 0 || Math.abs(n) == Infinity ) {
+    return n;
+  }
+
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  return ( sign * Math.floor(Math.abs(n)) );
+}
diff --git a/js/src/tests/ecma/String/15.5.4.8-1.js b/js/src/tests/ecma/String/15.5.4.8-1.js
new file mode 100644
index 000000000..344444ca4
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.8-1.js
@@ -0,0 +1,196 @@
+/* -*- tab-width: 2; 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:          15.5.4.8-1.js
+   ECMA Section:       15.5.4.8 String.prototype.split( separator )
+   Description:
+
+   Returns an Array object into which substrings of the result of converting
+   this object to a string have been stored. The substrings are determined by
+   searching from left to right for occurrences of the given separator; these
+   occurrences are not part of any substring in the returned array, but serve
+   to divide up this string value. The separator may be a string of any length.
+
+   As a special case, if the separator is the empty string, the string is split
+   up into individual characters; the length of the result array equals the
+   length of the string, and each substring contains one character.
+
+   If the separator is not supplied, then the result array contains just one
+   string, which is the string.
+
+   Author:    christine@netscape.com, pschwartau@netscape.com
+   Date:      12 November 1997
+   Modified:  14 July 2002
+   Reason:    See http://bugzilla.mozilla.org/show_bug.cgi?id=155289
+   ECMA-262 Ed.3  Section 15.5.4.14
+   The length property of the split method is 2
+   *
+   */
+
+var SECTION = "15.5.4.8-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.split";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,  "String.prototype.split.length",        2,          String.prototype.split.length );
+
+// test cases for when split is called with no arguments.
+
+// this is a string object
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); typeof s.split()",
+		"object",
+		eval("var s = new String('this is a string object'); typeof s.split()") );
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); Array.prototype.getClass = Object.prototype.toString; (s.split()).getClass()",
+		"[object Array]",
+		eval("var s = new String('this is a string object'); Array.prototype.getClass = Object.prototype.toString; (s.split()).getClass()") );
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.split().length",
+		1,
+		eval("var s = new String('this is a string object'); s.split().length") );
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.split()[0]",
+		"this is a string object",
+		eval("var s = new String('this is a string object'); s.split()[0]") );
+
+// this is an object object
+new TestCase(   SECTION,
+		"var obj = new Object(); obj.split = String.prototype.split; typeof obj.split()",
+		"object",
+		eval("var obj = new Object(); obj.split = String.prototype.split; typeof obj.split()") );
+
+new TestCase(   SECTION,
+		"var obj = new Object(); obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.getClass()",
+		"[object Array]",
+		eval("var obj = new Object(); obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.split().getClass()") );
+
+new TestCase(   SECTION,
+		"var obj = new Object(); obj.split = String.prototype.split; obj.split().length",
+		1,
+		eval("var obj = new Object(); obj.split = String.prototype.split; obj.split().length") );
+
+new TestCase(   SECTION,
+		"var obj = new Object(); obj.split = String.prototype.split; obj.split()[0]",
+		"[object Object]",
+		eval("var obj = new Object(); obj.split = String.prototype.split; obj.split()[0]") );
+
+// this is a function object
+new TestCase(   SECTION,
+		"var obj = new Function(); obj.split = String.prototype.split; typeof obj.split()",
+		"object",
+		eval("var obj = new Function(); obj.split = String.prototype.split; typeof obj.split()") );
+
+new TestCase(   SECTION,
+		"var obj = new Function(); obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.getClass()",
+		"[object Array]",
+		eval("var obj = new Function(); obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.split().getClass()") );
+
+new TestCase(   SECTION,
+		"var obj = new Function(); obj.split = String.prototype.split; obj.split().length",
+		1,
+		eval("var obj = new Function(); obj.split = String.prototype.split; obj.split().length") );
+
+new TestCase(   SECTION,
+		"var obj = new Function(); obj.split = String.prototype.split; obj.toString = Object.prototype.toString; obj.split()[0]",
+		"[object Function]",
+		eval("var obj = new Function(); obj.split = String.prototype.split; obj.toString = Object.prototype.toString; obj.split()[0]") );
+
+// this is a number object
+new TestCase(   SECTION,
+		"var obj = new Number(NaN); obj.split = String.prototype.split; typeof obj.split()",
+		"object",
+		eval("var obj = new Number(NaN); obj.split = String.prototype.split; typeof obj.split()") );
+
+new TestCase(   SECTION,
+		"var obj = new Number(Infinity); obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.getClass()",
+		"[object Array]",
+		eval("var obj = new Number(Infinity); obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.split().getClass()") );
+
+new TestCase(   SECTION,
+		"var obj = new Number(-1234567890); obj.split = String.prototype.split; obj.split().length",
+		1,
+		eval("var obj = new Number(-1234567890); obj.split = String.prototype.split; obj.split().length") );
+
+new TestCase(   SECTION,
+		"var obj = new Number(-1e21); obj.split = String.prototype.split; obj.split()[0]",
+		"-1e+21",
+		eval("var obj = new Number(-1e21); obj.split = String.prototype.split; obj.split()[0]") );
+
+
+// this is the Math object
+new TestCase(   SECTION,
+		"var obj = Math; obj.split = String.prototype.split; typeof obj.split()",
+		"object",
+		eval("var obj = Math; obj.split = String.prototype.split; typeof obj.split()") );
+
+new TestCase(   SECTION,
+		"var obj = Math; obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.getClass()",
+		"[object Array]",
+		eval("var obj = Math; obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.split().getClass()") );
+
+new TestCase(   SECTION,
+		"var obj = Math; obj.split = String.prototype.split; obj.split().length",
+		1,
+		eval("var obj = Math; obj.split = String.prototype.split; obj.split().length") );
+
+new TestCase(   SECTION,
+		"var obj = Math; obj.split = String.prototype.split; obj.split()[0]",
+		"[object Math]",
+		eval("var obj = Math; obj.split = String.prototype.split; obj.split()[0]") );
+
+// this is an array object
+new TestCase(   SECTION,
+		"var obj = new Array(1,2,3,4,5); obj.split = String.prototype.split; typeof obj.split()",
+		"object",
+		eval("var obj = new Array(1,2,3,4,5); obj.split = String.prototype.split; typeof obj.split()") );
+
+new TestCase(   SECTION,
+		"var obj = new Array(1,2,3,4,5); obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.getClass()",
+		"[object Array]",
+		eval("var obj = new Array(1,2,3,4,5); obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.split().getClass()") );
+
+new TestCase(   SECTION,
+		"var obj = new Array(1,2,3,4,5); obj.split = String.prototype.split; obj.split().length",
+		1,
+		eval("var obj = new Array(1,2,3,4,5); obj.split = String.prototype.split; obj.split().length") );
+
+new TestCase(   SECTION,
+		"var obj = new Array(1,2,3,4,5); obj.split = String.prototype.split; obj.split()[0]",
+		"1,2,3,4,5",
+		eval("var obj = new Array(1,2,3,4,5); obj.split = String.prototype.split; obj.split()[0]") );
+
+// this is a Boolean object
+
+new TestCase(   SECTION,
+		"var obj = new Boolean(); obj.split = String.prototype.split; typeof obj.split()",
+		"object",
+		eval("var obj = new Boolean(); obj.split = String.prototype.split; typeof obj.split()") );
+
+new TestCase(   SECTION,
+		"var obj = new Boolean(); obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.getClass()",
+		"[object Array]",
+		eval("var obj = new Boolean(); obj.split = String.prototype.split; Array.prototype.getClass = Object.prototype.toString; obj.split().getClass()") );
+
+new TestCase(   SECTION,
+		"var obj = new Boolean(); obj.split = String.prototype.split; obj.split().length",
+		1,
+		eval("var obj = new Boolean(); obj.split = String.prototype.split; obj.split().length") );
+
+new TestCase(   SECTION,
+		"var obj = new Boolean(); obj.split = String.prototype.split; obj.split()[0]",
+		"false",
+		eval("var obj = new Boolean(); obj.split = String.prototype.split; obj.split()[0]") );
+
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.8-2.js b/js/src/tests/ecma/String/15.5.4.8-2.js
new file mode 100644
index 000000000..158e3a8f2
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.8-2.js
@@ -0,0 +1,213 @@
+/* -*- tab-width: 2; 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:          15.5.4.8-2.js
+   ECMA Section:       15.5.4.8 String.prototype.split( separator )
+   Description:
+
+   Returns an Array object into which substrings of the result of converting
+   this object to a string have been stored. The substrings are determined by
+   searching from left to right for occurrences of the given separator; these
+   occurrences are not part of any substring in the returned array, but serve
+   to divide up this string value. The separator may be a string of any length.
+
+   As a special case, if the separator is the empty string, the string is split
+   up into individual characters; the length of the result array equals the
+   length of the string, and each substring contains one character.
+
+   If the separator is not supplied, then the result array contains just one
+   string, which is the string.
+
+   When the split method is called with one argument separator, the following steps are taken:
+
+   1.   Call ToString, giving it the this value as its argument.
+   2.   Create a new Array object of length 0 and call it A.
+   3.   If separator is not supplied, call the [[Put]] method of A with 0 and
+   Result(1) as arguments, and then return A.
+   4.   Call ToString(separator).
+   5.   Compute the number of characters in Result(1).
+   6.   Compute the number of characters in the string that is Result(4).
+   7.   Let p be 0.
+   8.   If Result(6) is zero (the separator string is empty), go to step 17.
+   9.   Compute the smallest possible integer k not smaller than p such that
+   k+Result(6) is not greater than Result(5), and for all nonnegative
+   integers j less than Result(6), the character at position k+j of
+   Result(1) is the same as the character at position j of Result(2);
+   but if there is no such integer k, then go to step 14.
+   10.   Compute a string value equal to the substring of Result(1), consisting
+   of the characters at positions p through k1, inclusive.
+   11.   Call the [[Put]] method of A with A.length and Result(10) as arguments.
+   12.   Let p be k+Result(6).
+   13.   Go to step 9.
+   14.   Compute a string value equal to the substring of Result(1), consisting
+   of the characters from position p to the end of Result(1).
+   15.   Call the [[Put]] method of A with A.length and Result(14) as arguments.
+   16.   Return A.
+   17.   If p equals Result(5), return A.
+   18.   Compute a string value equal to the substring of Result(1), consisting of
+   the single character at position p.
+   19.   Call the [[Put]] method of A with A.length and Result(18) as arguments.
+   20.   Increase p by 1.
+   21.   Go to step 17.
+
+   Note that the split function is intentionally generic; it does not require that its this value be a String
+   object. Therefore it can be transferred to other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.8-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.split";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// case where separator is the empty string.
+
+var TEST_STRING = "this is a string object";
+
+new TestCase(   SECTION,
+		"var s = new String( "+ TEST_STRING +" ); s.split('').length",
+		TEST_STRING.length,
+		eval("var s = new String( TEST_STRING ); s.split('').length") );
+
+for ( var i = 0; i < TEST_STRING.length; i++ ) {
+
+  new TestCase(   SECTION,
+		  "var s = new String( "+TEST_STRING+" ); s.split('')["+i+"]",
+		  TEST_STRING.charAt(i),
+		  eval("var s = new String( TEST_STRING ); s.split('')["+i+"]") );
+}
+
+// case where the value of the separator is undefined.  in this case,
+// the this value is returned.
+
+var TEST_STRING = "thisundefinedisundefinedaundefinedstringundefinedobject";
+var EXPECT_STRING = new Array( TEST_STRING );
+
+new TestCase(   SECTION,
+		"var s = new String( "+ TEST_STRING +" ); s.split(void 0).length",
+		EXPECT_STRING.length,
+		eval("var s = new String( TEST_STRING ); s.split(void 0).length") );
+
+for ( var i = 0; i < EXPECT_STRING.length; i++ ) {
+  new TestCase(   SECTION,
+		  "var s = new String( "+TEST_STRING+" ); s.split(void 0)["+i+"]",
+		  EXPECT_STRING[i],
+		  eval("var s = new String( TEST_STRING ); s.split(void 0)["+i+"]") );
+}
+
+// case where the value of the separator is null.  in this case the value of the separator is "null".
+TEST_STRING = "thisnullisnullanullstringnullobject";
+var EXPECT_STRING = new Array( "this", "is", "a", "string", "object" );
+
+new TestCase(   SECTION,
+		"var s = new String( "+ TEST_STRING +" ); s.split(null).length",
+		EXPECT_STRING.length,
+		eval("var s = new String( TEST_STRING ); s.split(null).length") );
+
+for ( var i = 0; i < EXPECT_STRING.length; i++ ) {
+  new TestCase(   SECTION,
+		  "var s = new String( "+TEST_STRING+" ); s.split(null)["+i+"]",
+		  EXPECT_STRING[i],
+		  eval("var s = new String( TEST_STRING ); s.split(null)["+i+"]") );
+}
+
+// case where the value of the separator is a boolean.
+TEST_STRING = "thistrueistrueatruestringtrueobject";
+var EXPECT_STRING = new Array( "this", "is", "a", "string", "object" );
+
+new TestCase(   SECTION,
+		"var s = new String( "+ TEST_STRING +" ); s.split(true).length",
+		EXPECT_STRING.length,
+		eval("var s = new String( TEST_STRING ); s.split(true).length") );
+
+for ( var i = 0; i < EXPECT_STRING.length; i++ ) {
+  new TestCase(   SECTION,
+		  "var s = new String( "+TEST_STRING+" ); s.split(true)["+i+"]",
+		  EXPECT_STRING[i],
+		  eval("var s = new String( TEST_STRING ); s.split(true)["+i+"]") );
+}
+
+// case where the value of the separator is a number
+TEST_STRING = "this123is123a123string123object";
+var EXPECT_STRING = new Array( "this", "is", "a", "string", "object" );
+
+new TestCase(   SECTION,
+		"var s = new String( "+ TEST_STRING +" ); s.split(123).length",
+		EXPECT_STRING.length,
+		eval("var s = new String( TEST_STRING ); s.split(123).length") );
+
+for ( var i = 0; i < EXPECT_STRING.length; i++ ) {
+  new TestCase(   SECTION,
+		  "var s = new String( "+TEST_STRING+" ); s.split(123)["+i+"]",
+		  EXPECT_STRING[i],
+		  eval("var s = new String( TEST_STRING ); s.split(123)["+i+"]") );
+}
+
+
+// case where the value of the separator is a number
+TEST_STRING = "this123is123a123string123object";
+var EXPECT_STRING = new Array( "this", "is", "a", "string", "object" );
+
+new TestCase(   SECTION,
+		"var s = new String( "+ TEST_STRING +" ); s.split(123).length",
+		EXPECT_STRING.length,
+		eval("var s = new String( TEST_STRING ); s.split(123).length") );
+
+for ( var i = 0; i < EXPECT_STRING.length; i++ ) {
+  new TestCase(   SECTION,
+		  "var s = new String( "+TEST_STRING+" ); s.split(123)["+i+"]",
+		  EXPECT_STRING[i],
+		  eval("var s = new String( TEST_STRING ); s.split(123)["+i+"]") );
+}
+
+// case where the separator is not in the string
+TEST_STRING = "this is a string";
+EXPECT_STRING = new Array( "this is a string" );
+
+new TestCase(   SECTION,
+		"var s = new String( " + TEST_STRING + " ); s.split(':').length",
+		1,
+		eval("var s = new String( TEST_STRING ); s.split(':').length") );
+
+new TestCase(   SECTION,
+		"var s = new String( " + TEST_STRING + " ); s.split(':')[0]",
+		TEST_STRING,
+		eval("var s = new String( TEST_STRING ); s.split(':')[0]") );
+
+// case where part but not all of separator is in the string.
+TEST_STRING = "this is a string";
+EXPECT_STRING = new Array( "this is a string" );
+new TestCase(   SECTION,
+		"var s = new String( " + TEST_STRING + " ); s.split('strings').length",
+		1,
+		eval("var s = new String( TEST_STRING ); s.split('strings').length") );
+
+new TestCase(   SECTION,
+		"var s = new String( " + TEST_STRING + " ); s.split('strings')[0]",
+		TEST_STRING,
+		eval("var s = new String( TEST_STRING ); s.split('strings')[0]") );
+
+// case where the separator is at the end of the string
+TEST_STRING = "this is a string";
+EXPECT_STRING = new Array( "this is a " );
+new TestCase(   SECTION,
+		"var s = new String( " + TEST_STRING + " ); s.split('string').length",
+		2,
+		eval("var s = new String( TEST_STRING ); s.split('string').length") );
+
+for ( var i = 0; i < EXPECT_STRING.length; i++ ) {
+  new TestCase(   SECTION,
+		  "var s = new String( "+TEST_STRING+" ); s.split('string')["+i+"]",
+		  EXPECT_STRING[i],
+		  eval("var s = new String( TEST_STRING ); s.split('string')["+i+"]") );
+}
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.4.8-3.js b/js/src/tests/ecma/String/15.5.4.8-3.js
new file mode 100644
index 000000000..91405fe5f
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.8-3.js
@@ -0,0 +1,170 @@
+/* -*- tab-width: 2; 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:          15.5.4.8-3.js
+   ECMA Section:       15.5.4.8 String.prototype.split( separator )
+   Description:
+
+   Returns an Array object into which substrings of the result of converting
+   this object to a string have been stored. The substrings are determined by
+   searching from left to right for occurrences of the given separator; these
+   occurrences are not part of any substring in the returned array, but serve
+   to divide up this string value. The separator may be a string of any length.
+
+   As a special case, if the separator is the empty string, the string is split
+   up into individual characters; the length of the result array equals the
+   length of the string, and each substring contains one character.
+
+   If the separator is not supplied, then the result array contains just one
+   string, which is the string.
+
+   When the split method is called with one argument separator, the following steps are taken:
+
+   1.   Call ToString, giving it the this value as its argument.
+   2.   Create a new Array object of length 0 and call it A.
+   3.   If separator is not supplied, call the [[Put]] method of A with 0 and
+   Result(1) as arguments, and then return A.
+   4.   Call ToString(separator).
+   5.   Compute the number of characters in Result(1).
+   6.   Compute the number of characters in the string that is Result(4).
+   7.   Let p be 0.
+   8.   If Result(6) is zero (the separator string is empty), go to step 17.
+   9.   Compute the smallest possible integer k not smaller than p such that
+   k+Result(6) is not greater than Result(5), and for all nonnegative
+   integers j less than Result(6), the character at position k+j of
+   Result(1) is the same as the character at position j of Result(2);
+   but if there is no such integer k, then go to step 14.
+   10.   Compute a string value equal to the substring of Result(1), consisting
+   of the characters at positions p through k1, inclusive.
+   11.   Call the [[Put]] method of A with A.length and Result(10) as arguments.
+   12.   Let p be k+Result(6).
+   13.   Go to step 9.
+   14.   Compute a string value equal to the substring of Result(1), consisting
+   of the characters from position p to the end of Result(1).
+   15.   Call the [[Put]] method of A with A.length and Result(14) as arguments.
+   16.   Return A.
+   17.   If p equals Result(5), return A.
+   18.   Compute a string value equal to the substring of Result(1), consisting of
+   the single character at position p.
+   19.   Call the [[Put]] method of A with A.length and Result(18) as arguments.
+   20.   Increase p by 1.
+   21.   Go to step 17.
+
+   Note that the split function is intentionally generic; it does not require that its this value be a String
+   object. Therefore it can be transferred to other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.8-3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.split";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var TEST_STRING = "";
+var EXPECT = new Array();
+
+// this.toString is the empty string.
+
+new TestCase(   SECTION,
+		"var s = new String(); s.split().length",
+		1,
+		eval("var s = new String(); s.split().length") );
+
+new TestCase(   SECTION,
+		"var s = new String(); s.split()[0]",
+		"",
+		eval("var s = new String(); s.split()[0]") );
+
+// this.toString() is the empty string, separator is specified.
+
+new TestCase(   SECTION,
+		"var s = new String(); s.split('').length",
+		0,
+		eval("var s = new String(); s.split('').length") );
+
+new TestCase(   SECTION,
+		"var s = new String(); s.split(' ').length",
+		1,
+		eval("var s = new String(); s.split(' ').length") );
+
+// this to string is " "
+new TestCase(   SECTION,
+		"var s = new String(' '); s.split().length",
+		1,
+		eval("var s = new String(' '); s.split().length") );
+
+new TestCase(   SECTION,
+		"var s = new String(' '); s.split()[0]",
+		" ",
+		eval("var s = new String(' '); s.split()[0]") );
+
+new TestCase(   SECTION,
+		"var s = new String(' '); s.split('').length",
+		1,
+		eval("var s = new String(' '); s.split('').length") );
+
+new TestCase(   SECTION,
+		"var s = new String(' '); s.split('')[0]",
+		" ",
+		eval("var s = new String(' '); s.split('')[0]") );
+
+new TestCase(   SECTION,
+		"var s = new String(' '); s.split(' ').length",
+		2,
+		eval("var s = new String(' '); s.split(' ').length") );
+
+new TestCase(   SECTION,
+		"var s = new String(' '); s.split(' ')[0]",
+		"",
+		eval("var s = new String(' '); s.split(' ')[0]") );
+
+new TestCase(   SECTION,
+		"\"\".split(\"\").length",
+		0,
+		("".split("")).length );
+
+new TestCase(   SECTION,
+		"\"\".split(\"x\").length",
+		1,
+		("".split("x")).length );
+
+new TestCase(   SECTION,
+		"\"\".split(\"x\")[0]",
+		"",
+		("".split("x"))[0] );
+
+test();
+
+function Split( string, separator ) {
+  string = String( string );
+
+  var A = new Array();
+
+  if ( arguments.length < 2 ) {
+    A[0] = string;
+    return A;
+  }
+
+  separator = String( separator );
+
+  var str_len = String( string ).length;
+  var sep_len = String( separator ).length;
+
+  var p = 0;
+  var k = 0;
+
+  if ( sep_len == 0 ) {
+    for ( ; p < str_len; p++ ) {
+      A[A.length] = String( string.charAt(p) );
+    }
+  }
+  return A;
+}
diff --git a/js/src/tests/ecma/String/15.5.4.9-1.js b/js/src/tests/ecma/String/15.5.4.9-1.js
new file mode 100644
index 000000000..329600bf8
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.9-1.js
@@ -0,0 +1,166 @@
+/* -*- tab-width: 2; 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:          15.5.4.9-1.js
+   ECMA Section:       15.5.4.9 String.prototype.substring( start )
+   Description:
+
+   15.5.4.9 String.prototype.substring(start)
+
+   Returns a substring of the result of converting this object to a string,
+   starting from character position start and running to the end of the
+   string. The result is a string value, not a String object.
+
+   If the argument is NaN or negative, it is replaced with zero; if the
+   argument is larger than the length of the string, it is replaced with the
+   length of the string.
+
+   When the substring method is called with one argument start, the following
+   steps are taken:
+
+   1.Call ToString, giving it the this value as its argument.
+   2.Call ToInteger(start).
+   3.Compute the number of characters in Result(1).
+   4.Compute min(max(Result(2), 0), Result(3)).
+   5.Return a string whose length is the difference between Result(3) and Result(4),
+   containing characters from Result(1), namely the characters with indices Result(4)
+   through Result(3)1, in ascending order.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.4.9-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.substring( start )";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,  "String.prototype.substring.length",        2,          String.prototype.substring.length );
+
+// test cases for when substring is called with no arguments.
+
+// this is a string object
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); typeof s.substring()",
+		"string",
+		eval("var s = new String('this is a string object'); typeof s.substring()") );
+
+new TestCase(   SECTION,
+		"var s = new String(''); s.substring()",
+		"",
+		eval("var s = new String(''); s.substring()") );
+
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring()",
+		"this is a string object",
+		eval("var s = new String('this is a string object'); s.substring()") );
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(NaN)",
+		"this is a string object",
+		eval("var s = new String('this is a string object'); s.substring(NaN)") );
+
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(-0.01)",
+		"this is a string object",
+		eval("var s = new String('this is a string object'); s.substring(-0.01)") );
+
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(s.length)",
+		"",
+		eval("var s = new String('this is a string object'); s.substring(s.length)") );
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(s.length+1)",
+		"",
+		eval("var s = new String('this is a string object'); s.substring(s.length+1)") );
+
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(Infinity)",
+		"",
+		eval("var s = new String('this is a string object'); s.substring(Infinity)") );
+
+new TestCase(   SECTION,
+		"var s = new String('this is a string object'); s.substring(-Infinity)",
+		"this is a string object",
+		eval("var s = new String('this is a string object'); s.substring(-Infinity)") );
+
+// this is not a String object, start is not an integer
+
+
+new TestCase(   SECTION,
+		"var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring()",
+		"1,2,3,4,5",
+		eval("var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring()") );
+
+new TestCase(   SECTION,
+		"var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring(true)",
+		",2,3,4,5",
+		eval("var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring(true)") );
+
+new TestCase(   SECTION,
+		"var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring('4')",
+		"3,4,5",
+		eval("var s = new Array(1,2,3,4,5); s.substring = String.prototype.substring; s.substring('4')") );
+
+new TestCase(   SECTION,
+		"var s = new Array(); s.substring = String.prototype.substring; s.substring('4')",
+		"",
+		eval("var s = new Array(); s.substring = String.prototype.substring; s.substring('4')") );
+
+// this is an object object
+new TestCase(   SECTION,
+		"var obj = new Object(); obj.substring = String.prototype.substring; obj.substring(8)",
+		"Object]",
+		eval("var obj = new Object(); obj.substring = String.prototype.substring; obj.substring(8)") );
+
+// this is a function object
+new TestCase(   SECTION,
+		"var obj = new Function(); obj.substring = String.prototype.substring; obj.toString = Object.prototype.toString; obj.substring(8)",
+		"Function]",
+		eval("var obj = new Function(); obj.substring = String.prototype.substring; obj.toString = Object.prototype.toString; obj.substring(8)") );
+// this is a number object
+new TestCase(   SECTION,
+		"var obj = new Number(NaN); obj.substring = String.prototype.substring; obj.substring(false)",
+		"NaN",
+		eval("var obj = new Number(NaN); obj.substring = String.prototype.substring; obj.substring(false)") );
+
+// this is the Math object
+new TestCase(   SECTION,
+		"var obj = Math; obj.substring = String.prototype.substring; obj.substring(Math.PI)",
+		"ject Math]",
+		eval("var obj = Math; obj.substring = String.prototype.substring; obj.substring(Math.PI)") );
+
+// this is a Boolean object
+
+new TestCase(   SECTION,
+		"var obj = new Boolean(); obj.substring = String.prototype.substring; obj.substring(new Array())",
+		"false",
+		eval("var obj = new Boolean(); obj.substring = String.prototype.substring; obj.substring(new Array())") );
+
+// this is a user defined object
+
+new TestCase( SECTION,
+	      "var obj = new MyObject( null ); obj.substring(0)",
+	      "null",
+	      eval( "var obj = new MyObject( null ); obj.substring(0)") );
+
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.substring = String.prototype.substring;
+  this.toString = new Function ( "return this.value+''" );
+}
diff --git a/js/src/tests/ecma/String/15.5.4.js b/js/src/tests/ecma/String/15.5.4.js
new file mode 100644
index 000000000..0e17afba8
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.js
@@ -0,0 +1,74 @@
+/* -*- tab-width: 2; 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:          15.5.4.js
+   ECMA Section:       15.5.4 Properties of the String prototype object
+
+   Description:
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.5.4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the String Prototype objecta";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION,
+	      "String.prototype.getClass = Object.prototype.toString; String.prototype.getClass()",
+	      "[object String]",
+	      eval("String.prototype.getClass = Object.prototype.toString; String.prototype.getClass()") );
+
+delete String.prototype.getClass;
+
+new TestCase( SECTION,
+              "typeof String.prototype",  
+              "object",  
+              typeof String.prototype );
+
+new TestCase( SECTION,
+              "String.prototype.valueOf()",
+              "",       
+              String.prototype.valueOf() );
+
+new TestCase( SECTION,
+              "String.prototype +''",      
+              "",       
+              String.prototype + '' );
+
+new TestCase( SECTION,
+              "String.prototype.length",   
+              0,        
+              String.prototype.length );
+
+var prop;
+var value;
+
+value = '';
+for (prop in "")
+{
+  value += prop;
+}
+new TestCase( SECTION,
+              'String "" has no enumerable properties',
+              '',
+              value );
+
+value = '';
+for (prop in String.prototype)
+{
+  value += prop;
+}
+new TestCase( SECTION,
+              'String.prototype has no enumerable properties',
+              '',
+              value );
+
+test();
diff --git a/js/src/tests/ecma/String/15.5.5.1.js b/js/src/tests/ecma/String/15.5.5.1.js
new file mode 100644
index 000000000..9c9f8798b
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.5.1.js
@@ -0,0 +1,54 @@
+/* -*- tab-width: 2; 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:          15.5.5.1
+   ECMA Section:       String.length
+   Description:
+
+   The number of characters in the String value represented by this String
+   object.
+
+   Once a String object is created, this property is unchanging. It has the
+   attributes { DontEnum, DontDelete, ReadOnly }.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "15.5.5.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.length";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"var s = new String(); s.length",
+		0,
+		eval("var s = new String(); s.length") );
+
+new TestCase(   SECTION,
+		"var s = new String(); s.length = 10; s.length",
+		0,
+		eval("var s = new String(); s.length = 10; s.length") );
+
+new TestCase(   SECTION,
+		"var s = new String(); var props = ''; for ( var p in s ) {  props += p; };  props",
+		"",
+		eval("var s = new String(); var props = ''; for ( var p in s ) {  props += p; };  props") );
+
+new TestCase(   SECTION,
+		"var s = new String(); delete s.length",
+		false,
+		eval("var s = new String(); delete s.length") );
+
+new TestCase(   SECTION,
+		"var s = new String('hello'); delete s.length; s.length",
+		5,
+		eval("var s = new String('hello'); delete s.length; s.length") );
+
+test();
diff --git a/js/src/tests/ecma/String/browser.js b/js/src/tests/ecma/String/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/String/browser.js
diff --git a/js/src/tests/ecma/String/lastIndexOf-ToNumber-when-searchStr-larger-than-string.js b/js/src/tests/ecma/String/lastIndexOf-ToNumber-when-searchStr-larger-than-string.js
new file mode 100644
index 000000000..a4c3c316e
--- /dev/null
+++ b/js/src/tests/ecma/String/lastIndexOf-ToNumber-when-searchStr-larger-than-string.js
@@ -0,0 +1,22 @@
+/* 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/. */
+
+var str = "a";
+var searchStr = "abc";
+
+var position = new Object();
+var valueOfCalled = false;
+function positionValueOf() {
+    assertEq(valueOfCalled, false);
+    valueOfCalled = true;
+    return 0;
+}
+position.valueOf = positionValueOf;
+
+var result = str.lastIndexOf(searchStr, position);
+assertEq(result, -1);
+assertEq(valueOfCalled, true);
+
+if (typeof reportCompare == "function")
+    reportCompare(0, 0);
diff --git a/js/src/tests/ecma/String/shell.js b/js/src/tests/ecma/String/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/String/shell.js
diff --git a/js/src/tests/ecma/TypeConversion/9.2.js b/js/src/tests/ecma/TypeConversion/9.2.js
new file mode 100644
index 000000000..16a72f89e
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.2.js
@@ -0,0 +1,103 @@
+/* -*- 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:          9.2.js
+   ECMA Section:       9.2  Type Conversion:  ToBoolean
+   Description:        rules for converting an argument to a boolean.
+   undefined           false
+   Null                false
+   Boolean             input argument( no conversion )
+   Number              returns false for 0, -0, and NaN
+   otherwise return true
+   String              return false if the string is empty
+   (length is 0) otherwise the result is
+   true
+   Object              all return true
+
+   Author:             christine@netscape.com
+   Date:               14 july 1997
+*/
+var SECTION = "9.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "ToBoolean";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// special cases here
+
+new TestCase( SECTION,   "Boolean()",                     false,  Boolean() );
+new TestCase( SECTION,   "Boolean(var x)",                false,  Boolean(eval("var x")) );
+new TestCase( SECTION,   "Boolean(void 0)",               false,  Boolean(void 0) );
+new TestCase( SECTION,   "Boolean(null)",                 false,  Boolean(null) );
+new TestCase( SECTION,   "Boolean(false)",                false,  Boolean(false) );
+new TestCase( SECTION,   "Boolean(true)",                 true,   Boolean(true) );
+new TestCase( SECTION,   "Boolean(0)",                    false,  Boolean(0) );
+new TestCase( SECTION,   "Boolean(-0)",                   false,  Boolean(-0) );
+new TestCase( SECTION,   "Boolean(NaN)",                  false,  Boolean(Number.NaN) );
+new TestCase( SECTION,   "Boolean('')",                   false,  Boolean("") );
+
+// normal test cases here
+
+new TestCase( SECTION,   "Boolean(Infinity)",             true,   Boolean(Number.POSITIVE_INFINITY) );
+new TestCase( SECTION,   "Boolean(-Infinity)",            true,   Boolean(Number.NEGATIVE_INFINITY) );
+new TestCase( SECTION,   "Boolean(Math.PI)",              true,   Boolean(Math.PI) );
+new TestCase( SECTION,   "Boolean(1)",                    true,   Boolean(1) );
+new TestCase( SECTION,   "Boolean(-1)",                   true,   Boolean(-1) );
+new TestCase( SECTION,   "Boolean([tab])",                true,   Boolean("\t") );
+new TestCase( SECTION,   "Boolean('0')",                  true,   Boolean("0") );
+new TestCase( SECTION,   "Boolean('string')",             true,   Boolean("string") );
+
+// ToBoolean (object) should always return true.
+new TestCase( SECTION,   "Boolean(new String() )",        true,   Boolean(new String()) );
+new TestCase( SECTION,   "Boolean(new String('') )",      true,   Boolean(new String("")) );
+
+new TestCase( SECTION,   "Boolean(new Boolean(true))",    true,   Boolean(new Boolean(true)) );
+new TestCase( SECTION,   "Boolean(new Boolean(false))",   true,   Boolean(new Boolean(false)) );
+new TestCase( SECTION,   "Boolean(new Boolean() )",       true,   Boolean(new Boolean()) );
+
+new TestCase( SECTION,   "Boolean(new Array())",          true,   Boolean(new Array()) );
+
+new TestCase( SECTION,   "Boolean(new Number())",         true,   Boolean(new Number()) );
+new TestCase( SECTION,   "Boolean(new Number(-0))",       true,   Boolean(new Number(-0)) );
+new TestCase( SECTION,   "Boolean(new Number(0))",        true,   Boolean(new Number(0)) );
+new TestCase( SECTION,   "Boolean(new Number(NaN))",      true,   Boolean(new Number(Number.NaN)) );
+
+new TestCase( SECTION,   "Boolean(new Number(-1))",       true,   Boolean(new Number(-1)) );
+new TestCase( SECTION,   "Boolean(new Number(Infinity))", true,   Boolean(new Number(Number.POSITIVE_INFINITY)) );
+new TestCase( SECTION,   "Boolean(new Number(-Infinity))",true,   Boolean(new Number(Number.NEGATIVE_INFINITY)) );
+
+new TestCase( SECTION,    "Boolean(new Object())",       true,       Boolean(new Object()) );
+new TestCase( SECTION,    "Boolean(new Function())",     true,       Boolean(new Function()) );
+new TestCase( SECTION,    "Boolean(new Date())",         true,       Boolean(new Date()) );
+new TestCase( SECTION,    "Boolean(new Date(0))",         true,       Boolean(new Date(0)) );
+new TestCase( SECTION,    "Boolean(Math)",         true,       Boolean(Math) );
+
+// bug 375793
+new TestCase( SECTION,
+              "NaN ? true : false",
+              false,
+              (NaN ? true : false) );
+new TestCase( SECTION,
+              "1000 % 0 ? true : false",
+              false,
+              (1000 % 0 ? true : false) );
+new TestCase( SECTION,
+              "(function(a,b){ return a % b ? true : false })(1000, 0)",
+              false,
+              ((function(a,b){ return a % b ? true : false })(1000, 0)) );
+
+new TestCase( SECTION,
+              "(function(x) { return !(x) })(0/0)",
+              true,
+              ((function(x) { return !(x) })(0/0)) );
+new TestCase( SECTION,
+              "!(0/0)",
+              true,
+              (!(0/0)) );
+test();
+
diff --git a/js/src/tests/ecma/TypeConversion/9.3-1.js b/js/src/tests/ecma/TypeConversion/9.3-1.js
new file mode 100644
index 000000000..912b21962
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.3-1.js
@@ -0,0 +1,67 @@
+/* -*- 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:          9.3-1.js
+   ECMA Section:       9.3  Type Conversion:  ToNumber
+   Description:        rules for converting an argument to a number.
+   see 9.3.1 for cases for converting strings to numbers.
+   special cases:
+   undefined           NaN
+   Null                NaN
+   Boolean             1 if true; +0 if false
+   Number              the argument ( no conversion )
+   String              see test 9.3.1
+   Object              see test 9.3-1
+
+
+   This tests ToNumber applied to the object type, except
+   if object is string.  See 9.3-2 for
+   ToNumber( String object).
+
+   Author:             christine@netscape.com
+   Date:               10 july 1997
+
+*/
+var SECTION = "9.3-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " ToNumber");
+
+// object is Number
+new TestCase( SECTION, "Number(new Number())", 0, Number(new Number()) );
+new TestCase( SECTION, "typeof Number(new Number())", "number", typeof Number(new Number()) );
+
+new TestCase( SECTION, "Number(new Number(Number.NaN))", Number.NaN, Number(new Number(Number.NaN)) );
+new TestCase( SECTION, "typeof Number(new Number(Number.NaN))","number", typeof Number(new Number(Number.NaN)) );
+
+new TestCase( SECTION, "Number(new Number(0))", 0, Number(new Number(0)) );
+new TestCase( SECTION, "typeof Number(new Number(0))", "number", typeof Number(new Number(0)) );
+
+new TestCase( SECTION, "Number(new Number(null))", 0, Number(new Number(null)) );
+new TestCase( SECTION, "typeof Number(new Number(null))", "number", typeof Number(new Number(null)) );
+
+
+// new TestCase( SECTION, "Number(new Number(void 0))", Number.NaN, Number(new Number(void 0)) );
+new TestCase( SECTION, "Number(new Number(true))", 1, Number(new Number(true)) );
+new TestCase( SECTION, "typeof Number(new Number(true))", "number", typeof Number(new Number(true)) );
+
+new TestCase( SECTION, "Number(new Number(false))", 0, Number(new Number(false)) );
+new TestCase( SECTION, "typeof Number(new Number(false))", "number", typeof Number(new Number(false)) );
+
+// object is boolean
+new TestCase( SECTION, "Number(new Boolean(true))", 1, Number(new Boolean(true)) );
+new TestCase( SECTION, "typeof Number(new Boolean(true))", "number", typeof Number(new Boolean(true)) );
+
+new TestCase( SECTION, "Number(new Boolean(false))", 0, Number(new Boolean(false)) );
+new TestCase( SECTION, "typeof Number(new Boolean(false))", "number", typeof Number(new Boolean(false)) );
+
+// object is array
+new TestCase( SECTION, "Number(new Array(2,4,8,16,32))", Number.NaN, Number(new Array(2,4,8,16,32)) );
+new TestCase( SECTION, "typeof Number(new Array(2,4,8,16,32))", "number", typeof Number(new Array(2,4,8,16,32)) );
+
+test();
diff --git a/js/src/tests/ecma/TypeConversion/9.3.1-1.js b/js/src/tests/ecma/TypeConversion/9.3.1-1.js
new file mode 100644
index 000000000..70e80c5a7
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.3.1-1.js
@@ -0,0 +1,308 @@
+/* -*- 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:          9.3.1-1.js
+   ECMA Section:       9.3  Type Conversion:  ToNumber
+   Description:        rules for converting an argument to a number.
+   see 9.3.1 for cases for converting strings to numbers.
+   special cases:
+   undefined           NaN
+   Null                NaN
+   Boolean             1 if true; +0 if false
+   Number              the argument ( no conversion )
+   String              see test 9.3.1
+   Object              see test 9.3-1
+
+
+   This tests ToNumber applied to the string type
+
+   Author:             christine@netscape.com
+   Date:               10 july 1997
+
+*/
+var SECTION = "9.3.1-1";
+var VERSION = "ECMA_1";
+var TITLE   = "ToNumber applied to the String type";
+var BUGNUMBER="77391";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+//  StringNumericLiteral:::StrWhiteSpace:::StrWhiteSpaceChar StrWhiteSpace:::
+//
+//  Name    Unicode Value   Escape Sequence
+//  <TAB>   0X0009          \t
+//  <SP>    0X0020
+//  <FF>    0X000C          \f
+//  <VT>    0X000B
+//  <CR>    0X000D          \r
+//  <LF>    0X000A          \n
+new TestCase( SECTION,  "Number('')",           0,      Number("") );
+new TestCase( SECTION,  "Number(' ')",          0,      Number(" ") );
+new TestCase( SECTION,  "Number(\\t)",          0,      Number("\t") );
+new TestCase( SECTION,  "Number(\\n)",          0,      Number("\n") );
+new TestCase( SECTION,  "Number(\\r)",          0,      Number("\r") );
+new TestCase( SECTION,  "Number(\\f)",          0,      Number("\f") );
+
+new TestCase( SECTION,  "Number(String.fromCharCode(0x0009)",   0,  Number(String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "Number(String.fromCharCode(0x0020)",   0,  Number(String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "Number(String.fromCharCode(0x000C)",   0,  Number(String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "Number(String.fromCharCode(0x000B)",   0,  Number(String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "Number(String.fromCharCode(0x000D)",   0,  Number(String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "Number(String.fromCharCode(0x000A)",   0,  Number(String.fromCharCode(0x000A)) );
+
+//  a StringNumericLiteral may be preceeded or followed by whitespace and/or
+//  line terminators
+
+new TestCase( SECTION,  "Number( '   ' +  999 )",        999,    Number( '   '+999) );
+new TestCase( SECTION,  "Number( '\\n'  + 999 )",       999,    Number( '\n' +999) );
+new TestCase( SECTION,  "Number( '\\r'  + 999 )",       999,    Number( '\r' +999) );
+new TestCase( SECTION,  "Number( '\\t'  + 999 )",       999,    Number( '\t' +999) );
+new TestCase( SECTION,  "Number( '\\f'  + 999 )",       999,    Number( '\f' +999) );
+
+new TestCase( SECTION,  "Number( 999 + '   ' )",        999,    Number( 999+'   ') );
+new TestCase( SECTION,  "Number( 999 + '\\n' )",        999,    Number( 999+'\n' ) );
+new TestCase( SECTION,  "Number( 999 + '\\r' )",        999,    Number( 999+'\r' ) );
+new TestCase( SECTION,  "Number( 999 + '\\t' )",        999,    Number( 999+'\t' ) );
+new TestCase( SECTION,  "Number( 999 + '\\f' )",        999,    Number( 999+'\f' ) );
+
+new TestCase( SECTION,  "Number( '\\n'  + 999 + '\\n' )",         999,    Number( '\n' +999+'\n' ) );
+new TestCase( SECTION,  "Number( '\\r'  + 999 + '\\r' )",         999,    Number( '\r' +999+'\r' ) );
+new TestCase( SECTION,  "Number( '\\t'  + 999 + '\\t' )",         999,    Number( '\t' +999+'\t' ) );
+new TestCase( SECTION,  "Number( '\\f'  + 999 + '\\f' )",         999,    Number( '\f' +999+'\f' ) );
+
+new TestCase( SECTION,  "Number( '   ' +  '999' )",     999,    Number( '   '+'999') );
+new TestCase( SECTION,  "Number( '\\n'  + '999' )",       999,    Number( '\n' +'999') );
+new TestCase( SECTION,  "Number( '\\r'  + '999' )",       999,    Number( '\r' +'999') );
+new TestCase( SECTION,  "Number( '\\t'  + '999' )",       999,    Number( '\t' +'999') );
+new TestCase( SECTION,  "Number( '\\f'  + '999' )",       999,    Number( '\f' +'999') );
+
+new TestCase( SECTION,  "Number( '999' + '   ' )",        999,    Number( '999'+'   ') );
+new TestCase( SECTION,  "Number( '999' + '\\n' )",        999,    Number( '999'+'\n' ) );
+new TestCase( SECTION,  "Number( '999' + '\\r' )",        999,    Number( '999'+'\r' ) );
+new TestCase( SECTION,  "Number( '999' + '\\t' )",        999,    Number( '999'+'\t' ) );
+new TestCase( SECTION,  "Number( '999' + '\\f' )",        999,    Number( '999'+'\f' ) );
+
+new TestCase( SECTION,  "Number( '\\n'  + '999' + '\\n' )",         999,    Number( '\n' +'999'+'\n' ) );
+new TestCase( SECTION,  "Number( '\\r'  + '999' + '\\r' )",         999,    Number( '\r' +'999'+'\r' ) );
+new TestCase( SECTION,  "Number( '\\t'  + '999' + '\\t' )",         999,    Number( '\t' +'999'+'\t' ) );
+new TestCase( SECTION,  "Number( '\\f'  + '999' + '\\f' )",         999,    Number( '\f' +'999'+'\f' ) );
+
+var ws = ["",
+          " ",
+          "  ",
+          "   "];
+
+for (var i = 0, sz = ws.length; i < sz; i++)
+{
+  var start = ws[i];
+  for (var j = 0; j < sz; j++)
+  {
+    var end = ws[j];
+    new TestCase( SECTION,  "Number( '" + start + "' +  '0xA' )",       10,    Number( start+'0xA') );
+
+    new TestCase( SECTION,  "Number( '0xA' + '" + end + "' )",        10,    Number( '0xA'+end) );
+
+    new TestCase( SECTION,  "Number( '" + start + "'  + '0xA' + '" + end + "' )",         10,    Number( start +'0xA'+end ) );
+  }
+}
+
+new TestCase( SECTION,  "Number( String.fromCharCode(0x0009) +  '99' )",    99,     Number( String.fromCharCode(0x0009) +  '99' ) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x0020) +  '99' )",    99,     Number( String.fromCharCode(0x0020) +  '99' ) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000C) +  '99' )",    99,     Number( String.fromCharCode(0x000C) +  '99' ) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000B) +  '99' )",    99,     Number( String.fromCharCode(0x000B) +  '99' ) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000D) +  '99' )",    99,     Number( String.fromCharCode(0x000D) +  '99' ) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000A) +  '99' )",    99,     Number( String.fromCharCode(0x000A) +  '99' ) );
+
+new TestCase( SECTION,  "Number( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x0009)",    99,     Number( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x0020) +  '99' + String.fromCharCode(0x0020)",    99,     Number( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000C) +  '99' + String.fromCharCode(0x000C)",    99,     Number( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000D) +  '99' + String.fromCharCode(0x000D)",    99,     Number( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000B) +  '99' + String.fromCharCode(0x000B)",    99,     Number( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000A) +  '99' + String.fromCharCode(0x000A)",    99,     Number( String.fromCharCode(0x0009) +  '99' + String.fromCharCode(0x000A)) );
+
+new TestCase( SECTION,  "Number( '99' + String.fromCharCode(0x0009)",    99,     Number( '99' + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "Number( '99' + String.fromCharCode(0x0020)",    99,     Number( '99' + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "Number( '99' + String.fromCharCode(0x000C)",    99,     Number( '99' + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "Number( '99' + String.fromCharCode(0x000D)",    99,     Number( '99' + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "Number( '99' + String.fromCharCode(0x000B)",    99,     Number( '99' + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "Number( '99' + String.fromCharCode(0x000A)",    99,     Number( '99' + String.fromCharCode(0x000A)) );
+
+new TestCase( SECTION,  "Number( String.fromCharCode(0x0009) +  99 )",    99,     Number( String.fromCharCode(0x0009) +  99 ) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x0020) +  99 )",    99,     Number( String.fromCharCode(0x0020) +  99 ) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000C) +  99 )",    99,     Number( String.fromCharCode(0x000C) +  99 ) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000B) +  99 )",    99,     Number( String.fromCharCode(0x000B) +  99 ) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000D) +  99 )",    99,     Number( String.fromCharCode(0x000D) +  99 ) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000A) +  99 )",    99,     Number( String.fromCharCode(0x000A) +  99 ) );
+
+new TestCase( SECTION,  "Number( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x0009)",    99,     Number( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x0020) +  99 + String.fromCharCode(0x0020)",    99,     Number( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000C) +  99 + String.fromCharCode(0x000C)",    99,     Number( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000D) +  99 + String.fromCharCode(0x000D)",    99,     Number( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000B) +  99 + String.fromCharCode(0x000B)",    99,     Number( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "Number( String.fromCharCode(0x000A) +  99 + String.fromCharCode(0x000A)",    99,     Number( String.fromCharCode(0x0009) +  99 + String.fromCharCode(0x000A)) );
+
+new TestCase( SECTION,  "Number( 99 + String.fromCharCode(0x0009)",    99,     Number( 99 + String.fromCharCode(0x0009)) );
+new TestCase( SECTION,  "Number( 99 + String.fromCharCode(0x0020)",    99,     Number( 99 + String.fromCharCode(0x0020)) );
+new TestCase( SECTION,  "Number( 99 + String.fromCharCode(0x000C)",    99,     Number( 99 + String.fromCharCode(0x000C)) );
+new TestCase( SECTION,  "Number( 99 + String.fromCharCode(0x000D)",    99,     Number( 99 + String.fromCharCode(0x000D)) );
+new TestCase( SECTION,  "Number( 99 + String.fromCharCode(0x000B)",    99,     Number( 99 + String.fromCharCode(0x000B)) );
+new TestCase( SECTION,  "Number( 99 + String.fromCharCode(0x000A)",    99,     Number( 99 + String.fromCharCode(0x000A)) );
+
+
+// StrNumericLiteral:::StrDecimalLiteral:::Infinity
+
+new TestCase( SECTION,  "Number('Infinity')",   Math.pow(10,10000),   Number("Infinity") );
+new TestCase( SECTION,  "Number('-Infinity')", -Math.pow(10,10000),   Number("-Infinity") );
+new TestCase( SECTION,  "Number('+Infinity')",  Math.pow(10,10000),   Number("+Infinity") );
+
+// StrNumericLiteral:::   StrDecimalLiteral ::: DecimalDigits . DecimalDigits opt ExponentPart opt
+
+new TestCase( SECTION,  "Number('0')",          0,          Number("0") );
+new TestCase( SECTION,  "Number('-0')",         -0,         Number("-0") );
+new TestCase( SECTION,  "Number('+0')",          0,         Number("+0") );
+
+new TestCase( SECTION,  "Number('1')",          1,          Number("1") );
+new TestCase( SECTION,  "Number('-1')",         -1,         Number("-1") );
+new TestCase( SECTION,  "Number('+1')",          1,         Number("+1") );
+
+new TestCase( SECTION,  "Number('2')",          2,          Number("2") );
+new TestCase( SECTION,  "Number('-2')",         -2,         Number("-2") );
+new TestCase( SECTION,  "Number('+2')",          2,         Number("+2") );
+
+new TestCase( SECTION,  "Number('3')",          3,          Number("3") );
+new TestCase( SECTION,  "Number('-3')",         -3,         Number("-3") );
+new TestCase( SECTION,  "Number('+3')",          3,         Number("+3") );
+
+new TestCase( SECTION,  "Number('4')",          4,          Number("4") );
+new TestCase( SECTION,  "Number('-4')",         -4,         Number("-4") );
+new TestCase( SECTION,  "Number('+4')",          4,         Number("+4") );
+
+new TestCase( SECTION,  "Number('5')",          5,          Number("5") );
+new TestCase( SECTION,  "Number('-5')",         -5,         Number("-5") );
+new TestCase( SECTION,  "Number('+5')",          5,         Number("+5") );
+
+new TestCase( SECTION,  "Number('6')",          6,          Number("6") );
+new TestCase( SECTION,  "Number('-6')",         -6,         Number("-6") );
+new TestCase( SECTION,  "Number('+6')",          6,         Number("+6") );
+
+new TestCase( SECTION,  "Number('7')",          7,          Number("7") );
+new TestCase( SECTION,  "Number('-7')",         -7,         Number("-7") );
+new TestCase( SECTION,  "Number('+7')",          7,         Number("+7") );
+
+new TestCase( SECTION,  "Number('8')",          8,          Number("8") );
+new TestCase( SECTION,  "Number('-8')",         -8,         Number("-8") );
+new TestCase( SECTION,  "Number('+8')",          8,         Number("+8") );
+
+new TestCase( SECTION,  "Number('9')",          9,          Number("9") );
+new TestCase( SECTION,  "Number('-9')",         -9,         Number("-9") );
+new TestCase( SECTION,  "Number('+9')",          9,         Number("+9") );
+
+new TestCase( SECTION,  "Number('3.14159')",    3.14159,    Number("3.14159") );
+new TestCase( SECTION,  "Number('-3.14159')",   -3.14159,   Number("-3.14159") );
+new TestCase( SECTION,  "Number('+3.14159')",   3.14159,    Number("+3.14159") );
+
+new TestCase( SECTION,  "Number('3.')",         3,          Number("3.") );
+new TestCase( SECTION,  "Number('-3.')",        -3,         Number("-3.") );
+new TestCase( SECTION,  "Number('+3.')",        3,          Number("+3.") );
+
+new TestCase( SECTION,  "Number('3.e1')",       30,         Number("3.e1") );
+new TestCase( SECTION,  "Number('-3.e1')",      -30,        Number("-3.e1") );
+new TestCase( SECTION,  "Number('+3.e1')",      30,         Number("+3.e1") );
+
+new TestCase( SECTION,  "Number('3.e+1')",       30,         Number("3.e+1") );
+new TestCase( SECTION,  "Number('-3.e+1')",      -30,        Number("-3.e+1") );
+new TestCase( SECTION,  "Number('+3.e+1')",      30,         Number("+3.e+1") );
+
+new TestCase( SECTION,  "Number('3.e-1')",       .30,         Number("3.e-1") );
+new TestCase( SECTION,  "Number('-3.e-1')",      -.30,        Number("-3.e-1") );
+new TestCase( SECTION,  "Number('+3.e-1')",      .30,         Number("+3.e-1") );
+
+// StrDecimalLiteral:::  .DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "Number('.00001')",     0.00001,    Number(".00001") );
+new TestCase( SECTION,  "Number('+.00001')",    0.00001,    Number("+.00001") );
+new TestCase( SECTION,  "Number('-0.0001')",    -0.00001,   Number("-.00001") );
+
+new TestCase( SECTION,  "Number('.01e2')",      1,          Number(".01e2") );
+new TestCase( SECTION,  "Number('+.01e2')",     1,          Number("+.01e2") );
+new TestCase( SECTION,  "Number('-.01e2')",     -1,         Number("-.01e2") );
+
+new TestCase( SECTION,  "Number('.01e+2')",      1,         Number(".01e+2") );
+new TestCase( SECTION,  "Number('+.01e+2')",     1,         Number("+.01e+2") );
+new TestCase( SECTION,  "Number('-.01e+2')",     -1,        Number("-.01e+2") );
+
+new TestCase( SECTION,  "Number('.01e-2')",      0.0001,    Number(".01e-2") );
+new TestCase( SECTION,  "Number('+.01e-2')",     0.0001,    Number("+.01e-2") );
+new TestCase( SECTION,  "Number('-.01e-2')",     -0.0001,   Number("-.01e-2") );
+
+//  StrDecimalLiteral:::    DecimalDigits ExponentPart opt
+
+new TestCase( SECTION,  "Number('1234e5')",     123400000,  Number("1234e5") );
+new TestCase( SECTION,  "Number('+1234e5')",    123400000,  Number("+1234e5") );
+new TestCase( SECTION,  "Number('-1234e5')",    -123400000, Number("-1234e5") );
+
+new TestCase( SECTION,  "Number('1234e+5')",    123400000,  Number("1234e+5") );
+new TestCase( SECTION,  "Number('+1234e+5')",   123400000,  Number("+1234e+5") );
+new TestCase( SECTION,  "Number('-1234e+5')",   -123400000, Number("-1234e+5") );
+
+new TestCase( SECTION,  "Number('1234e-5')",     0.01234,  Number("1234e-5") );
+new TestCase( SECTION,  "Number('+1234e-5')",    0.01234,  Number("+1234e-5") );
+new TestCase( SECTION,  "Number('-1234e-5')",    -0.01234, Number("-1234e-5") );
+
+// StrNumericLiteral::: HexIntegerLiteral
+
+new TestCase( SECTION,  "Number('0x0')",        0,          Number("0x0"));
+new TestCase( SECTION,  "Number('0x1')",        1,          Number("0x1"));
+new TestCase( SECTION,  "Number('0x2')",        2,          Number("0x2"));
+new TestCase( SECTION,  "Number('0x3')",        3,          Number("0x3"));
+new TestCase( SECTION,  "Number('0x4')",        4,          Number("0x4"));
+new TestCase( SECTION,  "Number('0x5')",        5,          Number("0x5"));
+new TestCase( SECTION,  "Number('0x6')",        6,          Number("0x6"));
+new TestCase( SECTION,  "Number('0x7')",        7,          Number("0x7"));
+new TestCase( SECTION,  "Number('0x8')",        8,          Number("0x8"));
+new TestCase( SECTION,  "Number('0x9')",        9,          Number("0x9"));
+new TestCase( SECTION,  "Number('0xa')",        10,         Number("0xa"));
+new TestCase( SECTION,  "Number('0xb')",        11,         Number("0xb"));
+new TestCase( SECTION,  "Number('0xc')",        12,         Number("0xc"));
+new TestCase( SECTION,  "Number('0xd')",        13,         Number("0xd"));
+new TestCase( SECTION,  "Number('0xe')",        14,         Number("0xe"));
+new TestCase( SECTION,  "Number('0xf')",        15,         Number("0xf"));
+new TestCase( SECTION,  "Number('0xA')",        10,         Number("0xA"));
+new TestCase( SECTION,  "Number('0xB')",        11,         Number("0xB"));
+new TestCase( SECTION,  "Number('0xC')",        12,         Number("0xC"));
+new TestCase( SECTION,  "Number('0xD')",        13,         Number("0xD"));
+new TestCase( SECTION,  "Number('0xE')",        14,         Number("0xE"));
+new TestCase( SECTION,  "Number('0xF')",        15,         Number("0xF"));
+
+new TestCase( SECTION,  "Number('0X0')",        0,          Number("0X0"));
+new TestCase( SECTION,  "Number('0X1')",        1,          Number("0X1"));
+new TestCase( SECTION,  "Number('0X2')",        2,          Number("0X2"));
+new TestCase( SECTION,  "Number('0X3')",        3,          Number("0X3"));
+new TestCase( SECTION,  "Number('0X4')",        4,          Number("0X4"));
+new TestCase( SECTION,  "Number('0X5')",        5,          Number("0X5"));
+new TestCase( SECTION,  "Number('0X6')",        6,          Number("0X6"));
+new TestCase( SECTION,  "Number('0X7')",        7,          Number("0X7"));
+new TestCase( SECTION,  "Number('0X8')",        8,          Number("0X8"));
+new TestCase( SECTION,  "Number('0X9')",        9,          Number("0X9"));
+new TestCase( SECTION,  "Number('0Xa')",        10,         Number("0Xa"));
+new TestCase( SECTION,  "Number('0Xb')",        11,         Number("0Xb"));
+new TestCase( SECTION,  "Number('0Xc')",        12,         Number("0Xc"));
+new TestCase( SECTION,  "Number('0Xd')",        13,         Number("0Xd"));
+new TestCase( SECTION,  "Number('0Xe')",        14,         Number("0Xe"));
+new TestCase( SECTION,  "Number('0Xf')",        15,         Number("0Xf"));
+new TestCase( SECTION,  "Number('0XA')",        10,         Number("0XA"));
+new TestCase( SECTION,  "Number('0XB')",        11,         Number("0XB"));
+new TestCase( SECTION,  "Number('0XC')",        12,         Number("0XC"));
+new TestCase( SECTION,  "Number('0XD')",        13,         Number("0XD"));
+new TestCase( SECTION,  "Number('0XE')",        14,         Number("0XE"));
+new TestCase( SECTION,  "Number('0XF')",        15,         Number("0XF"));
+
+test();
+
diff --git a/js/src/tests/ecma/TypeConversion/9.3.1-2.js b/js/src/tests/ecma/TypeConversion/9.3.1-2.js
new file mode 100644
index 000000000..671345980
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.3.1-2.js
@@ -0,0 +1,53 @@
+/* -*- 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:          9.3.1-2.js
+   ECMA Section:       9.3  Type Conversion:  ToNumber
+   Description:        rules for converting an argument to a number.
+   see 9.3.1 for cases for converting strings to numbers.
+   special cases:
+   undefined           NaN
+   Null                NaN
+   Boolean             1 if true; +0 if false
+   Number              the argument ( no conversion )
+   String              see test 9.3.1
+   Object              see test 9.3-1
+
+   This tests special cases of ToNumber(string) that are
+   not covered in 9.3.1-1.js.
+
+   Author:             christine@netscape.com
+   Date:               10 july 1997
+
+*/
+var SECTION = "9.3.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "ToNumber applied to the String type";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// A StringNumericLiteral may not use octal notation
+
+new TestCase( SECTION,  "Number(00)",        0,         Number("00"));
+new TestCase( SECTION,  "Number(01)",        1,         Number("01"));
+new TestCase( SECTION,  "Number(02)",        2,         Number("02"));
+new TestCase( SECTION,  "Number(03)",        3,         Number("03"));
+new TestCase( SECTION,  "Number(04)",        4,         Number("04"));
+new TestCase( SECTION,  "Number(05)",        5,         Number("05"));
+new TestCase( SECTION,  "Number(06)",        6,         Number("06"));
+new TestCase( SECTION,  "Number(07)",        7,         Number("07"));
+new TestCase( SECTION,  "Number(010)",       10,        Number("010"));
+new TestCase( SECTION,  "Number(011)",       11,        Number("011"));
+
+// A StringNumericLIteral may have any number of leading 0 digits
+
+new TestCase( SECTION,  "Number(001)",        1,         Number("001"));
+new TestCase( SECTION,  "Number(0001)",       1,         Number("0001"));
+
+test();
+
diff --git a/js/src/tests/ecma/TypeConversion/9.3.1-3.js b/js/src/tests/ecma/TypeConversion/9.3.1-3.js
new file mode 100644
index 000000000..18544e955
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.3.1-3.js
@@ -0,0 +1,718 @@
+/* -*- tab-width: 2; 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:          9.3.1-3.js
+   ECMA Section:       9.3  Type Conversion:  ToNumber
+   Description:        rules for converting an argument to a number.
+   see 9.3.1 for cases for converting strings to numbers.
+   special cases:
+   undefined           NaN
+   Null                NaN
+   Boolean             1 if true; +0 if false
+   Number              the argument ( no conversion )
+   String              see test 9.3.1
+   Object              see test 9.3-1
+
+
+   Test cases provided by waldemar.
+
+
+   Author:             christine@netscape.com
+   Date:               10 june 1998
+
+*/
+
+var SECTION = "9.3.1-3";
+var VERSION = "ECMA_1";
+var BUGNUMBER="129087";
+
+var TITLE   = "Number To String, String To Number";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// test case from http://scopus.mcom.com/bugsplat/show_bug.cgi?id=312954
+var z = 0;
+
+new TestCase(
+  SECTION,
+  "var z = 0; print(1/-z)",
+  -Infinity,
+  1/-z );
+
+
+
+
+
+// test cases from bug http://scopus.mcom.com/bugsplat/show_bug.cgi?id=122882
+
+
+
+new TestCase( SECTION,
+	      '- -"0x80000000"',
+	      2147483648,
+	      - -"0x80000000" );
+
+new TestCase( SECTION,
+	      '- -"0x100000000"',
+	      4294967296,
+	      - -"0x100000000" );
+
+new TestCase( SECTION,
+	      '- "-0x123456789abcde8"',
+	      NaN,
+	      - "-0x123456789abcde8" );
+
+new TestCase( SECTION,
+	      '- "+0x123456789abcde8"',
+	      NaN,
+	      - "+0x123456789abcde8" );
+
+// Convert some large numbers to string
+
+
+new TestCase( SECTION,
+	      "1e2000 +''",
+	      "Infinity",
+	      1e2000 +"" );
+
+new TestCase( SECTION,
+	      "1e2000",
+	      Infinity,
+	      1e2000 );
+
+new TestCase( SECTION,
+	      "-1e2000 +''",
+	      "-Infinity",
+	      -1e2000 +"" );
+
+new TestCase( SECTION,
+	      "-\"1e2000\"",
+	      -Infinity,
+	      -"1e2000" );
+
+new TestCase( SECTION,
+	      "-\"-1e2000\" +''",
+	      "Infinity",
+	      -"-1e2000" +"" );
+
+new TestCase( SECTION,
+	      "1e-2000",
+	      0,
+	      1e-2000 );
+
+new TestCase( SECTION,
+	      "1/1e-2000",
+	      Infinity,
+	      1/1e-2000 );
+
+// convert some strings to large numbers
+
+new TestCase( SECTION,
+	      "1/-1e-2000",
+	      -Infinity,
+	      1/-1e-2000 );
+
+new TestCase( SECTION,
+	      "1/\"1e-2000\"",
+	      Infinity,
+	      1/"1e-2000" );
+
+new TestCase( SECTION,
+	      "1/\"-1e-2000\"",
+	      -Infinity,
+	      1/"-1e-2000" );
+
+new TestCase( SECTION,
+	      "parseFloat(\"1e2000\")",
+	      Infinity,
+	      parseFloat("1e2000") );
+
+new TestCase( SECTION,
+	      "parseFloat(\"1e-2000\")",
+	      0,
+	      parseFloat("1e-2000") );
+
+new TestCase( SECTION,
+	      "1.7976931348623157E+308",
+	      1.7976931348623157e+308,
+	      1.7976931348623157E+308 );
+
+new TestCase( SECTION,
+	      "1.7976931348623158e+308",
+	      1.7976931348623157e+308,
+	      1.7976931348623158e+308 );
+
+new TestCase( SECTION,
+	      "1.7976931348623159e+308",
+	      Infinity,
+	      1.7976931348623159e+308 );
+
+s =
+  "17976931348623158079372897140530341507993413271003782693617377898044496829276475094664901797758720709633028641669288791094655554785194040263065748867150582068";
+
+print("s = " + s);
+print("-s = " + (-s));
+
+new TestCase( SECTION,
+	      "s = " + s +"; s +="+
+	      "\"190890200070838367627385484581771153176447573027006985557136695962284291481986083493647529271907416844436551070434271155969950809304288017790417449779\""+
+
+	      +"; s",
+	      "17976931348623158079372897140530341507993413271003782693617377898044496829276475094664901797758720709633028641669288791094655554785194040263065748867150582068190890200070838367627385484581771153176447573027006985557136695962284291481986083493647529271907416844436551070434271155969950809304288017790417449779",
+	      s +=
+	      "190890200070838367627385484581771153176447573027006985557136695962284291481986083493647529271907416844436551070434271155969950809304288017790417449779"
+  );
+
+s1 = s+1;
+
+print("s1 = " + s1);
+print("-s1 = " + (-s1));
+
+new TestCase( SECTION,
+	      "s1 = s+1; s1",
+	      "179769313486231580793728971405303415079934132710037826936173778980444968292764750946649017977587207096330286416692887910946555547851940402630657488671505820681908902000708383676273854845817711531764475730270069855571366959622842914819860834936475292719074168444365510704342711559699508093042880177904174497791",
+	      s1 );
+
+/***** This answer is preferred but -Infinity is also acceptable here *****/
+
+new TestCase( SECTION,
+	      "-s1 == Infinity || s1 == 1.7976931348623157e+308",
+	      true,
+	      -s1 == Infinity || s1 == 1.7976931348623157e+308 );
+
+s2 = s + 2;
+
+print("s2 = " + s2);
+print("-s2 = " + (-s2));
+
+new TestCase( SECTION,
+	      "s2 = s+2; s2",
+	      "179769313486231580793728971405303415079934132710037826936173778980444968292764750946649017977587207096330286416692887910946555547851940402630657488671505820681908902000708383676273854845817711531764475730270069855571366959622842914819860834936475292719074168444365510704342711559699508093042880177904174497792",
+	      s2 );
+
+// ***** This answer is preferred but -1.7976931348623157e+308 is also acceptable here *****
+new TestCase( SECTION,
+	      "-s2 == -Infinity || -s2 == -1.7976931348623157e+308 ",
+	      true,
+	      -s2 == -Infinity || -s2 == -1.7976931348623157e+308 );
+
+s3 = s+3;
+
+print("s3 = " + s3);
+print("-s3 = " + (-s3));
+
+new TestCase( SECTION,
+	      "s3 = s+3; s3",
+	      "179769313486231580793728971405303415079934132710037826936173778980444968292764750946649017977587207096330286416692887910946555547851940402630657488671505820681908902000708383676273854845817711531764475730270069855571366959622842914819860834936475292719074168444365510704342711559699508093042880177904174497793",
+	      s3 );
+
+//***** This answer is preferred but -1.7976931348623157e+308 is also acceptable here *****
+
+new TestCase( SECTION,
+	      "-s3 == -Infinity || -s3 == -1.7976931348623157e+308",
+	      true,
+	      -s3 == -Infinity || -s3 == -1.7976931348623157e+308 );
+
+
+//***** This answer is preferred but Infinity is also acceptable here *****
+
+new TestCase( SECTION,
+	      "parseInt(s1,10) == 1.7976931348623157e+308 || parseInt(s1,10) == Infinity",
+	      true,
+	      parseInt(s1,10) == 1.7976931348623157e+308 || parseInt(s1,10) == Infinity );
+
+//***** This answer is preferred but 1.7976931348623157e+308 is also acceptable here *****
+new TestCase( SECTION,
+	      "parseInt(s2,10) == Infinity || parseInt(s2,10) == 1.7976931348623157e+308",
+	      true ,
+	      parseInt(s2,10) == Infinity || parseInt(s2,10) == 1.7976931348623157e+308 );
+
+//***** This answer is preferred but Infinity is also acceptable here *****
+
+new TestCase( SECTION,
+	      "parseInt(s1) == 1.7976931348623157e+308 || parseInt(s1) == Infinity",
+	      true,
+	      parseInt(s1) == 1.7976931348623157e+308 || parseInt(s1) == Infinity);
+
+//***** This answer is preferred but 1.7976931348623157e+308 is also acceptable here *****
+new TestCase( SECTION,
+	      "parseInt(s2) == Infinity || parseInt(s2) == 1.7976931348623157e+308",
+	      true,
+	      parseInt(s2) == Infinity || parseInt(s2) == 1.7976931348623157e+308 );
+
+new TestCase( SECTION,
+	      "0x12345678",
+	      305419896,
+	      0x12345678 );
+
+new TestCase( SECTION,
+	      "0x80000000",
+	      2147483648,
+	      0x80000000 );
+
+new TestCase( SECTION,
+	      "0xffffffff",
+	      4294967295,
+	      0xffffffff );
+
+new TestCase( SECTION,
+	      "0x100000000",
+	      4294967296,
+	      0x100000000 );
+
+new TestCase( SECTION,
+	      "077777777777777777",
+	      2251799813685247,
+	      077777777777777777 );
+
+new TestCase( SECTION,
+	      "077777777777777776",
+	      2251799813685246,
+	      077777777777777776 );
+
+new TestCase( SECTION,
+	      "0x1fffffffffffff",
+	      9007199254740991,
+	      0x1fffffffffffff );
+
+new TestCase( SECTION,
+	      "0x20000000000000",
+	      9007199254740992,
+	      0x20000000000000 );
+
+new TestCase( SECTION,
+	      "0x20123456789abc",
+	      9027215253084860,
+	      0x20123456789abc );
+
+new TestCase( SECTION,
+	      "0x20123456789abd",
+	      9027215253084860,
+	      0x20123456789abd );
+
+new TestCase( SECTION,
+	      "0x20123456789abe",
+	      9027215253084862,
+	      0x20123456789abe );
+
+new TestCase( SECTION,
+	      "0x20123456789abf",
+	      9027215253084864,
+	      0x20123456789abf );
+
+/***** These test the round-to-nearest-or-even-if-equally-close rule *****/
+
+new TestCase( SECTION,
+	      "0x1000000000000080",
+	      1152921504606847000,
+	      0x1000000000000080 );
+
+new TestCase( SECTION,
+	      "0x1000000000000081",
+	      1152921504606847200,
+	      0x1000000000000081 );
+
+new TestCase( SECTION,
+	      "0x1000000000000100",
+	      1152921504606847200,
+	      0x1000000000000100 );
+new TestCase( SECTION,
+	      "0x100000000000017f",
+	      1152921504606847200,
+	      0x100000000000017f );
+
+new TestCase( SECTION,
+	      "0x1000000000000180",
+	      1152921504606847500,
+	      0x1000000000000180 );
+
+new TestCase( SECTION,
+	      "0x1000000000000181",
+	      1152921504606847500,
+	      0x1000000000000181 );
+
+new TestCase( SECTION,
+	      "0x10000000000001f0",
+	      1152921504606847500,
+	      0x10000000000001f0 );
+
+new TestCase( SECTION,
+	      "0x1000000000000200",
+	      1152921504606847500,
+	      0x1000000000000200 );
+
+new TestCase( SECTION,
+	      "0x100000000000027f",
+	      1152921504606847500,
+	      0x100000000000027f );
+
+new TestCase( SECTION,
+	      "0x1000000000000280",
+	      1152921504606847500,
+	      0x1000000000000280 );
+
+new TestCase( SECTION,
+	      "0x1000000000000281",
+	      1152921504606847700,
+	      0x1000000000000281 );
+
+new TestCase( SECTION,
+	      "0x10000000000002ff",
+	      1152921504606847700,
+	      0x10000000000002ff );
+
+new TestCase( SECTION,
+	      "0x1000000000000300",
+	      1152921504606847700,
+	      0x1000000000000300 );
+
+new TestCase( SECTION,
+	      "0x10000000000000000",
+	      18446744073709552000,
+	      0x10000000000000000 );
+
+new TestCase( SECTION,
+	      "parseInt(\"000000100000000100100011010001010110011110001001101010111100\",2)",
+	      9027215253084860,
+	      parseInt("000000100000000100100011010001010110011110001001101010111100",2) );
+
+new TestCase( SECTION,
+	      "parseInt(\"000000100000000100100011010001010110011110001001101010111101\",2)",
+	      9027215253084860,
+	      parseInt("000000100000000100100011010001010110011110001001101010111101",2) );
+
+new TestCase( SECTION,
+	      "parseInt(\"000000100000000100100011010001010110011110001001101010111111\",2)",
+	      9027215253084864,
+	      parseInt("000000100000000100100011010001010110011110001001101010111111",2) );
+
+new TestCase( SECTION,
+	      "parseInt(\"0000001000000001001000110100010101100111100010011010101111010\",2)",
+	      18054430506169720,
+	      parseInt("0000001000000001001000110100010101100111100010011010101111010",2));
+
+new TestCase( SECTION,
+	      "parseInt(\"0000001000000001001000110100010101100111100010011010101111011\",2)",
+	      18054430506169724,
+	      parseInt("0000001000000001001000110100010101100111100010011010101111011",2) );
+
+new TestCase( SECTION,
+	      "parseInt(\"0000001000000001001000110100010101100111100010011010101111100\",2)",
+	      18054430506169724,
+	      parseInt("0000001000000001001000110100010101100111100010011010101111100",2));
+
+new TestCase( SECTION,
+	      "parseInt(\"0000001000000001001000110100010101100111100010011010101111110\",2)",
+	      18054430506169728,
+	      parseInt("0000001000000001001000110100010101100111100010011010101111110",2));
+
+new TestCase( SECTION,
+	      "parseInt(\"yz\",35)",
+	      34,
+	      parseInt("yz",35) );
+
+new TestCase( SECTION,
+	      "parseInt(\"yz\",36)",
+	      1259,
+	      parseInt("yz",36) );
+
+new TestCase( SECTION,
+	      "parseInt(\"yz\",37)",
+	      NaN,
+	      parseInt("yz",37) );
+
+new TestCase( SECTION,
+	      "parseInt(\"+77\")",
+	      77,
+	      parseInt("+77") );
+
+new TestCase( SECTION,
+	      "parseInt(\"-77\",9)",
+	      -70,
+	      parseInt("-77",9) );
+
+new TestCase( SECTION,
+	      "parseInt(\"\\u20001234\\u2000\")",
+	      1234,
+	      parseInt("\u20001234\u2000") );
+
+new TestCase( SECTION,
+	      "parseInt(\"123456789012345678\")",
+	      123456789012345680,
+	      parseInt("123456789012345678") );
+
+new TestCase( SECTION,
+	      "parseInt(\"9\",8)",
+	      NaN,
+	      parseInt("9",8) );
+
+new TestCase( SECTION,
+	      "parseInt(\"1e2\")",
+	      1,
+	      parseInt("1e2") );
+
+new TestCase( SECTION,
+	      "parseInt(\"1.9999999999999999999\")",
+	      1,
+	      parseInt("1.9999999999999999999") );
+
+new TestCase( SECTION,
+	      "parseInt(\"0x10\")",
+	      16,
+	      parseInt("0x10") );
+
+new TestCase( SECTION,
+	      "parseInt(\"0x10\",10)",
+	      0,
+	      parseInt("0x10",10) );
+
+new TestCase( SECTION,
+	      "parseInt(\"0022\")",
+	      22,
+	      parseInt("0022") );
+
+new TestCase( SECTION,
+	      "parseInt(\"0022\", 8)",
+	      18,
+	      parseInt("0022", 8) );
+
+new TestCase( SECTION,
+	      "parseInt(\"0022\",10)",
+	      22,
+	      parseInt("0022",10) );
+
+new TestCase( SECTION,
+	      "parseInt(\"0x1000000000000080\")",
+	      1152921504606847000,
+	      parseInt("0x1000000000000080") );
+
+new TestCase( SECTION,
+	      "parseInt(\"0x1000000000000081\")",
+	      1152921504606847200,
+	      parseInt("0x1000000000000081") );
+
+s =
+  "0xFFFFFFFFFFFFF80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000";
+
+new TestCase( SECTION, "s = "+
+	      "\"0xFFFFFFFFFFFFF80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\";"+
+	      "s",
+	      "0xFFFFFFFFFFFFF80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+	      s );
+
+
+new TestCase( SECTION, "s +="+
+	      "\"0000000000000000000000000000000000000\"; s",
+	      "0xFFFFFFFFFFFFF800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+	      s += "0000000000000000000000000000000000000" );
+
+new TestCase( SECTION, "-s",
+	      -1.7976931348623157e+308,
+	      -s );
+
+s =
+  "0xFFFFFFFFFFFFF80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000";
+
+new TestCase( SECTION, "s ="+
+	      "\"0xFFFFFFFFFFFFF80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\";"+
+	      "s",
+	      "0xFFFFFFFFFFFFF80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+	      s );
+
+new TestCase( SECTION,
+	      "s += \"0000000000000000000000000000000000001\"",
+	      "0xFFFFFFFFFFFFF800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001",
+	      s += "0000000000000000000000000000000000001" );
+
+new TestCase( SECTION,
+	      "-s",
+	      -1.7976931348623157e+308,
+	      -s );
+
+s =
+  "0xFFFFFFFFFFFFFC0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000";
+
+new TestCase( SECTION,
+	      "s ="+
+	      "\"0xFFFFFFFFFFFFFC0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\";"+
+	      "s",
+	      "0xFFFFFFFFFFFFFC0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+	      s );
+
+
+new TestCase( SECTION,
+	      "s += \"0000000000000000000000000000000000000\"",
+	      "0xFFFFFFFFFFFFFC00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+	      s += "0000000000000000000000000000000000000");
+
+
+new TestCase( SECTION,
+	      "-s",
+	      -Infinity,
+	      -s );
+
+s =
+  "0xFFFFFFFFFFFFFB0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000";
+
+new TestCase( SECTION,
+	      "s = "+
+	      "\"0xFFFFFFFFFFFFFB0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\";s",
+	      "0xFFFFFFFFFFFFFB0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+	      s);
+
+new TestCase( SECTION,
+	      "s += \"0000000000000000000000000000000000001\"",
+	      "0xFFFFFFFFFFFFFB00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001",
+	      s += "0000000000000000000000000000000000001" );
+
+new TestCase( SECTION,
+	      "-s",
+	      -1.7976931348623157e+308,
+	      -s );
+
+new TestCase( SECTION,
+	      "s += \"0\"",
+	      "0xFFFFFFFFFFFFFB000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010",
+	      s += "0" );
+
+new TestCase( SECTION,
+	      "-s",
+	      -Infinity,
+	      -s );
+
+new TestCase( SECTION,
+	      "parseInt(s)",
+	      Infinity,
+	      parseInt(s) );
+
+new TestCase( SECTION,
+	      "parseInt(s,32)",
+	      0,
+	      parseInt(s,32) );
+
+new TestCase( SECTION,
+	      "parseInt(s,36)",
+	      Infinity,
+	      parseInt(s,36) );
+
+new TestCase( SECTION,
+	      "-\"\"",
+	      0,
+	      -"" );
+
+new TestCase( SECTION,
+	      "-\" \"",
+	      0,
+	      -" " );
+
+new TestCase( SECTION,
+	      "-\"999\"",
+	      -999,
+	      -"999" );
+
+new TestCase( SECTION,
+	      "-\" 999\"",
+	      -999,
+	      -" 999" );
+
+new TestCase( SECTION,
+	      "-\"\\t999\"",
+	      -999,
+	      -"\t999" );
+
+new TestCase( SECTION,
+	      "-\"013  \"",
+	      -13,
+	      -"013  " );
+
+new TestCase( SECTION,
+	      "-\"999\\t\"",
+	      -999,
+	      -"999\t" );
+
+new TestCase( SECTION,
+	      "-\"-Infinity\"",
+	      Infinity,
+	      -"-Infinity" );
+
+new TestCase( SECTION,
+	      "-\"+Infinity\"",
+	      -Infinity,
+	      -"+Infinity" );
+
+new TestCase( SECTION,
+	      "-\"+Infiniti\"",
+	      NaN,
+	      -"+Infiniti" );
+
+new TestCase( SECTION,
+	      "- -\"0x80000000\"",
+	      2147483648,
+	      - -"0x80000000" );
+
+new TestCase( SECTION,
+	      "- -\"0x100000000\"",
+	      4294967296,
+	      - -"0x100000000" );
+
+new TestCase( SECTION,
+	      "- \"-0x123456789abcde8\"",
+	      NaN,
+	      - "-0x123456789abcde8" );
+
+new TestCase( SECTION,
+	      "- \"+0x123456789abcde8\"",
+	      NaN,
+	      - "+0x123456789abcde8" );
+
+// the following two tests are not strictly ECMA 1.0
+
+new TestCase( SECTION,
+	      "-\"\\u20001234\\u2001\"",
+	      -1234,
+	      -"\u20001234\u2001" );
+
+new TestCase( SECTION,
+	      "-\"\\u20001234\\0\"",
+	      NaN,
+	      -"\u20001234\0" );
+
+new TestCase( SECTION,
+	      "-\"0x10\"",
+	      -16,
+	      -"0x10" );
+
+new TestCase( SECTION,
+	      "-\"+\"",
+	      NaN,
+	      -"+" );
+
+new TestCase( SECTION,
+	      "-\"-\"",
+	      NaN,
+	      -"-" );
+
+new TestCase( SECTION,
+	      "-\"-0-\"",
+	      NaN,
+	      -"-0-" );
+
+new TestCase( SECTION,
+	      "-\"1e-\"",
+	      NaN,
+	      -"1e-" );
+
+new TestCase( SECTION,
+	      "-\"1e-1\"",
+	      -0.1,
+	      -"1e-1" );
+
+test();
+
+
diff --git a/js/src/tests/ecma/TypeConversion/9.3.js b/js/src/tests/ecma/TypeConversion/9.3.js
new file mode 100644
index 000000000..21e2b3d81
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.3.js
@@ -0,0 +1,53 @@
+/* -*- 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:          9.3.js
+   ECMA Section:       9.3  Type Conversion:  ToNumber
+   Description:        rules for converting an argument to a number.
+   see 9.3.1 for cases for converting strings to numbers.
+   special cases:
+   undefined           NaN
+   Null                NaN
+   Boolean             1 if true; +0 if false
+   Number              the argument ( no conversion )
+   String              see test 9.3.1
+   Object              see test 9.3-1
+
+   For ToNumber applied to the String type, see test 9.3.1.
+   For ToNumber applied to the object type, see test 9.3-1.
+
+   Author:             christine@netscape.com
+   Date:               10 july 1997
+
+*/
+var SECTION = "9.3";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "ToNumber";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// special cases here
+
+new TestCase( SECTION,   "Number()",                      0,              Number() );
+new TestCase( SECTION,   "Number(eval('var x'))",         Number.NaN,     Number(eval("var x")) );
+new TestCase( SECTION,   "Number(void 0)",                Number.NaN,     Number(void 0) );
+new TestCase( SECTION,   "Number(null)",                  0,              Number(null) );
+new TestCase( SECTION,   "Number(true)",                  1,              Number(true) );
+new TestCase( SECTION,   "Number(false)",                 0,              Number(false) );
+new TestCase( SECTION,   "Number(0)",                     0,              Number(0) );
+new TestCase( SECTION,   "Number(-0)",                    -0,             Number(-0) );
+new TestCase( SECTION,   "Number(1)",                     1,              Number(1) );
+new TestCase( SECTION,   "Number(-1)",                    -1,             Number(-1) );
+new TestCase( SECTION,   "Number(Number.MAX_VALUE)",      1.7976931348623157e308, Number(Number.MAX_VALUE) );
+new TestCase( SECTION,   "Number(Number.MIN_VALUE)",      5e-324,         Number(Number.MIN_VALUE) );
+
+new TestCase( SECTION,   "Number(Number.NaN)",                Number.NaN,                 Number(Number.NaN) );
+new TestCase( SECTION,   "Number(Number.POSITIVE_INFINITY)",  Number.POSITIVE_INFINITY,   Number(Number.POSITIVE_INFINITY) );
+new TestCase( SECTION,   "Number(Number.NEGATIVE_INFINITY)",  Number.NEGATIVE_INFINITY,   Number(Number.NEGATIVE_INFINITY) );
+
+test();
diff --git a/js/src/tests/ecma/TypeConversion/9.4-1.js b/js/src/tests/ecma/TypeConversion/9.4-1.js
new file mode 100644
index 000000000..61a422276
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.4-1.js
@@ -0,0 +1,78 @@
+/* -*- 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:          9.4-1.js
+   ECMA Section:       9.4 ToInteger
+   Description:        1.  Call ToNumber on the input argument
+   2.  If Result(1) is NaN, return +0
+   3.  If Result(1) is +0, -0, Infinity, or -Infinity,
+   return Result(1).
+   4.  Compute sign(Result(1)) * floor(abs(Result(1))).
+   5.  Return Result(4).
+
+   To test ToInteger, this test uses new Date(value),
+   15.9.3.7.  The Date constructor sets the [[Value]]
+   property of the new object to TimeClip(value), which
+   uses the rules:
+
+   TimeClip(time)
+   1. If time is not finite, return NaN
+   2. If abs(Result(1)) > 8.64e15, return NaN
+   3. Return an implementation dependent choice of either
+   ToInteger(Result(2)) or ToInteger(Result(2)) + (+0)
+   (Adding a positive 0 converts -0 to +0).
+
+   This tests ToInteger for values -8.64e15 > value > 8.64e15,
+   not including -0 and +0.
+
+   For additional special cases (0, +0, Infinity, -Infinity,
+   and NaN, see 9.4-2.js).  For value is String, see 9.4-3.js.
+
+   Author:             christine@netscape.com
+   Date:               10 july 1997
+
+*/
+var SECTION = "9.4-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "ToInteger";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// some special cases
+
+new TestCase( SECTION,  "td = new Date(Number.NaN); td.valueOf()",  Number.NaN, eval("td = new Date(Number.NaN); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(Infinity); td.valueOf()",    Number.NaN, eval("td = new Date(Number.POSITIVE_INFINITY); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-Infinity); td.valueOf()",   Number.NaN, eval("td = new Date(Number.NEGATIVE_INFINITY); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-0); td.valueOf()",          -0,         eval("td = new Date(-0); td.valueOf()" ) );
+new TestCase( SECTION,  "td = new Date(0); td.valueOf()",           0,          eval("td = new Date(0); td.valueOf()") );
+
+// value is not an integer
+
+new TestCase( SECTION,  "td = new Date(3.14159); td.valueOf()",     3,          eval("td = new Date(3.14159); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(Math.PI); td.valueOf()",     3,          eval("td = new Date(Math.PI); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-Math.PI);td.valueOf()",     -3,         eval("td = new Date(-Math.PI);td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(3.14159e2); td.valueOf()",   314,        eval("td = new Date(3.14159e2); td.valueOf()") );
+
+new TestCase( SECTION,  "td = new Date(.692147e1); td.valueOf()",   6,          eval("td = new Date(.692147e1);td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-.692147e1);td.valueOf()",   -6,         eval("td = new Date(-.692147e1);td.valueOf()") );
+
+// value is not a number
+
+new TestCase( SECTION,  "td = new Date(true); td.valueOf()",        1,          eval("td = new Date(true); td.valueOf()" ) );
+new TestCase( SECTION,  "td = new Date(false); td.valueOf()",       0,          eval("td = new Date(false); td.valueOf()") );
+
+new TestCase( SECTION,  "td = new Date(new Number(Math.PI)); td.valueOf()",  3, eval("td = new Date(new Number(Math.PI)); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(new Number(Math.PI)); td.valueOf()",  3, eval("td = new Date(new Number(Math.PI)); td.valueOf()") );
+
+// edge cases
+new TestCase( SECTION,  "td = new Date(8.64e15); td.valueOf()",     8.64e15,    eval("td = new Date(8.64e15); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-8.64e15); td.valueOf()",    -8.64e15,   eval("td = new Date(-8.64e15); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(8.64e-15); td.valueOf()",    0,          eval("td = new Date(8.64e-15); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-8.64e-15); td.valueOf()",   0,          eval("td = new Date(-8.64e-15); td.valueOf()") );
+
+test();
diff --git a/js/src/tests/ecma/TypeConversion/9.4-2.js b/js/src/tests/ecma/TypeConversion/9.4-2.js
new file mode 100644
index 000000000..61a422276
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.4-2.js
@@ -0,0 +1,78 @@
+/* -*- 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:          9.4-1.js
+   ECMA Section:       9.4 ToInteger
+   Description:        1.  Call ToNumber on the input argument
+   2.  If Result(1) is NaN, return +0
+   3.  If Result(1) is +0, -0, Infinity, or -Infinity,
+   return Result(1).
+   4.  Compute sign(Result(1)) * floor(abs(Result(1))).
+   5.  Return Result(4).
+
+   To test ToInteger, this test uses new Date(value),
+   15.9.3.7.  The Date constructor sets the [[Value]]
+   property of the new object to TimeClip(value), which
+   uses the rules:
+
+   TimeClip(time)
+   1. If time is not finite, return NaN
+   2. If abs(Result(1)) > 8.64e15, return NaN
+   3. Return an implementation dependent choice of either
+   ToInteger(Result(2)) or ToInteger(Result(2)) + (+0)
+   (Adding a positive 0 converts -0 to +0).
+
+   This tests ToInteger for values -8.64e15 > value > 8.64e15,
+   not including -0 and +0.
+
+   For additional special cases (0, +0, Infinity, -Infinity,
+   and NaN, see 9.4-2.js).  For value is String, see 9.4-3.js.
+
+   Author:             christine@netscape.com
+   Date:               10 july 1997
+
+*/
+var SECTION = "9.4-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "ToInteger";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+// some special cases
+
+new TestCase( SECTION,  "td = new Date(Number.NaN); td.valueOf()",  Number.NaN, eval("td = new Date(Number.NaN); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(Infinity); td.valueOf()",    Number.NaN, eval("td = new Date(Number.POSITIVE_INFINITY); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-Infinity); td.valueOf()",   Number.NaN, eval("td = new Date(Number.NEGATIVE_INFINITY); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-0); td.valueOf()",          -0,         eval("td = new Date(-0); td.valueOf()" ) );
+new TestCase( SECTION,  "td = new Date(0); td.valueOf()",           0,          eval("td = new Date(0); td.valueOf()") );
+
+// value is not an integer
+
+new TestCase( SECTION,  "td = new Date(3.14159); td.valueOf()",     3,          eval("td = new Date(3.14159); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(Math.PI); td.valueOf()",     3,          eval("td = new Date(Math.PI); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-Math.PI);td.valueOf()",     -3,         eval("td = new Date(-Math.PI);td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(3.14159e2); td.valueOf()",   314,        eval("td = new Date(3.14159e2); td.valueOf()") );
+
+new TestCase( SECTION,  "td = new Date(.692147e1); td.valueOf()",   6,          eval("td = new Date(.692147e1);td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-.692147e1);td.valueOf()",   -6,         eval("td = new Date(-.692147e1);td.valueOf()") );
+
+// value is not a number
+
+new TestCase( SECTION,  "td = new Date(true); td.valueOf()",        1,          eval("td = new Date(true); td.valueOf()" ) );
+new TestCase( SECTION,  "td = new Date(false); td.valueOf()",       0,          eval("td = new Date(false); td.valueOf()") );
+
+new TestCase( SECTION,  "td = new Date(new Number(Math.PI)); td.valueOf()",  3, eval("td = new Date(new Number(Math.PI)); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(new Number(Math.PI)); td.valueOf()",  3, eval("td = new Date(new Number(Math.PI)); td.valueOf()") );
+
+// edge cases
+new TestCase( SECTION,  "td = new Date(8.64e15); td.valueOf()",     8.64e15,    eval("td = new Date(8.64e15); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-8.64e15); td.valueOf()",    -8.64e15,   eval("td = new Date(-8.64e15); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(8.64e-15); td.valueOf()",    0,          eval("td = new Date(8.64e-15); td.valueOf()") );
+new TestCase( SECTION,  "td = new Date(-8.64e-15); td.valueOf()",   0,          eval("td = new Date(-8.64e-15); td.valueOf()") );
+
+test();
diff --git a/js/src/tests/ecma/TypeConversion/9.5-2.js b/js/src/tests/ecma/TypeConversion/9.5-2.js
new file mode 100644
index 000000000..6f39ac544
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.5-2.js
@@ -0,0 +1,139 @@
+/* -*- tab-width: 2; 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:          9.5-2.js
+   ECMA Section:       9.5  Type Conversion:  ToInt32
+   Description:        rules for converting an argument to a signed 32 bit integer
+
+   this test uses << 0 to convert the argument to a 32bit
+   integer.
+
+   The operator ToInt32 converts its argument to one of 2^32
+   integer values in the range -2^31 through 2^31 inclusive.
+   This operator functions as follows:
+
+   1 call ToNumber on argument
+   2 if result is NaN, 0, -0, return 0
+   3 compute (sign (result(1)) * floor(abs(result 1)))
+   4 compute result(3) modulo 2^32:
+   5 if result(4) is greater than or equal to 2^31, return
+   result(5)-2^32.  otherwise, return result(5)
+
+   special cases:
+   -0          returns 0
+   Infinity    returns 0
+   -Infinity   returns 0
+   ToInt32(ToUint32(x)) == ToInt32(x) for all values of x
+   Numbers greater than 2^31 (see step 5 above)
+   (note http://bugzilla.mozilla.org/show_bug.cgi?id=120083)
+
+   Author:             christine@netscape.com
+   Date:               17 july 1997
+*/
+var SECTION = "9.5-2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " ToInt32");
+
+new TestCase( SECTION,   "0 << 0",                        0,              0 << 0 );
+new TestCase( SECTION,   "-0 << 0",                       0,              -0 << 0 );
+new TestCase( SECTION,   "Infinity << 0",                 0,              "Infinity" << 0 );
+new TestCase( SECTION,   "-Infinity << 0",                0,              "-Infinity" << 0 );
+new TestCase( SECTION,   "Number.POSITIVE_INFINITY << 0", 0,              Number.POSITIVE_INFINITY << 0 );
+new TestCase( SECTION,   "Number.NEGATIVE_INFINITY << 0", 0,              Number.NEGATIVE_INFINITY << 0 );
+new TestCase( SECTION,   "Number.NaN << 0",               0,              Number.NaN << 0 );
+
+new TestCase( SECTION,   "Number.MIN_VALUE << 0",         0,              Number.MIN_VALUE << 0 );
+new TestCase( SECTION,   "-Number.MIN_VALUE << 0",        0,              -Number.MIN_VALUE << 0 );
+new TestCase( SECTION,   "0.1 << 0",                      0,              0.1 << 0 );
+new TestCase( SECTION,   "-0.1 << 0",                     0,              -0.1 << 0 );
+new TestCase( SECTION,   "1 << 0",                        1,              1 << 0 );
+new TestCase( SECTION,   "1.1 << 0",                      1,              1.1 << 0 );
+new TestCase( SECTION,   "-1 << 0",                     ToInt32(-1),             -1 << 0 );
+
+
+new TestCase( SECTION,   "2147483647 << 0",     ToInt32(2147483647),    2147483647 << 0 );
+new TestCase( SECTION,   "2147483648 << 0",     ToInt32(2147483648),    2147483648 << 0 );
+new TestCase( SECTION,   "2147483649 << 0",     ToInt32(2147483649),    2147483649 << 0 );
+
+new TestCase( SECTION,   "(Math.pow(2,31)-1) << 0", ToInt32(2147483647),    (Math.pow(2,31)-1) << 0 );
+new TestCase( SECTION,   "Math.pow(2,31) << 0",     ToInt32(2147483648),    Math.pow(2,31) << 0 );
+new TestCase( SECTION,   "(Math.pow(2,31)+1) << 0", ToInt32(2147483649),    (Math.pow(2,31)+1) << 0 );
+
+new TestCase( SECTION,   "(Math.pow(2,32)-1) << 0",   ToInt32(4294967295),    (Math.pow(2,32)-1) << 0 );
+new TestCase( SECTION,   "(Math.pow(2,32)) << 0",     ToInt32(4294967296),    (Math.pow(2,32)) << 0 );
+new TestCase( SECTION,   "(Math.pow(2,32)+1) << 0",   ToInt32(4294967297),    (Math.pow(2,32)+1) << 0 );
+
+new TestCase( SECTION,   "4294967295 << 0",     ToInt32(4294967295),    4294967295 << 0 );
+new TestCase( SECTION,   "4294967296 << 0",     ToInt32(4294967296),    4294967296 << 0 );
+new TestCase( SECTION,   "4294967297 << 0",     ToInt32(4294967297),    4294967297 << 0 );
+
+new TestCase( SECTION,   "'2147483647' << 0",   ToInt32(2147483647),    '2147483647' << 0 );
+new TestCase( SECTION,   "'2147483648' << 0",   ToInt32(2147483648),    '2147483648' << 0 );
+new TestCase( SECTION,   "'2147483649' << 0",   ToInt32(2147483649),    '2147483649' << 0 );
+
+new TestCase( SECTION,   "'4294967295' << 0",   ToInt32(4294967295),    '4294967295' << 0 );
+new TestCase( SECTION,   "'4294967296' << 0",   ToInt32(4294967296),    '4294967296' << 0 );
+new TestCase( SECTION,   "'4294967297' << 0",   ToInt32(4294967297),    '4294967297' << 0 );
+
+new TestCase( SECTION,   "-2147483647 << 0",    ToInt32(-2147483647),   -2147483647	<< 0 );
+new TestCase( SECTION,   "-2147483648 << 0",    ToInt32(-2147483648),   -2147483648 << 0 );
+new TestCase( SECTION,   "-2147483649 << 0",    ToInt32(-2147483649),   -2147483649 << 0 );
+
+new TestCase( SECTION,   "-4294967295 << 0",    ToInt32(-4294967295),   -4294967295 << 0 );
+new TestCase( SECTION,   "-4294967296 << 0",    ToInt32(-4294967296),   -4294967296 << 0 );
+new TestCase( SECTION,   "-4294967297 << 0",    ToInt32(-4294967297),   -4294967297 << 0 );
+
+/*
+ * Numbers between 2^31 and 2^32 will have a negative ToInt32 per ECMA (see step 5 of introduction)
+ * (These are by stevechapel@earthlink.net; cf. http://bugzilla.mozilla.org/show_bug.cgi?id=120083)
+ */
+new TestCase( SECTION,   "2147483648.25 << 0",  ToInt32(2147483648.25),   2147483648.25 << 0 );
+new TestCase( SECTION,   "2147483648.5 << 0",   ToInt32(2147483648.5),    2147483648.5 << 0 );
+new TestCase( SECTION,   "2147483648.75 << 0",  ToInt32(2147483648.75),   2147483648.75 << 0 );
+new TestCase( SECTION,   "4294967295.25 << 0",  ToInt32(4294967295.25),   4294967295.25 << 0 );
+new TestCase( SECTION,   "4294967295.5 << 0",   ToInt32(4294967295.5),    4294967295.5 << 0 );
+new TestCase( SECTION,   "4294967295.75 << 0",  ToInt32(4294967295.75),   4294967295.75 << 0 );
+new TestCase( SECTION,   "3000000000.25 << 0",  ToInt32(3000000000.25),   3000000000.25 << 0 );
+new TestCase( SECTION,   "3000000000.5 << 0",   ToInt32(3000000000.5),    3000000000.5 << 0 );
+new TestCase( SECTION,   "3000000000.75 << 0",  ToInt32(3000000000.75),   3000000000.75 << 0 );
+
+/*
+ * Numbers between - 2^31 and - 2^32
+ */
+new TestCase( SECTION,   "-2147483648.25 << 0",  ToInt32(-2147483648.25),   -2147483648.25 << 0 );
+new TestCase( SECTION,   "-2147483648.5 << 0",   ToInt32(-2147483648.5),    -2147483648.5 << 0 );
+new TestCase( SECTION,   "-2147483648.75 << 0",  ToInt32(-2147483648.75),   -2147483648.75 << 0 );
+new TestCase( SECTION,   "-4294967295.25 << 0",  ToInt32(-4294967295.25),   -4294967295.25 << 0 );
+new TestCase( SECTION,   "-4294967295.5 << 0",   ToInt32(-4294967295.5),    -4294967295.5 << 0 );
+new TestCase( SECTION,   "-4294967295.75 << 0",  ToInt32(-4294967295.75),   -4294967295.75 << 0 );
+new TestCase( SECTION,   "-3000000000.25 << 0",  ToInt32(-3000000000.25),   -3000000000.25 << 0 );
+new TestCase( SECTION,   "-3000000000.5 << 0",   ToInt32(-3000000000.5),    -3000000000.5 << 0 );
+new TestCase( SECTION,   "-3000000000.75 << 0",  ToInt32(-3000000000.75),   -3000000000.75 << 0 );
+
+
+test();
+
+function ToInt32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+
+  n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
+  if ( sign == -1 ) {
+    n = ( n < -Math.pow(2,31) ) ? n + Math.pow(2,32) : n;
+  } else{
+    n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
+  }
+
+  return ( n );
+}
+
diff --git a/js/src/tests/ecma/TypeConversion/9.6.js b/js/src/tests/ecma/TypeConversion/9.6.js
new file mode 100644
index 000000000..533b21fcd
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.6.js
@@ -0,0 +1,106 @@
+/* -*- 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:          9.6.js
+   ECMA Section:       9.6  Type Conversion:  ToUint32
+   Description:        rules for converting an argument to an unsigned
+   32 bit integer
+
+   this test uses >>> 0 to convert the argument to
+   an unsigned 32bit integer.
+
+   1 call ToNumber on argument
+   2 if result is NaN, 0, -0, Infinity, -Infinity
+   return 0
+   3 compute (sign (result(1)) * floor(abs(result 1)))
+   4 compute result(3) modulo 2^32:
+   5 return result(4)
+
+   special cases:
+   -0          returns 0
+   Infinity    returns 0
+   -Infinity   returns 0
+   0           returns 0
+   ToInt32(ToUint32(x)) == ToInt32(x) for all values of x
+   ** NEED TO DO THIS PART IN A SEPARATE TEST FILE **
+
+
+   Author:             christine@netscape.com
+   Date:               17 july 1997
+*/
+
+var SECTION = "9.6";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Type Conversion:  ToUint32");
+
+new TestCase( SECTION,    "0 >>> 0",                          0,          0 >>> 0 );
+//    new TestCase( SECTION,    "+0 >>> 0",                         0,          +0 >>> 0);
+new TestCase( SECTION,    "-0 >>> 0",                         0,          -0 >>> 0 );
+new TestCase( SECTION,    "'Infinity' >>> 0",                 0,          "Infinity" >>> 0 );
+new TestCase( SECTION,    "'-Infinity' >>> 0",                0,          "-Infinity" >>> 0);
+new TestCase( SECTION,    "'+Infinity' >>> 0",                0,          "+Infinity" >>> 0 );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY >>> 0",   0,          Number.POSITIVE_INFINITY >>> 0 );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY >>> 0",   0,          Number.NEGATIVE_INFINITY >>> 0 );
+new TestCase( SECTION,    "Number.NaN >>> 0",                 0,          Number.NaN >>> 0 );
+
+new TestCase( SECTION,    "Number.MIN_VALUE >>> 0",           0,          Number.MIN_VALUE >>> 0 );
+new TestCase( SECTION,    "-Number.MIN_VALUE >>> 0",          0,          Number.MIN_VALUE >>> 0 );
+new TestCase( SECTION,    "0.1 >>> 0",                        0,          0.1 >>> 0 );
+new TestCase( SECTION,    "-0.1 >>> 0",                       0,          -0.1 >>> 0 );
+new TestCase( SECTION,    "1 >>> 0",                          1,          1 >>> 0 );
+new TestCase( SECTION,    "1.1 >>> 0",                        1,          1.1 >>> 0 );
+
+new TestCase( SECTION,    "-1.1 >>> 0",                       ToUint32(-1.1),       -1.1 >>> 0 );
+new TestCase( SECTION,    "-1 >>> 0",                         ToUint32(-1),         -1 >>> 0 );
+
+new TestCase( SECTION,    "2147483647 >>> 0",         ToUint32(2147483647),     2147483647 >>> 0 );
+new TestCase( SECTION,    "2147483648 >>> 0",         ToUint32(2147483648),     2147483648 >>> 0 );
+new TestCase( SECTION,    "2147483649 >>> 0",         ToUint32(2147483649),     2147483649 >>> 0 );
+
+new TestCase( SECTION,    "4294967295 >>> 0",         ToUint32(4294967295),     4294967295 >>> 0 );
+new TestCase( SECTION,    "4294967296 >>> 0",         ToUint32(4294967296),     4294967296 >>> 0 );
+new TestCase( SECTION,    "4294967297 >>> 0",         ToUint32(4294967297),     4294967297 >>> 0 );
+
+new TestCase( SECTION,    "-2147483647 >>> 0",        ToUint32(-2147483647),    -2147483647 >>> 0 );
+new TestCase( SECTION,    "-2147483648 >>> 0",        ToUint32(-2147483648),    -2147483648 >>> 0 );
+new TestCase( SECTION,    "-2147483649 >>> 0",        ToUint32(-2147483649),    -2147483649 >>> 0 );
+
+new TestCase( SECTION,    "-4294967295 >>> 0",        ToUint32(-4294967295),    -4294967295 >>> 0 );
+new TestCase( SECTION,    "-4294967296 >>> 0",        ToUint32(-4294967296),    -4294967296 >>> 0 );
+new TestCase( SECTION,    "-4294967297 >>> 0",        ToUint32(-4294967297),    -4294967297 >>> 0 );
+
+new TestCase( SECTION,    "'2147483647' >>> 0",       ToUint32(2147483647),     '2147483647' >>> 0 );
+new TestCase( SECTION,    "'2147483648' >>> 0",       ToUint32(2147483648),     '2147483648' >>> 0 );
+new TestCase( SECTION,    "'2147483649' >>> 0",       ToUint32(2147483649),     '2147483649' >>> 0 );
+
+new TestCase( SECTION,    "'4294967295' >>> 0",       ToUint32(4294967295),     '4294967295' >>> 0 );
+new TestCase( SECTION,    "'4294967296' >>> 0",       ToUint32(4294967296),     '4294967296' >>> 0 );
+new TestCase( SECTION,    "'4294967297' >>> 0",       ToUint32(4294967297),     '4294967297' >>> 0 );
+
+
+test();
+
+function ToUint32( n ) {
+  n = Number( n );
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+    return 0;
+  }
+  n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+  if ( n < 0 ){
+    n += Math.pow(2,32);
+  }
+
+  return ( n );
+}
+
diff --git a/js/src/tests/ecma/TypeConversion/9.7.js b/js/src/tests/ecma/TypeConversion/9.7.js
new file mode 100644
index 000000000..1d89583e0
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.7.js
@@ -0,0 +1,126 @@
+/* -*- 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:          9.7.js
+   ECMA Section:       9.7  Type Conversion:  ToInt16
+   Description:        rules for converting an argument to an unsigned
+   16 bit integer in the range 0 to 2^16-1.
+
+   this test uses String.prototype.fromCharCode() and
+   String.prototype.charCodeAt() to test ToInt16.
+
+   special cases:
+   -0          returns 0
+   Infinity    returns 0
+   -Infinity   returns 0
+   0           returns 0
+
+   Author:             christine@netscape.com
+   Date:               17 july 1997
+*/
+var SECTION = "9.7";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " Type Conversion:  ToInt16");
+
+/*
+  new TestCase( "9.7",   "String.fromCharCode(0).charCodeAt(0)",          0,      String.fromCharCode(0).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(-0).charCodeAt(0)",         0,      String.fromCharCode(-0).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(1).charCodeAt(0)",          1,      String.fromCharCode(1).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(64).charCodeAt(0)",         64,     String.fromCharCode(64).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(126).charCodeAt(0)",        126,    String.fromCharCode(126).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(127).charCodeAt(0)",        127,    String.fromCharCode(127).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(128).charCodeAt(0)",        128,    String.fromCharCode(128).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(130).charCodeAt(0)",        130,    String.fromCharCode(130).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(255).charCodeAt(0)",        255,    String.fromCharCode(255).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(256).charCodeAt(0)",        256,    String.fromCharCode(256).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(Math.pow(2,16)-1).charCodeAt(0)",   65535,  String.fromCharCode(Math.pow(2,16)-1).charCodeAt(0) );
+  new TestCase( "9.7",   "String.fromCharCode(Math.pow(2,16)).charCodeAt(0)",     0,      String.fromCharCode(Math.pow(2,16)).charCodeAt(0) );
+*/
+
+
+new TestCase( "9.7",   "String.fromCharCode(0).charCodeAt(0)",          ToInt16(0),      String.fromCharCode(0).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-0).charCodeAt(0)",         ToInt16(0),      String.fromCharCode(-0).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(1).charCodeAt(0)",          ToInt16(1),      String.fromCharCode(1).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(64).charCodeAt(0)",         ToInt16(64),     String.fromCharCode(64).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(126).charCodeAt(0)",        ToInt16(126),    String.fromCharCode(126).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(127).charCodeAt(0)",        ToInt16(127),    String.fromCharCode(127).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(128).charCodeAt(0)",        ToInt16(128),    String.fromCharCode(128).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(130).charCodeAt(0)",        ToInt16(130),    String.fromCharCode(130).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(255).charCodeAt(0)",        ToInt16(255),    String.fromCharCode(255).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(256).charCodeAt(0)",        ToInt16(256),    String.fromCharCode(256).charCodeAt(0) );
+
+new TestCase( "9.7",   "String.fromCharCode(Math.pow(2,16)-1).charCodeAt(0)",   65535,  String.fromCharCode(Math.pow(2,16)-1).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(Math.pow(2,16)).charCodeAt(0)",     0,      String.fromCharCode(Math.pow(2,16)).charCodeAt(0) );
+
+new TestCase( "9.7",   "String.fromCharCode(65535).charCodeAt(0)",     ToInt16(65535),      String.fromCharCode(65535).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(65536).charCodeAt(0)",     ToInt16(65536),      String.fromCharCode(65536).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(65537).charCodeAt(0)",     ToInt16(65537),      String.fromCharCode(65537).charCodeAt(0) );
+
+new TestCase( "9.7",   "String.fromCharCode(131071).charCodeAt(0)",     ToInt16(131071),    String.fromCharCode(131071).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(131072).charCodeAt(0)",     ToInt16(131072),    String.fromCharCode(131072).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(131073).charCodeAt(0)",     ToInt16(131073),    String.fromCharCode(131073).charCodeAt(0) );
+
+new TestCase( "9.7",   "String.fromCharCode('65535').charCodeAt(0)",     65535,             String.fromCharCode("65535").charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode('65536').charCodeAt(0)",     0,                 String.fromCharCode("65536").charCodeAt(0) );
+
+new TestCase( "9.7",   "String.fromCharCode(-1).charCodeAt(0)",         ToInt16(-1),        String.fromCharCode(-1).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-64).charCodeAt(0)",        ToInt16(-64),       String.fromCharCode(-64).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-126).charCodeAt(0)",       ToInt16(-126),      String.fromCharCode(-126).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-127).charCodeAt(0)",       ToInt16(-127),      String.fromCharCode(-127).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-128).charCodeAt(0)",       ToInt16(-128),      String.fromCharCode(-128).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-130).charCodeAt(0)",       ToInt16(-130),      String.fromCharCode(-130).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-255).charCodeAt(0)",       ToInt16(-255),      String.fromCharCode(-255).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-256).charCodeAt(0)",       ToInt16(-256),      String.fromCharCode(-256).charCodeAt(0) );
+
+new TestCase( "9.7",   "String.fromCharCode(-Math.pow(2,16)-1).charCodeAt(0)",   65535,     String.fromCharCode(-Math.pow(2,16)-1).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-Math.pow(2,16)).charCodeAt(0)",     0,         String.fromCharCode(-Math.pow(2,16)).charCodeAt(0) );
+
+new TestCase( "9.7",   "String.fromCharCode(-65535).charCodeAt(0)",     ToInt16(-65535),    String.fromCharCode(-65535).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-65536).charCodeAt(0)",     ToInt16(-65536),    String.fromCharCode(-65536).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-65537).charCodeAt(0)",     ToInt16(-65537),    String.fromCharCode(-65537).charCodeAt(0) );
+
+new TestCase( "9.7",   "String.fromCharCode(-131071).charCodeAt(0)",    ToInt16(-131071),   String.fromCharCode(-131071).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-131072).charCodeAt(0)",    ToInt16(-131072),   String.fromCharCode(-131072).charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode(-131073).charCodeAt(0)",    ToInt16(-131073),   String.fromCharCode(-131073).charCodeAt(0) );
+
+new TestCase( "9.7",   "String.fromCharCode('-65535').charCodeAt(0)",   ToInt16(-65535),    String.fromCharCode("-65535").charCodeAt(0) );
+new TestCase( "9.7",   "String.fromCharCode('-65536').charCodeAt(0)",   ToInt16(-65536),    String.fromCharCode("-65536").charCodeAt(0) );
+
+
+//    new TestCase( "9.7",   "String.fromCharCode(2147483648).charCodeAt(0)", ToInt16(2147483648),      String.fromCharCode(2147483648).charCodeAt(0) );
+
+
+
+//    the following test cases cause a runtime error.  see:  http://scopus.mcom.com/bugsplat/show_bug.cgi?id=78878
+
+//    new TestCase( "9.7",   "String.fromCharCode(Infinity).charCodeAt(0)",           0,      String.fromCharCode("Infinity").charCodeAt(0) );
+//    new TestCase( "9.7",   "String.fromCharCode(-Infinity).charCodeAt(0)",          0,      String.fromCharCode("-Infinity").charCodeAt(0) );
+//    new TestCase( "9.7",   "String.fromCharCode(NaN).charCodeAt(0)",                0,      String.fromCharCode(Number.NaN).charCodeAt(0) );
+//    new TestCase( "9.7",   "String.fromCharCode(Number.POSITIVE_INFINITY).charCodeAt(0)",   0,  String.fromCharCode(Number.POSITIVE_INFINITY).charCodeAt(0) );
+//    new TestCase( "9.7",   "String.fromCharCode(Number.NEGATIVE_INFINITY).charCodeAt(0)",   0,  String.fromCharCode(Number.NEGATIVE_INFINITY).charCodeAt(0) );
+
+test();
+
+function ToInt16( num ) {
+  num = Number( num );
+  if ( isNaN( num ) || num == 0 || num == Number.POSITIVE_INFINITY || num == Number.NEGATIVE_INFINITY ) {
+    return 0;
+  }
+
+  var sign = ( num < 0 ) ? -1 : 1;
+
+  num = sign * Math.floor( Math.abs( num ) );
+
+  num = num % Math.pow(2,16);
+
+  num = ( num > -65536 && num < 0) ? 65536 + num : num;
+
+  return num;
+}
+
diff --git a/js/src/tests/ecma/TypeConversion/9.8.1.js b/js/src/tests/ecma/TypeConversion/9.8.1.js
new file mode 100644
index 000000000..1f6268303
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.8.1.js
@@ -0,0 +1,133 @@
+/* -*- 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:          9.8.1.js
+   ECMA Section:       9.8.1 ToString Applied to the Number Type
+   Description:        The operator ToString convers a number m to string
+   as follows:
+
+   1.  if m is NaN, return the string "NaN"
+   2.  if m is +0 or -0, return the string "0"
+   3.  if m is less than zero, return the string
+   concatenation of the string "-" and ToString(-m).
+   4.  If m is Infinity, return the string "Infinity".
+   5.  Otherwise, let n, k, and s be integers such that
+   k >= 1, 10k1 <= s < 10k, the number value for s10nk
+   is m, and k is as small as possible. Note that k is
+   the number of digits in the decimal representation
+   of s, that s is not divisible by 10, and that the
+   least significant digit of s is not necessarily
+   uniquely determined by these criteria.
+   6.  If k <= n <= 21, return the string consisting of the
+   k digits of the decimal representation of s (in order,
+   with no leading zeroes), followed by n-k occurences
+   of the character '0'.
+   7.  If 0 < n <= 21, return the string consisting of the
+   most significant n digits of the decimal
+   representation of s, followed by a decimal point
+   '.', followed by the remaining kn digits of the
+   decimal representation of s.
+   8.  If 6 < n <= 0, return the string consisting of the
+   character '0', followed by a decimal point '.',
+   followed by n occurences of the character '0',
+   followed by the k digits of the decimal
+   representation of s.
+   9.  Otherwise, if k = 1, return the string consisting
+   of the single digit of s, followed by lowercase
+   character 'e', followed by a plus sign '+' or minus
+   sign '' according to whether n1 is positive or
+   negative, followed by the decimal representation
+   of the integer abs(n1) (with no leading zeros).
+   10.  Return the string consisting of the most significant
+   digit of the decimal representation of s, followed
+   by a decimal point '.', followed by the remaining k1
+   digits of the decimal representation of s, followed
+   by the lowercase character 'e', followed by a plus
+   sign '+' or minus sign '' according to whether n1 is
+   positive or negative, followed by the decimal
+   representation of the integer abs(n1) (with no
+   leading zeros).
+
+   Note that if x is any number value other than 0, then
+   ToNumber(ToString(x)) is exactly the same number value as x.
+
+   As noted, the least significant digit of s is not always
+   uniquely determined by the requirements listed in step 5.
+   The following specification for step 5 was considered, but
+   not adopted:
+
+   Author:         christine@netscape.com
+   Date:           10 july 1997
+*/
+
+var SECTION = "9.8.1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " ToString applied to the Number type");
+
+new TestCase( SECTION,    "Number.NaN",       "NaN",                  Number.NaN + "" );
+new TestCase( SECTION,    "0",                "0",                    0 + "" );
+new TestCase( SECTION,    "-0",               "0",                   -0 + "" );
+new TestCase( SECTION,    "Number.POSITIVE_INFINITY", "Infinity",     Number.POSITIVE_INFINITY + "" );
+new TestCase( SECTION,    "Number.NEGATIVE_INFINITY", "-Infinity",    Number.NEGATIVE_INFINITY + "" );
+new TestCase( SECTION,    "-1",               "-1",                   -1 + "" );
+
+// cases in step 6:  integers  1e21 > x >= 1 or -1 >= x > -1e21
+
+new TestCase( SECTION,    "1",                    "1",                    1 + "" );
+new TestCase( SECTION,    "10",                   "10",                   10 + "" );
+new TestCase( SECTION,    "100",                  "100",                  100 + "" );
+new TestCase( SECTION,    "1000",                 "1000",                 1000 + "" );
+new TestCase( SECTION,    "10000",                "10000",                10000 + "" );
+new TestCase( SECTION,    "10000000000",          "10000000000",          10000000000 + "" );
+new TestCase( SECTION,    "10000000000000000000", "10000000000000000000", 10000000000000000000 + "" );
+new TestCase( SECTION,    "100000000000000000000","100000000000000000000",100000000000000000000 + "" );
+
+new TestCase( SECTION,    "12345",                    "12345",                    12345 + "" );
+new TestCase( SECTION,    "1234567890",               "1234567890",               1234567890 + "" );
+
+new TestCase( SECTION,    "-1",                       "-1",                       -1 + "" );
+new TestCase( SECTION,    "-10",                      "-10",                      -10 + "" );
+new TestCase( SECTION,    "-100",                     "-100",                     -100 + "" );
+new TestCase( SECTION,    "-1000",                    "-1000",                    -1000 + "" );
+new TestCase( SECTION,    "-1000000000",              "-1000000000",              -1000000000 + "" );
+new TestCase( SECTION,    "-1000000000000000",        "-1000000000000000",        -1000000000000000 + "" );
+new TestCase( SECTION,    "-100000000000000000000",   "-100000000000000000000",   -100000000000000000000 + "" );
+new TestCase( SECTION,    "-1000000000000000000000",  "-1e+21",                   -1000000000000000000000 + "" );
+
+new TestCase( SECTION,    "-12345",                    "-12345",                  -12345 + "" );
+new TestCase( SECTION,    "-1234567890",               "-1234567890",             -1234567890 + "" );
+
+// cases in step 7: numbers with a fractional component, 1e21> x >1 or  -1 > x > -1e21,
+new TestCase( SECTION,    "1.0000001",                "1.0000001",                1.0000001 + "" );
+
+// cases in step 8:  fractions between 1 > x > -1, exclusive of 0 and -0
+
+// cases in step 9:  numbers with 1 significant digit >= 1e+21 or <= 1e-6
+
+new TestCase( SECTION,    "1000000000000000000000",   "1e+21",             1000000000000000000000 + "" );
+new TestCase( SECTION,    "10000000000000000000000",   "1e+22",            10000000000000000000000 + "" );
+
+//  cases in step 10:  numbers with more than 1 significant digit >= 1e+21 or <= 1e-6
+
+new TestCase( SECTION,    "1.2345",                    "1.2345",                  String( 1.2345));
+new TestCase( SECTION,    "1.234567890",               "1.23456789",             String( 1.234567890 ));
+
+
+new TestCase( SECTION,    ".12345",                   "0.12345",                String(.12345 )     );
+new TestCase( SECTION,    ".012345",                  "0.012345",               String(.012345)     );
+new TestCase( SECTION,    ".0012345",                 "0.0012345",              String(.0012345)    );
+new TestCase( SECTION,    ".00012345",                "0.00012345",             String(.00012345)   );
+new TestCase( SECTION,    ".000012345",               "0.000012345",            String(.000012345)  );
+new TestCase( SECTION,    ".0000012345",              "0.0000012345",           String(.0000012345) );
+new TestCase( SECTION,    ".00000012345",             "1.2345e-7",              String(.00000012345));
+
+new TestCase( SECTION,    "-1e21",                    "-1e+21",                 String(-1e21) );
+
+test();
+
diff --git a/js/src/tests/ecma/TypeConversion/9.9-1.js b/js/src/tests/ecma/TypeConversion/9.9-1.js
new file mode 100644
index 000000000..b252f68ce
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/9.9-1.js
@@ -0,0 +1,85 @@
+/* -*- 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:          9.9-1.js
+   ECMA Section:       9.9  Type Conversion:  ToObject
+   Description:
+
+   undefined   generate a runtime error
+   null        generate a runtime error
+   boolean     create a new Boolean object whose default
+   value is the value of the boolean.
+   number      Create a new Number object whose default
+   value is the value of the number.
+   string      Create a new String object whose default
+   value is the value of the string.
+   object      Return the input argument (no conversion).
+   Author:             christine@netscape.com
+   Date:               17 july 1997
+*/
+
+var VERSION = "ECMA_1";
+startTest();
+var SECTION = "9.9-1";
+
+writeHeaderToLog( SECTION + " Type Conversion: ToObject" );
+
+new TestCase( SECTION, "Object(true).valueOf()",    true,                   (Object(true)).valueOf() );
+new TestCase( SECTION, "typeof Object(true)",       "object",               typeof Object(true) );
+
+new TestCase( SECTION, "Object(false).valueOf()",    false,                  (Object(false)).valueOf() );
+new TestCase( SECTION, "typeof Object(false)",      "object",               typeof Object(false) );
+
+new TestCase( SECTION, "Object(0).valueOf()",       0,                      (Object(0)).valueOf() );
+new TestCase( SECTION, "typeof Object(0)",          "object",               typeof Object(0) );
+
+new TestCase( SECTION, "Object(-0).valueOf()",      -0,                     (Object(-0)).valueOf() );
+new TestCase( SECTION, "typeof Object(-0)",         "object",               typeof Object(-0) );
+
+new TestCase( SECTION, "Object(1).valueOf()",       1,                      (Object(1)).valueOf() );
+new TestCase( SECTION, "typeof Object(1)",          "object",               typeof Object(1) );
+
+new TestCase( SECTION, "Object(-1).valueOf()",      -1,                     (Object(-1)).valueOf() );
+new TestCase( SECTION, "typeof Object(-1)",         "object",               typeof Object(-1) );
+
+new TestCase( SECTION, "Object(Number.MAX_VALUE).valueOf()",    1.7976931348623157e308,         (Object(Number.MAX_VALUE)).valueOf() );
+new TestCase( SECTION, "typeof Object(Number.MAX_VALUE)",       "object",                       typeof Object(Number.MAX_VALUE) );
+
+new TestCase( SECTION, "Object(Number.MIN_VALUE).valueOf()",     5e-324,           (Object(Number.MIN_VALUE)).valueOf() );
+new TestCase( SECTION, "typeof Object(Number.MIN_VALUE)",       "object",         typeof Object(Number.MIN_VALUE) );
+
+new TestCase( SECTION, "Object(Number.POSITIVE_INFINITY).valueOf()",    Number.POSITIVE_INFINITY,       (Object(Number.POSITIVE_INFINITY)).valueOf() );
+new TestCase( SECTION, "typeof Object(Number.POSITIVE_INFINITY)",       "object",                       typeof Object(Number.POSITIVE_INFINITY) );
+
+new TestCase( SECTION, "Object(Number.NEGATIVE_INFINITY).valueOf()",    Number.NEGATIVE_INFINITY,       (Object(Number.NEGATIVE_INFINITY)).valueOf() );
+new TestCase( SECTION, "typeof Object(Number.NEGATIVE_INFINITY)",       "object",            typeof Object(Number.NEGATIVE_INFINITY) );
+
+new TestCase( SECTION, "Object(Number.NaN).valueOf()",      Number.NaN,                (Object(Number.NaN)).valueOf() );
+new TestCase( SECTION, "typeof Object(Number.NaN)",         "object",                  typeof Object(Number.NaN) );
+
+new TestCase( SECTION, "Object('a string').valueOf()",      "a string",         (Object("a string")).valueOf() );
+new TestCase( SECTION, "typeof Object('a string')",         "object",           typeof (Object("a string")) );
+
+new TestCase( SECTION, "Object('').valueOf()",              "",                 (Object("")).valueOf() );
+new TestCase( SECTION, "typeof Object('')",                 "object",           typeof (Object("")) );
+
+new TestCase( SECTION, "Object('\\r\\t\\b\\n\\v\\f').valueOf()",   "\r\t\b\n\v\f",   (Object("\r\t\b\n\v\f")).valueOf() );
+new TestCase( SECTION, "typeof Object('\\r\\t\\b\\n\\v\\f')",      "object",           typeof (Object("\\r\\t\\b\\n\\v\\f")) );
+
+new TestCase( SECTION,  "Object( '\\\'\\\"\\' ).valueOf()",      "\'\"\\",          (Object("\'\"\\")).valueOf() );
+new TestCase( SECTION,  "typeof Object( '\\\'\\\"\\' )",        "object",           typeof Object("\'\"\\") );
+
+new TestCase( SECTION, "Object( new MyObject(true) ).valueOf()",    true,           eval("Object( new MyObject(true) ).valueOf()") );
+new TestCase( SECTION, "typeof Object( new MyObject(true) )",       "object",       eval("typeof Object( new MyObject(true) )") );
+new TestCase( SECTION, "(Object( new MyObject(true) )).toString()",  "[object Object]",       eval("(Object( new MyObject(true) )).toString()") );
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.valueOf = new Function ( "return this.value" );
+}
diff --git a/js/src/tests/ecma/TypeConversion/browser.js b/js/src/tests/ecma/TypeConversion/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/browser.js
diff --git a/js/src/tests/ecma/TypeConversion/shell.js b/js/src/tests/ecma/TypeConversion/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/TypeConversion/shell.js
diff --git a/js/src/tests/ecma/Types/8.1.js b/js/src/tests/ecma/Types/8.1.js
new file mode 100644
index 000000000..532ebaab5
--- /dev/null
+++ b/js/src/tests/ecma/Types/8.1.js
@@ -0,0 +1,41 @@
+/* -*- tab-width: 2; 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:          8.1.js
+   ECMA Section:       The undefined type
+   Description:
+
+   The Undefined type has exactly one value, called undefined. Any variable
+   that has not been assigned a value is of type Undefined.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "8.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The undefined type";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "var x; typeof x",
+	      "undefined",
+	      eval("var x; typeof x") );
+
+new TestCase( SECTION,
+	      "var x; typeof x == 'undefined",
+	      true,
+	      eval("var x; typeof x == 'undefined'") );
+
+new TestCase( SECTION,
+	      "var x; x == void 0",
+	      true,
+	      eval("var x; x == void 0") );
+test();
+
diff --git a/js/src/tests/ecma/Types/8.4.js b/js/src/tests/ecma/Types/8.4.js
new file mode 100644
index 000000000..60cf12d13
--- /dev/null
+++ b/js/src/tests/ecma/Types/8.4.js
@@ -0,0 +1,96 @@
+/* -*- tab-width: 2; 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:          8.4.js
+   ECMA Section:       The String type
+   Description:
+
+   The String type is the set of all finite ordered sequences of zero or more
+   Unicode characters. Each character is regarded as occupying a position
+   within the sequence. These positions are identified by nonnegative
+   integers. The leftmost character (if any) is at position 0, the next
+   character (if any) at position 1, and so on. The length of a string is the
+   number of distinct positions within it. The empty string has length zero
+   and therefore contains no characters.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "8.4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The String type";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "var s = ''; s.length",
+	      0,
+	      eval("var s = ''; s.length") );
+
+new TestCase( SECTION,
+	      "var s = ''; s.charAt(0)",
+	      "",
+	      eval("var s = ''; s.charAt(0)") );
+
+
+for ( var i = 0x0041, TEST_STRING = "", EXPECT_STRING = ""; i < 0x007B; i++ ) {
+  TEST_STRING += ("\\u"+ DecimalToHexString( i ) );
+  EXPECT_STRING += String.fromCharCode(i);
+}
+
+new TestCase( SECTION,
+	      "var s = '" + TEST_STRING+ "'; s",
+	      EXPECT_STRING,
+	      eval("var s = '" + TEST_STRING+ "'; s") );
+
+new TestCase( SECTION,
+	      "var s = '" + TEST_STRING+ "'; s.length",
+	      0x007B-0x0041,
+	      eval("var s = '" + TEST_STRING+ "'; s.length") );
+
+test();
+
+function DecimalToHexString( n ) {
+  n = Number( n );
+  var h = "";
+
+  for ( var i = 3; i >= 0; i-- ) {
+    if ( n >= Math.pow(16, i) ){
+      var t = Math.floor( n  / Math.pow(16, i));
+      n -= t * Math.pow(16, i);
+      if ( t >= 10 ) {
+	if ( t == 10 ) {
+	  h += "A";
+	}
+	if ( t == 11 ) {
+	  h += "B";
+	}
+	if ( t == 12 ) {
+	  h += "C";
+	}
+	if ( t == 13 ) {
+	  h += "D";
+	}
+	if ( t == 14 ) {
+	  h += "E";
+	}
+	if ( t == 15 ) {
+	  h += "F";
+	}
+      } else {
+	h += String( t );
+      }
+    } else {
+      h += "0";
+    }
+  }
+
+  return h;
+}
+
diff --git a/js/src/tests/ecma/Types/8.6.2.1-1.js b/js/src/tests/ecma/Types/8.6.2.1-1.js
new file mode 100644
index 000000000..627c8cba6
--- /dev/null
+++ b/js/src/tests/ecma/Types/8.6.2.1-1.js
@@ -0,0 +1,44 @@
+/* -*- 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:          8.6.2.1-1.js
+   ECMA Section:       8.6.2.1 Get (Value)
+   Description:
+
+   When the [[Get]] method of O is called with property name P, the following
+   steps are taken:
+
+   1.  If O doesn't have a property with name P, go to step 4.
+   2.  Get the value of the property.
+   3.  Return Result(2).
+   4.  If the [[Prototype]] of O is null, return undefined.
+   5.  Call the [[Get]] method of [[Prototype]] with property name P.
+   6.  Return Result(5).
+
+   This tests [[Get]] (Value).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "8.6.2.1-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " [[Get]] (Value)");
+
+new TestCase( SECTION,  "var OBJ = new MyObject(true); OBJ.valueOf()",              true,           eval("var OBJ = new MyObject(true); OBJ.valueOf()") );
+
+new TestCase( SECTION,  "var OBJ = new MyObject(Number.POSITIVE_INFINITY); OBJ.valueOf()",              Number.POSITIVE_INFINITY,           eval("var OBJ = new MyObject(Number.POSITIVE_INFINITY); OBJ.valueOf()") );
+
+new TestCase( SECTION,  "var OBJ = new MyObject('string'); OBJ.valueOf()",              'string',           eval("var OBJ = new MyObject('string'); OBJ.valueOf()") );
+
+test();
+
+function MyObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/Types/browser.js b/js/src/tests/ecma/Types/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Types/browser.js
diff --git a/js/src/tests/ecma/Types/shell.js b/js/src/tests/ecma/Types/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/Types/shell.js
diff --git a/js/src/tests/ecma/browser.js b/js/src/tests/ecma/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/browser.js
diff --git a/js/src/tests/ecma/extensions/10.1.4-9.js b/js/src/tests/ecma/extensions/10.1.4-9.js
new file mode 100644
index 000000000..59367024a
--- /dev/null
+++ b/js/src/tests/ecma/extensions/10.1.4-9.js
@@ -0,0 +1,75 @@
+/* -*- 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:          10.1.4-9.js
+   ECMA Section:       10.1.4 Scope Chain and Identifier Resolution
+   Description:
+   Every execution context has associated with it a scope chain. This is
+   logically a list of objects that are searched when binding an Identifier.
+   When control enters an execution context, the scope chain is created and
+   is populated with an initial set of objects, depending on the type of
+   code. When control leaves the execution context, the scope chain is
+   destroyed.
+
+   During execution, the scope chain of the execution context is affected
+   only by WithStatement. When execution enters a with block, the object
+   specified in the with statement is added to the front of the scope chain.
+   When execution leaves a with block, whether normally or via a break or
+   continue statement, the object is removed from the scope chain. The object
+   being removed will always be the first object in the scope chain.
+
+   During execution, the syntactic production PrimaryExpression : Identifier
+   is evaluated using the following algorithm:
+
+   1.  Get the next object in the scope chain. If there isn't one, go to step 5.
+   2.  Call the [[HasProperty]] method of Result(l), passing the Identifier as
+   the property.
+   3.  If Result(2) is true, return a value of type Reference whose base object
+   is Result(l) and whose property name is the Identifier.
+   4.  Go to step 1.
+   5.  Return a value of type Reference whose base object is null and whose
+   property name is the Identifier.
+   The result of binding an identifier is always a value of type Reference with
+   its member name component equal to the identifier string.
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "10.1.4-9";
+var VERSION = "ECMA_2";
+startTest();
+
+writeHeaderToLog( SECTION + " Scope Chain and Identifier Resolution");
+
+new TestCase( SECTION, "NEW_PROPERTY =  " );
+
+test();
+
+function test() {
+  for ( gTc=0; gTc < gTestcases.length; gTc++ ) {
+
+    var MYOBJECT = new MyObject();
+    var RESULT   = "hello";
+
+    with ( MYOBJECT ) {
+      NEW_PROPERTY = RESULT;
+    }
+    gTestcases[gTc].actual = NEW_PROPERTY;
+    gTestcases[gTc].expect = RESULT;
+
+    gTestcases[gTc].passed = writeTestCaseResult(
+      gTestcases[gTc].expect,
+      gTestcases[gTc].actual,
+      gTestcases[gTc].description +" = "+
+      gTestcases[gTc].actual );
+
+    gTestcases[gTc].reason += ( gTestcases[gTc].passed ) ? "" : "wrong value ";
+  }
+  return ( gTestcases );
+}
+function MyObject( n ) {
+  this.__proto__ = Number.prototype;
+}
diff --git a/js/src/tests/ecma/extensions/10.1.6.js b/js/src/tests/ecma/extensions/10.1.6.js
new file mode 100644
index 000000000..35cca8743
--- /dev/null
+++ b/js/src/tests/ecma/extensions/10.1.6.js
@@ -0,0 +1,93 @@
+/* -*- tab-width: 2; 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:          10.1.6
+   ECMA Section:       Activation Object
+   Description:
+
+   If the function object being invoked has an arguments property, let x be
+   the value of that property; the activation object is also given an internal
+   property [[OldArguments]] whose initial value is x; otherwise, an arguments
+   property is created for the function object but the activation object is
+   not given an [[OldArguments]] property. Next, arguments object described
+   below (the same one stored in the arguments property of the activation
+   object) is used as the new value of the arguments property of the function
+   object. This new value is installed even if the arguments property already
+   exists and has the ReadOnly attribute (as it will for native Function
+   objects). (These actions are taken to provide compatibility with a form of
+   program syntax that is now discouraged: to access the arguments object for
+   function f within the body of f by using the expression f.arguments.
+   The recommended way to access the arguments object for function f within
+   the body of f is simply to refer to the variable arguments.)
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "10.1.6";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Activation Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var arguments = "FAILED!";
+
+var ARG_STRING = "value of the argument property";
+
+new TestCase( SECTION,
+	      "(new TestObject(0,1,2,3,4,5)).length",
+	      6,
+	      (new TestObject(0,1,2,3,4,5)).length );
+
+for ( i = 0; i < 6; i++ ) {
+
+  new TestCase( SECTION,
+		"(new TestObject(0,1,2,3,4,5))["+i+"]",
+		i,
+		(new TestObject(0,1,2,3,4,5))[i]);
+}
+
+
+//    The current object already has an arguments property.
+
+new TestCase( SECTION,
+	      "(new AnotherTestObject(1,2,3)).arguments",
+	      ARG_STRING,
+	      (new AnotherTestObject(1,2,3)).arguments );
+
+//  The function invoked with [[Call]]
+
+new TestCase( SECTION,
+	      "TestFunction(1,2,3)",
+	      ARG_STRING,
+	      TestFunction() + '' );
+
+
+test();
+
+
+
+function Prototype() {
+  this.arguments = ARG_STRING;
+}
+function TestObject() {
+  this.__proto__ = new Prototype();
+  return arguments;
+}
+function AnotherTestObject() {
+  this.__proto__ = new Prototype();
+  return this;
+}
+function TestFunction() {
+  arguments = ARG_STRING;
+  return arguments;
+}
+function AnotherTestFunction() {
+  this.__proto__ = new Prototype();
+  return this;
+}
diff --git a/js/src/tests/ecma/extensions/10.1.8-1.js b/js/src/tests/ecma/extensions/10.1.8-1.js
new file mode 100644
index 000000000..f0acd7b0b
--- /dev/null
+++ b/js/src/tests/ecma/extensions/10.1.8-1.js
@@ -0,0 +1,101 @@
+/* -*- tab-width: 2; 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:          10.1.8
+   ECMA Section:       Arguments Object
+   Description:
+
+   When control enters an execution context for declared function code,
+   anonymous code, or implementation-supplied code, an arguments object is
+   created and initialized as follows:
+
+   The [[Prototype]] of the arguments object is to the original Object
+   prototype object, the one that is the initial value of Object.prototype
+   (section 15.2.3.1).
+
+   A property is created with name callee and property attributes {DontEnum}.
+   The initial value of this property is the function object being executed.
+   This allows anonymous functions to be recursive.
+
+   A property is created with name length and property attributes {DontEnum}.
+   The initial value of this property is the number of actual parameter values
+   supplied by the caller.
+
+   For each non-negative integer, iarg, less than the value of the length
+   property, a property is created with name ToString(iarg) and property
+   attributes { DontEnum }. The initial value of this property is the value
+   of the corresponding actual parameter supplied by the caller. The first
+   actual parameter value corresponds to iarg = 0, the second to iarg = 1 and
+   so on. In the case when iarg is less than the number of formal parameters
+   for the function object, this property shares its value with the
+   corresponding property of the activation object. This means that changing
+   this property changes the corresponding property of the activation object
+   and vice versa. The value sharing mechanism depends on the implementation.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+
+var SECTION = "10.1.8";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Arguments Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var ARG_STRING = "value of the argument property";
+
+new TestCase( SECTION,
+	      "GetCallee()",
+	      GetCallee,
+	      GetCallee() );
+
+var LIMIT = 100;
+
+for ( var i = 0, args = "" ; i < LIMIT; i++ ) {
+  args += String(i) + ( i+1 < LIMIT ? "," : "" );
+
+}
+
+var LENGTH = eval( "GetLength("+ args +")" );
+
+new TestCase( SECTION,
+	      "GetLength("+args+")",
+	      100,
+	      LENGTH );
+
+var ARGUMENTS = eval( "GetArguments( " +args+")" );
+
+for ( var i = 0; i < 100; i++ ) {
+  new TestCase( SECTION,
+		"GetArguments("+args+")["+i+"]",
+		i,
+		ARGUMENTS[i] );
+}
+
+test();
+
+function TestFunction() {
+  var arg_proto = arguments.__proto__;
+}
+function GetCallee() {
+  var c = arguments.callee;
+  return c;
+}
+function GetArguments() {
+  var a = arguments;
+  return a;
+}
+function GetLength() {
+  var l = arguments.length;
+  return l;
+}
+
+function AnotherTestFunction() {
+  this.__proto__ = new Prototype();
+  return this;
+}
diff --git a/js/src/tests/ecma/extensions/11.6.1-1.js b/js/src/tests/ecma/extensions/11.6.1-1.js
new file mode 100644
index 000000000..94e241e06
--- /dev/null
+++ b/js/src/tests/ecma/extensions/11.6.1-1.js
@@ -0,0 +1,111 @@
+/* -*- tab-width: 2; 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:          11.6.1-1.js
+   ECMA Section:       11.6.1 The addition operator ( + )
+   Description:
+
+   The addition operator either performs string concatenation or numeric
+   addition.
+
+   The production AdditiveExpression : AdditiveExpression + MultiplicativeExpression
+   is evaluated as follows:
+
+   1.  Evaluate AdditiveExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate MultiplicativeExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToPrimitive(Result(2)).
+   6.  Call ToPrimitive(Result(4)).
+   7.  If Type(Result(5)) is String or Type(Result(6)) is String, go to step 12.
+   (Note that this step differs from step 3 in the algorithm for comparison
+   for the relational operators in using or instead of and.)
+   8.  Call ToNumber(Result(5)).
+   9.  Call ToNumber(Result(6)).
+   10. Apply the addition operation to Result(8) and Result(9). See the discussion below (11.6.3).
+   11. Return Result(10).
+   12. Call ToString(Result(5)).
+   13. Call ToString(Result(6)).
+   14. Concatenate Result(12) followed by Result(13).
+   15. Return Result(14).
+
+   Note that no hint is provided in the calls to ToPrimitive in steps 5 and 6.
+   All native ECMAScript objects except Date objects handle the absence of a
+   hint as if the hint Number were given; Date objects handle the absence of a
+   hint as if the hint String were given. Host objects may handle the absence
+   of a hint in some other manner.
+
+   This test does not cover cases where the Additive or Mulplicative expression
+   ToPrimitive is string.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.6.1-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The Addition operator ( + )");
+
+// tests for "MyValuelessObject", where the value is
+// set in the object's prototype, not the object itself.
+
+new TestCase(   SECTION,
+		"var EXP_1 = new MyValuelessObject(true); var EXP_2 = new MyValuelessObject(false); EXP_1 + EXP_2",
+		1,
+		eval("var EXP_1 = new MyValuelessObject(true); var EXP_2 = new MyValuelessObject(false); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new MyValuelessObject(new Boolean(true)); var EXP_2 = new MyValuelessObject(new Boolean(false)); EXP_1 + EXP_2",
+		"truefalse",
+		eval("var EXP_1 = new MyValuelessObject(new Boolean(true)); var EXP_2 = new MyValuelessObject(new Boolean(false)); EXP_1 + EXP_2") );
+
+// tests for "MyValuelessObject", where the value is
+// set in the object's prototype, not the object itself.
+
+
+new TestCase(   SECTION,
+		"var EXP_1 = new MyValuelessObject(100); var EXP_2 = new MyValuelessObject(-1); EXP_1 + EXP_2",
+		99,
+		eval("var EXP_1 = new MyValuelessObject(100); var EXP_2 = new MyValuelessObject(-1); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new MyValuelessObject(new Number(100)); var EXP_2 = new MyValuelessObject(new Number(-1)); EXP_1 + EXP_2",
+		"100-1",
+		eval("var EXP_1 = new MyValuelessObject(new Number(100)); var EXP_2 = new MyValuelessObject(new Number(-1)); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+		"var EXP_1 = new MyValuelessObject( new MyValuelessObject( new Boolean(true) ) ); EXP_1 + EXP_1",
+		"truetrue",
+		eval("var EXP_1 = new MyValuelessObject( new MyValuelessObject( new Boolean(true) ) ); EXP_1 + EXP_1") );
+
+test();
+
+function MyProtoValuelessObject() {
+  this.valueOf = new Function ( "" );
+  this.__proto__ = null;
+}
+
+function MyProtolessObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.__proto__ = null;
+  this.value = value;
+}
+
+function MyValuelessObject(value) {
+  this.__proto__ = new MyPrototypeObject(value);
+}
+function MyPrototypeObject(value) {
+  this.valueOf = new Function( "return this.value;" );
+  this.toString = new Function( "return (this.value + '');" );
+  this.value = value;
+}
+
+function MyObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/extensions/11.6.1-2.js b/js/src/tests/ecma/extensions/11.6.1-2.js
new file mode 100644
index 000000000..90ed10f56
--- /dev/null
+++ b/js/src/tests/ecma/extensions/11.6.1-2.js
@@ -0,0 +1,102 @@
+/* -*- 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:          11.6.1-2.js
+   ECMA Section:       11.6.1 The addition operator ( + )
+   Description:
+
+   The addition operator either performs string concatenation or numeric
+   addition.
+
+   The production AdditiveExpression : AdditiveExpression + MultiplicativeExpression
+   is evaluated as follows:
+
+   1.  Evaluate AdditiveExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate MultiplicativeExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToPrimitive(Result(2)).
+   6.  Call ToPrimitive(Result(4)).
+   7.  If Type(Result(5)) is String or Type(Result(6)) is String, go to step 12.
+   (Note that this step differs from step 3 in the algorithm for comparison
+   for the relational operators in using or instead of and.)
+   8.  Call ToNumber(Result(5)).
+   9.  Call ToNumber(Result(6)).
+   10. Apply the addition operation to Result(8) and Result(9). See the discussion below (11.6.3).
+   11. Return Result(10).
+   12. Call ToString(Result(5)).
+   13. Call ToString(Result(6)).
+   14. Concatenate Result(12) followed by Result(13).
+   15. Return Result(14).
+
+   Note that no hint is provided in the calls to ToPrimitive in steps 5 and 6.
+   All native ECMAScript objects except Date objects handle the absence of a
+   hint as if the hint Number were given; Date objects handle the absence of a
+   hint as if the hint String were given. Host objects may handle the absence
+   of a hint in some other manner.
+
+   This test does only covers cases where the Additive or Mulplicative expression
+   ToPrimitive is a string.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.6.1-2";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The Addition operator ( + )");
+
+// tests for "MyValuelessObject", where the value is
+// set in the object's prototype, not the object itself.
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyValuelessObject('string'); var EXP_2 = new MyValuelessObject(false); EXP_1 + EXP_2",
+                "stringfalse",
+                eval("var EXP_1 = new MyValuelessObject('string'); var EXP_2 = new MyValuelessObject(false); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyValuelessObject(new String('string')); var EXP_2 = new MyValuelessObject(new Boolean(false)); EXP_1 + EXP_2",
+                "stringfalse",
+                eval("var EXP_1 = new MyValuelessObject(new String('string')); var EXP_2 = new MyValuelessObject(new Boolean(false)); EXP_1 + EXP_2") );
+
+// tests for "MyValuelessObject", where the value is
+// set in the object's prototype, not the object itself.
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyValuelessObject(100); var EXP_2 = new MyValuelessObject('string'); EXP_1 + EXP_2",
+                "100string",
+                eval("var EXP_1 = new MyValuelessObject(100); var EXP_2 = new MyValuelessObject('string'); EXP_1 + EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyValuelessObject(new String('string')); var EXP_2 = new MyValuelessObject(new Number(-1)); EXP_1 + EXP_2",
+                "string-1",
+                eval("var EXP_1 = new MyValuelessObject(new String('string')); var EXP_2 = new MyValuelessObject(new Number(-1)); EXP_1 + EXP_2") );
+
+test();
+
+function MyProtoValuelessObject() {
+  this.valueOf = new Function ( "" );
+  this.__proto__ = null;
+}
+function MyProtolessObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.__proto__ = null;
+  this.value = value;
+}
+function MyValuelessObject(value) {
+  this.__proto__ = new MyPrototypeObject(value);
+}
+function MyPrototypeObject(value) {
+  this.valueOf = new Function( "return this.value;" );
+  this.toString = new Function( "return (this.value + '');" );
+  this.value = value;
+}
+function MyObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/extensions/11.6.1-3.js b/js/src/tests/ecma/extensions/11.6.1-3.js
new file mode 100644
index 000000000..48dbaf4f7
--- /dev/null
+++ b/js/src/tests/ecma/extensions/11.6.1-3.js
@@ -0,0 +1,103 @@
+/* -*- 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:          11.6.1-3.js
+   ECMA Section:       11.6.1 The addition operator ( + )
+   Description:
+
+   The addition operator either performs string concatenation or numeric
+   addition.
+
+   The production AdditiveExpression : AdditiveExpression + MultiplicativeExpression
+   is evaluated as follows:
+
+   1.  Evaluate AdditiveExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate MultiplicativeExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToPrimitive(Result(2)).
+   6.  Call ToPrimitive(Result(4)).
+   7.  If Type(Result(5)) is String or Type(Result(6)) is String, go to step 12.
+   (Note that this step differs from step 3 in the algorithm for comparison
+   for the relational operators in using or instead of and.)
+   8.  Call ToNumber(Result(5)).
+   9.  Call ToNumber(Result(6)).
+   10. Apply the addition operation to Result(8) and Result(9). See the discussion below (11.6.3).
+   11. Return Result(10).
+   12. Call ToString(Result(5)).
+   13. Call ToString(Result(6)).
+   14. Concatenate Result(12) followed by Result(13).
+   15. Return Result(14).
+
+   Note that no hint is provided in the calls to ToPrimitive in steps 5 and 6.
+   All native ECMAScript objects except Date objects handle the absence of a
+   hint as if the hint Number were given; Date objects handle the absence of a
+   hint as if the hint String were given. Host objects may handle the absence
+   of a hint in some other manner.
+
+   This test does only covers cases where the Additive or Mulplicative expression
+   is a Date.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.6.1-3";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The Addition operator ( + )");
+
+// tests for a boolean primitive and a boolean object, and
+// "MyValuelessObject", where the value is set in the object's
+// prototype, not the object itself.
+
+var DATE1 = new Date();
+
+var MYOB1 = new MyObject( DATE1 );
+var MYOB2 = new MyValuelessObject( DATE1 );
+var MYOB3 = new MyProtolessObject( DATE1 );
+var MYOB4 = new MyProtoValuelessObject( DATE1 );
+
+new TestCase(   SECTION,
+                "MYOB2 = new MyValuelessObject(DATE1); MYOB3 + 'string'",
+                DATE1.toString() + "string",
+                MYOB2 + 'string' );
+
+new TestCase(   SECTION,
+                "MYOB2 = new MyValuelessObject(DATE1); MYOB3 + new String('string')",
+                DATE1.toString() + "string",
+                MYOB2 + new String('string') );
+/*
+  new TestCase(   SECTION,
+  "MYOB3 = new MyProtolessObject(DATE1); MYOB3 + new Boolean(true)",
+  DATE1.toString() + "true",
+  MYOB3 + new Boolean(true) );
+*/
+
+test();
+
+function MyProtoValuelessObject() {
+  this.valueOf = new Function ( "" );
+  this.__proto__ = null;
+}
+function MyProtolessObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.__proto__ = null;
+  this.value = value;
+}
+function MyValuelessObject(value) {
+  this.__proto__ = new MyPrototypeObject(value);
+}
+function MyPrototypeObject(value) {
+  this.valueOf = new Function( "return this.value;" );
+  this.toString = new Function( "return (this.value + '');" );
+  this.value = value;
+}
+function MyObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/extensions/11.6.2-1.js b/js/src/tests/ecma/extensions/11.6.2-1.js
new file mode 100644
index 000000000..d9b6ea35e
--- /dev/null
+++ b/js/src/tests/ecma/extensions/11.6.2-1.js
@@ -0,0 +1,90 @@
+/* -*- 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:          11.6.2-1.js
+   ECMA Section:       11.6.2 The Subtraction operator ( - )
+   Description:
+
+   The production AdditiveExpression : AdditiveExpression -
+   MultiplicativeExpression is evaluated as follows:
+
+   1.  Evaluate AdditiveExpression.
+   2.  Call GetValue(Result(1)).
+   3.  Evaluate MultiplicativeExpression.
+   4.  Call GetValue(Result(3)).
+   5.  Call ToNumber(Result(2)).
+   6.  Call ToNumber(Result(4)).
+   7.  Apply the subtraction operation to Result(5) and Result(6). See the
+   discussion below (11.6.3).
+   8.  Return Result(7).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "11.6.2-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " The subtraction operator ( - )");
+
+// tests "MyValuelessObject", where the value is
+// set in the object's prototype, not the object itself.
+
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyValuelessObject(true); var EXP_2 = new MyValuelessObject(false); EXP_1 - EXP_2",
+                1,
+                eval("var EXP_1 = new MyValuelessObject(true); var EXP_2 = new MyValuelessObject(false); EXP_1 - EXP_2") );
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyValuelessObject(new Boolean(true)); var EXP_2 = new MyValuelessObject(new Boolean(false)); EXP_1 - EXP_2",
+                Number.NaN,
+                eval("var EXP_1 = new MyValuelessObject(new Boolean(true)); var EXP_2 = new MyValuelessObject(new Boolean(false)); EXP_1 - EXP_2") );
+
+// tests "MyValuelessObject", where the value is
+// set in the object's prototype, not the object itself.
+
+new TestCase(   SECTION,
+                "var EXP_1 = new MyValuelessObject(100); var EXP_2 = new MyValuelessObject(1); EXP_1 - EXP_2",
+                99,
+                eval("var EXP_1 = new MyValuelessObject(100); var EXP_2 = new MyValuelessObject(1); EXP_1 - EXP_2") );
+/*
+  new TestCase(   SECTION,
+  "var EXP_1 = new MyValuelessObject(new Number(100)); var EXP_2 = new MyValuelessObject(new Number(1)); EXP_1 - EXP_2",
+  Number.NaN,
+  eval("var EXP_1 = new MyValuelessObject(new Number(100)); var EXP_2 = new MyValuelessObject(new Number(1)); EXP_1 - EXP_2") );
+*/
+// same thing with string!
+
+test();
+
+function MyProtoValuelessObject() {
+  this.valueOf = new Function ( "" );
+  this.__proto__ = null;
+}
+function MyProtolessObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.__proto__ = null;
+  this.value = value;
+}
+function MyValuelessObject(value) {
+  this.__proto__ = new MyPrototypeObject(value);
+}
+function MyPrototypeObject(value) {
+  this.valueOf = new Function( "return this.value;" );
+  this.toString = new Function( "return (this.value + '');" );
+  this.value = value;
+}
+function MyObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.value = value;
+}
+function MyOtherObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.toString = new Function ( "return this.value + ''" );
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/extensions/15-1.js b/js/src/tests/ecma/extensions/15-1.js
new file mode 100644
index 000000000..e70cb2ca6
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15-1.js
@@ -0,0 +1,60 @@
+/* -*- 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:          15.js
+   ECMA Section:       15 Native ECMAScript Objects
+   Description:        Every built-in prototype object has the Object prototype
+   object, which is the value of the expression
+   Object.prototype (15.2.3.1) as the value of its internal
+   [[Prototype]] property, except the Object prototype
+   object itself.
+
+   Every native object associated with a program-created
+   function also has the Object prototype object as the
+   value of its internal [[Prototype]] property.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Native ECMAScript Objects";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+/*
+  new TestCase( SECTION,  "Function.prototype.__proto__", Object.prototype,   Function.prototype.__proto__ );
+  new TestCase( SECTION,  "Array.prototype.__proto__",    Object.prototype,   Array.prototype.__proto__ );
+  new TestCase( SECTION,  "String.prototype.__proto__",   Object.prototype,   String.prototype.__proto__ );
+  new TestCase( SECTION,  "Boolean.prototype.__proto__",  Object.prototype,   Boolean.prototype.__proto__ );
+  new TestCase( SECTION,  "Number.prototype.__proto__",   Object.prototype,   Number.prototype.__proto__ );
+//    new TestCase( SECTION,  "Math.prototype.__proto__",     Object.prototype,   Math.prototype.__proto__ );
+new TestCase( SECTION,  "Date.prototype.__proto__",     Object.prototype,   Date.prototype.__proto__ );
+new TestCase( SECTION,  "TestCase.prototype.__proto__", Object.prototype,   TestCase.prototype.__proto__ );
+
+new TestCase( SECTION,  "MyObject.prototype.__proto__", Object.prototype,   MyObject.prototype.__proto__ );
+*/
+new TestCase( SECTION,  "Function.prototype.__proto__ == Object.prototype", true,   Function.prototype.__proto__ == Object.prototype );
+new TestCase( SECTION,  "Array.prototype.__proto__ == Object.prototype",    true,   Array.prototype.__proto__ == Object.prototype );
+new TestCase( SECTION,  "String.prototype.__proto__ == Object.prototype",   true,   String.prototype.__proto__ == Object.prototype );
+new TestCase( SECTION,  "Boolean.prototype.__proto__ == Object.prototype",  true,   Boolean.prototype.__proto__ == Object.prototype );
+new TestCase( SECTION,  "Number.prototype.__proto__ == Object.prototype",   true,   Number.prototype.__proto__ == Object.prototype );
+//    new TestCase( SECTION,  "Math.prototype.__proto__ == Object.prototype",     true,   Math.prototype.__proto__ == Object.prototype );
+new TestCase( SECTION,  "Date.prototype.__proto__ == Object.prototype",     true,   Date.prototype.__proto__ == Object.prototype );
+new TestCase( SECTION,  "TestCase.prototype.__proto__ == Object.prototype", true,   TestCase.prototype.__proto__ == Object.prototype );
+
+new TestCase( SECTION,  "MyObject.prototype.__proto__ == Object.prototype", true,   MyObject.prototype.__proto__ == Object.prototype );
+
+
+test();
+
+
+function MyObject( value ) {
+  this.value = value;
+  this.valueOf = new Function( "return this.value" );
+}
diff --git a/js/src/tests/ecma/extensions/15-2.js b/js/src/tests/ecma/extensions/15-2.js
new file mode 100644
index 000000000..81724949c
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15-2.js
@@ -0,0 +1,43 @@
+/* -*- 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:          15-2.js
+   ECMA Section:       15 Native ECMAScript Objects
+
+   Description:        Every built-in function and every built-in constructor
+   has the Function prototype object, which is the value of
+   the expression Function.prototype as the value of its
+   internal [[Prototype]] property, except the Function
+   prototype object itself.
+
+   That is, the __proto__ property of builtin functions and
+   constructors should be the Function.prototype object.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Native ECMAScript Objects";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,  "Object.__proto__",   Function.prototype,   Object.__proto__ );
+new TestCase( SECTION,  "Array.__proto__",    Function.prototype,   Array.__proto__ );
+new TestCase( SECTION,  "String.__proto__",   Function.prototype,   String.__proto__ );
+new TestCase( SECTION,  "Boolean.__proto__",  Function.prototype,   Boolean.__proto__ );
+new TestCase( SECTION,  "Number.__proto__",   Function.prototype,   Number.__proto__ );
+new TestCase( SECTION,  "Date.__proto__",     Function.prototype,   Date.__proto__ );
+new TestCase( SECTION,  "TestCase.__proto__", Function.prototype,   TestCase.__proto__ );
+
+new TestCase( SECTION,  "eval.__proto__",     Function.prototype,   eval.__proto__ );
+new TestCase( SECTION,  "Math.pow.__proto__", Function.prototype,   Math.pow.__proto__ );
+new TestCase( SECTION,  "String.prototype.indexOf.__proto__", Function.prototype,   String.prototype.indexOf.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.1.2.1-1.js b/js/src/tests/ecma/extensions/15.1.2.1-1.js
new file mode 100644
index 000000000..3119abd6d
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.1.2.1-1.js
@@ -0,0 +1,53 @@
+/* -*- 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:          15.1.2.1-1.js
+   ECMA Section:       15.1.2.1 eval(x)
+
+   if x is not a string object, return x.
+   Description:
+   Author:             christine@netscape.com
+   Date:               16 september 1997
+*/
+var SECTION = "15.1.2.1-1";
+var VERSION = "ECMA_1";
+var TITLE   = "eval(x)";
+var BUGNUMBER = "none";
+
+startTest();
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,      "eval.length",              1,              eval.length );
+new TestCase( SECTION,      "var PROPS = ''; for ( p in eval ) { PROPS += p }; PROPS",  "", eval("var PROPS = ''; for ( p in eval ) { PROPS += p }; PROPS") );
+new TestCase( SECTION,      "eval.length = null; eval.length",       1, eval( "eval.length = null; eval.length") );
+//     new TestCase( SECTION,     "eval.__proto__",                       Function.prototype,            eval.__proto__ );
+
+// test cases where argument is not a string.  should return the argument.
+
+new TestCase( SECTION,     "eval()",                                void 0,                     eval() );
+new TestCase( SECTION,     "eval(void 0)",                          void 0,                     eval( void 0) );
+new TestCase( SECTION,     "eval(null)",                            null,                       eval( null ) );
+new TestCase( SECTION,     "eval(true)",                            true,                       eval( true ) );
+new TestCase( SECTION,     "eval(false)",                           false,                      eval( false ) );
+
+new TestCase( SECTION,     "typeof eval(new String('Infinity/-0')", "object",                   typeof eval(new String('Infinity/-0')) );
+
+new TestCase( SECTION,     "eval([1,2,3,4,5,6])",                  "1,2,3,4,5,6",                 ""+eval([1,2,3,4,5,6]) );
+new TestCase( SECTION,     "eval(new Array(0,1,2,3)",              "1,2,3",                       ""+  eval(new Array(1,2,3)) );
+new TestCase( SECTION,     "eval(1)",                              1,                             eval(1) );
+new TestCase( SECTION,     "eval(0)",                              0,                             eval(0) );
+new TestCase( SECTION,     "eval(-1)",                             -1,                            eval(-1) );
+new TestCase( SECTION,     "eval(Number.NaN)",                     Number.NaN,                    eval(Number.NaN) );
+new TestCase( SECTION,     "eval(Number.MIN_VALUE)",               5e-308,                        eval(Number.MIN_VALUE) );
+new TestCase( SECTION,     "eval(-Number.MIN_VALUE)",              -5e-308,                       eval(-Number.MIN_VALUE) );
+new TestCase( SECTION,     "eval(Number.POSITIVE_INFINITY)",       Number.POSITIVE_INFINITY,      eval(Number.POSITIVE_INFINITY) );
+new TestCase( SECTION,     "eval(Number.NEGATIVE_INFINITY)",       Number.NEGATIVE_INFINITY,      eval(Number.NEGATIVE_INFINITY) );
+new TestCase( SECTION,     "eval( 4294967296 )",                   4294967296,                    eval(4294967296) );
+new TestCase( SECTION,     "eval( 2147483648 )",                   2147483648,                    eval(2147483648) );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.2.1.1.js b/js/src/tests/ecma/extensions/15.2.1.1.js
new file mode 100644
index 000000000..3acaf24d9
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.2.1.1.js
@@ -0,0 +1,48 @@
+/* -*- 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:          15.2.1.1.js
+   ECMA Section:       15.2.1.1  The Object Constructor Called as a Function:
+   Object(value)
+   Description:        When Object is called as a function rather than as a
+   constructor, the following steps are taken:
+
+   1.  If value is null or undefined, create and return a
+   new object with no properties other than internal
+   properties exactly as if the object constructor
+   had been called on that same value (15.2.2.1).
+   2.  Return ToObject (value), whose rules are:
+
+   undefined   generate a runtime error
+   null        generate a runtime error
+   boolean     create a new Boolean object whose default
+   value is the value of the boolean.
+   number      Create a new Number object whose default
+   value is the value of the number.
+   string      Create a new String object whose default
+   value is the value of the string.
+   object      Return the input argument (no conversion).
+
+   Author:             christine@netscape.com
+   Date:               17 july 1997
+*/
+
+var SECTION = "15.2.1.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Object( value )";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var NULL_OBJECT = Object(null);
+
+new TestCase( SECTION, "Object(null).__proto__",    Object.prototype,       (Object(null)).__proto__ );
+
+new TestCase( SECTION, "Object(void 0).__proto__",    Object.prototype,       (Object(void 0)).__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.2.3-1.js b/js/src/tests/ecma/extensions/15.2.3-1.js
new file mode 100644
index 000000000..a7aaf20b5
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.2.3-1.js
@@ -0,0 +1,30 @@
+/* -*- 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:          15.2.3-1.js
+   ECMA Section:       15.2.3 Properties of the Object Constructor
+
+   Description:        The value of the internal [[Prototype]] property of the
+   Object constructor is the Function prototype object.
+
+   Besides the call and construct propreties and the length
+   property, the Object constructor has properties described
+   in 15.2.3.1.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.2.3";
+var VERSION = "ECMA_2";
+startTest();
+
+writeHeaderToLog( SECTION + " Properties of the Object Constructor");
+
+new TestCase( SECTION,  "Object.__proto__",     Function.prototype,     Object.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.2.4.js b/js/src/tests/ecma/extensions/15.2.4.js
new file mode 100644
index 000000000..f5620094e
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.2.4.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.2.4.js
+   ECMA Section:       15.2.4 Properties of the Object prototype object
+
+   Description:        The value of the internal [[Prototype]] property of
+   the Object prototype object is null
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+
+var SECTION = "15.2.4";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "Properties of the Object.prototype object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, 
+	      "Object.prototype.__proto__",
+	      null,
+	      Object.prototype.__proto__ );
+
+test();
+
diff --git a/js/src/tests/ecma/extensions/15.3.1.1-1.js b/js/src/tests/ecma/extensions/15.3.1.1-1.js
new file mode 100644
index 000000000..cf21dbb93
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.3.1.1-1.js
@@ -0,0 +1,48 @@
+/* -*- tab-width: 2; 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:          15.3.1.1.js
+   ECMA Section:       15.3.1.1 The Function Constructor Called as a Function
+
+   Description:
+   When the Function function is called with some arguments p1, p2, . . . , pn, body
+   (where n might be 0, that is, there are no "p" arguments, and where body might
+   also not be provided), the following steps are taken:
+
+   1.  Create and return a new Function object exactly if the function constructor had
+   been called with the same arguments (15.3.2.1).
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.1.1-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Function Constructor Called as a Function";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var MyObject = Function( "value", "this.value = value; this.valueOf =  Function( 'return this.value' ); this.toString =  Function( 'return String(this.value);' )" );
+
+
+var myfunc = Function();
+myfunc.toString = Object.prototype.toString;
+
+//    not going to test toString here since it is implementation dependent.
+//    new TestCase( SECTION,  "myfunc.toString()",     "function anonymous() { }",    myfunc.toString() );
+
+myfunc.toString = Object.prototype.toString;
+
+new TestCase( SECTION, 
+	      "MyObject.__proto__ == Function.prototype",    
+	      true,  
+	      MyObject.__proto__ == Function.prototype );
+
+test();
+
+
diff --git a/js/src/tests/ecma/extensions/15.3.1.1-2.js b/js/src/tests/ecma/extensions/15.3.1.1-2.js
new file mode 100644
index 000000000..ab9bbf91c
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.3.1.1-2.js
@@ -0,0 +1,48 @@
+/* -*- tab-width: 2; 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:          15.3.1.1-2.js
+   ECMA Section:       15.3.1.1 The Function Constructor Called as a Function
+   Function(p1, p2, ..., pn, body )
+
+   Description:
+   When the Function function is called with some arguments p1, p2, . . . , pn,
+   body (where n might be 0, that is, there are no "p" arguments, and where body
+   might also not be provided), the following steps are taken:
+
+   1.  Create and return a new Function object exactly if the function constructor
+   had been called with the same arguments (15.3.2.1).
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.1.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Function Constructor Called as a Function";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var myfunc2 =  Function("a, b, c",   "return a+b+c" );
+var myfunc3 =  Function("a,b", "c",  "return a+b+c" );
+
+myfunc2.toString = Object.prototype.toString;
+myfunc3.toString = Object.prototype.toString;
+
+
+new TestCase( SECTION, 
+	      "myfunc2.__proto__",                        
+	      Function.prototype,    
+	      myfunc2.__proto__ );
+
+new TestCase( SECTION, 
+	      "myfunc3.__proto__",                        
+	      Function.prototype,    
+	      myfunc3.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.3.2.1-1.js b/js/src/tests/ecma/extensions/15.3.2.1-1.js
new file mode 100644
index 000000000..201fbeb90
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.3.2.1-1.js
@@ -0,0 +1,38 @@
+/* -*- tab-width: 2; 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:          15.3.2.1.js
+   ECMA Section:       15.3.2.1 The Function Constructor
+   new Function(p1, p2, ..., pn, body )
+
+   Description:        The last argument specifies the body (executable code)
+   of a function; any preceding arguments sepcify formal
+   parameters.
+
+   See the text for description of this section.
+
+   This test examples from the specification.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.2.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Function Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var MyObject = new Function( "value", "this.value = value; this.valueOf = new Function( 'return this.value' ); this.toString = new Function( 'return String(this.value);' )" );
+
+new TestCase( SECTION,
+	      "MyObject.__proto__ == Function.prototype",   
+	      true,
+	      MyObject.__proto__ == Function.prototype );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.3.2.1-2.js b/js/src/tests/ecma/extensions/15.3.2.1-2.js
new file mode 100644
index 000000000..3a6d404b1
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.3.2.1-2.js
@@ -0,0 +1,38 @@
+/* -*- 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:          15.3.2.1.js
+   ECMA Section:       15.3.2.1 The Function Constructor
+   new Function(p1, p2, ..., pn, body )
+
+   Description:
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.2.1-2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "The Function Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+var myfunc1 = new Function("a","b","c", "return a+b+c" );
+var myfunc2 = new Function("a, b, c",   "return a+b+c" );
+var myfunc3 = new Function("a,b", "c",  "return a+b+c" );
+
+myfunc1.toString = Object.prototype.toString;
+myfunc2.toString = Object.prototype.toString;
+myfunc3.toString = Object.prototype.toString;
+
+
+new TestCase( SECTION,  "myfunc2.__proto__",                         Function.prototype,     myfunc2.__proto__ );
+
+new TestCase( SECTION,  "myfunc3.__proto__",                         Function.prototype,     myfunc3.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.3.3.1-1.js b/js/src/tests/ecma/extensions/15.3.3.1-1.js
new file mode 100644
index 000000000..88e1608c8
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.3.3.1-1.js
@@ -0,0 +1,33 @@
+/* -*- 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:          15.3.3.1-1.js
+   ECMA Section:       15.3.3.1 Properties of the Function Constructor
+   Function.prototype
+
+   Description:        The initial value of Function.prototype is the built-in
+   Function prototype object.
+
+   This property shall have the attributes [DontEnum |
+   DontDelete | ReadOnly]
+
+   This test the value of Function.prototype.
+
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.3.3.1-1";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "Function.prototype";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "Function.prototype == Function.__proto__",    true, Function.__proto__ == Function.prototype );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.4.3.js b/js/src/tests/ecma/extensions/15.4.3.js
new file mode 100644
index 000000000..31ae0f2e9
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.4.3.js
@@ -0,0 +1,29 @@
+/* -*- tab-width: 2; 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:          15.4.3.js
+   ECMA Section:       15.4.3 Properties of the Array Constructor
+   Description:        The value of the internal [[Prototype]] property of the
+   Array constructor is the Function prototype object.
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+
+var SECTION = "15.4.3";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "Properties of the Array Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Array.__proto__",     
+	      Function.prototype,       
+	      Array.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.5.3.js b/js/src/tests/ecma/extensions/15.5.3.js
new file mode 100644
index 000000000..a45d289e6
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.5.3.js
@@ -0,0 +1,32 @@
+/* -*- tab-width: 2; 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:          15.5.3.1.js
+   ECMA Section:       15.5.3 Properties of the String Constructor
+
+   Description:	    The value of the internal [[Prototype]] property of
+   the String constructor is the Function prototype
+   object.
+
+   In addition to the internal [[Call]] and [[Construct]]
+   properties, the String constructor also has the length
+   property, as well as properties described in 15.5.3.1
+   and 15.5.3.2.
+
+   Author:             christine@netscape.com
+   Date:               1 october 1997
+*/
+
+var SECTION = "15.5.3";
+var VERSION = "ECMA_2";
+startTest();
+var passed = true;
+writeHeaderToLog( SECTION + " Properties of the String Constructor" );
+
+new TestCase( SECTION,	"String.prototype",             Function.prototype,     String.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.5.4.2.js b/js/src/tests/ecma/extensions/15.5.4.2.js
new file mode 100644
index 000000000..b67bdbdae
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.5.4.2.js
@@ -0,0 +1,25 @@
+/* -*- 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:          15.5.4.2.js
+   ECMA Section:       15.5.4.2 String.prototype.toString
+
+   Description:
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var SECTION = "15.5.4.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.prototype.tostring";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "String.prototype.toString.__proto__",  Function.prototype, String.prototype.toString.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.5.4.4-4.js b/js/src/tests/ecma/extensions/15.5.4.4-4.js
new file mode 100644
index 000000000..4da338ce6
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.5.4.4-4.js
@@ -0,0 +1,73 @@
+/* -*- 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:          15.5.4.4-4.js
+   ECMA Section:       15.5.4.4 String.prototype.charAt(pos)
+   Description:        Returns a string containing the character at position
+   pos in the string.  If there is no character at that
+   string, the result is the empty string.  The result is
+   a string value, not a String object.
+
+   When the charAt method is called with one argument,
+   pos, the following steps are taken:
+   1. Call ToString, with this value as its argument
+   2. Call ToInteger pos
+   3. Compute the number of characters  in Result(1)
+   4. If Result(2) is less than 0 is or not less than
+   Result(3), return the empty string
+   5. Return a string of length 1 containing one character
+   from result (1), the character at position Result(2).
+
+   Note that the charAt function is intentionally generic;
+   it does not require that its this value be a String
+   object.  Therefore it can be transferred to other kinds
+   of objects for use as a method.
+
+   This tests assiging charAt to primitive types..
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.4-4";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "String.prototype.charAt";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+/*
+  new TestCase( SECTION,     "x = null; x.__proto.charAt = String.prototype.charAt; x.charAt(0)",            "n",     eval("x=null; x.__proto__.charAt = String.prototype.charAt; x.charAt(0)") );
+  new TestCase( SECTION,     "x = null; x.__proto.charAt = String.prototype.charAt; x.charAt(1)",            "u",     eval("x=null; x.__proto__.charAt = String.prototype.charAt; x.charAt(1)") );
+  new TestCase( SECTION,     "x = null; x.__proto.charAt = String.prototype.charAt; x.charAt(2)",            "l",     eval("x=null; x.__proto__.charAt = String.prototype.charAt; x.charAt(2)") );
+  new TestCase( SECTION,     "x = null; x.__proto.charAt = String.prototype.charAt; x.charAt(3)",            "l",     eval("x=null; x.__proto__.charAt = String.prototype.charAt; x.charAt(3)") );
+
+  new TestCase( SECTION,     "x = undefined; x.__proto.charAt = String.prototype.charAt; x.charAt(0)",            "u",     eval("x=undefined; x.__proto__.charAt = String.prototype.charAt; x.charAt(0)") );
+  new TestCase( SECTION,     "x = undefined; x.__proto.charAt = String.prototype.charAt; x.charAt(1)",            "n",     eval("x=undefined; x.__proto__.charAt = String.prototype.charAt; x.charAt(1)") );
+  new TestCase( SECTION,     "x = undefined; x.__proto.charAt = String.prototype.charAt; x.charAt(2)",            "d",     eval("x=undefined; x.__proto__.charAt = String.prototype.charAt; x.charAt(2)") );
+  new TestCase( SECTION,     "x = undefined; x.__proto.charAt = String.prototype.charAt; x.charAt(3)",            "e",     eval("x=undefined; x.__proto__.charAt = String.prototype.charAt; x.charAt(3)") );
+*/
+new TestCase( SECTION,     "x = false; x.__proto.charAt = String.prototype.charAt; x.charAt(0)",            "f",     eval("x=false; x.__proto__.charAt = String.prototype.charAt; x.charAt(0)") );
+new TestCase( SECTION,     "x = false; x.__proto.charAt = String.prototype.charAt; x.charAt(1)",            "a",     eval("x=false; x.__proto__.charAt = String.prototype.charAt; x.charAt(1)") );
+new TestCase( SECTION,     "x = false; x.__proto.charAt = String.prototype.charAt; x.charAt(2)",            "l",     eval("x=false; x.__proto__.charAt = String.prototype.charAt; x.charAt(2)") );
+new TestCase( SECTION,     "x = false; x.__proto.charAt = String.prototype.charAt; x.charAt(3)",            "s",     eval("x=false; x.__proto__.charAt = String.prototype.charAt; x.charAt(3)") );
+new TestCase( SECTION,     "x = false; x.__proto.charAt = String.prototype.charAt; x.charAt(4)",            "e",     eval("x=false; x.__proto__.charAt = String.prototype.charAt; x.charAt(4)") );
+
+new TestCase( SECTION,     "x = true; x.__proto.charAt = String.prototype.charAt; x.charAt(0)",            "t",     eval("x=true; x.__proto__.charAt = String.prototype.charAt; x.charAt(0)") );
+new TestCase( SECTION,     "x = true; x.__proto.charAt = String.prototype.charAt; x.charAt(1)",            "r",     eval("x=true; x.__proto__.charAt = String.prototype.charAt; x.charAt(1)") );
+new TestCase( SECTION,     "x = true; x.__proto.charAt = String.prototype.charAt; x.charAt(2)",            "u",     eval("x=true; x.__proto__.charAt = String.prototype.charAt; x.charAt(2)") );
+new TestCase( SECTION,     "x = true; x.__proto.charAt = String.prototype.charAt; x.charAt(3)",            "e",     eval("x=true; x.__proto__.charAt = String.prototype.charAt; x.charAt(3)") );
+
+new TestCase( SECTION,     "x = NaN; x.__proto.charAt = String.prototype.charAt; x.charAt(0)",            "N",     eval("x=NaN; x.__proto__.charAt = String.prototype.charAt; x.charAt(0)") );
+new TestCase( SECTION,     "x = NaN; x.__proto.charAt = String.prototype.charAt; x.charAt(1)",            "a",     eval("x=NaN; x.__proto__.charAt = String.prototype.charAt; x.charAt(1)") );
+new TestCase( SECTION,     "x = NaN; x.__proto.charAt = String.prototype.charAt; x.charAt(2)",            "N",     eval("x=NaN; x.__proto__.charAt = String.prototype.charAt; x.charAt(2)") );
+
+new TestCase( SECTION,     "x = 123; x.__proto.charAt = String.prototype.charAt; x.charAt(0)",            "1",     eval("x=123; x.__proto__.charAt = String.prototype.charAt; x.charAt(0)") );
+new TestCase( SECTION,     "x = 123; x.__proto.charAt = String.prototype.charAt; x.charAt(1)",            "2",     eval("x=123; x.__proto__.charAt = String.prototype.charAt; x.charAt(1)") );
+new TestCase( SECTION,     "x = 123; x.__proto.charAt = String.prototype.charAt; x.charAt(2)",            "3",     eval("x=123; x.__proto__.charAt = String.prototype.charAt; x.charAt(2)") );
+
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.5.4.5-6.js b/js/src/tests/ecma/extensions/15.5.4.5-6.js
new file mode 100644
index 000000000..8c3470e85
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.5.4.5-6.js
@@ -0,0 +1,60 @@
+/* -*- tab-width: 2; 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:          15.5.4.5-6.js
+   ECMA Section:       15.5.4.5 String.prototype.charCodeAt(pos)
+   Description:        Returns a number (a nonnegative integer less than 2^16)
+   representing the Unicode encoding of the character at
+   position pos in this string.  If there is no character
+   at that position, the number is NaN.
+
+   When the charCodeAt method is called with one argument
+   pos, the following steps are taken:
+   1. Call ToString, giving it the theis value as its
+   argument
+   2. Call ToInteger(pos)
+   3. Compute the number of characters in result(1).
+   4. If Result(2) is less than 0 or is not less than
+   Result(3), return NaN.
+   5. Return a value of Number type, of positive sign, whose
+   magnitude is the Unicode encoding of one character
+   from result 1, namely the characer at position Result
+   (2), where the first character in Result(1) is
+   considered to be at position 0.
+
+   Note that the charCodeAt function is intentionally
+   generic; it does not require that its this value be a
+   String object.  Therefore it can be transferred to other
+   kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.5-6";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "String.prototype.charCodeAt";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+
+new TestCase( SECTION,
+	      "var obj = true; obj.__proto__.charCodeAt = String.prototype.charCodeAt; var s = ''; for ( var i = 0; i < 4; i++ ) s+= String.fromCharCode( obj.charCodeAt(i) ); s",
+	      "true",
+	      eval("var obj = true; obj.__proto__.charCodeAt = String.prototype.charCodeAt; var s = ''; for ( var i = 0; i < 4; i++ ) s+= String.fromCharCode( obj.charCodeAt(i) ); s") );
+
+new TestCase( SECTION,
+	      "var obj = 1234; obj.__proto__.charCodeAt = String.prototype.charCodeAt; var s = ''; for ( var i = 0; i < 4; i++ ) s+= String.fromCharCode( obj.charCodeAt(i) ); s",
+	      "1234",
+	      eval("var obj = 1234; obj.__proto__.charCodeAt = String.prototype.charCodeAt; var s = ''; for ( var i = 0; i < 4; i++ ) s+= String.fromCharCode( obj.charCodeAt(i) ); s") );
+
+new TestCase( SECTION,
+	      "var obj = 'hello'; obj.__proto__.charCodeAt = String.prototype.charCodeAt; var s = ''; for ( var i = 0; i < 5; i++ ) s+= String.fromCharCode( obj.charCodeAt(i) ); s",
+	      "hello",
+	      eval("var obj = 'hello'; obj.__proto__.charCodeAt = String.prototype.charCodeAt; var s = ''; for ( var i = 0; i < 5; i++ ) s+= String.fromCharCode( obj.charCodeAt(i) ); s") );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.5.4.7-3.js b/js/src/tests/ecma/extensions/15.5.4.7-3.js
new file mode 100644
index 000000000..3db9df4f9
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.5.4.7-3.js
@@ -0,0 +1,127 @@
+/* -*- tab-width: 2; 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:          15.5.4.7-3.js
+   ECMA Section:       15.5.4.7 String.prototype.lastIndexOf( searchString, pos)
+   Description:
+
+   If the given searchString appears as a substring of the result of
+   converting this object to a string, at one or more positions that are
+   at or to the left of the specified position, then the index of the
+   rightmost such position is returned; otherwise -1 is returned. If position
+   is undefined or not supplied, the length of this string value is assumed,
+   so as to search all of the string.
+
+   When the lastIndexOf method is called with two arguments searchString and
+   position, the following steps are taken:
+
+   1.Call ToString, giving it the this value as its argument.
+   2.Call ToString(searchString).
+   3.Call ToNumber(position). (If position is undefined or not supplied, this step produces the value NaN).
+   4.If Result(3) is NaN, use +; otherwise, call ToInteger(Result(3)).
+   5.Compute the number of characters in Result(1).
+   6.Compute min(max(Result(4), 0), Result(5)).
+   7.Compute the number of characters in the string that is Result(2).
+   8.Compute the largest possible integer k not larger than Result(6) such that k+Result(7) is not greater
+   than Result(5), and for all nonnegative integers j less than Result(7), the character at position k+j of
+   Result(1) is the same as the character at position j of Result(2); but if there is no such integer k, then
+   compute the value -1.
+
+   1.Return Result(8).
+
+   Note that the lastIndexOf function is intentionally generic; it does not require that its this value be a
+   String object. Therefore it can be transferred to other kinds of objects for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.7-3";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "String.protoype.lastIndexOf";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(   SECTION,
+		"var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 0 )",
+		-1,
+		eval("var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 0 )") );
+
+new TestCase(   SECTION,
+		"var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 1 )",
+		1,
+		eval("var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 1 )") );
+
+new TestCase(   SECTION,
+		"var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 2 )",
+		1,
+		eval("var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 2 )") );
+
+new TestCase(   SECTION,
+		"var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 10 )",
+		1,
+		eval("var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 10 )") );
+
+new TestCase(   SECTION,
+		"var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r' )",
+		1,
+		eval("var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r' )") );
+
+test();
+
+function LastIndexOf( string, search, position ) {
+  string = String( string );
+  search = String( search );
+
+  position = Number( position )
+
+    if ( isNaN( position ) ) {
+      position = Infinity;
+    } else {
+      position = ToInteger( position );
+    }
+
+  result5= string.length;
+  result6 = Math.min(Math.max(position, 0), result5);
+  result7 = search.length;
+
+  if (result7 == 0) {
+    return Math.min(position, result5);
+  }
+
+  result8 = -1;
+
+  for ( k = 0; k <= result6; k++ ) {
+    if ( k+ result7 > result5 ) {
+      break;
+    }
+    for ( j = 0; j < result7; j++ ) {
+      if ( string.charAt(k+j) != search.charAt(j) ){
+	break;
+      }   else  {
+	if ( j == result7 -1 ) {
+	  result8 = k;
+	}
+      }
+    }
+  }
+
+  return result8;
+}
+function ToInteger( n ) {
+  n = Number( n );
+  if ( isNaN(n) ) {
+    return 0;
+  }
+  if ( Math.abs(n) == 0 || Math.abs(n) == Infinity ) {
+    return n;
+  }
+
+  var sign = ( n < 0 ) ? -1 : 1;
+
+  return ( sign * Math.floor(Math.abs(n)) );
+}
diff --git a/js/src/tests/ecma/extensions/15.6.3.1-5.js b/js/src/tests/ecma/extensions/15.6.3.1-5.js
new file mode 100644
index 000000000..05475c692
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.6.3.1-5.js
@@ -0,0 +1,24 @@
+/* -*- 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:          15.6.3.1-5.js
+   ECMA Section:       15.6.3.1 Boolean.prototype
+   Description:
+   Author:             christine@netscape.com
+   Date:               28 october 1997
+
+*/
+var VERSION = "ECMA_2";
+startTest();
+var SECTION = "15.6.3.1-5";
+var TITLE   = "Boolean.prototype"
+
+  writeHeaderToLog( SECTION + " " + TITLE );
+
+new TestCase( SECTION,  "Function.prototype == Boolean.__proto__",   true,   Function.prototype == Boolean.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.6.3.js b/js/src/tests/ecma/extensions/15.6.3.js
new file mode 100644
index 000000000..76ca00159
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.6.3.js
@@ -0,0 +1,31 @@
+/* -*- 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:          15.6.3.js
+   ECMA Section:       15.6.3 Properties of the Boolean Constructor
+
+   Description:        The value of the internal prototype property is
+   the Function prototype object.
+
+   It has the internal [[Call]] and [[Construct]]
+   properties, and the length property.
+
+   Author:             christine@netscape.com
+   Date:               june 27, 1997
+
+*/
+var SECTION = "15.6.3";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "Properties of the Boolean Constructor"
+  writeHeaderToLog( SECTION + TITLE );
+
+
+new TestCase( SECTION,  "Boolean.__proto__ == Function.prototype",  true,   Boolean.__proto__ == Function.prototype );
+new TestCase( SECTION,  "Boolean.length",          1,                   Boolean.length );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.6.4-2.js b/js/src/tests/ecma/extensions/15.6.4-2.js
new file mode 100644
index 000000000..c4f994e59
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.6.4-2.js
@@ -0,0 +1,32 @@
+/* -*- 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:          15.6.4-2.js
+   ECMA Section:       15.6.4 Properties of the Boolean Prototype Object
+
+   Description:
+   The Boolean prototype object is itself a Boolean object (its [[Class]] is
+   "Boolean") whose value is false.
+
+   The value of the internal [[Prototype]] property of the Boolean prototype object
+   is the Object prototype object (15.2.3.1).
+
+   Author:             christine@netscape.com
+   Date:               30 september 1997
+
+*/
+
+
+var VERSION = "ECMA_2"
+  startTest();
+var SECTION = "15.6.4-2";
+
+writeHeaderToLog( SECTION + " Properties of the Boolean Prototype Object");
+
+new TestCase( SECTION, "Boolean.prototype.__proto__",               Object.prototype,       Boolean.prototype.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.7.3.js b/js/src/tests/ecma/extensions/15.7.3.js
new file mode 100644
index 000000000..5bf3b5eb6
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.7.3.js
@@ -0,0 +1,35 @@
+/* -*- tab-width: 2; 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:          15.7.3.js
+   15.7.3  Properties of the Number Constructor
+
+   Description:        The value of the internal [[Prototype]] property
+   of the Number constructor is the Function prototype
+   object.  The Number constructor also has the internal
+   [[Call]] and [[Construct]] properties, and the length
+   property.
+
+   Other properties are in subsequent tests.
+
+   Author:             christine@netscape.com
+   Date:               29 september 1997
+*/
+
+var SECTION = "15.7.3";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "Properties of the Number Constructor";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase(SECTION,
+	     "Number.__proto__",  
+	     Function.prototype,
+	     Number.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.7.4.js b/js/src/tests/ecma/extensions/15.7.4.js
new file mode 100644
index 000000000..b62ba4090
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.7.4.js
@@ -0,0 +1,56 @@
+/* -*- tab-width: 2; 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:          15.7.4.js
+   ECMA Section:       15.7.4
+
+   Description:
+
+   The Number prototype object is itself a Number object (its [[Class]] is
+   "Number") whose value is +0.
+
+   The value of the internal [[Prototype]] property of the Number prototype
+   object is the Object prototype object (15.2.3.1).
+
+   In following descriptions of functions that are properties of the Number
+   prototype object, the phrase "this Number object" refers to the object
+   that is the this value for the invocation of the function; it is an error
+   if this does not refer to an object for which the value of the internal
+   [[Class]] property is "Number". Also, the phrase "this number value" refers
+   to the number value represented by this Number object, that is, the value
+   of the internal [[Value]] property of this Number object.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "15.7.4";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Properties of the Number Prototype Object";
+
+writeHeaderToLog( SECTION + " "+TITLE);
+
+new TestCase( SECTION,
+	      "Number.prototype.toString=Object.prototype.toString;Number.prototype.toString()",
+	      "[object Number]",
+	      eval("Number.prototype.toString=Object.prototype.toString;Number.prototype.toString()") );
+
+new TestCase( SECTION,
+	      "typeof Number.prototype",  
+	      "object",
+	      typeof Number.prototype );
+
+new TestCase( SECTION,
+	      "Number.prototype.valueOf()", 
+	      0,
+	      Number.prototype.valueOf() );
+
+//    The __proto__ property cannot be used in ECMA_1 tests.
+//    new TestCase( SECTION, "Number.prototype.__proto__",                        Object.prototype,   Number.prototype.__proto__ );
+//    new TestCase( SECTION, "Number.prototype.__proto__ == Object.prototype",    true,       Number.prototype.__proto__ == Object.prototype );
+
+test();
diff --git a/js/src/tests/ecma/extensions/15.8-1.js b/js/src/tests/ecma/extensions/15.8-1.js
new file mode 100644
index 000000000..ce4b029bb
--- /dev/null
+++ b/js/src/tests/ecma/extensions/15.8-1.js
@@ -0,0 +1,50 @@
+/* -*- tab-width: 2; 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:          15.8-1.js
+   ECMA Section:       15.8 The Math Object
+
+   Description:
+
+   The Math object is merely a single object that has some named properties,
+   some of which are functions.
+
+   The value of the internal [[Prototype]] property of the Math object is the
+   Object prototype object (15.2.3.1).
+
+   The Math object does not have a [[Construct]] property; it is not possible
+   to use the Math object as a constructor with the new operator.
+
+   The Math object does not have a [[Call]] property; it is not possible to
+   invoke the Math object as a function.
+
+   Recall that, in this specification, the phrase "the number value for x" has
+   a technical meaning defined in section 8.5.
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+
+*/
+
+var SECTION = "15.8-1";
+var VERSION = "ECMA_2";
+startTest();
+var TITLE   = "The Math Object";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION,
+	      "Math.__proto__ == Object.prototype",
+	      true,
+	      Math.__proto__ == Object.prototype );
+
+new TestCase( SECTION,
+	      "Math.__proto__",
+	      Object.prototype,
+	      Math.__proto__ );
+
+test();
diff --git a/js/src/tests/ecma/extensions/8.6.2.1-1.js b/js/src/tests/ecma/extensions/8.6.2.1-1.js
new file mode 100644
index 000000000..8e9ccd12b
--- /dev/null
+++ b/js/src/tests/ecma/extensions/8.6.2.1-1.js
@@ -0,0 +1,64 @@
+/* -*- 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:          8.6.2.1-1.js
+   ECMA Section:       8.6.2.1 Get (Value)
+   Description:
+
+   When the [[Get]] method of O is called with property name P, the following
+   steps are taken:
+
+   1.  If O doesn't have a property with name P, go to step 4.
+   2.  Get the value of the property.
+   3.  Return Result(2).
+   4.  If the [[Prototype]] of O is null, return undefined.
+   5.  Call the [[Get]] method of [[Prototype]] with property name P.
+   6.  Return Result(5).
+
+   This tests [[Get]] (Value).
+
+   Author:             christine@netscape.com
+   Date:               12 november 1997
+*/
+var SECTION = "8.6.2.1-1";
+var VERSION = "ECMA_1";
+startTest();
+
+writeHeaderToLog( SECTION + " [[Get]] (Value)");
+
+new TestCase( SECTION,  "var OBJ = new MyValuelessObject(true); OBJ.valueOf()",     true,           eval("var OBJ = new MyValuelessObject(true); OBJ.valueOf()") );
+//    new TestCase( SECTION,  "var OBJ = new MyProtoValuelessObject(true); OBJ + ''",     "undefined",    eval("var OBJ = new MyProtoValuelessObject(); OBJ + ''") );
+new TestCase( SECTION,  "var OBJ = new MyProtolessObject(true); OBJ.valueOf()",     true,           eval("var OBJ = new MyProtolessObject(true); OBJ.valueOf()") );
+
+new TestCase( SECTION,  "var OBJ = new MyValuelessObject(Number.POSITIVE_INFINITY); OBJ.valueOf()",     Number.POSITIVE_INFINITY,           eval("var OBJ = new MyValuelessObject(Number.POSITIVE_INFINITY); OBJ.valueOf()") );
+//    new TestCase( SECTION,  "var OBJ = new MyProtoValuelessObject(Number.POSITIVE_INFINITY); OBJ + ''",     "undefined",                        eval("var OBJ = new MyProtoValuelessObject(); OBJ + ''") );
+new TestCase( SECTION,  "var OBJ = new MyProtolessObject(Number.POSITIVE_INFINITY); OBJ.valueOf()",     Number.POSITIVE_INFINITY,           eval("var OBJ = new MyProtolessObject(Number.POSITIVE_INFINITY); OBJ.valueOf()") );
+
+new TestCase( SECTION,  "var OBJ = new MyValuelessObject('string'); OBJ.valueOf()",     'string',           eval("var OBJ = new MyValuelessObject('string'); OBJ.valueOf()") );
+//    new TestCase( SECTION,  "var OBJ = new MyProtoValuelessObject('string'); OJ + ''",     "undefined",      eval("var OBJ = new MyProtoValuelessObject(); OBJ + ''") );
+new TestCase( SECTION,  "var OBJ = new MyProtolessObject('string'); OBJ.valueOf()",     'string',           eval("var OBJ = new MyProtolessObject('string'); OBJ.valueOf()") );
+
+test();
+
+function MyProtoValuelessObject(value) {
+  this.valueOf = new Function ( "" );
+  this.__proto__ = null;
+}
+
+function MyProtolessObject( value ) {
+  this.valueOf = new Function( "return this.value" );
+  this.__proto__ = null;
+  this.value = value;
+}
+function MyValuelessObject(value) {
+  this.__proto__ = new MyPrototypeObject(value);
+}
+function MyPrototypeObject(value) {
+  this.valueOf = new Function( "return this.value;" );
+  this.toString = new Function( "return (this.value + '');" );
+  this.value = value;
+}
diff --git a/js/src/tests/ecma/extensions/9.9-1.js b/js/src/tests/ecma/extensions/9.9-1.js
new file mode 100644
index 000000000..a9312e2c0
--- /dev/null
+++ b/js/src/tests/ecma/extensions/9.9-1.js
@@ -0,0 +1,68 @@
+/* -*- 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:          9.9-1.js
+   ECMA Section:       9.9  Type Conversion:  ToObject
+   Description:
+
+   undefined   generate a runtime error
+   null        generate a runtime error
+   boolean     create a new Boolean object whose default
+   value is the value of the boolean.
+   number      Create a new Number object whose default
+   value is the value of the number.
+   string      Create a new String object whose default
+   value is the value of the string.
+   object      Return the input argument (no conversion).
+   Author:             christine@netscape.com
+   Date:               17 july 1997
+*/
+
+var VERSION = "ECMA_1";
+startTest();
+var SECTION = "9.9-1";
+
+writeHeaderToLog( SECTION + " Type Conversion: ToObject" );
+
+new TestCase( SECTION, "(Object(true)).__proto__",  Boolean.prototype,      (Object(true)).__proto__ );
+
+new TestCase( SECTION, "(Object(true)).__proto__",  Boolean.prototype,      (Object(true)).__proto__ );
+
+new TestCase( SECTION, "(Object(0)).__proto__",     Number.prototype,      (Object(0)).__proto__ );
+
+new TestCase( SECTION, "(Object(-0)).__proto__",    Number.prototype,      (Object(-0)).__proto__ );
+
+new TestCase( SECTION, "(Object(1)).__proto__",     Number.prototype,      (Object(1)).__proto__ );
+
+new TestCase( SECTION, "(Object(-1)).__proto__",    Number.prototype,      (Object(-1)).__proto__ );
+
+new TestCase( SECTION, "(Object(Number.MAX_VALUE)).__proto__",  Number.prototype,               (Object(Number.MAX_VALUE)).__proto__ );
+
+new TestCase( SECTION, "(Object(Number.MIN_VALUE)).__proto__",  Number.prototype, (Object(Number.MIN_VALUE)).__proto__ );
+
+new TestCase( SECTION, "(Object(Number.POSITIVE_INFINITY)).__proto__",  Number.prototype,               (Object(Number.POSITIVE_INFINITY)).__proto__ );
+
+new TestCase( SECTION, "(Object(Number.NEGATIVE_INFINITY)).__proto__",  Number.prototype,   (Object(Number.NEGATIVE_INFINITY)).__proto__ );
+
+new TestCase( SECTION, "(Object(Number.NaN)).__proto__",    Number.prototype,          (Object(Number.NaN)).__proto__ );
+
+new TestCase( SECTION, "(Object('a string')).__proto__",    String.prototype,   (Object("a string")).__proto__ );
+
+new TestCase( SECTION, "(Object('')).__proto__",            String.prototype,   (Object("")).__proto__ );
+
+new TestCase( SECTION, "(Object('\\r\\t\\b\\n\\v\\f')).__proto__", String.prototype,   (Object("\\r\\t\\b\\n\\v\\f")).__proto__ );
+
+new TestCase( SECTION,  "Object( '\\\'\\\"\\' ).__proto__",      String.prototype,   (Object("\'\"\\")).__proto__ );
+
+new TestCase( SECTION, "(Object( new MyObject(true) )).toString()",  "[object Object]",       eval("(Object( new MyObject(true) )).toString()") );
+
+test();
+
+function MyObject( value ) {
+  this.value = value;
+  this.valueOf = new Function ( "return this.value" );
+}
diff --git a/js/src/tests/ecma/extensions/browser.js b/js/src/tests/ecma/extensions/browser.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/extensions/browser.js
diff --git a/js/src/tests/ecma/extensions/errorcolumnblame.js b/js/src/tests/ecma/extensions/errorcolumnblame.js
new file mode 100644
index 000000000..08d84e5a6
--- /dev/null
+++ b/js/src/tests/ecma/extensions/errorcolumnblame.js
@@ -0,0 +1,79 @@
+/*
+ * Any copyright is dedicated to the Public Domain.
+ * http://creativecommons.org/licenses/publicdomain/
+ */
+
+var BUGNUMBER = 568142;
+var summary = 'error reporting blames column as well as line';
+
+function test(f, col) {
+    var caught = false;
+    try {
+        f();
+    } catch (e) {
+        caught = true;
+        assertEq(e.columnNumber, col);
+    }
+    assertEq(caught, true);
+}
+
+/* Note single hard tab before return! */
+function foo(o) {
+	return o.p;
+}
+test(foo, 2);
+
+//345678901234567890
+test(function(f) { return f.bar; }, 20);
+//       1         2
+//3456789012345678901234567
+test(function(f) { return f(); }, 27);
+/* Cover negative colspan case using for(;;) loop with error in update part. */
+test(function(){
+        //         1         2         3         4
+        //123456789012345678901234567890123456789012
+    eval("function baz() { for (var i = 0; i < 10; i += a.b); assertEq(i !== i, true); }");
+    baz();
+}, 42);
+
+//       1         2         3
+//3456789012345678901234567890123456
+test(function() { var tmp = null; tmp(); }, 35)
+test(function() { var tmp = null;  tmp.foo; }, 36)
+
+/* Just a generic 'throw'. */
+test(function() {
+//       1         2
+//345678901234567890
+    foo({}); throw new Error('a');
+}, 20);
+
+/* Be sure to report the right statement */
+test(function() {
+    function f() { return true; }
+    function g() { return false; }
+//       1         2
+//345678901234567890123456789
+    f(); g(); f(); if (f()) a += e;
+}, 29);
+
+//       1         2
+//345678901234567890
+test(function() { e++; }, 19);
+test(function() {print += e; }, 18);
+test(function(){e += 1 }, 17);
+test(function() {  print[e]; }, 20);
+test(function() { e[1]; }, 19);
+test(function() { e(); }, 19);
+test(function() { 1(); }, 19);
+test(function() { Object.defineProperty() }, 19);
+
+test(function() {
+//       1         2
+//34567890123456789012
+    function foo() { asdf; } foo()
+}, 22);
+
+reportCompare(0, 0, "ok");
+
+printStatus("All tests passed!");
diff --git a/js/src/tests/ecma/extensions/shell.js b/js/src/tests/ecma/extensions/shell.js
new file mode 100644
index 000000000..e69de29bb
--- /dev/null
+++ b/js/src/tests/ecma/extensions/shell.js
diff --git a/js/src/tests/ecma/shell.js b/js/src/tests/ecma/shell.js
new file mode 100644
index 000000000..1927eb5dc
--- /dev/null
+++ b/js/src/tests/ecma/shell.js
@@ -0,0 +1,651 @@
+/* -*- 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/. */
+
+
+/*
+ * Date functions used by tests in Date suite
+ *
+ */
+var msPerYear =  31536000000;
+var msPerDay =   86400000;
+var HoursPerDay =  24;
+var MinutesPerHour = 60;
+var SecondsPerMinute = 60;
+var msPerSecond =  1000;
+var msPerMinute =  60000;  // msPerSecond * SecondsPerMinute
+var msPerHour =   3600000; // msPerMinute * MinutesPerHour
+
+var TZ_PST = -8;  // offset of Pacific Standard Time from UTC
+var TZ_DIFF_RAW = GetRawTimezoneOffset();  // raw offset of tester's timezone from UTC
+var TZ_DIFF = GetTimezoneOffset();  // offset of tester's timezone from UTC
+var PST_DIFF_RAW = TZ_DIFF_RAW - TZ_PST;  // raw offset of tester's timezone from PST
+var PST_DIFF = TZ_DIFF - TZ_PST;  // offset of tester's timezone from PST
+var TZ_ADJUST  = TZ_DIFF_RAW * msPerHour;
+var PST_ADJUST = TZ_PST * msPerHour;
+
+var DST_PERIOD = DaylightSavingPeriod();  // time period when DST is used
+var DST_1970 = DaylightSavingObserved(1970);  // Was DST observed in 1970?
+var DST_1971 = DaylightSavingObserved(1971);  // Was DST observed in 1971?
+
+var TIME_0000  = (function ()
+  { // calculate time for year 0
+    for ( var time = 0, year = 1969; year >= 0; year-- ) {
+      time -= TimeInYear(year);
+    }
+    return time;
+  })();
+var TIME_1970  = 0;
+var TIME_2000  = 946684800000;
+var TIME_1900  = -2208988800000;
+var UTC_FEB_29_2000 = TIME_2000 + 31*msPerDay + 28*msPerDay;
+var UTC_JAN_1_2005 = TIME_2000 + TimeInYear(2000) + TimeInYear(2001) +
+  TimeInYear(2002) + TimeInYear(2003) + TimeInYear(2004);
+var now = new Date();
+var TIME_NOW = now.valueOf();  //valueOf() is to accurate to the millisecond
+                               //Date.parse() is accurate only to the second
+
+/*
+ * Originally, the test suite used a hard-coded value TZ_DIFF = -8.
+ * But that was only valid for testers in the Pacific Standard Time Zone!
+ * We calculate the proper number dynamically for any tester. We just
+ * have to be careful not to use a date subject to Daylight Savings Time...
+ */
+function GetRawTimezoneOffset()
+{
+  var t1 = new Date(2000, 1, 1).getTimezoneOffset();
+  var t2 = new Date(2000, 1 + 6, 1).getTimezoneOffset();
+  if ((t1 - t2) >= 0) {
+    // 1) timezone without daylight saving time
+    // 2) northern hemisphere with daylight saving time
+    return -t1 / MinutesPerHour;
+  } else {
+    // 3) southern hemisphere with daylight saving time
+    return -t2 / MinutesPerHour;
+  }
+}
+
+/*
+ * Returns the timezone offset, possibly including daylight saving time.
+ * (This function is only used to obtain the relative timezone offset to PST,
+ * see TZ_DIFF and PST_DIFF in adjustResultArray().)
+ */
+function GetTimezoneOffset()
+{
+  return -(new Date(2000, 1, 1).getTimezoneOffset()) / MinutesPerHour;
+}
+
+/*
+ * Determine when daylight saving time is used in the current timezone.
+ */
+function DaylightSavingPeriod()
+{
+  var t1 = new Date(2000, 1, 1).getTimezoneOffset();
+  var t2 = new Date(2000, 1 + 6, 1).getTimezoneOffset();
+  if (t1 == t2) {
+    // timezone without daylight saving time
+    return 0;
+  } else if ((t1 - t2) > 0) {
+    // northern hemisphere with daylight saving time
+    return 1;
+  } else {
+    // southern hemisphere with daylight saving time
+    return -1;
+  }
+}
+
+/*
+ * Test whether daylight time saving was observed in the supplied year
+ */
+function DaylightSavingObserved(y)
+{
+  var t1 = new Date(y, 1, 1).getTimezoneOffset();
+  var t2 = new Date(y, 1 + 6, 1).getTimezoneOffset();
+  return (t1 != t2);
+}
+
+/*
+ * Don't apply DST near start of epoch unless absolutely necessary
+ */
+function IgnoreDaylightSaving(t)
+{
+  if ((0 <= t && t < msPerYear) && !DST_1970) {
+    return true;
+  }
+  if ((msPerYear <= t && t < 2*msPerYear) && !DST_1971) {
+    return true;
+  }
+  return false;
+}
+
+/*
+ * Date test "ResultArrays" are hard-coded for Pacific Standard Time.
+ * We must adjust them for the tester's own timezone -
+ */
+function adjustResultArray(ResultArray, msMode)
+{
+  // If the tester's system clock is in PST, no need to continue -
+//  if (!PST_DIFF) {return;}
+
+  /* The date testcases instantiate Date objects in two different ways:
+   *
+   *        millisecond mode: e.g.   dt = new Date(10000000);
+   *        year-month-day mode:  dt = new Date(2000, 5, 1, ...);
+   *
+   * In the first case, the date is measured from Time 0 in Greenwich (i.e. UTC).
+   * In the second case, it is measured with reference to the tester's local timezone.
+   *
+   * In the first case we must correct those values expected for local measurements,
+   * like dt.getHours() etc. No correction is necessary for dt.getUTCHours() etc.
+   *
+   * In the second case, it is exactly the other way around -
+   */
+  if (msMode)
+  {
+    // The hard-coded UTC milliseconds from Time 0 derives from a UTC date.
+    // Shift to the right by the offset between UTC and the tester.
+    if (IgnoreDaylightSaving(ResultArray[TIME])) {
+      var t = ResultArray[TIME]  +  TZ_DIFF_RAW*msPerHour;
+    } else {
+      var t = ResultArray[TIME]  +  TZ_DIFF*msPerHour;
+    }
+
+    // Use our date arithmetic functions to determine the local hour, day, etc.
+    ResultArray[HOURS] = HourFromTime(t);
+    ResultArray[DAY] = WeekDay(t);
+    ResultArray[DATE] = DateFromTime(t);
+    ResultArray[MONTH] = MonthFromTime(t);
+    ResultArray[YEAR] = YearFromTime(t);
+  }
+  else
+  {
+    // The hard-coded UTC milliseconds from Time 0 derives from a PST date.
+    // Shift to the left by the offset between PST and the tester.
+    var t = ResultArray[TIME]  -  PST_DIFF*msPerHour;
+
+    // Use our date arithmetic functions to determine the UTC hour, day, etc.
+    ResultArray[TIME] = t;
+    ResultArray[UTC_HOURS] = HourFromTime(t);
+    ResultArray[UTC_DAY] = WeekDay(t);
+    ResultArray[UTC_DATE] = DateFromTime(t);
+    ResultArray[UTC_MONTH] = MonthFromTime(t);
+    ResultArray[UTC_YEAR] = YearFromTime(t);
+  }
+}
+
+function Day( t ) {
+  return ( Math.floor(t/msPerDay ) );
+}
+function DaysInYear( y ) {
+  if ( y % 4 != 0 ) {
+    return 365;
+  }
+  if ( (y % 4 == 0) && (y % 100 != 0) ) {
+    return 366;
+  }
+  if ( (y % 100 == 0) && (y % 400 != 0) ) {
+    return 365;
+  }
+  if ( (y % 400 == 0) ){
+    return 366;
+  } else {
+    return "ERROR: DaysInYear(" + y + ") case not covered";
+  }
+}
+function TimeInYear( y ) {
+  return ( DaysInYear(y) * msPerDay );
+}
+function DayNumber( t ) {
+  return ( Math.floor( t / msPerDay ) );
+}
+function TimeWithinDay( t ) {
+
+  var r = t % msPerDay;
+
+  if (r < 0)
+  {
+    r += msPerDay;
+  }
+  return r;
+
+}
+function YearNumber( t ) {
+}
+function TimeFromYear( y ) {
+  return ( msPerDay * DayFromYear(y) );
+}
+function DayFromYear( y ) {
+  return ( 365*(y-1970) +
+           Math.floor((y-1969)/4) -
+           Math.floor((y-1901)/100) +
+           Math.floor((y-1601)/400) );
+}
+function InLeapYear( t ) {
+  if ( DaysInYear(YearFromTime(t)) == 365 ) {
+    return 0;
+  }
+  if ( DaysInYear(YearFromTime(t)) == 366 ) {
+    return 1;
+  } else {
+    return "ERROR:  InLeapYear("+ t + ") case not covered";
+  }
+}
+function YearFromTime( t ) {
+  t = Number( t );
+  var sign = ( t < 0 ) ? -1 : 1;
+  var year = ( sign < 0 ) ? 1969 : 1970;
+  for ( var timeToTimeZero = t; ;  ) {
+    // subtract the current year's time from the time that's left.
+    timeToTimeZero -= sign * TimeInYear(year)
+
+      // if there's less than the current year's worth of time left, then break.
+      if ( sign < 0 ) {
+        if ( sign * timeToTimeZero <= 0 ) {
+          break;
+        } else {
+          year += sign;
+        }
+      } else {
+        if ( sign * timeToTimeZero < 0 ) {
+          break;
+        } else {
+          year += sign;
+        }
+      }
+  }
+  return ( year );
+}
+function MonthFromTime( t ) {
+  // i know i could use switch but i'd rather not until it's part of ECMA
+  var day = DayWithinYear( t );
+  var leap = InLeapYear(t);
+
+  if ( (0 <= day) && (day < 31) ) {
+    return 0;
+  }
+  if ( (31 <= day) && (day < (59+leap)) ) {
+    return 1;
+  }
+  if ( ((59+leap) <= day) && (day < (90+leap)) ) {
+    return 2;
+  }
+  if ( ((90+leap) <= day) && (day < (120+leap)) ) {
+    return 3;
+  }
+  if ( ((120+leap) <= day) && (day < (151+leap)) ) {
+    return 4;
+  }
+  if ( ((151+leap) <= day) && (day < (181+leap)) ) {
+    return 5;
+  }
+  if ( ((181+leap) <= day) && (day < (212+leap)) ) {
+    return 6;
+  }
+  if ( ((212+leap) <= day) && (day < (243+leap)) ) {
+    return 7;
+  }
+  if ( ((243+leap) <= day) && (day < (273+leap)) ) {
+    return 8;
+  }
+  if ( ((273+leap) <= day) && (day < (304+leap)) ) {
+    return 9;
+  }
+  if ( ((304+leap) <= day) && (day < (334+leap)) ) {
+    return 10;
+  }
+  if ( ((334+leap) <= day) && (day < (365+leap)) ) {
+    return 11;
+  } else {
+    return "ERROR: MonthFromTime("+t+") not known";
+  }
+}
+function DayWithinYear( t ) {
+  return( Day(t) - DayFromYear(YearFromTime(t)));
+}
+function DateFromTime( t ) {
+  var day = DayWithinYear(t);
+  var month = MonthFromTime(t);
+
+  if ( month == 0 ) {
+    return ( day + 1 );
+  }
+  if ( month == 1 ) {
+    return ( day - 30 );
+  }
+  if ( month == 2 ) {
+    return ( day - 58 - InLeapYear(t) );
+  }
+  if ( month == 3 ) {
+    return ( day - 89 - InLeapYear(t));
+  }
+  if ( month == 4 ) {
+    return ( day - 119 - InLeapYear(t));
+  }
+  if ( month == 5 ) {
+    return ( day - 150- InLeapYear(t));
+  }
+  if ( month == 6 ) {
+    return ( day - 180- InLeapYear(t));
+  }
+  if ( month == 7 ) {
+    return ( day - 211- InLeapYear(t));
+  }
+  if ( month == 8 ) {
+    return ( day - 242- InLeapYear(t));
+  }
+  if ( month == 9 ) {
+    return ( day - 272- InLeapYear(t));
+  }
+  if ( month == 10 ) {
+    return ( day - 303- InLeapYear(t));
+  }
+  if ( month == 11 ) {
+    return ( day - 333- InLeapYear(t));
+  }
+
+  return ("ERROR:  DateFromTime("+t+") not known" );
+}
+function WeekDay( t ) {
+  var weekday = (Day(t)+4) % 7;
+  return( weekday < 0 ? 7 + weekday : weekday );
+}
+
+// missing daylight savings time adjustment
+
+function HourFromTime( t ) {
+  var h = Math.floor( t / msPerHour ) % HoursPerDay;
+  return ( (h<0) ? HoursPerDay + h : h  );
+}
+function MinFromTime( t ) {
+  var min = Math.floor( t / msPerMinute ) % MinutesPerHour;
+  return( ( min < 0 ) ? MinutesPerHour + min : min  );
+}
+function SecFromTime( t ) {
+  var sec = Math.floor( t / msPerSecond ) % SecondsPerMinute;
+  return ( (sec < 0 ) ? SecondsPerMinute + sec : sec );
+}
+function msFromTime( t ) {
+  var ms = t % msPerSecond;
+  return ( (ms < 0 ) ? msPerSecond + ms : ms );
+}
+function LocalTZA() {
+  return ( TZ_DIFF_RAW * msPerHour );
+}
+function UTC( t ) {
+  return ( t - LocalTZA() - DaylightSavingTA(t - LocalTZA()) );
+}
+function LocalTime( t ) {
+  return ( t + LocalTZA() + DaylightSavingTA(t) );
+}
+function DaylightSavingTA( t ) {
+  if (IgnoreDaylightSaving(t)) {
+    return 0;
+  }
+
+  if (DST_PERIOD > 0) {
+    // northern hemisphere
+    var dst_start = GetDSTStart(t);
+    var dst_end   = GetDSTEnd(t);
+
+    if ( t >= dst_start && t < dst_end )
+      return msPerHour;
+  } else if (DST_PERIOD < 0) {
+    // southern hemisphere
+    var dst_start = GetDSTStart_Southern(t);
+    var dst_end   = GetDSTEnd_Southern(t);
+
+    if ( t >= dst_start && t < GetDSTEnd_Southern(t + msPerYear) )
+      return msPerHour;
+    if ( t < dst_end && t >= GetDSTEnd_Southern(t - msPerYear) )
+      return msPerHour;
+  }
+
+  return 0;
+}
+
+function GetFirstSundayInMonth( t, m ) {
+  var year = YearFromTime(t);
+  var leap = InLeapYear(t);
+
+// month m 0..11
+// april == 3
+// march == 2
+
+  // set time to first day of month m
+  var time = TimeFromYear(year);
+  for (var i = 0; i < m; ++i)
+  {
+    time += TimeInMonth(i, leap);
+  }
+
+  for ( var first_sunday = time; WeekDay(first_sunday) > 0;
+        first_sunday += msPerDay )
+  {
+    ;
+  }
+
+  return first_sunday;
+}
+
+function GetLastSundayInMonth( t, m ) {
+  var year = YearFromTime(t);
+  var leap = InLeapYear(t);
+
+// month m 0..11
+// april == 3
+// march == 2
+
+  // first day of following month
+  var time = TimeFromYear(year);
+  for (var i = 0; i <= m; ++i)
+  {
+    time += TimeInMonth(i, leap);
+  }
+  // prev day == last day of month
+  time -= msPerDay;
+
+  for ( var last_sunday = time; WeekDay(last_sunday) > 0;
+        last_sunday -= msPerDay )
+  {
+    ;
+  }
+  return last_sunday;
+}
+
+/*
+  15.9.1.9 Daylight Saving Time Adjustment
+
+  The implementation of ECMAScript should not try to determine whether
+  the exact time was subject to daylight saving time, but just whether
+  daylight saving time would have been in effect if the current
+  daylight saving time algorithm had been used at the time. This avoids
+  complications such as taking into account the years that the locale
+  observed daylight saving time year round.
+*/
+
+/*
+  US DST algorithm
+
+  Before 2007, DST starts first Sunday in April at 2 AM and ends last
+  Sunday in October at 2 AM
+
+  Starting in 2007, DST starts second Sunday in March at 2 AM and ends
+  first Sunday in November at 2 AM
+
+  Note that different operating systems behave differently.
+
+  Fully patched Windows XP uses the 2007 algorithm for all dates while
+  fully patched Fedora Core 6 and RHEL 4 Linux use the algorithm in
+  effect at the time.
+
+  Since pre-2007 DST is a subset of 2007 DST rules, this only affects
+  tests that occur in the period Mar-Apr and Oct-Nov where the two
+  algorithms do not agree.
+
+*/
+
+function GetDSTStart( t )
+{
+  return (GetFirstSundayInMonth(t, 2) + 7*msPerDay + 2*msPerHour - LocalTZA());
+}
+
+function GetDSTEnd( t )
+{
+  return (GetFirstSundayInMonth(t, 10) + 2*msPerHour - LocalTZA());
+}
+
+function GetOldDSTStart( t )
+{
+  return (GetFirstSundayInMonth(t, 3) + 2*msPerHour - LocalTZA());
+}
+
+function GetOldDSTEnd( t )
+{
+  return (GetLastSundayInMonth(t, 9) + 2*msPerHour - LocalTZA());
+}
+
+/*
+ * Daylight saving time start/end date for 'Australia'
+ * (arbitrarily chosen as a representative for the southern hemisphere)
+ */
+
+function GetDSTStart_Southern( t )
+{
+  return (GetFirstSundayInMonth(t, 9) + 2*msPerHour - LocalTZA());
+}
+
+function GetDSTEnd_Southern( t )
+{
+  return (GetFirstSundayInMonth(t, 3) + 2*msPerHour - LocalTZA());
+}
+
+function MakeTime( hour, min, sec, ms ) {
+  if ( isNaN( hour ) || isNaN( min ) || isNaN( sec ) || isNaN( ms ) ) {
+    return Number.NaN;
+  }
+
+  hour = ToInteger(hour);
+  min  = ToInteger( min);
+  sec  = ToInteger( sec);
+  ms  = ToInteger( ms );
+
+  return( (hour*msPerHour) + (min*msPerMinute) +
+          (sec*msPerSecond) + ms );
+}
+function MakeDay( year, month, date ) {
+  if ( isNaN(year) || isNaN(month) || isNaN(date) ) {
+    return Number.NaN;
+  }
+  year = ToInteger(year);
+  month = ToInteger(month);
+  date = ToInteger(date );
+
+  var sign = ( year < 1970 ) ? -1 : 1;
+  var t =    ( year < 1970 ) ? 1 :  0;
+  var y =    ( year < 1970 ) ? 1969 : 1970;
+
+  var result5 = year + Math.floor( month/12 );
+  var result6 = month % 12;
+
+  if ( year < 1970 ) {
+    for ( y = 1969; y >= year; y += sign ) {
+      t += sign * TimeInYear(y);
+    }
+  } else {
+    for ( y = 1970 ; y < year; y += sign ) {
+      t += sign * TimeInYear(y);
+    }
+  }
+
+  var leap = InLeapYear( t );
+
+  for ( var m = 0; m < month; m++ ) {
+    t += TimeInMonth( m, leap );
+  }
+
+  if ( YearFromTime(t) != result5 ) {
+    return Number.NaN;
+  }
+  if ( MonthFromTime(t) != result6 ) {
+    return Number.NaN;
+  }
+  if ( DateFromTime(t) != 1 ) {
+    return Number.NaN;
+  }
+
+  return ( (Day(t)) + date - 1 );
+}
+function TimeInMonth( month, leap ) {
+  // september april june november
+  // jan 0  feb 1  mar 2 apr 3 may 4  june 5  jul 6
+  // aug 7  sep 8  oct 9 nov 10 dec 11
+
+  if ( month == 3 || month == 5 || month == 8 || month == 10 ) {
+    return ( 30*msPerDay );
+  }
+
+  // all the rest
+  if ( month == 0 || month == 2 || month == 4 || month == 6 ||
+       month == 7 || month == 9 || month == 11 ) {
+    return ( 31*msPerDay );
+  }
+
+  // save february
+  return ( (leap == 0) ? 28*msPerDay : 29*msPerDay );
+}
+function MakeDate( day, time ) {
+  if ( day == Number.POSITIVE_INFINITY ||
+       day == Number.NEGATIVE_INFINITY ) {
+    return Number.NaN;
+  }
+  if ( time == Number.POSITIVE_INFINITY ||
+       time == Number.NEGATIVE_INFINITY ) {
+    return Number.NaN;
+  }
+  return ( day * msPerDay ) + time;
+}
+function TimeClip( t ) {
+  if ( isNaN( t ) ) {
+    return ( Number.NaN );
+  }
+  if ( Math.abs( t ) > 8.64e15 ) {
+    return ( Number.NaN );
+  }
+
+  return ( ToInteger( t ) );
+}
+function ToInteger( t ) {
+  t = Number( t );
+
+  if ( isNaN( t ) ){
+    return ( Number.NaN );
+  }
+  if ( t == 0 || t == -0 ||
+       t == Number.POSITIVE_INFINITY || t == Number.NEGATIVE_INFINITY ) {
+    return 0;
+  }
+
+  var sign = ( t < 0 ) ? -1 : 1;
+
+  return ( sign * Math.floor( Math.abs( t ) ) );
+}
+function Enumerate ( o ) {
+  var p;
+  for ( p in o ) {
+    print( p +": " + o[p] );
+  }
+}
+
+/* these functions are useful for running tests manually in Rhino */
+
+function GetContext() {
+  return Packages.com.netscape.javascript.Context.getCurrentContext();
+}
+function OptLevel( i ) {
+  i = Number(i);
+  var cx = GetContext();
+  cx.setOptimizationLevel(i);
+}
+/* end of Rhino functions */
+
diff --git a/js/src/tests/ecma/template.js b/js/src/tests/ecma/template.js
new file mode 100644
index 000000000..56da21cb6
--- /dev/null
+++ b/js/src/tests/ecma/template.js
@@ -0,0 +1,39 @@
+/* -*- indent-tabs-mode: nil; js-indent-level: 2 -*- */
+/*
+ * Any copyright is dedicated to the Public Domain.
+ * http://creativecommons.org/licenses/publicdomain/
+ * Contributor: 
+ */
+
+
+/**
+ *  File Name:          template.js
+ *  Reference:          ** replace with bugzilla URL or document reference **
+ *  Description:        ** replace with description of test **
+ *  Author:             ** replace with your e-mail address **
+ */
+
+var SECTION = "";       // provide a document reference (ie, ECMA section)
+var VERSION = "ECMA";   // Version of JavaScript or ECMA
+var TITLE   = "";       // Provide ECMA section title or a description
+var BUGNUMBER = "";     // Provide URL to bugsplat or bugzilla report
+
+startTest();               // leave this alone
+
+/*
+ * Calls to AddTestCase here. AddTestCase is a function that is defined
+ * in shell.js and takes three arguments:
+ * - a string representation of what is being tested
+ * - the expected result
+ * - the actual result
+ *
+ * For example, a test might look like this:
+ *
+ * AddTestCase("** description",
+ *             "** expected value",
+ *             "** actual value");
+ */
+
+// leave this alone.  this executes the test cases and
+// displays results.
+test();