Get pegparser test to pass again

utils/peg/pegparser.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.
 
-library Peg Parser;
+library PegParser;
 
 /*
  * The following functions are combinators for building Rules.
  *
  * A rule is one of the following
  * - A String which matches the string literally.
  * - A Symbol which matches the symbol's definition.
  * - A list of rules with an optional reducing function, which matches a sequence.
  * - The result of calling one of the combinators.
  *
@@ skipping 39 matching lines @@
  * CHAR does not generate a value.
  */
 _Rule CHAR([characters]) {
   if (characters == null)
     return const _AnyCharRule();
   if (characters is int)
     return CHARCODE(characters);
 
   // Find the range of character codes and construct an array of flags for codes
   // within the range.
-  List<int> codes = characters.codeUnits;
+  List<int> codes = characters.codeUnits.toList();
   codes.sort((a, b) => a < b ? -1 : a > b ? 1 : 0);
   int lo = codes[0];
   int hi = codes[codes.length - 1];
   if (lo == hi)
     return CHARCODE(lo);
   int len = hi - lo + 1;
   var flags = new List<bool>(len);
   for (int i = 0; i < len; ++i)
     flags[i] = false;
   for (int code in codes)
@@ skipping 82 matching lines @@
 
 /**
  * MANY(rule) matches [rule] [min] or more times.
  * [min] must be 0 or 1.
  * If [separator] is provided it is used to match a separator between matches of
  * [rule].
  *
  * MANY is a value generating matcher.  The value is a list of the matches of
  * [rule].  The list may be empty if [:min == 0:].
  */
-_Rule MANY(rule, [separator = null, int min = 1]) {
+_Rule MANY(rule, {separator: null, int min: 1}) {
   assert(0 <= min && min <= 1);
   return new _RepeatRule(_compile(rule), _compileOptional(separator), min);
 }
 
 /**
  * Matches [rule] zero or more times.  Shorthand for [:MANY(rule, min:0):]
  * TODO: retire min: parameter?
  *
  * MANY0 is a value generating matcher.
  */
@@ skipping 88 matching lines @@
   diagnose(state) {
     var message = 'unexpected error';
     if (!state.max_rule.isEmpty) {
       var s = new Set();
       for (var rule in state.max_rule)
         s.add(rule.description());
       var tokens = new List<String>.from(s);
       tokens.sort((a, b) =>
                   a.startsWith("'") == b.startsWith("'")
                       ? a.compareTo(b)
-                      : a.startsWith("'") ? +1 : -1);
+                      : a.startsWith("'") ? 1 : -1);
       var expected = tokens.join(' or ');
       var found = state.max_pos == state._end ? 'end of file'
           : "'${state._text[state.max_pos]}'";
       message = 'Expected $expected but found $found';
     }
     int start = state.max_pos;
     int end = start;
     while (start >= 1 && state._text[start - 1] != '\n') --start;
     while (end < state._text.length && state._text[end] != '\n') ++end;
     var line = state._text.substring(start, end);
@@ skipping 19 matching lines @@
   void set def(rule) {
     assert(_rule == null);  // Assign once.
     _rule = _compile(rule);
   }
 
   toString() => _rule == null ? '<$name>' : '<$name = $_rule>';
 }
 
 
 class _ParserState {
-  _ParserState(this._text, [_Rule whitespace = null]) {
+  _ParserState(this._text, {_Rule whitespace}) {
     _end = this._text.length;
     whitespaceRule = whitespace;
     max_rule = [];
   }
 
   String _text;
   int _end;
 
   //
   bool inWhitespaceMode = false;
@@ skipping 521 matching lines @@
   add(s);
   add(t);
   add(u);
   add(v);
   add(w);
   add(x);
   add(y);
   add(z);
   return list;
 }