Big merge from experimental to bleeding edge.

sdk/lib/_internal/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.
 
 part of scanner;
 
 /**
  * A keyword in the Dart programming language.
  */
-class Keyword implements SourceString {
+class Keyword extends Iterable<int> implements SourceString {
   static const List<Keyword> values = const <Keyword> [
       const Keyword("assert"),
       const Keyword("break"),
       const Keyword("case"),
       const Keyword("catch"),
       const Keyword("class"),
       const Keyword("const"),
       const Keyword("continue"),
       const Keyword("default"),
       const Keyword("do"),
@@ skipping 74 matching lines @@
     }
     return result;
   }
 
   int get hashCode => syntax.hashCode;
 
   bool operator ==(other) {
     return other is SourceString && toString() == other.slowToString();
   }
 
-  Iterator<int> iterator() => new StringCodeIterator(syntax);
+  Iterator<int> get iterator => new StringCodeIterator(syntax);
 
   void printOn(StringBuffer sb) {
     sb.add(syntax);
   }
 
   String toString() => syntax;
   String slowToString() => 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 get isEmpty => false;
   bool isPrivate() => false;
 }
 
 /**
  * Abstract state in a state machine for scanning keywords.
  */
 abstract class KeywordState {
   bool isLeaf();
   KeywordState next(int c);
   Keyword get keyword;
 
   static KeywordState _KEYWORD_STATE;
   static KeywordState get KEYWORD_STATE {
     if (_KEYWORD_STATE == null) {
-      List<String> strings = new List<String>(Keyword.values.length);
+      List<String> strings =
+          new List<String>.fixedLength(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;
   }
 
   static KeywordState computeKeywordStateTable(int start, List<String> strings,
                                                int offset, int length) {
-    List<KeywordState> result = new List<KeywordState>(26);
+    List<KeywordState> result = new List<KeywordState>.fixedLength(26);
     assert(length != 0);
     int chunk = 0;
     int chunkStart = -1;
     bool isLeaf = false;
     for (int i = offset; i < offset + length; i++) {
       if (strings[i].length == start) {
         isLeaf = true;
       }
       if (strings[i].length > start) {
         int c = strings[i].charCodeAt(start);
@@ skipping 66 matching lines @@
   final Keyword keyword;
 
   LeafKeywordState(String syntax) : keyword = Keyword.keywords[syntax];
 
   bool isLeaf() => true;
 
   KeywordState next(int c) => null;
 
   String toString() => keyword.syntax;
 }