Make isEmpty a getter.

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 313 matching lines @@
     visitAll(node.cases);
     indentLevel--;
     outIndentLn("}");
   }
 
   visitCase(Case node) {
     outIndent("case ");
     visitNestedExpression(node.expression, EXPRESSION,
                           newInForInit: false, newAtStatementBegin: false);
     outLn(":");
-    if (!node.body.statements.isEmpty()) {
+    if (!node.body.statements.isEmpty) {
       indentLevel++;
       blockOutWithoutBraces(node.body);
       indentLevel--;
     }
   }
 
   visitDefault(Default node) {
     outIndentLn("default:");
-    if (!node.body.statements.isEmpty()) {
+    if (!node.body.statements.isEmpty) {
       indentLevel++;
       blockOutWithoutBraces(node.body);
       indentLevel--;
     }
   }
 
   visitLabeledStatement(LabeledStatement node) {
     outIndent("${node.label}:");
     blockBody(node.body, needsSeparation: false, needsNewline: true);
   }
@@ skipping 584 matching lines @@
     return oldName;
   }
 
   static int nthLetter(int n) {
     return (n < 26) ? charCodes.$a + n : charCodes.$A + n - 26;
   }
 
   String declareName(String oldName) {
     const LETTERS = 52;
     const DIGITS = 10;
-    if (maps.isEmpty()) return oldName;
+    if (maps.isEmpty) return oldName;
 
     String newName;
     int n = nameNumber;
     if (n < LETTERS) {
       // Start naming variables a, b, c, ..., z, A, B, C, ..., Z.
       newName = new String.fromCharCodes([nthLetter(n)]);
     } else {
       // Then name variables a0, a1, a2, ..., a9, b0, b1, ..., Z9, aa0, aa1, ...
       // For all functions with fewer than 500 locals this is just as compact
       // as using aa, ab, etc. but avoids clashes with keywords.
@@ skipping 16 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;
   }
 }