Added support for exports and re-exports.

lib/compiler/implementation/tree/nodes.dart

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 abstract class Visitor<R> {
   const Visitor();
 
   abstract R visitNode(Node node);
 
   R visitBlock(Block node) => visitStatement(node);
   R visitBreakStatement(BreakStatement node) => visitGotoStatement(node);
   R visitCascade(Cascade node) => visitExpression(node);
   R visitCascadeReceiver(CascadeReceiver node) => visitExpression(node);
   R visitCaseMatch(CaseMatch node) => visitNode(node);
   R visitCatchBlock(CatchBlock node) => visitNode(node);
   R visitClassNode(ClassNode node) => visitNode(node);
   R visitCombinator(Combinator node) => visitNode(node);
   R visitConditional(Conditional node) => visitExpression(node);
   R visitContinueStatement(ContinueStatement node) => visitGotoStatement(node);
   R visitDoWhile(DoWhile node) => visitLoop(node);
   R visitEmptyStatement(EmptyStatement node) => visitStatement(node);
-  R visitExport(Export node) => visitLibraryTag(node);
+  R visitExport(Export node) => visitLibraryDependency(node);
   R visitExpression(Expression node) => visitNode(node);
   R visitExpressionStatement(ExpressionStatement node) => visitStatement(node);
   R visitFor(For node) => visitLoop(node);
   R visitForIn(ForIn node) => visitLoop(node);
   R visitFunctionDeclaration(FunctionDeclaration node) => visitStatement(node);
   R visitFunctionExpression(FunctionExpression node) => visitExpression(node);
   R visitGotoStatement(GotoStatement node) => visitStatement(node);
   R visitIdentifier(Identifier node) => visitExpression(node);
   R visitIf(If node) => visitStatement(node);
-  R visitImport(Import node) => visitLibraryTag(node);
+  R visitImport(Import node) => visitLibraryDependency(node);
   R visitLabel(Label node) => visitNode(node);
   R visitLabeledStatement(LabeledStatement node) => visitStatement(node);
+  R visitLibraryDependency(LibraryDependency node) => visitLibraryTag(node);
   R visitLibraryName(LibraryName node) => visitLibraryTag(node);
   R visitLibraryTag(LibraryTag node) => visitNode(node);
   R visitLiteral(Literal node) => visitExpression(node);
   R visitLiteralBool(LiteralBool node) => visitLiteral(node);
   R visitLiteralDouble(LiteralDouble node) => visitLiteral(node);
   R visitLiteralInt(LiteralInt node) => visitLiteral(node);
   R visitLiteralList(LiteralList node) => visitExpression(node);
   R visitLiteralMap(LiteralMap node) => visitExpression(node);
   R visitLiteralMapEntry(LiteralMapEntry node) => visitNode(node);
   R visitLiteralNull(LiteralNull node) => visitLiteral(node);
@@ skipping 1119 matching lines @@
       else if (value === 'abstract') flags |= FLAG_ABSTRACT;
       else if (value === 'final') flags |= FLAG_FINAL;
       else if (value === 'var') flags |= FLAG_VAR;
       else if (value === 'const') flags |= FLAG_CONST;
       else if (value === 'factory') flags |= FLAG_FACTORY;
       else if (value === 'external') flags |= FLAG_EXTERNAL;
       else throw 'internal error: ${nodes.head}';
     }
     return flags;
   }
-  
+
   Node findModifier(String modifier) {
     Link<Node> nodeList = nodes.nodes;
     for (; !nodeList.isEmpty(); nodeList = nodeList.tail) {
       String value = nodeList.head.asIdentifier().source.stringValue;
       if(value === modifier) {
         return nodeList.head;
       }
     }
     return null;
   }
@@ skipping 503 matching lines @@
 
   accept(Visitor visitor) => visitor.visitLibraryName(this);
 
   visitChildren(Visitor visitor) => name.accept(visitor);
 
   Token getBeginToken() => libraryKeyword;
 
   Token getEndToken() => name.getEndToken().next;
 }
 
-class Import extends LibraryTag {
+/**
+ * This tag describes a dependency between one library and the exported
+ * identifiers of another library. The other library is specified by the [uri].
+ * Combinators filter away some identifiers from the other library.
+ */
+abstract class LibraryDependency extends LibraryTag {
   final LiteralString uri;
-  final Identifier prefix;
   final NodeList combinators;
 
+  LibraryDependency(this.uri, this.combinators);
+}
+
+/**
+ * An [:import:] library tag.
+ *
+ * An import tag is dependency on another library where the exported identifiers
+ * are put into the import scope of the importing library. The import scope is
+ * only visible inside the library.
+ */
+class Import extends LibraryDependency {
+  final Identifier prefix;
   final Token importKeyword;
 
-  Import(this.importKeyword, this.uri, this.prefix, this.combinators);
+  Import(this.importKeyword, LiteralString uri,
+         this.prefix, NodeList combinators)
+      : super(uri, combinators);
 
   bool get isImport => true;
 
   Import asImport() => this;
 
   Token get asKeyword => prefix == null ? null : uri.getEndToken().next;
 
   accept(Visitor visitor) => visitor.visitImport(this);
 
   visitChildren(Visitor visitor) {
     uri.accept(visitor);
     if (prefix !== null) prefix.accept(visitor);
     if (combinators !== null) combinators.accept(visitor);
   }
 
   Token getBeginToken() => importKeyword;
 
   Token getEndToken() {
     if (combinators !== null) return combinators.getEndToken().next;
     if (prefix !== null) return prefix.getEndToken().next;
     return uri.getEndToken().next;
   }
 }
 
-class Export extends LibraryTag {
-  final LiteralString uri;
-  final NodeList combinators;
-
+/**
+ * An [:export:] library tag.
+ *
+ * An export tag is dependency on another library where the exported identifiers
+ * are put into the export scope of the exporting library. The export scope is
+ * not visible inside the library.
+ */
+class Export extends LibraryDependency {
   final Token exportKeyword;
 
-  Export(this.exportKeyword, this.uri, this.combinators);
+  Export(this.exportKeyword, LiteralString uri, NodeList combinators)
+      : super(uri, combinators);
 
   bool get isExport => true;
 
   Export asExport() => this;
 
   accept(Visitor visitor) => visitor.visitExport(this);
 
   visitChildren(Visitor visitor) {
     uri.accept(visitor);
     if (combinators !== null) combinators.accept(visitor);
@@ skipping 245 matching lines @@
  * argument).
  *
  * TODO(ahe): This method is controversial, the team needs to discuss
  * if top-level methods are acceptable and what naming conventions to
  * use.
  */
 initializerDo(Node node, f(Node node)) {
   SendSet send = node.asSendSet();
   if (send !== null) return f(send.arguments.head);
 }