Fixed test failure.

test/cctest/test-regexp.cc

 // Copyright 2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 273 matching lines @@
   CHECK_MIN_MAX("a[bc]d", 3, 3);
   CHECK_MIN_MAX("a|bc", 1, 2);
   CHECK_MIN_MAX("ab|c", 1, 2);
   CHECK_MIN_MAX("a||bc", 0, 2);
   CHECK_MIN_MAX("|", 0, 0);
   CHECK_MIN_MAX("(?:ab)", 2, 2);
   CHECK_MIN_MAX("(?:ab|cde)", 2, 3);
   CHECK_MIN_MAX("(?:ab)|cde", 2, 3);
   CHECK_MIN_MAX("(ab)", 2, 2);
   CHECK_MIN_MAX("(ab|cde)", 2, 3);
-  CHECK_MIN_MAX("(ab)\\1", 4, 4);
-  CHECK_MIN_MAX("(ab|cde)\\1", 4, 6);
+  CHECK_MIN_MAX("(ab)\\1", 2, 4);
+  CHECK_MIN_MAX("(ab|cde)\\1", 2, 6);
   CHECK_MIN_MAX("(?:ab)?", 0, 2);
   CHECK_MIN_MAX("(?:ab)*", 0, RegExpTree::kInfinity);
   CHECK_MIN_MAX("(?:ab)+", 2, RegExpTree::kInfinity);
   CHECK_MIN_MAX("a?", 0, 1);
   CHECK_MIN_MAX("a*", 0, RegExpTree::kInfinity);
   CHECK_MIN_MAX("a+", 1, RegExpTree::kInfinity);
   CHECK_MIN_MAX("a??", 0, 1);
   CHECK_MIN_MAX("a*?", 0, RegExpTree::kInfinity);
   CHECK_MIN_MAX("a+?", 1, RegExpTree::kInfinity);
   CHECK_MIN_MAX("(?:a?)?", 0, 1);
@@ skipping 1237 matching lines @@
       CHECK(!InClass(i, excluded));
     }
   }
 }
 
 
 TEST(Graph) {
   V8::Initialize(NULL);
   Execute("(?:(?:x(.))?\1)+$", false, true, true);
 }