Dispatch tables

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 236 matching lines @@
   for (int i = 0; i <  that->nodes()->length(); i++) {
     stream()->Add(" ");
     that->nodes()->at(i)->Accept(this, data);
   }
   stream()->Add(")");
   return NULL;
 }
 
 
 void RegExpUnparser::VisitCharacterRange(CharacterRange that) {
-  if (that.is_character_class()) {
-    stream()->Add("&%c", that.from());
-  } else if (that.IsSingleton()) {
+  if (that.IsSingleton()) {
     stream()->Add("%c", that.from());
   } else {
     stream()->Add("%c-%c", that.from(), that.to());
   }
 }
 
 
 
 void* RegExpUnparser::VisitCharacterClass(RegExpCharacterClass* that,
                                           void* data) {
@@ skipping 85 matching lines @@
 
 
 SmartPointer<char> RegExpTree::ToString() {
   RegExpUnparser unparser;
   Accept(&unparser, NULL);
   return unparser.ToString();
 }
 
 
 } }  // namespace v8::internal