Parse/unparse library combinators.

dart/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) => visitNode(node);
+  R visitExport(Export node) => visitLibraryTag(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) => visitNode(node);
+  R visitImport(Import node) => visitLibraryTag(node);
   R visitLabel(Label node) => visitNode(node);
   R visitLabeledStatement(LabeledStatement node) => visitStatement(node);
-  R visitLibraryName(LibraryName node) => visitNode(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);
   R visitLiteralString(LiteralString node) => visitStringNode(node);
   R visitStringJuxtaposition(StringJuxtaposition node) => visitStringNode(node);
   R visitLoop(Loop node) => visitStatement(node);
   R visitModifiers(Modifiers node) => visitNode(node);
   R visitNamedArgument(NamedArgument node) => visitExpression(node);
   R visitNewExpression(NewExpression node) => visitExpression(node);
   R visitNodeList(NodeList node) => visitNode(node);
   R visitOperator(Operator node) => visitIdentifier(node);
   R visitParenthesizedExpression(ParenthesizedExpression node) {
     return visitExpression(node);
   }
-  R visitPart(Part node) => visitNode(node);
-  R visitPartOf(PartOf node) => visitNode(node);
+  R visitPart(Part node) => visitLibraryTag(node);
+  R visitPartOf(PartOf node) => visitLibraryTag(node);
   R visitPostfix(Postfix node) => visitNodeList(node);
   R visitPrefix(Prefix node) => visitNodeList(node);
   R visitReturn(Return node) => visitStatement(node);
   R visitScriptTag(ScriptTag node) => visitNode(node);
   R visitSend(Send node) => visitExpression(node);
   R visitSendSet(SendSet node) => visitSend(node);
   R visitStatement(Statement node) => visitNode(node);
   R visitStringNode(StringNode node) => visitExpression(node);
   R visitStringInterpolation(StringInterpolation node) => visitStringNode(node);
   R visitStringInterpolationPart(StringInterpolationPart node) {
@@ skipping 69 matching lines @@
 
   abstract Token getEndToken();
 
   Block asBlock() => null;
   BreakStatement asBreakStatement() => null;
   Cascade asCascade() => null;
   CascadeReceiver asCascadeReceiver() => null;
   CaseMatch asCaseMatch() => null;
   CatchBlock asCatchBlock() => null;
   ClassNode asClassNode() => null;
+  Combinator asCombinator() => null;
   Conditional asConditional() => null;
   ContinueStatement asContinueStatement() => null;
   DoWhile asDoWhile() => null;
   EmptyStatement asEmptyStatement() => null;
   Export AsExport() => null;
   Expression asExpression() => null;
   ExpressionStatement asExpressionStatement() => null;
   For asFor() => null;
   ForIn asForIn() => null;
   FunctionDeclaration asFunctionDeclaration() => null;
@@ skipping 1615 matching lines @@
 
   accept(Visitor visitor) => visitor.visitPartOf(this);
 
   visitChildren(Visitor visitor) => name.accept(visitor);
 
   Token getBeginToken() => partKeyword;
 
   Token getEndToken() => name.getEndToken().next;
 }
 
+class Combinator extends Node {
+  final NodeList identifiers;
+
+  final Token keywordToken;
+
+  Combinator(this.identifiers, this.keywordToken);
+
+  bool get isShow => keywordToken.stringValue === 'show';
+
+  bool get isHide => keywordToken.stringValue === 'hide';
+
+  Combinator asCombinator() => this;
+
+  accept(Visitor visitor) => visitor.visitCombinator(this);
+
+  visitChildren(Visitor visitor) => identifiers.accept(visitor);
+
+  Token getBeginToken() => keywordToken;
+
+  Token getEndToken() => identifiers.getEndToken();
+}
+
 class Typedef extends Node {
   final TypeAnnotation returnType;
   final Identifier name;
   final NodeList typeParameters;
   final NodeList formals;
 
   final Token typedefKeyword;
   final Token endToken;
 
   Typedef(this.returnType, this.name, this.typeParameters, this.formals,
@@ skipping 161 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);
 }