Regexp bugfixes

test/cctest/test-regexp.cc

 // Copyright 2006-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 331 matching lines @@
   if (dot_output) {
     RegExpEngine::DotPrint(input, node);
     exit(0);
   }
 #endif // DEBUG
 }
 
 
 TEST(Execution) {
   V8::Initialize(NULL);
-  // Execute(".*?(?:a[bc]d|e[fg]h)", "xxxabbegh");
-  // Execute(".*?(?:a[bc]d|e[fg]h)", "xxxabbefh");
-  // Execute(".*?(?:a[bc]d|e[fg]h)", "xxxabbefd");
+  Execute(".*?(?:a[bc]d|e[fg]h)", "xxxabbegh");
+  Execute(".*?(?:a[bc]d|e[fg]h)", "xxxabbefh");
+  Execute(".*?(?:a[bc]d|e[fg]h)", "xxxabbefd");
 }
 
 
 class TestConfig {
  public:
   typedef int Key;
   typedef int Value;
   static const int kNoKey;
   static const int kNoValue;
   static inline int Compare(int a, int b) {
@@ skipping 254 matching lines @@
     int to = PseudoRandom(i + 87, 25) % (kLimit / 20);
     if (to > kLimit) to = kLimit;
     range->Add(CharacterRange(from, to));
   }
   DispatchTable table;
   // CharacterClassNode::AddInverseToTable(range, &table, 0);
 }
 
 
 TEST(Graph) {
-  Execute("([^a]|\\w)", "", true);
+  Execute(".*?a", "", true);
 }