Restructure analysis

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 215 matching lines @@
   StringStream stream_;
 };
 
 
 RegExpUnparser::RegExpUnparser() : stream_(&alloc_) {
 }
 
 
 void* RegExpUnparser::VisitDisjunction(RegExpDisjunction* that, void* data) {
   stream()->Add("(|");
-  for (int i = 0; i <  that->nodes()->length(); i++) {
+  for (int i = 0; i <  that->alternatives()->length(); i++) {
     stream()->Add(" ");
-    that->nodes()->at(i)->Accept(this, data);
+    that->alternatives()->at(i)->Accept(this, data);
   }
   stream()->Add(")");
   return NULL;
 }
 
 
 void* RegExpUnparser::VisitAlternative(RegExpAlternative* that, void* data) {
   stream()->Add("(:");
   for (int i = 0; i <  that->nodes()->length(); i++) {
     stream()->Add(" ");
@@ skipping 104 matching lines @@
 
 
 SmartPointer<const char> RegExpTree::ToString() {
   RegExpUnparser unparser;
   Accept(&unparser, NULL);
   return unparser.ToString();
 }
 
 
 } }  // namespace v8::internal