* Use new RegExp parser.

regexp2000/src/ast.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 172 matching lines @@
 // ----------------------------------------------------------------------------
 // Regular expressions
 
 #define MAKE_ACCEPT(Name)                                            \
   void* RegExp##Name::Accept(RegExpVisitor* visitor, void* data) {   \
     return visitor->Visit##Name(this, data);                         \
   }
 FOR_EACH_REG_EXP_NODE_TYPE(MAKE_ACCEPT)
 #undef MAKE_ACCEPT
 
+#define MAKE_CONVERSION(Name)                                        \
+  RegExp##Name* RegExpTree::As##Name() {                             \
+    return NULL;                                                     \
+  }
+  FOR_EACH_REG_EXP_NODE_TYPE(MAKE_CONVERSION)
+#undef MAKE_CONVERSION
+
+#define MAKE_CONVERSION(Name)                                       \
+  RegExp##Name* RegExp##Name::As##Name() {                          \
+    return this;                                                    \
+  }
+FOR_EACH_REG_EXP_NODE_TYPE(MAKE_CONVERSION)
+#undef MAKE_CONVERSION
 
 RegExpEmpty RegExpEmpty::kInstance;
 
 
 // Convert regular expression trees to a simple sexp representation.
 // This representation should be different from the input grammar
 // in as many cases as possible, to make it more difficult for incorrect
 // parses to look as correct ones which is likely if the input and
 // output formats are alike.
 class RegExpUnparser: public RegExpVisitor {
@@ skipping 139 matching lines @@
 
 
 SmartPointer<char> RegExpTree::ToString() {
   RegExpUnparser unparser;
   Accept(&unparser, NULL);
   return unparser.ToString();
 }
 
 
 } }  // namespace v8::internal