dart2js: Create noSuchMethod handlers at runtime to reduce overhead.

sdk/lib/_internal/compiler/implementation/js/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.
 
 part of js;
 
 abstract class NodeVisitor<T> {
   T visitProgram(Program node);
 
   T visitBlock(Block node);
@@ skipping 1043 matching lines @@
                      toExpression(object),
                      toStatement(statement));
   }
 
   For for_(init, condition, update, statement) {
     return new For(
         toExpression(init), toExpression(condition), toExpression(update),
         toStatement(statement));
   }
 
+  While while_(condition, statement) {
+    return new While(
+        toExpression(condition), toStatement(statement));
+  }
+
   Try try_(body, {catchPart, finallyPart}) {
     if (catchPart != null) catchPart = toStatement(catchPart);
     if (finallyPart != null) finallyPart = toStatement(finallyPart);
     return new Try(toStatement(body), catchPart, finallyPart);
   }
 
   Comment comment(String text) => new Comment(text);
 }
 
 const JsBuilder js = const JsBuilder();
@@ skipping 110 matching lines @@
       ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA,       // ABCDEFGH
       ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA,       // IJKLMNOP
       ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA,       // QRSTUVWX
       ALPHA, ALPHA, LSQUARE, OTHER, RSQUARE, SYMBOL, ALPHA, OTHER,  // YZ[\]^_'
       ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA,       // abcdefgh
       ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA,       // ijklmnop
       ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA, ALPHA,       // qrstuvwx
       ALPHA, ALPHA, LBRACE, SYMBOL, RBRACE, SYMBOL];                // yz{|}~
 
   static final BINARY_OPERATORS = [
-      '+', '-', '*', '/', '%', '^', '|', '&', '||', '&&',
-      '<<', '>>', '+=', '-=', '*=', '/=', '^=', '|=', '&=', '<<=', '>>=',
+      '+', '-', '*', '/', '%', '^', '|', '&', '||', '&&', '<<', '>>', '>>>',
+      '+=', '-=', '*=', '/=', '%=', '^=', '|=', '&=', '<<=', '>>=', '>>>=',
       '=', '!=', '==', '!==', '===', '<', '<=', '>=', '>'].toSet();
   static final UNARY_OPERATORS = ['++', '--', '+', '-', '~', '!'].toSet();
 
   // For sanity we only allow \\, \', \" and \n in string literals.
   static final STRING_LITERAL_PATTERN =
       new RegExp('^[\'"](?:[^\\\\]|\\\\[\\\\n\'"])*[\'"]\$');
 
   static int category(int code) {
     if (code >= CATEGORIES.length) return OTHER;
     return CATEGORIES[code];
@@ skipping 218 matching lines @@
   }
 
   Expression parseRelation() {
     Expression lhs = parseBinary();
     String relation = lastToken;
     // The lexer returns "=" as a relational operator because it looks a bit
     // like ==, <=, etc.  But we don't want to handle it here (that would give
     // it the wrong prescedence), so we just return if we see it.
     if (relation == "=" || !acceptCategory(RELATION)) return lhs;
     Expression rhs = parseBinary();
-    if (relation == "<<=" || relation == ">>=") {
+    if (relation == "<<=" || relation == ">>=" || relation == ">>>=") {
       return new Assignment.compound(lhs,
                                      relation.substring(0, relation.length - 1),
                                      rhs);
     } else {
       // Regular binary operation.
       return new Binary(relation, lhs, rhs);
     }
   }
 
   Expression parseConditional() {
@@ skipping 38 matching lines @@
 
   Expression expression() {
     Expression expression = parseVarDeclarationOrExpression();
     if (lastCategory != NONE || position != src.length) {
       throw new MiniJsParserError(
           this, "Unparsed junk: ${categoryToString(lastCategory)}");
     }
     return expression;
   }
 }