Second round of cleanups for new optional parameter semantics.

lib/compiler/implementation/dart_backend/backend.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 ElementAst {
   final Node ast;
   final TreeElements treeElements;
 
   ElementAst(this.ast, this.treeElements);
 
@@ skipping 336 matching lines @@
 
       // TODO(antonm): check with AAR team if there is better approach.
       // As an idea: provide template as a Dart code---class C { C.name(); }---
       // and then overwrite necessary parts.
       SynthesizedConstructorElement constructor =
           new SynthesizedConstructorElement(classElement);
       constructor.type = new FunctionType(
           compiler.types.voidType, const Link<DartType>(),
           constructor);
       constructor.cachedNode = new FunctionExpression(
-          new Send(receiver: classElement.parseNode(compiler).name,
-                   selector: synthesizedIdentifier),
+          new Send(classElement.parseNode(compiler).name,
+                   synthesizedIdentifier),
           new NodeList(new StringToken(OPEN_PAREN_INFO, '(', -1),
                        const Link<Node>(),
                        new StringToken(CLOSE_PAREN_INFO, ')', -1)),
           new EmptyStatement(new StringToken(SEMICOLON_INFO, ';', -1)),
           null, Modifiers.EMPTY, null, null);
 
       classMembers[classElement].add(constructor);
       elementAsts[constructor] =
           new ElementAst(constructor.cachedNode, new TreeElementMapping());
     }
@@ skipping 167 matching lines @@
 }
 
 compareElements(e0, e1) {
   int result = compareBy((e) => e.getLibrary().uri.toString())(e0, e1);
   if (result != 0) return result;
   return compareBy((e) => e.position().charOffset)(e0, e1);
 }
 
 List<Element> sortElements(Collection<Element> elements) =>
     sorted(elements, compareElements);