Remove most superfluous getter arguments from dart2js.

dart/lib/compiler/implementation/scanner/keyword.dart

 // Copyright (c) 2011, 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.
 
 /**
  * A keyword in the Dart programming language.
  */
 class Keyword implements SourceString {
   static final Keyword BREAK = const Keyword("break");
   static final Keyword CASE = const Keyword("case");
@@ skipping 92 matching lines @@
       SET,
       SOURCE,
       STATIC,
       TYPEDEF ];
 
   final String syntax;
   final bool isPseudo;
   final PrecedenceInfo info;
 
   static Map<String, Keyword> _keywords;
-  static Map<String, Keyword> get keywords() {
+  static Map<String, Keyword> get keywords {
     if (_keywords === null) {
       _keywords = computeKeywordMap();
     }
     return _keywords;
   }
 
   const Keyword(String this.syntax,
                 [bool this.isPseudo = false,
                  PrecedenceInfo this.info = KEYWORD_INFO]);
 
@@ skipping 12 matching lines @@
   }
 
   Iterator<int> iterator() => new StringCodeIterator(syntax);
 
   void printOn(StringBuffer sb) {
     sb.add(syntax);
   }
 
   String toString() => syntax;
   String slowToString() => syntax;
-  String get stringValue() => syntax;
+  String get stringValue => syntax;
 
   SourceString copyWithoutQuotes(int initial, int terminal) {
     // TODO(lrn): consider remodelling to avoid having this method in keywords.
     return this;
   }
 
   bool isEmpty() => false;
   bool isPrivate() => false;
 }
 
 /**
  * Abstract state in a state machine for scanning keywords.
  */
 class KeywordState {
   abstract bool isLeaf();
   abstract KeywordState next(int c);
   abstract Keyword get keyword();
 
   static KeywordState _KEYWORD_STATE;
-  static KeywordState get KEYWORD_STATE() {
+  static KeywordState get KEYWORD_STATE {
     if (_KEYWORD_STATE === null) {
       List<String> strings = new List<String>(Keyword.values.length);
       for (int i = 0; i < Keyword.values.length; i++) {
         strings[i] = Keyword.values[i].syntax;
       }
       strings.sort((a,b) => a.compareTo(b));
       _KEYWORD_STATE = computeKeywordStateTable(0, strings, 0, strings.length);
     }
     return _KEYWORD_STATE;
   }
@@ skipping 80 matching lines @@
   final Keyword keyword;
 
   LeafKeywordState(String syntax) : keyword = Keyword.keywords[syntax];
 
   bool isLeaf() => true;
 
   KeywordState next(int c) => null;
 
   String toString() => keyword.syntax;
 }