Change core lib, dart2js, and more for new optional parameters syntax

lib/compiler/implementation/js/printer.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.
 
 class Printer implements NodeVisitor {
   final bool shouldCompressOutput;
   leg.Compiler compiler;
   leg.CodeBuffer outBuffer;
   int indentLevel = 0;
   bool inForInit = false;
@@ skipping 55 matching lines @@
 
   visit(Node node) {
     if (node.sourcePosition != null) outBuffer.beginMappedRange();
     recordSourcePosition(node.sourcePosition);
     node.accept(this);
     recordSourcePosition(node.endSourcePosition);
     if (node.sourcePosition != null) outBuffer.endMappedRange();
   }
 
   visitCommaSeparated(List<Node> nodes, int hasRequiredType,
-                      [bool newInForInit, bool newAtStatementBegin]) {
+                      {bool newInForInit, bool newAtStatementBegin}) {
     for (int i = 0; i < nodes.length; i++) {
       if (i != 0) {
         atStatementBegin = false;
         out(",");
         spaceOut();
       }
       visitNestedExpression(nodes[i], hasRequiredType,
-                            newInForInit, newAtStatementBegin);
+                            newInForInit: newInForInit,
+                            newAtStatementBegin: newAtStatementBegin);
     }
   }
 
   visitAll(List<Node> nodes) {
     nodes.forEach(visit);
   }
 
   visitProgram(Program program) {
     visitAll(program.body);
   }
 
-  bool blockBody(Node body, [bool needsSeparation, bool needsNewline]) {
+  bool blockBody(Node body, {bool needsSeparation, bool needsNewline}) {
     if (body is Block) {
       spaceOut();
       blockOut(body, false, needsNewline);
       return true;
     }
     if (shouldCompressOutput && needsSeparation) {
       // If [shouldCompressOutput] is false, then the 'lineOut' will insert
       // the separation.
       out(" ");
     } else {
@@ skipping 265 matching lines @@
 
   visitFunctionDeclaration(FunctionDeclaration declaration) {
     VarCollector vars = new VarCollector();
     vars.visitFunctionDeclaration(declaration);
     indent();
     functionOut(declaration.function, declaration.name, vars);
     lineOut();
   }
 
   visitNestedExpression(Expression node, int requiredPrecedence,
-                        [bool newInForInit, bool newAtStatementBegin]) {
+                        {bool newInForInit, bool newAtStatementBegin}) {
     bool needsParentheses =
         // a - (b + c).
         (requiredPrecedence != EXPRESSION &&
          node.precedenceLevel < requiredPrecedence) ||
         // for (a = (x in o); ... ; ... ) { ... }
         (newInForInit && node is Binary && (node as Binary).op == "in") ||
         // (function() { ... })().
         // ({a: 2, b: 3}.toString()).
         (newAtStatementBegin && (node is NamedFunction ||
                                  node is Fun ||
@@ skipping 581 matching lines @@
       }
       codes.add(charCodes.$0 + digit);
       newName = new String.fromCharCodes(codes);
     }
     assert(const RegExp(r'[a-zA-Z][a-zA-Z0-9]*').hasMatch(newName));
     nameNumber++;
     maps.last()[oldName] = newName;
     return newName;
   }
 }