Remove trailing spaces in analyzer_experimental

pkg/analyzer_experimental/lib/src/generated/parser.dart

 // This code was auto-generated, is not intended to be edited, and is subject to
 // significant change. Please see the README file for more information.
-
 library engine.parser;
-
 import 'dart:collection';
 import 'java_core.dart';
 import 'java_engine.dart';
 import 'instrumentation.dart';
 import 'error.dart';
 import 'source.dart';
 import 'scanner.dart';
 import 'ast.dart';
 import 'utilities_dart.dart';
-
-
 /**
  * Instances of the class {@code CommentAndMetadata} implement a simple data-holder for a method
  * that needs to return multiple values.
  * @coverage dart.engine.parser
  */
 class CommentAndMetadata {
-  
+
   /**
    * The documentation comment that was parsed, or {@code null} if none was given.
    */
   Comment _comment;
-  
+
   /**
    * The metadata that was parsed.
    */
   List<Annotation> _metadata;
-  
+
   /**
    * Initialize a newly created holder with the given data.
    * @param comment the documentation comment that was parsed
    * @param metadata the metadata that was parsed
    */
   CommentAndMetadata(Comment comment, List<Annotation> metadata) {
     this._comment = comment;
     this._metadata = metadata;
   }
-  
+
   /**
    * Return the documentation comment that was parsed, or {@code null} if none was given.
    * @return the documentation comment that was parsed
    */
   Comment get comment => _comment;
-  
+
   /**
    * Return the metadata that was parsed. If there was no metadata, then the list will be empty.
    * @return the metadata that was parsed
    */
   List<Annotation> get metadata => _metadata;
 }
-
 /**
  * Instances of the class {@code FinalConstVarOrType} implement a simple data-holder for a method
  * that needs to return multiple values.
  * @coverage dart.engine.parser
  */
 class FinalConstVarOrType {
-  
+
   /**
    * The 'final', 'const' or 'var' keyword, or {@code null} if none was given.
    */
   Token _keyword;
-  
+
   /**
    * The type, of {@code null} if no type was specified.
    */
   TypeName _type;
-  
+
   /**
    * Initialize a newly created holder with the given data.
    * @param keyword the 'final', 'const' or 'var' keyword
    * @param type the type
    */
   FinalConstVarOrType(Token keyword, TypeName type) {
     this._keyword = keyword;
     this._type = type;
   }
-  
+
   /**
    * Return the 'final', 'const' or 'var' keyword, or {@code null} if none was given.
    * @return the 'final', 'const' or 'var' keyword
    */
   Token get keyword => _keyword;
-  
+
   /**
    * Return the type, of {@code null} if no type was specified.
    * @return the type
    */
   TypeName get type => _type;
 }
-
 /**
  * Instances of the class {@code Modifiers} implement a simple data-holder for a method that needs
  * to return multiple values.
  * @coverage dart.engine.parser
  */
 class Modifiers {
-  
+
   /**
    * The token representing the keyword 'abstract', or {@code null} if the keyword was not found.
    */
   Token _abstractKeyword;
-  
+
   /**
    * The token representing the keyword 'const', or {@code null} if the keyword was not found.
    */
   Token _constKeyword;
-  
+
   /**
    * The token representing the keyword 'external', or {@code null} if the keyword was not found.
    */
   Token _externalKeyword;
-  
+
   /**
    * The token representing the keyword 'factory', or {@code null} if the keyword was not found.
    */
   Token _factoryKeyword;
-  
+
   /**
    * The token representing the keyword 'final', or {@code null} if the keyword was not found.
    */
   Token _finalKeyword;
-  
+
   /**
    * The token representing the keyword 'static', or {@code null} if the keyword was not found.
    */
   Token _staticKeyword;
-  
+
   /**
    * The token representing the keyword 'var', or {@code null} if the keyword was not found.
    */
   Token _varKeyword;
-  
+
   /**
    * Return the token representing the keyword 'abstract', or {@code null} if the keyword was not
    * found.
    * @return the token representing the keyword 'abstract'
    */
   Token get abstractKeyword => _abstractKeyword;
-  
+
   /**
    * Return the token representing the keyword 'const', or {@code null} if the keyword was not
    * found.
    * @return the token representing the keyword 'const'
    */
   Token get constKeyword => _constKeyword;
-  
+
   /**
    * Return the token representing the keyword 'external', or {@code null} if the keyword was not
    * found.
    * @return the token representing the keyword 'external'
    */
   Token get externalKeyword => _externalKeyword;
-  
+
   /**
    * Return the token representing the keyword 'factory', or {@code null} if the keyword was not
    * found.
    * @return the token representing the keyword 'factory'
    */
   Token get factoryKeyword => _factoryKeyword;
-  
+
   /**
    * Return the token representing the keyword 'final', or {@code null} if the keyword was not
    * found.
    * @return the token representing the keyword 'final'
    */
   Token get finalKeyword => _finalKeyword;
-  
+
   /**
    * Return the token representing the keyword 'static', or {@code null} if the keyword was not
    * found.
    * @return the token representing the keyword 'static'
    */
   Token get staticKeyword => _staticKeyword;
-  
+
   /**
    * Return the token representing the keyword 'var', or {@code null} if the keyword was not found.
    * @return the token representing the keyword 'var'
    */
   Token get varKeyword => _varKeyword;
-  
+
   /**
    * Set the token representing the keyword 'abstract' to the given token.
    * @param abstractKeyword the token representing the keyword 'abstract'
    */
   void set abstractKeyword(Token abstractKeyword2) {
     this._abstractKeyword = abstractKeyword2;
   }
-  
+
   /**
    * Set the token representing the keyword 'const' to the given token.
    * @param constKeyword the token representing the keyword 'const'
    */
   void set constKeyword(Token constKeyword2) {
     this._constKeyword = constKeyword2;
   }
-  
+
   /**
    * Set the token representing the keyword 'external' to the given token.
    * @param externalKeyword the token representing the keyword 'external'
    */
   void set externalKeyword(Token externalKeyword2) {
     this._externalKeyword = externalKeyword2;
   }
-  
+
   /**
    * Set the token representing the keyword 'factory' to the given token.
    * @param factoryKeyword the token representing the keyword 'factory'
    */
   void set factoryKeyword(Token factoryKeyword2) {
     this._factoryKeyword = factoryKeyword2;
   }
-  
+
   /**
    * Set the token representing the keyword 'final' to the given token.
    * @param finalKeyword the token representing the keyword 'final'
    */
   void set finalKeyword(Token finalKeyword2) {
     this._finalKeyword = finalKeyword2;
   }
-  
+
   /**
    * Set the token representing the keyword 'static' to the given token.
    * @param staticKeyword the token representing the keyword 'static'
    */
   void set staticKeyword(Token staticKeyword2) {
     this._staticKeyword = staticKeyword2;
   }
-  
+
   /**
    * Set the token representing the keyword 'var' to the given token.
    * @param varKeyword the token representing the keyword 'var'
    */
   void set varKeyword(Token varKeyword2) {
     this._varKeyword = varKeyword2;
   }
   String toString() {
     JavaStringBuilder builder = new JavaStringBuilder();
     bool needsSpace = appendKeyword(builder, false, _abstractKeyword);
     needsSpace = appendKeyword(builder, needsSpace, _constKeyword);
     needsSpace = appendKeyword(builder, needsSpace, _externalKeyword);
     needsSpace = appendKeyword(builder, needsSpace, _factoryKeyword);
     needsSpace = appendKeyword(builder, needsSpace, _finalKeyword);
     needsSpace = appendKeyword(builder, needsSpace, _staticKeyword);
     appendKeyword(builder, needsSpace, _varKeyword);
     return builder.toString();
   }
-  
+
   /**
    * If the given keyword is not {@code null}, append it to the given builder, prefixing it with a
    * space if needed.
    * @param builder the builder to which the keyword will be appended
    * @param needsSpace {@code true} if the keyword needs to be prefixed with a space
    * @param keyword the keyword to be appended
    * @return {@code true} if subsequent keywords need to be prefixed with a space
    */
   bool appendKeyword(JavaStringBuilder builder, bool needsSpace, Token keyword) {
     if (keyword != null) {
       if (needsSpace) {
         builder.appendChar(0x20);
       }
       builder.append(keyword.lexeme);
       return true;
     }
     return needsSpace;
   }
 }
-
 /**
  * Instances of the class {@code Parser} are used to parse tokens into an AST structure.
  * @coverage dart.engine.parser
  */
 class Parser {
-  
+
   /**
    * The source being parsed.
    */
   Source _source;
-  
+
   /**
    * The error listener that will be informed of any errors that are found during the parse.
    */
   AnalysisErrorListener _errorListener;
-  
+
   /**
    * The next token to be parsed.
    */
   Token _currentToken;
-  
+
   /**
    * A flag indicating whether the parser is currently in the body of a loop.
    */
   bool _inLoop = false;
-  
+
   /**
    * A flag indicating whether the parser is currently in a switch statement.
    */
   bool _inSwitch = false;
   static String _HIDE = "hide";
   static String _OF = "of";
   static String _ON = "on";
   static String _SHOW = "show";
   static String _NATIVE = "native";
-  
+
   /**
    * Initialize a newly created parser.
    * @param source the source being parsed
    * @param errorListener the error listener that will be informed of any errors that are found
    * during the parse
    */
   Parser(Source source, AnalysisErrorListener errorListener) {
     this._source = source;
     this._errorListener = errorListener;
   }
-  
+
   /**
    * Parse a compilation unit, starting with the given token.
    * @param token the first token of the compilation unit
    * @return the compilation unit that was parsed
    */
   CompilationUnit parseCompilationUnit(Token token) {
     InstrumentationBuilder instrumentation = Instrumentation.builder2("dart.engine.Parser.parseCompilationUnit");
     try {
       _currentToken = token;
       return parseCompilationUnit2();
     } finally {
       instrumentation.log();
     }
   }
-  
+
   /**
    * Parse an expression, starting with the given token.
    * @param token the first token of the expression
    * @return the expression that was parsed, or {@code null} if the tokens do not represent a
    * recognizable expression
    */
   Expression parseExpression(Token token) {
     InstrumentationBuilder instrumentation = Instrumentation.builder2("dart.engine.Parser.parseExpression");
     try {
       _currentToken = token;
       return parseExpression2();
     } finally {
       instrumentation.log();
     }
   }
-  
+
   /**
    * Parse a statement, starting with the given token.
    * @param token the first token of the statement
    * @return the statement that was parsed, or {@code null} if the tokens do not represent a
    * recognizable statement
    */
   Statement parseStatement(Token token) {
     InstrumentationBuilder instrumentation = Instrumentation.builder2("dart.engine.Parser.parseStatement");
     try {
       _currentToken = token;
       return parseStatement2();
     } finally {
       instrumentation.log();
     }
   }
-  
+
   /**
    * Parse a sequence of statements, starting with the given token.
    * @param token the first token of the sequence of statement
    * @return the statements that were parsed, or {@code null} if the tokens do not represent a
    * recognizable sequence of statements
    */
   List<Statement> parseStatements(Token token) {
     InstrumentationBuilder instrumentation = Instrumentation.builder2("dart.engine.Parser.parseStatements");
     try {
       _currentToken = token;
       return parseStatements2();
     } finally {
       instrumentation.log();
     }
   }
   void set currentToken(Token currentToken2) {
     this._currentToken = currentToken2;
   }
-  
+
   /**
    * Advance to the next token in the token stream.
    */
   void advance() {
     _currentToken = _currentToken.next;
   }
-  
+
   /**
    * Append the character equivalent of the given scalar value to the given builder. Use the start
    * and end indices to report an error, and don't append anything to the builder, if the scalar
    * value is invalid.
    * @param builder the builder to which the scalar value is to be appended
    * @param escapeSequence the escape sequence that was parsed to produce the scalar value
    * @param scalarValue the value to be appended
    * @param startIndex the index of the first character representing the scalar value
    * @param endIndex the index of the last character representing the scalar value
    */
   void appendScalarValue(JavaStringBuilder builder, String escapeSequence, int scalarValue, int startIndex, int endIndex) {
     if (scalarValue < 0 || scalarValue > Character.MAX_CODE_POINT || (scalarValue >= 0xD800 && scalarValue <= 0xDFFF)) {
       reportError7(ParserErrorCode.INVALID_CODE_POINT, [escapeSequence]);
       return;
     }
     if (scalarValue < Character.MAX_VALUE) {
       builder.appendChar((scalarValue as int));
     } else {
       builder.append(Character.toChars(scalarValue));
     }
   }
-  
+
   /**
    * Compute the content of a string with the given literal representation.
    * @param lexeme the literal representation of the string
    * @return the actual value of the string
    */
   String computeStringValue(String lexeme) {
     if (lexeme.startsWith("r\"\"\"") || lexeme.startsWith("r'''")) {
       if (lexeme.length > 4) {
         return lexeme.substring(4, lexeme.length - 3);
       }
@@ skipping 14 matching lines @@
     } else if (end > 1 && (lexeme.endsWith("\"") || lexeme.endsWith("'"))) {
       end -= 1;
     }
     JavaStringBuilder builder = new JavaStringBuilder();
     int index = start;
     while (index < end) {
       index = translateCharacter(builder, lexeme, index);
     }
     return builder.toString();
   }
-  
+
   /**
    * Convert the given method declaration into the nearest valid top-level function declaration.
    * @param method the method to be converted
    * @return the function declaration that most closely captures the components of the given method
    * declaration
    */
   FunctionDeclaration convertToFunctionDeclaration(MethodDeclaration method) => new FunctionDeclaration.full(method.documentationComment, method.metadata, method.externalKeyword, method.returnType, method.propertyKeyword, method.name, new FunctionExpression.full(method.parameters, method.body));
-  
+
   /**
    * Return {@code true} if the current token could be the start of a compilation unit member. This
    * method is used for recovery purposes to decide when to stop skipping tokens after finding an
    * error while parsing a compilation unit member.
    * @return {@code true} if the current token could be the start of a compilation unit member
    */
   bool couldBeStartOfCompilationUnitMember() {
     if ((matches(Keyword.IMPORT) || matches(Keyword.EXPORT) || matches(Keyword.LIBRARY) || matches(Keyword.PART)) && !matches4(peek(), TokenType.PERIOD) && !matches4(peek(), TokenType.LT)) {
       return true;
     } else if (matches(Keyword.CLASS)) {
       return true;
     } else if (matches(Keyword.TYPEDEF) && !matches4(peek(), TokenType.PERIOD) && !matches4(peek(), TokenType.LT)) {
       return true;
     } else if (matches(Keyword.VOID) || ((matches(Keyword.GET) || matches(Keyword.SET)) && matchesIdentifier2(peek())) || (matches(Keyword.OPERATOR) && isOperator(peek()))) {
       return true;
     } else if (matchesIdentifier()) {
       if (matches4(peek(), TokenType.OPEN_PAREN)) {
         return true;
       }
       Token token = skipReturnType(_currentToken);
       if (token == null) {
         return false;
       }
       if (matches(Keyword.GET) || matches(Keyword.SET) || (matches(Keyword.OPERATOR) && isOperator(peek())) || matchesIdentifier()) {
         return true;
       }
     }
     return false;
   }
-  
+
   /**
    * Create a synthetic identifier.
    * @return the synthetic identifier that was created
    */
   SimpleIdentifier createSyntheticIdentifier() => new SimpleIdentifier.full(createSyntheticToken2(TokenType.IDENTIFIER));
-  
+
   /**
    * Create a synthetic string literal.
    * @return the synthetic string literal that was created
    */
   SimpleStringLiteral createSyntheticStringLiteral() => new SimpleStringLiteral.full(createSyntheticToken2(TokenType.STRING), "");
-  
+
   /**
    * Create a synthetic token representing the given keyword.
    * @return the synthetic token that was created
    */
   Token createSyntheticToken(Keyword keyword) => new KeywordToken_11(keyword, _currentToken.offset);
-  
+
   /**
    * Create a synthetic token with the given type.
    * @return the synthetic token that was created
    */
   Token createSyntheticToken2(TokenType type) => new StringToken(type, "", _currentToken.offset);
-  
+
   /**
    * Check that the given expression is assignable and report an error if it isn't.
    * <pre>
    * assignableExpression ::=
    * primary (arguments* assignableSelector)+
    * | 'super' assignableSelector
    * | identifier
    * assignableSelector ::=
    * '\[' expression '\]'
    * | '.' identifier
    * </pre>
    * @param expression the expression being checked
    */
   void ensureAssignable(Expression expression) {
     if (expression != null && !expression.isAssignable()) {
       reportError7(ParserErrorCode.ILLEGAL_ASSIGNMENT_TO_NON_ASSIGNABLE, []);
     }
   }
-  
+
   /**
    * If the current token is a keyword matching the given string, return it after advancing to the
    * next token. Otherwise report an error and return the current token without advancing.
    * @param keyword the keyword that is expected
    * @return the token that matched the given type
    */
   Token expect(Keyword keyword) {
     if (matches(keyword)) {
       return andAdvance;
     }
     reportError7(ParserErrorCode.EXPECTED_TOKEN, [keyword.syntax]);
     return _currentToken;
   }
-  
+
   /**
    * If the current token has the expected type, return it after advancing to the next token.
    * Otherwise report an error and return the current token without advancing.
    * @param type the type of token that is expected
    * @return the token that matched the given type
    */
   Token expect2(TokenType type) {
     if (matches5(type)) {
       return andAdvance;
     }
     if (identical(type, TokenType.SEMICOLON)) {
       reportError8(ParserErrorCode.EXPECTED_TOKEN, _currentToken.previous, [type.lexeme]);
     } else {
       reportError7(ParserErrorCode.EXPECTED_TOKEN, [type.lexeme]);
     }
     return _currentToken;
   }
-  
+
   /**
    * Search the given list of ranges for a range that contains the given index. Return the range
    * that was found, or {@code null} if none of the ranges contain the index.
    * @param ranges the ranges to be searched
    * @param index the index contained in the returned range
    * @return the range that was found
    */
   List<int> findRange(List<List<int>> ranges, int index) {
     for (List<int> range in ranges) {
       if (range[0] <= index && index <= range[1]) {
         return range;
       } else if (index < range[0]) {
         return null;
       }
     }
     return null;
   }
-  
+
   /**
    * Advance to the next token in the token stream, making it the new current token.
    * @return the token that was current before this method was invoked
    */
   Token get andAdvance {
     Token token = _currentToken;
     advance();
     return token;
   }
-  
+
   /**
    * Return a list of the ranges of characters in the given comment string that should be treated as
    * code blocks.
    * @param comment the comment being processed
    * @return the ranges of characters that should be treated as code blocks
    */
   List<List<int>> getCodeBlockRanges(String comment) {
     List<List<int>> ranges = new List<List<int>>();
     int length2 = comment.length;
     int index = 0;
@@ skipping 21 matching lines @@
           end = length2;
         }
         ranges.add(<int> [index, end]);
         index = end + 1;
       } else {
         index = index + 1;
       }
     }
     return ranges;
   }
-  
+
   /**
    * Return the end token associated with the given begin token, or {@code null} if either the given
    * token is not a begin token or it does not have an end token associated with it.
    * @param beginToken the token that is expected to have an end token associated with it
    * @return the end token associated with the begin token
    */
   Token getEndToken(Token beginToken) {
     if (beginToken is BeginToken) {
       return ((beginToken as BeginToken)).endToken;
     }
     return null;
   }
-  
+
   /**
    * Return {@code true} if the current token is the first token of a return type that is followed
    * by an identifier, possibly followed by a list of type parameters, followed by a
    * left-parenthesis. This is used by parseTypeAlias to determine whether or not to parse a return
    * type.
    * @return {@code true} if we can successfully parse the rest of a type alias if we first parse a
    * return type.
    */
   bool hasReturnTypeInTypeAlias() {
     Token next = skipReturnType(_currentToken);
     if (next == null) {
       return false;
     }
     return matchesIdentifier2(next);
   }
-  
+
   /**
    * Return {@code true} if the current token appears to be the beginning of a function declaration.
    * @return {@code true} if the current token appears to be the beginning of a function declaration
    */
   bool isFunctionDeclaration() {
     if (matches(Keyword.VOID)) {
       return true;
     }
     Token afterReturnType = skipTypeName(_currentToken);
     if (afterReturnType == null) {
       afterReturnType = _currentToken;
     }
     Token afterIdentifier = skipSimpleIdentifier(afterReturnType);
     if (afterIdentifier == null) {
       afterIdentifier = skipSimpleIdentifier(_currentToken);
     }
     if (afterIdentifier == null) {
       return false;
     }
     return isFunctionExpression(afterIdentifier);
   }
-  
+
   /**
    * Return {@code true} if the given token appears to be the beginning of a function expression.
    * @param startToken the token that might be the start of a function expression
    * @return {@code true} if the given token appears to be the beginning of a function expression
    */
   bool isFunctionExpression(Token startToken) {
     Token afterParameters = skipFormalParameterList(startToken);
     if (afterParameters == null) {
       return false;
     }
     return matchesAny(afterParameters, [TokenType.OPEN_CURLY_BRACKET, TokenType.FUNCTION]);
   }
-  
+
   /**
    * Return {@code true} if the given character is a valid hexadecimal digit.
    * @param character the character being tested
    * @return {@code true} if the character is a valid hexadecimal digit
    */
   bool isHexDigit(int character) => (0x30 <= character && character <= 0x39) || (0x41 <= character && character <= 0x46) || (0x61 <= character && character <= 0x66);
-  
+
   /**
    * Return {@code true} if the current token is the first token in an initialized variable
    * declaration rather than an expression. This method assumes that we have already skipped past
    * any metadata that might be associated with the declaration.
    * <pre>
    * initializedVariableDeclaration ::=
    * declaredIdentifier ('=' expression)? (',' initializedIdentifier)
    * declaredIdentifier ::=
    * metadata finalConstVarOrType identifier
    * finalConstVarOrType ::=
@@ skipping 20 matching lines @@
     if (token == null) {
       return false;
     }
     token = skipSimpleIdentifier(token);
     if (token == null) {
       return false;
     }
     TokenType type2 = token.type;
     return identical(type2, TokenType.EQ) || identical(type2, TokenType.COMMA) || identical(type2, TokenType.SEMICOLON) || matches3(token, Keyword.IN);
   }
-  
+
   /**
    * Given that we have just found bracketed text within a comment, look to see whether that text is
    * (a) followed by a parenthesized link address, (b) followed by a colon, or (c) followed by
    * optional whitespace and another square bracket.
    * <p>
    * This method uses the syntax described by the <a
    * href="http://daringfireball.net/projects/markdown/syntax">markdown</a> project.
    * @param comment the comment text in which the bracketed text was found
    * @param rightIndex the index of the right bracket
    * @return {@code true} if the bracketed text is followed by a link address
@@ skipping 10 matching lines @@
     }
     while (Character.isWhitespace(nextChar)) {
       index = index + 1;
       if (index >= length2) {
         return false;
       }
       nextChar = comment.codeUnitAt(index);
     }
     return nextChar == 0x5B;
   }
-  
+
   /**
    * Return {@code true} if the given token appears to be the beginning of an operator declaration.
    * @param startToken the token that might be the start of an operator declaration
    * @return {@code true} if the given token appears to be the beginning of an operator declaration
    */
   bool isOperator(Token startToken) {
     if (startToken.isOperator()) {
       Token token = startToken.next;
       while (token.isOperator()) {
         token = token.next;
       }
       return matches4(token, TokenType.OPEN_PAREN);
     }
     return false;
   }
-  
+
   /**
    * Return {@code true} if the current token appears to be the beginning of a switch member.
    * @return {@code true} if the current token appears to be the beginning of a switch member
    */
   bool isSwitchMember() {
     Token token = _currentToken;
     while (matches4(token, TokenType.IDENTIFIER) && matches4(token.next, TokenType.COLON)) {
       token = token.next.next;
     }
     if (identical(token.type, TokenType.KEYWORD)) {
       Keyword keyword2 = ((token as KeywordToken)).keyword;
       return identical(keyword2, Keyword.CASE) || identical(keyword2, Keyword.DEFAULT);
     }
     return false;
   }
-  
+
   /**
    * Compare the given tokens to find the token that appears first in the source being parsed. That
    * is, return the left-most of all of the tokens. The arguments are allowed to be {@code null}.
    * Return the token with the smallest offset, or {@code null} if there are no arguments or if all
    * of the arguments are {@code null}.
    * @param tokens the tokens being compared
    * @return the token with the smallest offset
    */
   Token lexicallyFirst(List<Token> tokens) {
     Token first = null;
     int firstOffset = 2147483647;
     for (Token token in tokens) {
       if (token != null) {
         int offset2 = token.offset;
         if (offset2 < firstOffset) {
           first = token;
           firstOffset = offset2;
         }
       }
     }
     return first;
   }
-  
+
   /**
    * Return {@code true} if the current token matches the given keyword.
    * @param keyword the keyword that can optionally appear in the current location
    * @return {@code true} if the current token matches the given keyword
    */
   bool matches(Keyword keyword) => matches3(_currentToken, keyword);
-  
+
   /**
    * Return {@code true} if the current token matches the given identifier.
    * @param identifier the identifier that can optionally appear in the current location
    * @return {@code true} if the current token matches the given identifier
    */
   bool matches2(String identifier) => identical(_currentToken.type, TokenType.IDENTIFIER) && _currentToken.lexeme == identifier;
-  
+
   /**
    * Return {@code true} if the given token matches the given keyword.
    * @param token the token being tested
    * @param keyword the keyword that is being tested for
    * @return {@code true} if the given token matches the given keyword
    */
   bool matches3(Token token, Keyword keyword2) => identical(token.type, TokenType.KEYWORD) && identical(((token as KeywordToken)).keyword, keyword2);
-  
+
   /**
    * Return {@code true} if the given token has the given type.
    * @param token the token being tested
    * @param type the type of token that is being tested for
    * @return {@code true} if the given token has the given type
    */
   bool matches4(Token token, TokenType type2) => identical(token.type, type2);
-  
+
   /**
    * Return {@code true} if the current token has the given type. Note that this method, unlike
    * other variants, will modify the token stream if possible to match a wider range of tokens. In
    * particular, if we are attempting to match a '>' and the next token is either a '>>' or '>>>',
    * the token stream will be re-written and {@code true} will be returned.
    * @param type the type of token that can optionally appear in the current location
    * @return {@code true} if the current token has the given type
    */
   bool matches5(TokenType type2) {
     TokenType currentType = _currentToken.type;
@@ skipping 27 matching lines @@
           first.setNext(second);
           _currentToken.previous.setNext(first);
           _currentToken = first;
           return true;
         }
       }
       return false;
     }
     return true;
   }
-  
+
   /**
    * Return {@code true} if the given token has any one of the given types.
    * @param token the token being tested
    * @param types the types of token that are being tested for
    * @return {@code true} if the given token has any of the given types
    */
   bool matchesAny(Token token, List<TokenType> types) {
     TokenType actualType = token.type;
     for (TokenType type in types) {
       if (identical(actualType, type)) {
         return true;
       }
     }
     return false;
   }
-  
+
   /**
    * Return {@code true} if the current token is a valid identifier. Valid identifiers include
    * built-in identifiers (pseudo-keywords).
    * @return {@code true} if the current token is a valid identifier
    */
   bool matchesIdentifier() => matchesIdentifier2(_currentToken);
-  
+
   /**
    * Return {@code true} if the given token is a valid identifier. Valid identifiers include
    * built-in identifiers (pseudo-keywords).
    * @return {@code true} if the given token is a valid identifier
    */
   bool matchesIdentifier2(Token token) => matches4(token, TokenType.IDENTIFIER) || (matches4(token, TokenType.KEYWORD) && ((token as KeywordToken)).keyword.isPseudoKeyword());
-  
+
   /**
    * If the current token has the given type, then advance to the next token and return {@code true}. Otherwise, return {@code false} without advancing.
    * @param type the type of token that can optionally appear in the current location
    * @return {@code true} if the current token has the given type
    */
   bool optional(TokenType type) {
     if (matches5(type)) {
       advance();
       return true;
     }
     return false;
   }
-  
+
   /**
    * Parse an additive expression.
    * <pre>
    * additiveExpression ::=
    * multiplicativeExpression (additiveOperator multiplicativeExpression)
    * | 'super' (additiveOperator multiplicativeExpression)+
    * </pre>
    * @return the additive expression that was parsed
    */
   Expression parseAdditiveExpression() {
     Expression expression;
     if (matches(Keyword.SUPER) && _currentToken.next.type.isAdditiveOperator()) {
       expression = new SuperExpression.full(andAdvance);
     } else {
       expression = parseMultiplicativeExpression();
     }
     while (_currentToken.type.isAdditiveOperator()) {
       Token operator = andAdvance;
       expression = new BinaryExpression.full(expression, operator, parseMultiplicativeExpression());
     }
     return expression;
   }
-  
+
   /**
    * Parse an annotation.
    * <pre>
    * annotation ::=
    * '@' qualified ('.' identifier)? arguments?
    * </pre>
    * @return the annotation that was parsed
    */
   Annotation parseAnnotation() {
     Token atSign = expect2(TokenType.AT);
     Identifier name = parsePrefixedIdentifier();
     Token period = null;
     SimpleIdentifier constructorName = null;
     if (matches5(TokenType.PERIOD)) {
       period = andAdvance;
       constructorName = parseSimpleIdentifier();
     }
     ArgumentList arguments = null;
     if (matches5(TokenType.OPEN_PAREN)) {
       arguments = parseArgumentList();
     }
     return new Annotation.full(atSign, name, period, constructorName, arguments);
   }
-  
+
   /**
    * Parse an argument.
    * <pre>
    * argument ::=
    * namedArgument
    * | expression
    * namedArgument ::=
    * label expression
    * </pre>
    * @return the argument that was parsed
    */
   Expression parseArgument() {
     if (matchesIdentifier() && matches4(peek(), TokenType.COLON)) {
       SimpleIdentifier label = new SimpleIdentifier.full(andAdvance);
       Label name = new Label.full(label, andAdvance);
       return new NamedExpression.full(name, parseExpression2());
     } else {
       return parseExpression2();
     }
   }
-  
+
   /**
    * Parse an argument definition test.
    * <pre>
    * argumentDefinitionTest ::=
    * '?' identifier
    * </pre>
    * @return the argument definition test that was parsed
    */
   ArgumentDefinitionTest parseArgumentDefinitionTest() {
     Token question = expect2(TokenType.QUESTION);
     SimpleIdentifier identifier = parseSimpleIdentifier();
     return new ArgumentDefinitionTest.full(question, identifier);
   }
-  
+
   /**
    * Parse a list of arguments.
    * <pre>
    * arguments ::=
    * '(' argumentList? ')'
    * argumentList ::=
    * namedArgument (',' namedArgument)
    * | expressionList (',' namedArgument)
    * </pre>
    * @return the argument list that was parsed
@@ skipping 16 matching lines @@
           reportError7(ParserErrorCode.POSITIONAL_AFTER_NAMED_ARGUMENT, []);
           generatedError = true;
         }
       } else if (argument is NamedExpression) {
         foundNamedArgument = true;
       }
     }
     Token rightParenthesis = expect2(TokenType.CLOSE_PAREN);
     return new ArgumentList.full(leftParenthesis, arguments, rightParenthesis);
   }
-  
+
   /**
    * Parse an assert statement.
    * <pre>
    * assertStatement ::=
    * 'assert' '(' conditionalExpression ')' ';'
    * </pre>
    * @return the assert statement
    */
   AssertStatement parseAssertStatement() {
     Token keyword = expect(Keyword.ASSERT);
     Token leftParen = expect2(TokenType.OPEN_PAREN);
     Expression expression = parseConditionalExpression();
     Token rightParen = expect2(TokenType.CLOSE_PAREN);
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new AssertStatement.full(keyword, leftParen, expression, rightParen, semicolon);
   }
-  
+
   /**
    * Parse an assignable expression.
    * <pre>
    * assignableExpression ::=
    * primary (arguments* assignableSelector)+
    * | 'super' assignableSelector
    * | identifier
    * </pre>
    * @param primaryAllowed {@code true} if the expression is allowed to be a primary without any
    * assignable selector
@@ skipping 28 matching lines @@
         if (!isOptional && (expression is PrefixedIdentifier)) {
           PrefixedIdentifier identifier = expression as PrefixedIdentifier;
           expression = new PropertyAccess.full(identifier.prefix, identifier.period, identifier.identifier);
         }
         return expression;
       }
       expression = selectorExpression;
       isOptional = true;
     }
   }
-  
+
   /**
    * Parse an assignable selector.
    * <pre>
    * assignableSelector ::=
    * '\[' expression '\]'
    * | '.' identifier
    * </pre>
    * @param prefix the expression preceding the selector
    * @param optional {@code true} if the selector is optional
    * @return the assignable selector that was parsed
    */
   Expression parseAssignableSelector(Expression prefix, bool optional) {
     if (matches5(TokenType.OPEN_SQUARE_BRACKET)) {
       Token leftBracket = andAdvance;
       Expression index = parseExpression2();
       Token rightBracket = expect2(TokenType.CLOSE_SQUARE_BRACKET);
       return new IndexExpression.forTarget_full(prefix, leftBracket, index, rightBracket);
     } else if (matches5(TokenType.PERIOD)) {
       Token period = andAdvance;
       return new PropertyAccess.full(prefix, period, parseSimpleIdentifier());
     } else {
       if (!optional) {
         reportError7(ParserErrorCode.MISSING_ASSIGNABLE_SELECTOR, []);
       }
       return prefix;
     }
   }
-  
+
   /**
    * Parse a bitwise and expression.
    * <pre>
    * bitwiseAndExpression ::=
    * equalityExpression ('&' equalityExpression)
    * | 'super' ('&' equalityExpression)+
    * </pre>
    * @return the bitwise and expression that was parsed
    */
   Expression parseBitwiseAndExpression() {
     Expression expression;
     if (matches(Keyword.SUPER) && matches4(peek(), TokenType.AMPERSAND)) {
       expression = new SuperExpression.full(andAdvance);
     } else {
       expression = parseEqualityExpression();
     }
     while (matches5(TokenType.AMPERSAND)) {
       Token operator = andAdvance;
       expression = new BinaryExpression.full(expression, operator, parseEqualityExpression());
     }
     return expression;
   }
-  
+
   /**
    * Parse a bitwise or expression.
    * <pre>
    * bitwiseOrExpression ::=
    * bitwiseXorExpression ('|' bitwiseXorExpression)
    * | 'super' ('|' bitwiseXorExpression)+
    * </pre>
    * @return the bitwise or expression that was parsed
    */
   Expression parseBitwiseOrExpression() {
     Expression expression;
     if (matches(Keyword.SUPER) && matches4(peek(), TokenType.BAR)) {
       expression = new SuperExpression.full(andAdvance);
     } else {
       expression = parseBitwiseXorExpression();
     }
     while (matches5(TokenType.BAR)) {
       Token operator = andAdvance;
       expression = new BinaryExpression.full(expression, operator, parseBitwiseXorExpression());
     }
     return expression;
   }
-  
+
   /**
    * Parse a bitwise exclusive-or expression.
    * <pre>
    * bitwiseXorExpression ::=
    * bitwiseAndExpression ('^' bitwiseAndExpression)
    * | 'super' ('^' bitwiseAndExpression)+
    * </pre>
    * @return the bitwise exclusive-or expression that was parsed
    */
   Expression parseBitwiseXorExpression() {
     Expression expression;
     if (matches(Keyword.SUPER) && matches4(peek(), TokenType.CARET)) {
       expression = new SuperExpression.full(andAdvance);
     } else {
       expression = parseBitwiseAndExpression();
     }
     while (matches5(TokenType.CARET)) {
       Token operator = andAdvance;
       expression = new BinaryExpression.full(expression, operator, parseBitwiseAndExpression());
     }
     return expression;
   }
-  
+
   /**
    * Parse a block.
    * <pre>
    * block ::=
    * '{' statements '}'
    * </pre>
    * @return the block that was parsed
    */
   Block parseBlock() {
     Token leftBracket = expect2(TokenType.OPEN_CURLY_BRACKET);
     List<Statement> statements = new List<Statement>();
     Token statementStart = _currentToken;
     while (!matches5(TokenType.EOF) && !matches5(TokenType.CLOSE_CURLY_BRACKET)) {
       Statement statement = parseStatement2();
       if (statement != null) {
         statements.add(statement);
       }
       if (identical(_currentToken, statementStart)) {
         reportError8(ParserErrorCode.UNEXPECTED_TOKEN, _currentToken, [_currentToken.lexeme]);
         advance();
       }
       statementStart = _currentToken;
     }
     Token rightBracket = expect2(TokenType.CLOSE_CURLY_BRACKET);
     return new Block.full(leftBracket, statements, rightBracket);
   }
-  
+
   /**
    * Parse a break statement.
    * <pre>
    * breakStatement ::=
    * 'break' identifier? ';'
    * </pre>
    * @return the break statement that was parsed
    */
   Statement parseBreakStatement() {
     Token breakKeyword = expect(Keyword.BREAK);
     SimpleIdentifier label = null;
     if (matchesIdentifier()) {
       label = parseSimpleIdentifier();
     }
     if (!_inLoop && !_inSwitch && label == null) {
       reportError8(ParserErrorCode.BREAK_OUTSIDE_OF_LOOP, breakKeyword, []);
     }
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new BreakStatement.full(breakKeyword, label, semicolon);
   }
-  
+
   /**
    * Parse a cascade section.
    * <pre>
    * cascadeSection ::=
    * '..' (cascadeSelector arguments*) (assignableSelector arguments*)* cascadeAssignment?
    * cascadeSelector ::=
    * '\[' expression '\]'
    * | identifier
    * cascadeAssignment ::=
    * assignmentOperator expressionWithoutCascade
@@ skipping 44 matching lines @@
         }
       }
     }
     if (_currentToken.type.isAssignmentOperator()) {
       Token operator = andAdvance;
       ensureAssignable(expression);
       expression = new AssignmentExpression.full(expression, operator, parseExpressionWithoutCascade());
     }
     return expression;
   }
-  
+
   /**
    * Parse a class declaration.
    * <pre>
    * classDeclaration ::=
    * metadata 'abstract'? 'class' name typeParameterList? (extendsClause withClause?)? implementsClause? '{' classMembers '}'
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the member
    * @param abstractKeyword the token for the keyword 'abstract', or {@code null} if the keyword was
    * not given
    * @return the class declaration that was parsed
@@ skipping 58 matching lines @@
       leftBracket = expect2(TokenType.OPEN_CURLY_BRACKET);
       members = parseClassMembers(className, getEndToken(leftBracket));
       rightBracket = expect2(TokenType.CLOSE_CURLY_BRACKET);
     } else {
       leftBracket = createSyntheticToken2(TokenType.OPEN_CURLY_BRACKET);
       rightBracket = createSyntheticToken2(TokenType.CLOSE_CURLY_BRACKET);
       reportError7(ParserErrorCode.MISSING_CLASS_BODY, []);
     }
     return new ClassDeclaration.full(commentAndMetadata.comment, commentAndMetadata.metadata, abstractKeyword, keyword, name, typeParameters, extendsClause, withClause, implementsClause, leftBracket, members, rightBracket);
   }
-  
+
   /**
    * Parse a class member.
    * <pre>
    * classMemberDefinition ::=
    * declaration ';'
    * | methodSignature functionBody
    * </pre>
    * @param className the name of the class containing the member being parsed
    * @return the class member that was parsed, or {@code null} if what was found was not a valid
    * class member
@@ skipping 88 matching lines @@
       if (methodName.name == className) {
         reportError(ParserErrorCode.CONSTRUCTOR_WITH_RETURN_TYPE, type, []);
         return parseConstructor(commentAndMetadata, modifiers.externalKeyword, validateModifiersForConstructor(modifiers), modifiers.factoryKeyword, methodName, null, null, parameters);
       }
       validateModifiersForGetterOrSetterOrMethod(modifiers);
       validateFormalParameterList(parameters);
       return parseMethodDeclaration2(commentAndMetadata, modifiers.externalKeyword, modifiers.staticKeyword, type, methodName, parameters);
     }
     return parseInitializedIdentifierList(commentAndMetadata, modifiers.staticKeyword, validateModifiersForField(modifiers), type);
   }
-  
+
   /**
    * Parse a list of class members.
    * <pre>
    * classMembers ::=
    * (metadata memberDefinition)
    * </pre>
    * @param className the name of the class whose members are being parsed
    * @param closingBracket the closing bracket for the class, or {@code null} if the closing bracket
    * is missing
    * @return the list of class members that were parsed
@@ skipping 12 matching lines @@
         }
       }
       if (identical(_currentToken, memberStart)) {
         reportError8(ParserErrorCode.UNEXPECTED_TOKEN, _currentToken, [_currentToken.lexeme]);
         advance();
       }
       memberStart = _currentToken;
     }
     return members;
   }
-  
+
   /**
    * Parse a class type alias.
    * <pre>
    * classTypeAlias ::=
    * identifier typeParameters? '=' 'abstract'? mixinApplication
    * mixinApplication ::=
    * type withClause implementsClause? ';'
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the member
    * @param keyword the token representing the 'typedef' keyword
@@ skipping 28 matching lines @@
         Token leftBracket = andAdvance;
         parseClassMembers(className.name, getEndToken(leftBracket));
         expect2(TokenType.CLOSE_CURLY_BRACKET);
       } else {
         reportError8(ParserErrorCode.EXPECTED_TOKEN, _currentToken.previous, [TokenType.SEMICOLON.lexeme]);
       }
       semicolon = createSyntheticToken2(TokenType.SEMICOLON);
     }
     return new ClassTypeAlias.full(commentAndMetadata.comment, commentAndMetadata.metadata, keyword, className, typeParameters, equals, abstractKeyword, superclass, withClause, implementsClause, semicolon);
   }
-  
+
   /**
    * Parse a list of combinators in a directive.
    * <pre>
    * combinator ::=
    * 'show' identifier (',' identifier)
    * | 'hide' identifier (',' identifier)
    * </pre>
    * @return the combinators that were parsed
    */
   List<Combinator> parseCombinators() {
     List<Combinator> combinators = new List<Combinator>();
     while (matches2(_SHOW) || matches2(_HIDE)) {
       Token keyword = expect2(TokenType.IDENTIFIER);
       if (keyword.lexeme == _SHOW) {
         List<SimpleIdentifier> shownNames = parseIdentifierList();
         combinators.add(new ShowCombinator.full(keyword, shownNames));
       } else {
         List<SimpleIdentifier> hiddenNames = parseIdentifierList();
         combinators.add(new HideCombinator.full(keyword, hiddenNames));
       }
     }
     return combinators;
   }
-  
+
   /**
    * Parse the documentation comment and metadata preceeding a declaration. This method allows any
    * number of documentation comments to occur before, after or between the metadata, but only
    * returns the last (right-most) documentation comment that is found.
    * <pre>
    * metadata ::=
    * annotation
    * </pre>
    * @return the documentation comment and metadata that were parsed
    */
   CommentAndMetadata parseCommentAndMetadata() {
     Comment comment = parseDocumentationComment();
     List<Annotation> metadata = new List<Annotation>();
     while (matches5(TokenType.AT)) {
       metadata.add(parseAnnotation());
       Comment optionalComment = parseDocumentationComment();
       if (optionalComment != null) {
         comment = optionalComment;
       }
     }
     return new CommentAndMetadata(comment, metadata);
   }
-  
+
   /**
    * Parse a comment reference from the source between square brackets.
    * <pre>
    * commentReference ::=
    * 'new'? prefixedIdentifier
    * </pre>
    * @param referenceSource the source occurring between the square brackets within a documentation
    * comment
    * @param sourceOffset the offset of the first character of the reference source
    * @return the comment reference that was parsed, or {@code null} if no reference could be found
@@ skipping 32 matching lines @@
           return null;
         }
         return new CommentReference.full(newKeyword, identifier);
       } else if (matches3(firstToken, Keyword.THIS) || matches3(firstToken, Keyword.NULL) || matches3(firstToken, Keyword.TRUE) || matches3(firstToken, Keyword.FALSE)) {
         return null;
       }
     } catch (exception) {
     }
     return null;
   }
-  
+
   /**
    * Parse all of the comment references occurring in the given array of documentation comments.
    * <pre>
    * commentReference ::=
    * '\[' 'new'? qualified '\]' libraryReference?
    * libraryReference ::=
    * '(' stringLiteral ')'
    * </pre>
    * @param tokens the comment tokens representing the documentation comments to be parsed
    * @return the comment references that were parsed
@@ skipping 24 matching lines @@
             rightIndex = leftIndex + 1;
           }
           leftIndex = comment.indexOf('[', rightIndex);
         } else {
           leftIndex = comment.indexOf('[', range[1] + 1);
         }
       }
     }
     return references;
   }
-  
+
   /**
    * Parse a compilation unit.
    * <p>
    * Specified:
    * <pre>
    * compilationUnit ::=
    * scriptTag? directive* topLevelDeclaration
    * </pre>
    * Actual:
    * <pre>
@@ skipping 72 matching lines @@
         reportError8(ParserErrorCode.UNEXPECTED_TOKEN, _currentToken, [_currentToken.lexeme]);
         advance();
         while (!matches5(TokenType.EOF) && !couldBeStartOfCompilationUnitMember()) {
           advance();
         }
       }
       memberStart = _currentToken;
     }
     return new CompilationUnit.full(firstToken, scriptTag, directives, declarations, _currentToken);
   }
-  
+
   /**
    * Parse a compilation unit member.
    * <pre>
    * compilationUnitMember ::=
    * classDefinition
    * | functionTypeAlias
    * | external functionSignature
    * | external getterSignature
    * | external setterSignature
    * | functionSignature functionBody
@@ skipping 62 matching lines @@
     } else if (!matchesIdentifier()) {
       reportError8(ParserErrorCode.EXPECTED_EXECUTABLE, _currentToken, []);
       return null;
     }
     if (matchesAny(peek(), [TokenType.OPEN_PAREN, TokenType.FUNCTION, TokenType.OPEN_CURLY_BRACKET])) {
       validateModifiersForTopLevelFunction(modifiers);
       return parseFunctionDeclaration(commentAndMetadata, modifiers.externalKeyword, returnType);
     }
     return new TopLevelVariableDeclaration.full(commentAndMetadata.comment, commentAndMetadata.metadata, parseVariableDeclarationList2(null, validateModifiersForTopLevelVariable(modifiers), returnType), expect2(TokenType.SEMICOLON));
   }
-  
+
   /**
    * Parse a conditional expression.
    * <pre>
    * conditionalExpression ::=
    * logicalOrExpression ('?' expressionWithoutCascade ':' expressionWithoutCascade)?
    * </pre>
    * @return the conditional expression that was parsed
    */
   Expression parseConditionalExpression() {
     Expression condition = parseLogicalOrExpression();
     if (!matches5(TokenType.QUESTION)) {
       return condition;
     }
     Token question = andAdvance;
     Expression thenExpression = parseExpressionWithoutCascade();
     Token colon = expect2(TokenType.COLON);
     Expression elseExpression = parseExpressionWithoutCascade();
     return new ConditionalExpression.full(condition, question, thenExpression, colon, elseExpression);
   }
-  
+
   /**
    * Parse a const expression.
    * <pre>
    * constExpression ::=
    * instanceCreationExpression
    * | listLiteral
    * | mapLiteral
    * </pre>
    * @return the const expression that was parsed
    */
@@ skipping 50 matching lines @@
       } else {
         if (constKeyword != null) {
           reportError(ParserErrorCode.CONST_CONSTRUCTOR_WITH_BODY, body, []);
         } else if (!bodyAllowed) {
           reportError(ParserErrorCode.EXTERNAL_CONSTRUCTOR_WITH_BODY, body, []);
         }
       }
     }
     return new ConstructorDeclaration.full(commentAndMetadata.comment, commentAndMetadata.metadata, externalKeyword, constKeyword, factoryKeyword, returnType, period, name, parameters, separator, initializers, redirectedConstructor, body);
   }
-  
+
   /**
    * Parse a field initializer within a constructor.
    * <pre>
    * fieldInitializer:
    * ('this' '.')? identifier '=' conditionalExpression cascadeSection
    * </pre>
    * @return the field initializer that was parsed
    */
   ConstructorFieldInitializer parseConstructorFieldInitializer() {
     Token keyword = null;
@@ skipping 12 matching lines @@
         Expression section = parseCascadeSection();
         if (section != null) {
           cascadeSections.add(section);
         }
         tokenType = _currentToken.type;
       }
       expression = new CascadeExpression.full(expression, cascadeSections);
     }
     return new ConstructorFieldInitializer.full(keyword, period, fieldName, equals, expression);
   }
-  
+
   /**
    * Parse the name of a constructor.
    * <pre>
    * constructorName:
    * type ('.' identifier)?
    * </pre>
    * @return the constructor name that was parsed
    */
   ConstructorName parseConstructorName() {
     TypeName type = parseTypeName();
     Token period = null;
     SimpleIdentifier name = null;
     if (matches5(TokenType.PERIOD)) {
       period = andAdvance;
       name = parseSimpleIdentifier();
     }
     return new ConstructorName.full(type, period, name);
   }
-  
+
   /**
    * Parse a continue statement.
    * <pre>
    * continueStatement ::=
    * 'continue' identifier? ';'
    * </pre>
    * @return the continue statement that was parsed
    */
   Statement parseContinueStatement() {
     Token continueKeyword = expect(Keyword.CONTINUE);
     if (!_inLoop && !_inSwitch) {
       reportError8(ParserErrorCode.CONTINUE_OUTSIDE_OF_LOOP, continueKeyword, []);
     }
     SimpleIdentifier label = null;
     if (matchesIdentifier()) {
       label = parseSimpleIdentifier();
     }
     if (_inSwitch && !_inLoop && label == null) {
       reportError8(ParserErrorCode.CONTINUE_WITHOUT_LABEL_IN_CASE, continueKeyword, []);
     }
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new ContinueStatement.full(continueKeyword, label, semicolon);
   }
-  
+
   /**
    * Parse a directive.
    * <pre>
    * directive ::=
    * exportDirective
    * | libraryDirective
    * | importDirective
    * | partDirective
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the directive
    * @return the directive that was parsed
    */
   Directive parseDirective(CommentAndMetadata commentAndMetadata) {
     if (matches(Keyword.IMPORT)) {
       return parseImportDirective(commentAndMetadata);
     } else if (matches(Keyword.EXPORT)) {
       return parseExportDirective(commentAndMetadata);
     } else if (matches(Keyword.LIBRARY)) {
       return parseLibraryDirective(commentAndMetadata);
     } else if (matches(Keyword.PART)) {
       return parsePartDirective(commentAndMetadata);
     } else {
       throw new IllegalStateException("parseDirective invoked in an invalid state; currentToken = ${_currentToken}");
     }
   }
-  
+
   /**
    * Parse a documentation comment.
    * <pre>
    * documentationComment ::=
    * multiLineComment?
    * | singleLineComment
    * </pre>
    * @return the documentation comment that was parsed, or {@code null} if there was no comment
    */
   Comment parseDocumentationComment() {
@@ skipping 15 matching lines @@
       }
       commentToken = commentToken.next;
     }
     if (commentTokens.isEmpty) {
       return null;
     }
     List<Token> tokens = new List.from(commentTokens);
     List<CommentReference> references = parseCommentReferences(tokens);
     return Comment.createDocumentationComment2(tokens, references);
   }
-  
+
   /**
    * Parse a do statement.
    * <pre>
    * doStatement ::=
    * 'do' statement 'while' '(' expression ')' ';'
    * </pre>
    * @return the do statement that was parsed
    */
   Statement parseDoStatement() {
     bool wasInLoop = _inLoop;
     _inLoop = true;
     try {
       Token doKeyword = expect(Keyword.DO);
       Statement body = parseStatement2();
       Token whileKeyword = expect(Keyword.WHILE);
       Token leftParenthesis = expect2(TokenType.OPEN_PAREN);
       Expression condition = parseExpression2();
       Token rightParenthesis = expect2(TokenType.CLOSE_PAREN);
       Token semicolon = expect2(TokenType.SEMICOLON);
       return new DoStatement.full(doKeyword, body, whileKeyword, leftParenthesis, condition, rightParenthesis, semicolon);
     } finally {
       _inLoop = wasInLoop;
     }
   }
-  
+
   /**
    * Parse an empty statement.
    * <pre>
    * emptyStatement ::=
    * ';'
    * </pre>
    * @return the empty statement that was parsed
    */
   Statement parseEmptyStatement() => new EmptyStatement.full(andAdvance);
-  
+
   /**
    * Parse an equality expression.
    * <pre>
    * equalityExpression ::=
    * relationalExpression (equalityOperator relationalExpression)?
    * | 'super' equalityOperator relationalExpression
    * </pre>
    * @return the equality expression that was parsed
    */
   Expression parseEqualityExpression() {
     Expression expression;
     if (matches(Keyword.SUPER) && _currentToken.next.type.isEqualityOperator()) {
       expression = new SuperExpression.full(andAdvance);
     } else {
       expression = parseRelationalExpression();
     }
     while (_currentToken.type.isEqualityOperator()) {
       Token operator = andAdvance;
       expression = new BinaryExpression.full(expression, operator, parseRelationalExpression());
     }
     return expression;
   }
-  
+
   /**
    * Parse an export directive.
    * <pre>
    * exportDirective ::=
    * metadata 'export' stringLiteral combinator*';'
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the directive
    * @return the export directive that was parsed
    */
   ExportDirective parseExportDirective(CommentAndMetadata commentAndMetadata) {
     Token exportKeyword = expect(Keyword.EXPORT);
     StringLiteral libraryUri = parseStringLiteral();
     List<Combinator> combinators = parseCombinators();
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new ExportDirective.full(commentAndMetadata.comment, commentAndMetadata.metadata, exportKeyword, libraryUri, combinators, semicolon);
   }
-  
+
   /**
    * Parse an expression that does not contain any cascades.
    * <pre>
    * expression ::=
    * assignableExpression assignmentOperator expression
    * | conditionalExpression cascadeSection
    * | throwExpression
    * </pre>
    * @return the expression that was parsed
    */
@@ skipping 15 matching lines @@
         tokenType = _currentToken.type;
       }
       return new CascadeExpression.full(expression, cascadeSections);
     } else if (tokenType.isAssignmentOperator()) {
       Token operator = andAdvance;
       ensureAssignable(expression);
       return new AssignmentExpression.full(expression, operator, parseExpression2());
     }
     return expression;
   }
-  
+
   /**
    * Parse a list of expressions.
    * <pre>
    * expressionList ::=
    * expression (',' expression)
    * </pre>
    * @return the expression that was parsed
    */
   List<Expression> parseExpressionList() {
     List<Expression> expressions = new List<Expression>();
     expressions.add(parseExpression2());
     while (optional(TokenType.COMMA)) {
       expressions.add(parseExpression2());
     }
     return expressions;
   }
-  
+
   /**
    * Parse an expression that does not contain any cascades.
    * <pre>
    * expressionWithoutCascade ::=
    * assignableExpression assignmentOperator expressionWithoutCascade
    * | conditionalExpression
    * | throwExpressionWithoutCascade
    * </pre>
    * @return the expression that was parsed
    */
   Expression parseExpressionWithoutCascade() {
     if (matches(Keyword.THROW)) {
       return parseThrowExpressionWithoutCascade();
     } else if (matches(Keyword.RETHROW)) {
       return parseRethrowExpression();
     }
     Expression expression = parseConditionalExpression();
     if (_currentToken.type.isAssignmentOperator()) {
       Token operator = andAdvance;
       ensureAssignable(expression);
       expression = new AssignmentExpression.full(expression, operator, parseExpressionWithoutCascade());
     }
     return expression;
   }
-  
+
   /**
    * Parse a class extends clause.
    * <pre>
    * classExtendsClause ::=
    * 'extends' type
    * </pre>
    * @return the class extends clause that was parsed
    */
   ExtendsClause parseExtendsClause() {
     Token keyword = expect(Keyword.EXTENDS);
     TypeName superclass = parseTypeName();
     return new ExtendsClause.full(keyword, superclass);
   }
-  
+
   /**
    * Parse the 'final', 'const', 'var' or type preceding a variable declaration.
    * <pre>
    * finalConstVarOrType ::=
    * | 'final' type?
    * | 'const' type?
    * | 'var'
    * | type
    * </pre>
    * @param optional {@code true} if the keyword and type are optional
@@ skipping 11 matching lines @@
       keyword = andAdvance;
     } else {
       if (matchesIdentifier2(peek()) || matches4(peek(), TokenType.LT) || matches3(peek(), Keyword.THIS) || (matches4(peek(), TokenType.PERIOD) && matchesIdentifier2(peek2(2)) && (matchesIdentifier2(peek2(3)) || matches4(peek2(3), TokenType.LT) || matches3(peek2(3), Keyword.THIS)))) {
         type = parseReturnType();
       } else if (!optional) {
         reportError7(ParserErrorCode.MISSING_CONST_FINAL_VAR_OR_TYPE, []);
       }
     }
     return new FinalConstVarOrType(keyword, type);
   }
-  
+
   /**
    * Parse a formal parameter. At most one of {@code isOptional} and {@code isNamed} can be{@code true}.
    * <pre>
    * defaultFormalParameter ::=
    * normalFormalParameter ('=' expression)?
    * defaultNamedParameter ::=
    * normalFormalParameter (':' expression)?
    * </pre>
    * @param kind the kind of parameter being expected based on the presence or absence of group
    * delimiters
@@ skipping 17 matching lines @@
         reportError8(ParserErrorCode.WRONG_SEPARATOR_FOR_POSITIONAL_PARAMETER, seperator, []);
       } else if (identical(kind, ParameterKind.REQUIRED)) {
         reportError(ParserErrorCode.NAMED_PARAMETER_OUTSIDE_GROUP, parameter, []);
       }
       return new DefaultFormalParameter.full(parameter, kind, seperator, defaultValue);
     } else if (kind != ParameterKind.REQUIRED) {
       return new DefaultFormalParameter.full(parameter, kind, null, null);
     }
     return parameter;
   }
-  
+
   /**
    * Parse a list of formal parameters.
    * <pre>
    * formalParameterList ::=
    * '(' ')'
    * | '(' normalFormalParameters (',' optionalFormalParameters)? ')'
    * | '(' optionalFormalParameters ')'
    * normalFormalParameters ::=
    * normalFormalParameter (',' normalFormalParameter)
    * optionalFormalParameters ::=
@@ skipping 102 matching lines @@
       reportError7(ParserErrorCode.MISSING_TERMINATOR_FOR_PARAMETER_GROUP, ["}"]);
     }
     if (leftSquareBracket == null) {
       leftSquareBracket = leftCurlyBracket;
     }
     if (rightSquareBracket == null) {
       rightSquareBracket = rightCurlyBracket;
     }
     return new FormalParameterList.full(leftParenthesis, parameters, leftSquareBracket, rightSquareBracket, rightParenthesis);
   }
-  
+
   /**
    * Parse a for statement.
    * <pre>
    * forStatement ::=
    * 'for' '(' forLoopParts ')' statement
    * forLoopParts ::=
    * forInitializerStatement expression? ';' expressionList?
    * | declaredIdentifier 'in' expression
    * | identifier 'in' expression
    * forInitializerStatement ::=
@@ skipping 54 matching lines @@
       if (!matches5(TokenType.CLOSE_PAREN)) {
         updaters = parseExpressionList();
       }
       Token rightParenthesis = expect2(TokenType.CLOSE_PAREN);
       Statement body = parseStatement2();
       return new ForStatement.full(forKeyword, leftParenthesis, variableList, initialization, leftSeparator, condition, rightSeparator, updaters, rightParenthesis, body);
     } finally {
       _inLoop = wasInLoop;
     }
   }
-  
+
   /**
    * Parse a function body.
    * <pre>
    * functionBody ::=
    * '=>' expression ';'
    * | block
    * functionExpressionBody ::=
    * '=>' expression
    * | block
    * </pre>
@@ skipping 33 matching lines @@
         return new NativeFunctionBody.full(nativeToken, stringLiteral, expect2(TokenType.SEMICOLON));
       } else {
         reportError7(emptyErrorCode, []);
         return new EmptyFunctionBody.full(createSyntheticToken2(TokenType.SEMICOLON));
       }
     } finally {
       _inLoop = wasInLoop;
       _inSwitch = wasInSwitch;
     }
   }
-  
+
   /**
    * Parse a function declaration.
    * <pre>
    * functionDeclaration ::=
    * functionSignature functionBody
    * | returnType? getOrSet identifier formalParameterList functionBody
    * </pre>
    * @param commentAndMetadata the documentation comment and metadata to be associated with the
    * declaration
    * @param externalKeyword the 'external' keyword, or {@code null} if the function is not external
@@ skipping 24 matching lines @@
       parseFormalParameterList();
     }
     FunctionBody body;
     if (externalKeyword == null) {
       body = parseFunctionBody(false, ParserErrorCode.MISSING_FUNCTION_BODY, false);
     } else {
       body = new EmptyFunctionBody.full(expect2(TokenType.SEMICOLON));
     }
     return new FunctionDeclaration.full(commentAndMetadata.comment, commentAndMetadata.metadata, externalKeyword, returnType, keyword, name, new FunctionExpression.full(parameters, body));
   }
-  
+
   /**
    * Parse a function declaration statement.
    * <pre>
    * functionDeclarationStatement ::=
    * functionSignature functionBody
    * </pre>
    * @return the function declaration statement that was parsed
    */
   Statement parseFunctionDeclarationStatement() => parseFunctionDeclarationStatement2(parseCommentAndMetadata(), parseOptionalReturnType());
-  
+
   /**
    * Parse a function declaration statement.
    * <pre>
    * functionDeclarationStatement ::=
    * functionSignature functionBody
    * </pre>
    * @param commentAndMetadata the documentation comment and metadata to be associated with the
    * declaration
    * @param returnType the return type, or {@code null} if there is no return type
    * @return the function declaration statement that was parsed
    */
   Statement parseFunctionDeclarationStatement2(CommentAndMetadata commentAndMetadata, TypeName returnType) => new FunctionDeclarationStatement.full(parseFunctionDeclaration(commentAndMetadata, null, returnType));
-  
+
   /**
    * Parse a function expression.
    * <pre>
    * functionExpression ::=
    * formalParameterList functionExpressionBody
    * </pre>
    * @return the function expression that was parsed
    */
   FunctionExpression parseFunctionExpression() {
     FormalParameterList parameters = parseFormalParameterList();
     validateFormalParameterList(parameters);
     FunctionBody body = parseFunctionBody(false, ParserErrorCode.MISSING_FUNCTION_BODY, true);
     return new FunctionExpression.full(parameters, body);
   }
-  
+
   /**
    * Parse a function type alias.
    * <pre>
    * functionTypeAlias ::=
    * functionPrefix typeParameterList? formalParameterList ';'
    * functionPrefix ::=
    * returnType? name
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the member
    * @param keyword the token representing the 'typedef' keyword
@@ skipping 16 matching lines @@
       return new FunctionTypeAlias.full(commentAndMetadata.comment, commentAndMetadata.metadata, keyword, returnType, name, typeParameters, parameters, semicolon);
     } else if (!matches5(TokenType.OPEN_PAREN)) {
       reportError7(ParserErrorCode.MISSING_TYPEDEF_PARAMETERS, []);
       return new FunctionTypeAlias.full(commentAndMetadata.comment, commentAndMetadata.metadata, keyword, returnType, name, typeParameters, new FormalParameterList.full(createSyntheticToken2(TokenType.OPEN_PAREN), null, null, null, createSyntheticToken2(TokenType.CLOSE_PAREN)), createSyntheticToken2(TokenType.SEMICOLON));
     }
     FormalParameterList parameters = parseFormalParameterList();
     validateFormalParameterList(parameters);
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new FunctionTypeAlias.full(commentAndMetadata.comment, commentAndMetadata.metadata, keyword, returnType, name, typeParameters, parameters, semicolon);
   }
-  
+
   /**
    * Parse a getter.
    * <pre>
    * getter ::=
    * getterSignature functionBody?
    * getterSignature ::=
    * 'external'? 'static'? returnType? 'get' identifier
    * </pre>
    * @param commentAndMetadata the documentation comment and metadata to be associated with the
    * declaration
@@ skipping 10 matching lines @@
       reportError7(ParserErrorCode.GETTER_WITH_PARAMETERS, []);
       advance();
       advance();
     }
     FunctionBody body = parseFunctionBody(externalKeyword != null || staticKeyword == null, ParserErrorCode.STATIC_GETTER_WITHOUT_BODY, false);
     if (externalKeyword != null && body is! EmptyFunctionBody) {
       reportError7(ParserErrorCode.EXTERNAL_GETTER_WITH_BODY, []);
     }
     return new MethodDeclaration.full(commentAndMetadata.comment, commentAndMetadata.metadata, externalKeyword, staticKeyword, returnType, propertyKeyword, null, name, null, body);
   }
-  
+
   /**
    * Parse a list of identifiers.
    * <pre>
    * identifierList ::=
    * identifier (',' identifier)
    * </pre>
    * @return the list of identifiers that were parsed
    */
   List<SimpleIdentifier> parseIdentifierList() {
     List<SimpleIdentifier> identifiers = new List<SimpleIdentifier>();
     identifiers.add(parseSimpleIdentifier());
     while (matches5(TokenType.COMMA)) {
       advance();
       identifiers.add(parseSimpleIdentifier());
     }
     return identifiers;
   }
-  
+
   /**
    * Parse an if statement.
    * <pre>
    * ifStatement ::=
    * 'if' '(' expression ')' statement ('else' statement)?
    * </pre>
    * @return the if statement that was parsed
    */
   Statement parseIfStatement() {
     Token ifKeyword = expect(Keyword.IF);
     Token leftParenthesis = expect2(TokenType.OPEN_PAREN);
     Expression condition = parseExpression2();
     Token rightParenthesis = expect2(TokenType.CLOSE_PAREN);
     Statement thenStatement = parseStatement2();
     Token elseKeyword = null;
     Statement elseStatement = null;
     if (matches(Keyword.ELSE)) {
       elseKeyword = andAdvance;
       elseStatement = parseStatement2();
     }
     return new IfStatement.full(ifKeyword, leftParenthesis, condition, rightParenthesis, thenStatement, elseKeyword, elseStatement);
   }
-  
+
   /**
    * Parse an implements clause.
    * <pre>
    * implementsClause ::=
    * 'implements' type (',' type)
    * </pre>
    * @return the implements clause that was parsed
    */
   ImplementsClause parseImplementsClause() {
     Token keyword = expect(Keyword.IMPLEMENTS);
     List<TypeName> interfaces = new List<TypeName>();
     interfaces.add(parseTypeName());
     while (optional(TokenType.COMMA)) {
       interfaces.add(parseTypeName());
     }
     return new ImplementsClause.full(keyword, interfaces);
   }
-  
+
   /**
    * Parse an import directive.
    * <pre>
    * importDirective ::=
    * metadata 'import' stringLiteral ('as' identifier)? combinator*';'
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the directive
    * @return the import directive that was parsed
    */
   ImportDirective parseImportDirective(CommentAndMetadata commentAndMetadata) {
     Token importKeyword = expect(Keyword.IMPORT);
     StringLiteral libraryUri = parseStringLiteral();
     Token asToken = null;
     SimpleIdentifier prefix = null;
     if (matches(Keyword.AS)) {
       asToken = andAdvance;
       prefix = parseSimpleIdentifier();
     }
     List<Combinator> combinators = parseCombinators();
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new ImportDirective.full(commentAndMetadata.comment, commentAndMetadata.metadata, importKeyword, libraryUri, asToken, prefix, combinators, semicolon);
   }
-  
+
   /**
    * Parse a list of initialized identifiers.
    * <pre>
    * ?? ::=
    * 'static'? ('var' | type) initializedIdentifierList ';'
    * | 'final' type? initializedIdentifierList ';'
    * initializedIdentifierList ::=
    * initializedIdentifier (',' initializedIdentifier)
    * initializedIdentifier ::=
    * identifier ('=' expression)?
    * </pre>
    * @param commentAndMetadata the documentation comment and metadata to be associated with the
    * declaration
    * @param staticKeyword the static keyword, or {@code null} if the getter is not static
    * @param keyword the token representing the 'final', 'const' or 'var' keyword, or {@code null} if
    * there is no keyword
    * @param type the type that has already been parsed, or {@code null} if 'var' was provided
    * @return the getter that was parsed
    */
   FieldDeclaration parseInitializedIdentifierList(CommentAndMetadata commentAndMetadata, Token staticKeyword, Token keyword, TypeName type) {
     VariableDeclarationList fieldList = parseVariableDeclarationList2(null, keyword, type);
     return new FieldDeclaration.full(commentAndMetadata.comment, commentAndMetadata.metadata, staticKeyword, fieldList, expect2(TokenType.SEMICOLON));
   }
-  
+
   /**
    * Parse an instance creation expression.
    * <pre>
    * instanceCreationExpression ::=
    * ('new' | 'const') type ('.' identifier)? argumentList
    * </pre>
    * @param keyword the 'new' or 'const' keyword that introduces the expression
    * @return the instance creation expression that was parsed
    */
   InstanceCreationExpression parseInstanceCreationExpression(Token keyword) {
     ConstructorName constructorName = parseConstructorName();
     ArgumentList argumentList = parseArgumentList();
     return new InstanceCreationExpression.full(keyword, constructorName, argumentList);
   }
-  
+
   /**
    * Parse a library directive.
    * <pre>
    * libraryDirective ::=
    * metadata 'library' identifier ';'
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the directive
    * @return the library directive that was parsed
    */
   LibraryDirective parseLibraryDirective(CommentAndMetadata commentAndMetadata) {
     Token keyword = expect(Keyword.LIBRARY);
     LibraryIdentifier libraryName = parseLibraryName(ParserErrorCode.MISSING_NAME_IN_LIBRARY_DIRECTIVE, keyword);
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new LibraryDirective.full(commentAndMetadata.comment, commentAndMetadata.metadata, keyword, libraryName, semicolon);
   }
-  
+
   /**
    * Parse a library identifier.
    * <pre>
    * libraryIdentifier ::=
    * identifier ('.' identifier)
    * </pre>
    * @return the library identifier that was parsed
    */
   LibraryIdentifier parseLibraryIdentifier() {
     List<SimpleIdentifier> components = new List<SimpleIdentifier>();
     components.add(parseSimpleIdentifier());
     while (matches5(TokenType.PERIOD)) {
       advance();
       components.add(parseSimpleIdentifier());
     }
     return new LibraryIdentifier.full(components);
   }
-  
+
   /**
    * Parse a library name.
    * <pre>
    * libraryName ::=
    * libraryIdentifier
    * </pre>
    * @param missingNameError the error code to be used if the library name is missing
    * @param missingNameToken the token associated with the error produced if the library name is
    * missing
    * @return the library name that was parsed
    */
   LibraryIdentifier parseLibraryName(ParserErrorCode missingNameError, Token missingNameToken) {
     if (matchesIdentifier()) {
       return parseLibraryIdentifier();
     } else if (matches5(TokenType.STRING)) {
       StringLiteral string = parseStringLiteral();
       reportError(ParserErrorCode.NON_IDENTIFIER_LIBRARY_NAME, string, []);
     } else {
       reportError8(missingNameError, missingNameToken, []);
     }
     List<SimpleIdentifier> components = new List<SimpleIdentifier>();
     components.add(createSyntheticIdentifier());
     return new LibraryIdentifier.full(components);
   }
-  
+
   /**
    * Parse a list literal.
    * <pre>
    * listLiteral ::=
    * 'const'? typeArguments? '\[' (expressionList ','?)? '\]'
    * </pre>
    * @param modifier the 'const' modifier appearing before the literal, or {@code null} if there is
    * no modifier
    * @param typeArguments the type arguments appearing before the literal, or {@code null} if there
    * are no type arguments
@@ skipping 18 matching lines @@
     elements.add(parseExpression2());
     while (optional(TokenType.COMMA)) {
       if (matches5(TokenType.CLOSE_SQUARE_BRACKET)) {
         return new ListLiteral.full(modifier, typeArguments, leftBracket, elements, andAdvance);
       }
       elements.add(parseExpression2());
     }
     Token rightBracket = expect2(TokenType.CLOSE_SQUARE_BRACKET);
     return new ListLiteral.full(modifier, typeArguments, leftBracket, elements, rightBracket);
   }
-  
+
   /**
    * Parse a list or map literal.
    * <pre>
    * listOrMapLiteral ::=
    * listLiteral
    * | mapLiteral
    * </pre>
    * @param modifier the 'const' modifier appearing before the literal, or {@code null} if there is
    * no modifier
    * @return the list or map literal that was parsed
    */
   TypedLiteral parseListOrMapLiteral(Token modifier) {
     TypeArgumentList typeArguments = null;
     if (matches5(TokenType.LT)) {
       typeArguments = parseTypeArgumentList();
     }
     if (matches5(TokenType.OPEN_CURLY_BRACKET)) {
       return parseMapLiteral(modifier, typeArguments);
     } else if (matches5(TokenType.OPEN_SQUARE_BRACKET) || matches5(TokenType.INDEX)) {
       return parseListLiteral(modifier, typeArguments);
     }
     reportError7(ParserErrorCode.EXPECTED_LIST_OR_MAP_LITERAL, []);
     return new ListLiteral.full(modifier, typeArguments, createSyntheticToken2(TokenType.OPEN_SQUARE_BRACKET), null, createSyntheticToken2(TokenType.CLOSE_SQUARE_BRACKET));
   }
-  
+
   /**
    * Parse a logical and expression.
    * <pre>
    * logicalAndExpression ::=
    * bitwiseOrExpression ('&&' bitwiseOrExpression)
    * </pre>
    * @return the logical and expression that was parsed
    */
   Expression parseLogicalAndExpression() {
     Expression expression = parseBitwiseOrExpression();
     while (matches5(TokenType.AMPERSAND_AMPERSAND)) {
       Token operator = andAdvance;
       expression = new BinaryExpression.full(expression, operator, parseBitwiseOrExpression());
     }
     return expression;
   }
-  
+
   /**
    * Parse a logical or expression.
    * <pre>
    * logicalOrExpression ::=
    * logicalAndExpression ('||' logicalAndExpression)
    * </pre>
    * @return the logical or expression that was parsed
    */
   Expression parseLogicalOrExpression() {
     Expression expression = parseLogicalAndExpression();
     while (matches5(TokenType.BAR_BAR)) {
       Token operator = andAdvance;
       expression = new BinaryExpression.full(expression, operator, parseLogicalAndExpression());
     }
     return expression;
   }
-  
+
   /**
    * Parse a map literal.
    * <pre>
    * mapLiteral ::=
    * 'const'? typeArguments? '{' (mapLiteralEntry (',' mapLiteralEntry)* ','?)? '}'
    * </pre>
    * @param modifier the 'const' modifier appearing before the literal, or {@code null} if there is
    * no modifier
    * @param typeArguments the type arguments that were declared, or {@code null} if there are no
    * type arguments
@@ skipping 14 matching lines @@
     entries.add(parseMapLiteralEntry());
     while (optional(TokenType.COMMA)) {
       if (matches5(TokenType.CLOSE_CURLY_BRACKET)) {
         return new MapLiteral.full(modifier, typeArguments, leftBracket, entries, andAdvance);
       }
       entries.add(parseMapLiteralEntry());
     }
     Token rightBracket = expect2(TokenType.CLOSE_CURLY_BRACKET);
     return new MapLiteral.full(modifier, typeArguments, leftBracket, entries, rightBracket);
   }
-  
+
   /**
    * Parse a map literal entry.
    * <pre>
    * mapLiteralEntry ::=
    * expression ':' expression
    * </pre>
    * @return the map literal entry that was parsed
    */
   MapLiteralEntry parseMapLiteralEntry() {
     Expression key = parseExpression2();
     Token separator = expect2(TokenType.COLON);
     Expression value = parseExpression2();
     return new MapLiteralEntry.full(key, separator, value);
   }
-  
+
   /**
    * Parse a method declaration.
    * <pre>
    * functionDeclaration ::=
    * 'external'? 'static'? functionSignature functionBody
    * | 'external'? functionSignature ';'
    * </pre>
    * @param commentAndMetadata the documentation comment and metadata to be associated with the
    * declaration
    * @param externalKeyword the 'external' token
    * @param staticKeyword the static keyword, or {@code null} if the getter is not static
    * @param returnType the return type of the method
    * @return the method declaration that was parsed
    */
   MethodDeclaration parseMethodDeclaration(CommentAndMetadata commentAndMetadata, Token externalKeyword, Token staticKeyword, TypeName returnType) {
     SimpleIdentifier methodName = parseSimpleIdentifier();
     FormalParameterList parameters = parseFormalParameterList();
     validateFormalParameterList(parameters);
     return parseMethodDeclaration2(commentAndMetadata, externalKeyword, staticKeyword, returnType, methodName, parameters);
   }
-  
+
   /**
    * Parse a method declaration.
    * <pre>
    * functionDeclaration ::=
    * ('external' 'static'?)? functionSignature functionBody
    * | 'external'? functionSignature ';'
    * </pre>
    * @param commentAndMetadata the documentation comment and metadata to be associated with the
    * declaration
    * @param externalKeyword the 'external' token
    * @param staticKeyword the static keyword, or {@code null} if the getter is not static
    * @param returnType the return type of the method
    * @param name the name of the method
    * @param parameters the parameters to the method
    * @return the method declaration that was parsed
    */
   MethodDeclaration parseMethodDeclaration2(CommentAndMetadata commentAndMetadata, Token externalKeyword, Token staticKeyword, TypeName returnType, SimpleIdentifier name, FormalParameterList parameters) {
     FunctionBody body = parseFunctionBody(externalKeyword != null || staticKeyword == null, ParserErrorCode.MISSING_FUNCTION_BODY, false);
     if (externalKeyword != null) {
       if (body is! EmptyFunctionBody) {
         reportError(ParserErrorCode.EXTERNAL_METHOD_WITH_BODY, body, []);
       }
     } else if (staticKeyword != null) {
       if (body is EmptyFunctionBody) {
         reportError(ParserErrorCode.ABSTRACT_STATIC_METHOD, body, []);
       }
     }
     return new MethodDeclaration.full(commentAndMetadata.comment, commentAndMetadata.metadata, externalKeyword, staticKeyword, returnType, null, null, name, parameters, body);
   }
-  
+
   /**
    * Parse the modifiers preceding a declaration. This method allows the modifiers to appear in any
    * order but does generate errors for duplicated modifiers. Checks for other problems, such as
    * having the modifiers appear in the wrong order or specifying both 'const' and 'final', are
    * reported in one of the methods whose name is prefixed with {@code validateModifiersFor}.
    * <pre>
    * modifiers ::=
    * ('abstract' | 'const' | 'external' | 'factory' | 'final' | 'static' | 'var')
    * </pre>
    * @return the modifiers that were parsed
@@ skipping 50 matching lines @@
           advance();
         } else {
           modifiers.varKeyword = andAdvance;
         }
       } else {
         progress = false;
       }
     }
     return modifiers;
   }
-  
+
   /**
    * Parse a multiplicative expression.
    * <pre>
    * multiplicativeExpression ::=
    * unaryExpression (multiplicativeOperator unaryExpression)
    * | 'super' (multiplicativeOperator unaryExpression)+
    * </pre>
    * @return the multiplicative expression that was parsed
    */
   Expression parseMultiplicativeExpression() {
     Expression expression;
     if (matches(Keyword.SUPER) && _currentToken.next.type.isMultiplicativeOperator()) {
       expression = new SuperExpression.full(andAdvance);
     } else {
       expression = parseUnaryExpression();
     }
     while (_currentToken.type.isMultiplicativeOperator()) {
       Token operator = andAdvance;
       expression = new BinaryExpression.full(expression, operator, parseUnaryExpression());
     }
     return expression;
   }
-  
+
   /**
    * Parse a new expression.
    * <pre>
    * newExpression ::=
    * instanceCreationExpression
    * </pre>
    * @return the new expression that was parsed
    */
   InstanceCreationExpression parseNewExpression() => parseInstanceCreationExpression(expect(Keyword.NEW));
-  
+
   /**
    * Parse a non-labeled statement.
    * <pre>
    * nonLabeledStatement ::=
    * block
    * | assertStatement
    * | breakStatement
    * | continueStatement
    * | doStatement
    * | forStatement
@@ skipping 86 matching lines @@
       return parseVariableDeclarationStatement(commentAndMetadata);
     } else if (isFunctionDeclaration()) {
       return parseFunctionDeclarationStatement();
     } else if (matches5(TokenType.CLOSE_CURLY_BRACKET)) {
       reportError7(ParserErrorCode.MISSING_STATEMENT, []);
       return new EmptyStatement.full(createSyntheticToken2(TokenType.SEMICOLON));
     } else {
       return new ExpressionStatement.full(parseExpression2(), expect2(TokenType.SEMICOLON));
     }
   }
-  
+
   /**
    * Parse a normal formal parameter.
    * <pre>
    * normalFormalParameter ::=
    * functionSignature
    * | fieldFormalParameter
    * | simpleFormalParameter
    * functionSignature:
    * metadata returnType? identifier formalParameterList
    * fieldFormalParameter ::=
@@ skipping 22 matching lines @@
     }
     TypeName type2 = holder.type;
     if (type2 != null && matches3(type2.name.beginToken, Keyword.VOID)) {
       reportError8(ParserErrorCode.VOID_PARAMETER, type2.name.beginToken, []);
     }
     if (thisKeyword != null) {
       return new FieldFormalParameter.full(commentAndMetadata.comment, commentAndMetadata.metadata, holder.keyword, holder.type, thisKeyword, period, identifier);
     }
     return new SimpleFormalParameter.full(commentAndMetadata.comment, commentAndMetadata.metadata, holder.keyword, holder.type, identifier);
   }
-  
+
   /**
    * Parse an operator declaration.
    * <pre>
    * operatorDeclaration ::=
    * operatorSignature (';' | functionBody)
    * operatorSignature ::=
    * 'external'? returnType? 'operator' operator formalParameterList
    * </pre>
    * @param commentAndMetadata the documentation comment and metadata to be associated with the
    * declaration
@@ skipping 22 matching lines @@
       }
     }
     FormalParameterList parameters = parseFormalParameterList();
     validateFormalParameterList(parameters);
     FunctionBody body = parseFunctionBody(true, ParserErrorCode.MISSING_FUNCTION_BODY, false);
     if (externalKeyword != null && body is! EmptyFunctionBody) {
       reportError7(ParserErrorCode.EXTERNAL_OPERATOR_WITH_BODY, []);
     }
     return new MethodDeclaration.full(commentAndMetadata.comment, commentAndMetadata.metadata, externalKeyword, null, returnType, null, operatorKeyword, name, parameters, body);
   }
-  
+
   /**
    * Parse a return type if one is given, otherwise return {@code null} without advancing.
    * @return the return type that was parsed
    */
   TypeName parseOptionalReturnType() {
     if (matches(Keyword.VOID)) {
       return parseReturnType();
     } else if (matchesIdentifier() && !matches(Keyword.GET) && !matches(Keyword.SET) && !matches(Keyword.OPERATOR) && (matchesIdentifier2(peek()) || matches4(peek(), TokenType.LT))) {
       return parseReturnType();
     } else if (matchesIdentifier() && matches4(peek(), TokenType.PERIOD) && matchesIdentifier2(peek2(2)) && (matchesIdentifier2(peek2(3)) || matches4(peek2(3), TokenType.LT))) {
       return parseReturnType();
     }
     return null;
   }
-  
+
   /**
    * Parse a part or part-of directive.
    * <pre>
    * partDirective ::=
    * metadata 'part' stringLiteral ';'
    * partOfDirective ::=
    * metadata 'part' 'of' identifier ';'
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the directive
    * @return the part or part-of directive that was parsed
    */
   Directive parsePartDirective(CommentAndMetadata commentAndMetadata) {
     Token partKeyword = expect(Keyword.PART);
     if (matches2(_OF)) {
       Token ofKeyword = andAdvance;
       LibraryIdentifier libraryName = parseLibraryName(ParserErrorCode.MISSING_NAME_IN_PART_OF_DIRECTIVE, ofKeyword);
       Token semicolon = expect2(TokenType.SEMICOLON);
       return new PartOfDirective.full(commentAndMetadata.comment, commentAndMetadata.metadata, partKeyword, ofKeyword, libraryName, semicolon);
     }
     StringLiteral partUri = parseStringLiteral();
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new PartDirective.full(commentAndMetadata.comment, commentAndMetadata.metadata, partKeyword, partUri, semicolon);
   }
-  
+
   /**
    * Parse a postfix expression.
    * <pre>
    * postfixExpression ::=
    * assignableExpression postfixOperator
    * | primary selector
    * selector ::=
    * assignableSelector
    * | argumentList
    * </pre>
@@ skipping 19 matching lines @@
     }
     if (!_currentToken.type.isIncrementOperator()) {
       return operand;
     }
     if (operand is FunctionExpressionInvocation) {
       reportError7(ParserErrorCode.MISSING_ASSIGNABLE_SELECTOR, []);
     }
     Token operator = andAdvance;
     return new PostfixExpression.full(operand, operator);
   }
-  
+
   /**
    * Parse a prefixed identifier.
    * <pre>
    * prefixedIdentifier ::=
    * identifier ('.' identifier)?
    * </pre>
    * @return the prefixed identifier that was parsed
    */
   Identifier parsePrefixedIdentifier() {
     SimpleIdentifier qualifier = parseSimpleIdentifier();
     if (!matches5(TokenType.PERIOD)) {
       return qualifier;
     }
     Token period = andAdvance;
     SimpleIdentifier qualified = parseSimpleIdentifier();
     return new PrefixedIdentifier.full(qualifier, period, qualified);
   }
-  
+
   /**
    * Parse a primary expression.
    * <pre>
    * primary ::=
    * thisExpression
    * | 'super' assignableSelector
    * | functionExpression
    * | literal
    * | identifier
    * | newExpression
@@ skipping 71 matching lines @@
       return parseArgumentDefinitionTest();
     } else if (matches(Keyword.VOID)) {
       reportError7(ParserErrorCode.UNEXPECTED_TOKEN, [_currentToken.lexeme]);
       advance();
       return parsePrimaryExpression();
     } else {
       reportError7(ParserErrorCode.MISSING_IDENTIFIER, []);
       return createSyntheticIdentifier();
     }
   }
-  
+
   /**
    * Parse a redirecting constructor invocation.
    * <pre>
    * redirectingConstructorInvocation ::=
    * 'this' ('.' identifier)? arguments
    * </pre>
    * @return the redirecting constructor invocation that was parsed
    */
   RedirectingConstructorInvocation parseRedirectingConstructorInvocation() {
     Token keyword = expect(Keyword.THIS);
     Token period = null;
     SimpleIdentifier constructorName = null;
     if (matches5(TokenType.PERIOD)) {
       period = andAdvance;
       constructorName = parseSimpleIdentifier();
     }
     ArgumentList argumentList = parseArgumentList();
     return new RedirectingConstructorInvocation.full(keyword, period, constructorName, argumentList);
   }
-  
+
   /**
    * Parse a relational expression.
    * <pre>
    * relationalExpression ::=
    * shiftExpression ('is' '!'? type | 'as' type | relationalOperator shiftExpression)?
    * | 'super' relationalOperator shiftExpression
    * </pre>
    * @return the relational expression that was parsed
    */
   Expression parseRelationalExpression() {
@@ skipping 13 matching lines @@
       if (matches5(TokenType.BANG)) {
         notOperator = andAdvance;
       }
       expression = new IsExpression.full(expression, isOperator, notOperator, parseTypeName());
     } else if (_currentToken.type.isRelationalOperator()) {
       Token operator = andAdvance;
       expression = new BinaryExpression.full(expression, operator, parseShiftExpression());
     }
     return expression;
   }
-  
+
   /**
    * Parse a rethrow expression.
    * <pre>
    * rethrowExpression ::=
    * 'rethrow'
    * </pre>
    * @return the rethrow expression that was parsed
    */
   Expression parseRethrowExpression() => new RethrowExpression.full(expect(Keyword.RETHROW));
-  
+
   /**
    * Parse a return statement.
    * <pre>
    * returnStatement ::=
    * 'return' expression? ';'
    * </pre>
    * @return the return statement that was parsed
    */
   Statement parseReturnStatement() {
     Token returnKeyword = expect(Keyword.RETURN);
     if (matches5(TokenType.SEMICOLON)) {
       return new ReturnStatement.full(returnKeyword, null, andAdvance);
     }
     Expression expression = parseExpression2();
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new ReturnStatement.full(returnKeyword, expression, semicolon);
   }
-  
+
   /**
    * Parse a return type.
    * <pre>
    * returnType ::=
    * 'void'
    * | type
    * </pre>
    * @return the return type that was parsed
    */
   TypeName parseReturnType() {
     if (matches(Keyword.VOID)) {
       return new TypeName.full(new SimpleIdentifier.full(andAdvance), null);
     } else {
       return parseTypeName();
     }
   }
-  
+
   /**
    * Parse a setter.
    * <pre>
    * setter ::=
    * setterSignature functionBody?
    * setterSignature ::=
    * 'external'? 'static'? returnType? 'set' identifier formalParameterList
    * </pre>
    * @param commentAndMetadata the documentation comment and metadata to be associated with the
    * declaration
    * @param externalKeyword the 'external' token
    * @param staticKeyword the static keyword, or {@code null} if the setter is not static
    * @param the return type that has already been parsed, or {@code null} if there was no return
    * type
    * @return the setter that was parsed
    */
   MethodDeclaration parseSetter(CommentAndMetadata commentAndMetadata, Token externalKeyword, Token staticKeyword, TypeName returnType) {
     Token propertyKeyword = expect(Keyword.SET);
     SimpleIdentifier name = parseSimpleIdentifier();
     FormalParameterList parameters = parseFormalParameterList();
     validateFormalParameterList(parameters);
     FunctionBody body = parseFunctionBody(externalKeyword != null || staticKeyword == null, ParserErrorCode.STATIC_SETTER_WITHOUT_BODY, false);
     if (externalKeyword != null && body is! EmptyFunctionBody) {
       reportError7(ParserErrorCode.EXTERNAL_SETTER_WITH_BODY, []);
     }
     return new MethodDeclaration.full(commentAndMetadata.comment, commentAndMetadata.metadata, externalKeyword, staticKeyword, returnType, propertyKeyword, null, name, parameters, body);
   }
-  
+
   /**
    * Parse a shift expression.
    * <pre>
    * shiftExpression ::=
    * additiveExpression (shiftOperator additiveExpression)
    * | 'super' (shiftOperator additiveExpression)+
    * </pre>
    * @return the shift expression that was parsed
    */
   Expression parseShiftExpression() {
     Expression expression;
     if (matches(Keyword.SUPER) && _currentToken.next.type.isShiftOperator()) {
       expression = new SuperExpression.full(andAdvance);
     } else {
       expression = parseAdditiveExpression();
     }
     while (_currentToken.type.isShiftOperator()) {
       Token operator = andAdvance;
       expression = new BinaryExpression.full(expression, operator, parseAdditiveExpression());
     }
     return expression;
   }
-  
+
   /**
    * Parse a simple identifier.
    * <pre>
    * identifier ::=
    * IDENTIFIER
    * </pre>
    * @return the simple identifier that was parsed
    */
   SimpleIdentifier parseSimpleIdentifier() {
     if (matchesIdentifier()) {
       return new SimpleIdentifier.full(andAdvance);
     }
     reportError7(ParserErrorCode.MISSING_IDENTIFIER, []);
     return createSyntheticIdentifier();
   }
-  
+
   /**
    * Parse a statement.
    * <pre>
    * statement ::=
    * label* nonLabeledStatement
    * </pre>
    * @return the statement that was parsed
    */
   Statement parseStatement2() {
     List<Label> labels = new List<Label>();
     while (matchesIdentifier() && matches4(peek(), TokenType.COLON)) {
       SimpleIdentifier label = parseSimpleIdentifier();
       Token colon = expect2(TokenType.COLON);
       labels.add(new Label.full(label, colon));
     }
     Statement statement = parseNonLabeledStatement();
     if (labels.isEmpty) {
       return statement;
     }
     return new LabeledStatement.full(labels, statement);
   }
-  
+
   /**
    * Parse a list of statements within a switch statement.
    * <pre>
    * statements ::=
    * statement
    * </pre>
    * @return the statements that were parsed
    */
   List<Statement> parseStatements2() {
     List<Statement> statements = new List<Statement>();
     Token statementStart = _currentToken;
     while (!matches5(TokenType.EOF) && !matches5(TokenType.CLOSE_CURLY_BRACKET) && !isSwitchMember()) {
       statements.add(parseStatement2());
       if (identical(_currentToken, statementStart)) {
         reportError8(ParserErrorCode.UNEXPECTED_TOKEN, _currentToken, [_currentToken.lexeme]);
         advance();
       }
       statementStart = _currentToken;
     }
     return statements;
   }
-  
+
   /**
    * Parse a string literal that contains interpolations.
    * @return the string literal that was parsed
    */
   StringInterpolation parseStringInterpolation(Token string) {
     List<InterpolationElement> elements = new List<InterpolationElement>();
     elements.add(new InterpolationString.full(string, computeStringValue(string.lexeme)));
     while (matches5(TokenType.STRING_INTERPOLATION_EXPRESSION) || matches5(TokenType.STRING_INTERPOLATION_IDENTIFIER)) {
       if (matches5(TokenType.STRING_INTERPOLATION_EXPRESSION)) {
         Token openToken = andAdvance;
@@ skipping 10 matching lines @@
         }
         elements.add(new InterpolationExpression.full(openToken, expression, null));
       }
       if (matches5(TokenType.STRING)) {
         string = andAdvance;
         elements.add(new InterpolationString.full(string, computeStringValue(string.lexeme)));
       }
     }
     return new StringInterpolation.full(elements);
   }
-  
+
   /**
    * Parse a string literal.
    * <pre>
    * stringLiteral ::=
    * MULTI_LINE_STRING+
    * | SINGLE_LINE_STRING+
    * </pre>
    * @return the string literal that was parsed
    */
   StringLiteral parseStringLiteral() {
     List<StringLiteral> strings = new List<StringLiteral>();
     while (matches5(TokenType.STRING)) {
       Token string = andAdvance;
       if (matches5(TokenType.STRING_INTERPOLATION_EXPRESSION) || matches5(TokenType.STRING_INTERPOLATION_IDENTIFIER)) {
         strings.add(parseStringInterpolation(string));
       } else {
         strings.add(new SimpleStringLiteral.full(string, computeStringValue(string.lexeme)));
       }
     }
     if (strings.length < 1) {
       reportError7(ParserErrorCode.EXPECTED_STRING_LITERAL, []);
       return createSyntheticStringLiteral();
     } else if (strings.length == 1) {
       return strings[0];
     } else {
       return new AdjacentStrings.full(strings);
     }
   }
-  
+
   /**
    * Parse a super constructor invocation.
    * <pre>
    * superConstructorInvocation ::=
    * 'super' ('.' identifier)? arguments
    * </pre>
    * @return the super constructor invocation that was parsed
    */
   SuperConstructorInvocation parseSuperConstructorInvocation() {
     Token keyword = expect(Keyword.SUPER);
     Token period = null;
     SimpleIdentifier constructorName = null;
     if (matches5(TokenType.PERIOD)) {
       period = andAdvance;
       constructorName = parseSimpleIdentifier();
     }
     ArgumentList argumentList = parseArgumentList();
     return new SuperConstructorInvocation.full(keyword, period, constructorName, argumentList);
   }
-  
+
   /**
    * Parse a switch statement.
    * <pre>
    * switchStatement ::=
    * 'switch' '(' expression ')' '{' switchCase* defaultCase? '}'
    * switchCase ::=
    * label* ('case' expression ':') statements
    * defaultCase ::=
    * label* 'default' ':' statements
    * </pre>
@@ skipping 45 matching lines @@
             advance();
           }
         }
       }
       Token rightBracket = expect2(TokenType.CLOSE_CURLY_BRACKET);
       return new SwitchStatement.full(keyword, leftParenthesis, expression, rightParenthesis, leftBracket, members, rightBracket);
     } finally {
       _inSwitch = wasInSwitch;
     }
   }
-  
+
   /**
    * Parse a throw expression.
    * <pre>
    * throwExpression ::=
    * 'throw' expression
    * </pre>
    * @return the throw expression that was parsed
    */
   Expression parseThrowExpression() {
     Token keyword = expect(Keyword.THROW);
     if (matches5(TokenType.SEMICOLON) || matches5(TokenType.CLOSE_PAREN)) {
       reportError8(ParserErrorCode.MISSING_EXPRESSION_IN_THROW, _currentToken, []);
       return new ThrowExpression.full(keyword, createSyntheticIdentifier());
     }
     Expression expression = parseExpression2();
     return new ThrowExpression.full(keyword, expression);
   }
-  
+
   /**
    * Parse a throw expression.
    * <pre>
    * throwExpressionWithoutCascade ::=
    * 'throw' expressionWithoutCascade
    * </pre>
    * @return the throw expression that was parsed
    */
   Expression parseThrowExpressionWithoutCascade() {
     Token keyword = expect(Keyword.THROW);
     if (matches5(TokenType.SEMICOLON) || matches5(TokenType.CLOSE_PAREN)) {
       reportError8(ParserErrorCode.MISSING_EXPRESSION_IN_THROW, _currentToken, []);
       return new ThrowExpression.full(keyword, createSyntheticIdentifier());
     }
     Expression expression = parseExpressionWithoutCascade();
     return new ThrowExpression.full(keyword, expression);
   }
-  
+
   /**
    * Parse a try statement.
    * <pre>
    * tryStatement ::=
    * 'try' block (onPart+ finallyPart? | finallyPart)
    * onPart ::=
    * catchPart block
    * | 'on' type catchPart? block
    * catchPart ::=
    * 'catch' '(' identifier (',' identifier)? ')'
@@ skipping 37 matching lines @@
     if (matches(Keyword.FINALLY)) {
       finallyKeyword = andAdvance;
       finallyClause = parseBlock();
     } else {
       if (catchClauses.isEmpty) {
         reportError7(ParserErrorCode.MISSING_CATCH_OR_FINALLY, []);
       }
     }
     return new TryStatement.full(tryKeyword, body, catchClauses, finallyKeyword, finallyClause);
   }
-  
+
   /**
    * Parse a type alias.
    * <pre>
    * typeAlias ::=
    * 'typedef' typeAliasBody
    * typeAliasBody ::=
    * classTypeAlias
    * | functionTypeAlias
    * classTypeAlias ::=
    * identifier typeParameters? '=' 'abstract'? mixinApplication
@@ skipping 15 matching lines @@
         next = skipTypeParameterList(next);
         if (next != null && matches4(next, TokenType.EQ)) {
           return parseClassTypeAlias(commentAndMetadata, keyword);
         }
       } else if (matches4(next, TokenType.EQ)) {
         return parseClassTypeAlias(commentAndMetadata, keyword);
       }
     }
     return parseFunctionTypeAlias(commentAndMetadata, keyword);
   }
-  
+
   /**
    * Parse a list of type arguments.
    * <pre>
    * typeArguments ::=
    * '<' typeList '>'
    * typeList ::=
    * type (',' type)
    * </pre>
    * @return the type argument list that was parsed
    */
   TypeArgumentList parseTypeArgumentList() {
     Token leftBracket = expect2(TokenType.LT);
     List<TypeName> arguments = new List<TypeName>();
     arguments.add(parseTypeName());
     while (optional(TokenType.COMMA)) {
       arguments.add(parseTypeName());
     }
     Token rightBracket = expect2(TokenType.GT);
     return new TypeArgumentList.full(leftBracket, arguments, rightBracket);
   }
-  
+
   /**
    * Parse a type name.
    * <pre>
    * type ::=
    * qualified typeArguments?
    * </pre>
    * @return the type name that was parsed
    */
   TypeName parseTypeName() {
     Identifier typeName;
     if (matches(Keyword.VAR)) {
       reportError7(ParserErrorCode.VAR_AS_TYPE_NAME, []);
       typeName = new SimpleIdentifier.full(andAdvance);
     } else if (matchesIdentifier()) {
       typeName = parsePrefixedIdentifier();
     } else {
       typeName = createSyntheticIdentifier();
       reportError7(ParserErrorCode.EXPECTED_TYPE_NAME, []);
     }
     TypeArgumentList typeArguments = null;
     if (matches5(TokenType.LT)) {
       typeArguments = parseTypeArgumentList();
     }
     return new TypeName.full(typeName, typeArguments);
   }
-  
+
   /**
    * Parse a type parameter.
    * <pre>
    * typeParameter ::=
    * metadata name ('extends' bound)?
    * </pre>
    * @return the type parameter that was parsed
    */
   TypeParameter parseTypeParameter() {
     CommentAndMetadata commentAndMetadata = parseCommentAndMetadata();
     SimpleIdentifier name = parseSimpleIdentifier();
     if (matches(Keyword.EXTENDS)) {
       Token keyword = andAdvance;
       TypeName bound = parseTypeName();
       return new TypeParameter.full(commentAndMetadata.comment, commentAndMetadata.metadata, name, keyword, bound);
     }
     return new TypeParameter.full(commentAndMetadata.comment, commentAndMetadata.metadata, name, null, null);
   }
-  
+
   /**
    * Parse a list of type parameters.
    * <pre>
    * typeParameterList ::=
    * '<' typeParameter (',' typeParameter)* '>'
    * </pre>
    * @return the list of type parameters that were parsed
    */
   TypeParameterList parseTypeParameterList() {
     Token leftBracket = expect2(TokenType.LT);
     List<TypeParameter> typeParameters = new List<TypeParameter>();
     typeParameters.add(parseTypeParameter());
     while (optional(TokenType.COMMA)) {
       typeParameters.add(parseTypeParameter());
     }
     Token rightBracket = expect2(TokenType.GT);
     return new TypeParameterList.full(leftBracket, typeParameters, rightBracket);
   }
-  
+
   /**
    * Parse a unary expression.
    * <pre>
    * unaryExpression ::=
    * prefixOperator unaryExpression
    * | postfixExpression
    * | unaryOperator 'super'
    * | '-' 'super'
    * | incrementOperator assignableExpression
    * </pre>
@@ skipping 28 matching lines @@
           return new PrefixExpression.full(operator, new SuperExpression.full(andAdvance));
         }
       }
       return new PrefixExpression.full(operator, parseAssignableExpression(false));
     } else if (matches5(TokenType.PLUS)) {
       reportError7(ParserErrorCode.MISSING_IDENTIFIER, []);
       return createSyntheticIdentifier();
     }
     return parsePostfixExpression();
   }
-  
+
   /**
    * Parse a variable declaration.
    * <pre>
    * variableDeclaration ::=
    * identifier ('=' expression)?
    * </pre>
    * @return the variable declaration that was parsed
    */
   VariableDeclaration parseVariableDeclaration() {
     CommentAndMetadata commentAndMetadata = parseCommentAndMetadata();
     SimpleIdentifier name = parseSimpleIdentifier();
     Token equals = null;
     Expression initializer = null;
     if (matches5(TokenType.EQ)) {
       equals = andAdvance;
       initializer = parseExpression2();
     }
     return new VariableDeclaration.full(commentAndMetadata.comment, commentAndMetadata.metadata, name, equals, initializer);
   }
-  
+
   /**
    * Parse a variable declaration list.
    * <pre>
    * variableDeclarationList ::=
    * finalConstVarOrType variableDeclaration (',' variableDeclaration)
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the variable declaration list
    * @return the variable declaration list that was parsed
    */
   VariableDeclarationList parseVariableDeclarationList(CommentAndMetadata commentAndMetadata) {
     FinalConstVarOrType holder = parseFinalConstVarOrType(false);
     return parseVariableDeclarationList2(commentAndMetadata, holder.keyword, holder.type);
   }
-  
+
   /**
    * Parse a variable declaration list.
    * <pre>
    * variableDeclarationList ::=
    * finalConstVarOrType variableDeclaration (',' variableDeclaration)
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the variable declaration list, or{@code null} if there is no attempt at parsing the comment and metadata
    * @param keyword the token representing the 'final', 'const' or 'var' keyword, or {@code null} if
    * there is no keyword
    * @param type the type of the variables in the list
    * @return the variable declaration list that was parsed
    */
   VariableDeclarationList parseVariableDeclarationList2(CommentAndMetadata commentAndMetadata, Token keyword, TypeName type) {
     List<VariableDeclaration> variables = new List<VariableDeclaration>();
     variables.add(parseVariableDeclaration());
     while (matches5(TokenType.COMMA)) {
       advance();
       variables.add(parseVariableDeclaration());
     }
     return new VariableDeclarationList.full(commentAndMetadata != null ? commentAndMetadata.comment : null, commentAndMetadata != null ? commentAndMetadata.metadata : null, keyword, type, variables);
   }
-  
+
   /**
    * Parse a variable declaration statement.
    * <pre>
    * variableDeclarationStatement ::=
    * variableDeclarationList ';'
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the variable declaration
    * statement, or {@code null} if there is no attempt at parsing the comment and metadata
    * @return the variable declaration statement that was parsed
    */
   VariableDeclarationStatement parseVariableDeclarationStatement(CommentAndMetadata commentAndMetadata) {
     VariableDeclarationList variableList = parseVariableDeclarationList(commentAndMetadata);
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new VariableDeclarationStatement.full(variableList, semicolon);
   }
-  
+
   /**
    * Parse a variable declaration statement.
    * <pre>
    * variableDeclarationStatement ::=
    * variableDeclarationList ';'
    * </pre>
    * @param commentAndMetadata the metadata to be associated with the variable declaration
    * statement, or {@code null} if there is no attempt at parsing the comment and metadata
    * @param keyword the token representing the 'final', 'const' or 'var' keyword, or {@code null} if
    * there is no keyword
    * @param type the type of the variables in the list
    * @return the variable declaration statement that was parsed
    */
   VariableDeclarationStatement parseVariableDeclarationStatement2(CommentAndMetadata commentAndMetadata, Token keyword, TypeName type) {
     VariableDeclarationList variableList = parseVariableDeclarationList2(commentAndMetadata, keyword, type);
     Token semicolon = expect2(TokenType.SEMICOLON);
     return new VariableDeclarationStatement.full(variableList, semicolon);
   }
-  
+
   /**
    * Parse a while statement.
    * <pre>
    * whileStatement ::=
    * 'while' '(' expression ')' statement
    * </pre>
    * @return the while statement that was parsed
    */
   Statement parseWhileStatement() {
     bool wasInLoop = _inLoop;
     _inLoop = true;
     try {
       Token keyword = expect(Keyword.WHILE);
       Token leftParenthesis = expect2(TokenType.OPEN_PAREN);
       Expression condition = parseExpression2();
       Token rightParenthesis = expect2(TokenType.CLOSE_PAREN);
       Statement body = parseStatement2();
       return new WhileStatement.full(keyword, leftParenthesis, condition, rightParenthesis, body);
     } finally {
       _inLoop = wasInLoop;
     }
   }
-  
+
   /**
    * Parse a with clause.
    * <pre>
    * withClause ::=
    * 'with' typeName (',' typeName)
    * </pre>
    * @return the with clause that was parsed
    */
   WithClause parseWithClause() {
     Token with2 = expect(Keyword.WITH);
     List<TypeName> types = new List<TypeName>();
     types.add(parseTypeName());
     while (optional(TokenType.COMMA)) {
       types.add(parseTypeName());
     }
     return new WithClause.full(with2, types);
   }
-  
+
   /**
    * Return the token that is immediately after the current token. This is equivalent to{@link #peek(int) peek(1)}.
    * @return the token that is immediately after the current token
    */
   Token peek() => _currentToken.next;
-  
+
   /**
    * Return the token that is the given distance after the current token.
    * @param distance the number of tokens to look ahead, where {@code 0} is the current token,{@code 1} is the next token, etc.
    * @return the token that is the given distance after the current token
    */
   Token peek2(int distance) {
     Token token = _currentToken;
     for (int i = 0; i < distance; i++) {
       token = token.next;
     }
     return token;
   }
-  
+
   /**
    * Report an error with the given error code and arguments.
    * @param errorCode the error code of the error to be reported
    * @param node the node specifying the location of the error
    * @param arguments the arguments to the error, used to compose the error message
    */
   void reportError(ParserErrorCode errorCode, ASTNode node, List<Object> arguments) {
     _errorListener.onError(new AnalysisError.con2(_source, node.offset, node.length, errorCode, arguments));
   }
-  
+
   /**
    * Report an error with the given error code and arguments.
    * @param errorCode the error code of the error to be reported
    * @param arguments the arguments to the error, used to compose the error message
    */
   void reportError7(ParserErrorCode errorCode, List<Object> arguments) {
     reportError8(errorCode, _currentToken, arguments);
   }
-  
+
   /**
    * Report an error with the given error code and arguments.
    * @param errorCode the error code of the error to be reported
    * @param token the token specifying the location of the error
    * @param arguments the arguments to the error, used to compose the error message
    */
   void reportError8(ParserErrorCode errorCode, Token token, List<Object> arguments) {
     _errorListener.onError(new AnalysisError.con2(_source, token.offset, token.length, errorCode, arguments));
   }
-  
+
   /**
    * Parse the 'final', 'const', 'var' or type preceding a variable declaration, starting at the
    * given token, without actually creating a type or changing the current token. Return the token
    * following the type that was parsed, or {@code null} if the given token is not the first token
    * in a valid type.
    * <pre>
    * finalConstVarOrType ::=
    * | 'final' type?
    * | 'const' type?
    * | 'var'
@@ skipping 11 matching lines @@
     } else if (matches3(startToken, Keyword.VAR)) {
       return startToken.next;
     } else if (matchesIdentifier2(startToken)) {
       Token next3 = startToken.next;
       if (matchesIdentifier2(next3) || matches4(next3, TokenType.LT) || matches3(next3, Keyword.THIS) || (matches4(next3, TokenType.PERIOD) && matchesIdentifier2(next3.next) && (matchesIdentifier2(next3.next.next) || matches4(next3.next.next, TokenType.LT) || matches3(next3.next.next, Keyword.THIS)))) {
         return skipReturnType(startToken);
       }
     }
     return null;
   }
-  
+
   /**
    * Parse a list of formal parameters, starting at the given token, without actually creating a
    * formal parameter list or changing the current token. Return the token following the formal
    * parameter list that was parsed, or {@code null} if the given token is not the first token in a
    * valid list of formal parameter.
    * <p>
    * Note that unlike other skip methods, this method uses a heuristic. In the worst case, the
    * parameters could be prefixed by metadata, which would require us to be able to skip arbitrary
    * expressions. Rather than duplicate the logic of most of the parse methods we simply look for
    * something that is likely to be a list of parameters and then skip to returning the token after
@@ skipping 37 matching lines @@
     }
     Token afterType = skipFinalConstVarOrType(next2);
     if (afterType == null) {
       return null;
     }
     if (skipSimpleIdentifier(afterType) == null) {
       return null;
     }
     return skipPastMatchingToken(startToken);
   }
-  
+
   /**
    * If the given token is a begin token with an associated end token, then return the token
    * following the end token. Otherwise, return {@code null}.
    * @param startToken the token that is assumed to be a being token
    * @return the token following the matching end token
    */
   Token skipPastMatchingToken(Token startToken) {
     if (startToken is! BeginToken) {
       return null;
     }
     Token closeParen = ((startToken as BeginToken)).endToken;
     if (closeParen == null) {
       return null;
     }
     return closeParen.next;
   }
-  
+
   /**
    * Parse a prefixed identifier, starting at the given token, without actually creating a prefixed
    * identifier or changing the current token. Return the token following the prefixed identifier
    * that was parsed, or {@code null} if the given token is not the first token in a valid prefixed
    * identifier.
    * <p>
    * This method must be kept in sync with {@link #parsePrefixedIdentifier()}.
    * <pre>
    * prefixedIdentifier ::=
    * identifier ('.' identifier)?
    * </pre>
    * @param startToken the token at which parsing is to begin
    * @return the token following the prefixed identifier that was parsed
    */
   Token skipPrefixedIdentifier(Token startToken) {
     Token token = skipSimpleIdentifier(startToken);
     if (token == null) {
       return null;
     } else if (!matches4(token, TokenType.PERIOD)) {
       return token;
     }
     return skipSimpleIdentifier(token.next);
   }
-  
+
   /**
    * Parse a return type, starting at the given token, without actually creating a return type or
    * changing the current token. Return the token following the return type that was parsed, or{@code null} if the given token is not the first token in a valid return type.
    * <p>
    * This method must be kept in sync with {@link #parseReturnType()}.
    * <pre>
    * returnType ::=
    * 'void'
    * | type
    * </pre>
    * @param startToken the token at which parsing is to begin
    * @return the token following the return type that was parsed
    */
   Token skipReturnType(Token startToken) {
     if (matches3(startToken, Keyword.VOID)) {
       return startToken.next;
     } else {
       return skipTypeName(startToken);
     }
   }
-  
+
   /**
    * Parse a simple identifier, starting at the given token, without actually creating a simple
    * identifier or changing the current token. Return the token following the simple identifier that
    * was parsed, or {@code null} if the given token is not the first token in a valid simple
    * identifier.
    * <p>
    * This method must be kept in sync with {@link #parseSimpleIdentifier()}.
    * <pre>
    * identifier ::=
    * IDENTIFIER
    * </pre>
    * @param startToken the token at which parsing is to begin
    * @return the token following the simple identifier that was parsed
    */
   Token skipSimpleIdentifier(Token startToken) {
     if (matches4(startToken, TokenType.IDENTIFIER) || (matches4(startToken, TokenType.KEYWORD) && ((startToken as KeywordToken)).keyword.isPseudoKeyword())) {
       return startToken.next;
     }
     return null;
   }
-  
+
   /**
    * Parse a string literal that contains interpolations, starting at the given token, without
    * actually creating a string literal or changing the current token. Return the token following
    * the string literal that was parsed, or {@code null} if the given token is not the first token
    * in a valid string literal.
    * <p>
    * This method must be kept in sync with {@link #parseStringInterpolation(Token)}.
    * @param startToken the token at which parsing is to begin
    * @return the string literal that was parsed
    */
@@ skipping 32 matching lines @@
         token = token.next;
       }
       type2 = token.type;
       if (identical(type2, TokenType.STRING)) {
         token = token.next;
         type2 = token.type;
       }
     }
     return token;
   }
-  
+
   /**
    * Parse a string literal, starting at the given token, without actually creating a string literal
    * or changing the current token. Return the token following the string literal that was parsed,
    * or {@code null} if the given token is not the first token in a valid string literal.
    * <p>
    * This method must be kept in sync with {@link #parseStringLiteral()}.
    * <pre>
    * stringLiteral ::=
    * MULTI_LINE_STRING+
    * | SINGLE_LINE_STRING+
    * </pre>
    * @param startToken the token at which parsing is to begin
    * @return the token following the string literal that was parsed
    */
   Token skipStringLiteral(Token startToken) {
     Token token = startToken;
     while (token != null && matches4(token, TokenType.STRING)) {
       token = token.next;
       TokenType type2 = token.type;
       if (identical(type2, TokenType.STRING_INTERPOLATION_EXPRESSION) || identical(type2, TokenType.STRING_INTERPOLATION_IDENTIFIER)) {
         token = skipStringInterpolation(token);
       }
     }
     if (identical(token, startToken)) {
       return null;
     }
     return token;
   }
-  
+
   /**
    * Parse a list of type arguments, starting at the given token, without actually creating a type argument list
    * or changing the current token. Return the token following the type argument list that was parsed,
    * or {@code null} if the given token is not the first token in a valid type argument list.
    * <p>
    * This method must be kept in sync with {@link #parseTypeArgumentList()}.
    * <pre>
    * typeArguments ::=
    * '<' typeList '>'
    * typeList ::=
@@ skipping 19 matching lines @@
     }
     if (identical(token.type, TokenType.GT)) {
       return token.next;
     } else if (identical(token.type, TokenType.GT_GT)) {
       Token second = new Token(TokenType.GT, token.offset + 1);
       second.setNextWithoutSettingPrevious(token.next);
       return second;
     }
     return null;
   }
-  
+
   /**
    * Parse a type name, starting at the given token, without actually creating a type name or
    * changing the current token. Return the token following the type name that was parsed, or{@code null} if the given token is not the first token in a valid type name.
    * <p>
    * This method must be kept in sync with {@link #parseTypeName()}.
    * <pre>
    * type ::=
    * qualified typeArguments?
    * </pre>
    * @param startToken the token at which parsing is to begin
    * @return the token following the type name that was parsed
    */
   Token skipTypeName(Token startToken) {
     Token token = skipPrefixedIdentifier(startToken);
     if (token == null) {
       return null;
     }
     if (matches4(token, TokenType.LT)) {
       token = skipTypeArgumentList(token);
     }
     return token;
   }
-  
+
   /**
    * Parse a list of type parameters, starting at the given token, without actually creating a type
    * parameter list or changing the current token. Return the token following the type parameter
    * list that was parsed, or {@code null} if the given token is not the first token in a valid type
    * parameter list.
    * <p>
    * This method must be kept in sync with {@link #parseTypeParameterList()}.
    * <pre>
    * typeParameterList ::=
    * '<' typeParameter (',' typeParameter)* '>'
@@ skipping 30 matching lines @@
           Token fakeEquals = new Token(TokenType.EQ, next2.offset + 2);
           fakeEquals.setNextWithoutSettingPrevious(next2.next);
           return fakeEquals;
         }
         depth -= 2;
       }
       next2 = next2.next;
     }
     return next2;
   }
-  
+
   /**
    * Translate the characters at the given index in the given string, appending the translated
    * character to the given builder. The index is assumed to be valid.
    * @param builder the builder to which the translated character is to be appended
    * @param lexeme the string containing the character(s) to be translated
    * @param index the index of the character to be translated
    * @return the index of the next character to be translated
    */
   int translateCharacter(JavaStringBuilder builder, String lexeme, int index) {
     int currentChar = lexeme.codeUnitAt(index);
@@ skipping 85 matching lines @@
         } else {
           appendScalarValue(builder, lexeme.substring(index, currentIndex + 1), ((((((Character.digit(firstDigit, 16) << 4) + Character.digit(secondDigit, 16)) << 4) + Character.digit(thirdDigit, 16)) << 4) + Character.digit(fourthDigit, 16)), index, currentIndex + 3);
         }
         return currentIndex + 4;
       }
     } else {
       builder.appendChar(currentChar);
     }
     return currentIndex + 1;
   }
-  
+
   /**
    * Validate that the given parameter list does not contain any field initializers.
    * @param parameterList the parameter list to be validated
    */
   void validateFormalParameterList(FormalParameterList parameterList) {
     for (FormalParameter parameter in parameterList.parameters) {
       if (parameter is FieldFormalParameter) {
         reportError(ParserErrorCode.FIELD_INITIALIZER_OUTSIDE_CONSTRUCTOR, ((parameter as FieldFormalParameter)).identifier, []);
       }
     }
   }
-  
+
   /**
    * Validate that the given set of modifiers is appropriate for a class and return the 'abstract'
    * keyword if there is one.
    * @param modifiers the modifiers being validated
    */
   Token validateModifiersForClass(Modifiers modifiers) {
     validateModifiersForTopLevelDeclaration(modifiers);
     if (modifiers.constKeyword != null) {
       reportError8(ParserErrorCode.CONST_CLASS, modifiers.constKeyword, []);
     }
     if (modifiers.externalKeyword != null) {
       reportError8(ParserErrorCode.EXTERNAL_CLASS, modifiers.externalKeyword, []);
     }
     if (modifiers.finalKeyword != null) {
       reportError8(ParserErrorCode.FINAL_CLASS, modifiers.finalKeyword, []);
     }
     if (modifiers.varKeyword != null) {
       reportError8(ParserErrorCode.VAR_CLASS, modifiers.varKeyword, []);
     }
     return modifiers.abstractKeyword;
   }
-  
+
   /**
    * Validate that the given set of modifiers is appropriate for a constructor and return the
    * 'const' keyword if there is one.
    * @param modifiers the modifiers being validated
    * @return the 'const' or 'final' keyword associated with the constructor
    */
   Token validateModifiersForConstructor(Modifiers modifiers) {
     if (modifiers.abstractKeyword != null) {
       reportError7(ParserErrorCode.ABSTRACT_CLASS_MEMBER, []);
     }
@@ skipping 10 matching lines @@
     Token constKeyword2 = modifiers.constKeyword;
     Token factoryKeyword2 = modifiers.factoryKeyword;
     if (externalKeyword2 != null && constKeyword2 != null && constKeyword2.offset < externalKeyword2.offset) {
       reportError8(ParserErrorCode.EXTERNAL_AFTER_CONST, externalKeyword2, []);
     }
     if (externalKeyword2 != null && factoryKeyword2 != null && factoryKeyword2.offset < externalKeyword2.offset) {
       reportError8(ParserErrorCode.EXTERNAL_AFTER_FACTORY, externalKeyword2, []);
     }
     return constKeyword2;
   }
-  
+
   /**
    * Validate that the given set of modifiers is appropriate for a field and return the 'final',
    * 'const' or 'var' keyword if there is one.
    * @param modifiers the modifiers being validated
    * @return the 'final', 'const' or 'var' keyword associated with the field
    */
   Token validateModifiersForField(Modifiers modifiers) {
     if (modifiers.abstractKeyword != null) {
       reportError7(ParserErrorCode.ABSTRACT_CLASS_MEMBER, []);
     }
@@ skipping 22 matching lines @@
         reportError8(ParserErrorCode.FINAL_AND_VAR, varKeyword2, []);
       }
       if (staticKeyword2 != null && finalKeyword2.offset < staticKeyword2.offset) {
         reportError8(ParserErrorCode.STATIC_AFTER_FINAL, staticKeyword2, []);
       }
     } else if (varKeyword2 != null && staticKeyword2 != null && varKeyword2.offset < staticKeyword2.offset) {
       reportError8(ParserErrorCode.STATIC_AFTER_VAR, staticKeyword2, []);
     }
     return lexicallyFirst([constKeyword2, finalKeyword2, varKeyword2]);
   }
-  
+
   /**
    * Validate that the given set of modifiers is appropriate for a getter, setter, or method.
    * @param modifiers the modifiers being validated
    */
   void validateModifiersForGetterOrSetterOrMethod(Modifiers modifiers) {
     if (modifiers.abstractKeyword != null) {
       reportError7(ParserErrorCode.ABSTRACT_CLASS_MEMBER, []);
     }
     if (modifiers.constKeyword != null) {
       reportError8(ParserErrorCode.CONST_METHOD, modifiers.constKeyword, []);
     }
     if (modifiers.factoryKeyword != null) {
       reportError8(ParserErrorCode.NON_CONSTRUCTOR_FACTORY, modifiers.factoryKeyword, []);
     }
     if (modifiers.finalKeyword != null) {
       reportError8(ParserErrorCode.FINAL_METHOD, modifiers.finalKeyword, []);
     }
     if (modifiers.varKeyword != null) {
       reportError8(ParserErrorCode.VAR_RETURN_TYPE, modifiers.varKeyword, []);
     }
     Token externalKeyword2 = modifiers.externalKeyword;
     Token staticKeyword2 = modifiers.staticKeyword;
     if (externalKeyword2 != null && staticKeyword2 != null && staticKeyword2.offset < externalKeyword2.offset) {
       reportError8(ParserErrorCode.EXTERNAL_AFTER_STATIC, externalKeyword2, []);
     }
   }
-  
+
   /**
    * Validate that the given set of modifiers is appropriate for a getter, setter, or method.
    * @param modifiers the modifiers being validated
    */
   void validateModifiersForOperator(Modifiers modifiers) {
     if (modifiers.abstractKeyword != null) {
       reportError7(ParserErrorCode.ABSTRACT_CLASS_MEMBER, []);
     }
     if (modifiers.constKeyword != null) {
       reportError8(ParserErrorCode.CONST_METHOD, modifiers.constKeyword, []);
     }
     if (modifiers.factoryKeyword != null) {
       reportError8(ParserErrorCode.NON_CONSTRUCTOR_FACTORY, modifiers.factoryKeyword, []);
     }
     if (modifiers.finalKeyword != null) {
       reportError8(ParserErrorCode.FINAL_METHOD, modifiers.finalKeyword, []);
     }
     if (modifiers.staticKeyword != null) {
       reportError8(ParserErrorCode.STATIC_OPERATOR, modifiers.staticKeyword, []);
     }
     if (modifiers.varKeyword != null) {
       reportError8(ParserErrorCode.VAR_RETURN_TYPE, modifiers.varKeyword, []);
     }
   }
-  
+
   /**
    * Validate that the given set of modifiers is appropriate for a top-level declaration.
    * @param modifiers the modifiers being validated
    */
   void validateModifiersForTopLevelDeclaration(Modifiers modifiers) {
     if (modifiers.factoryKeyword != null) {
       reportError8(ParserErrorCode.FACTORY_TOP_LEVEL_DECLARATION, modifiers.factoryKeyword, []);
     }
     if (modifiers.staticKeyword != null) {
       reportError8(ParserErrorCode.STATIC_TOP_LEVEL_DECLARATION, modifiers.staticKeyword, []);
     }
   }
-  
+
   /**
    * Validate that the given set of modifiers is appropriate for a top-level function.
    * @param modifiers the modifiers being validated
    */
   void validateModifiersForTopLevelFunction(Modifiers modifiers) {
     validateModifiersForTopLevelDeclaration(modifiers);
     if (modifiers.abstractKeyword != null) {
       reportError7(ParserErrorCode.ABSTRACT_TOP_LEVEL_FUNCTION, []);
     }
     if (modifiers.constKeyword != null) {
       reportError8(ParserErrorCode.CONST_CLASS, modifiers.constKeyword, []);
     }
     if (modifiers.finalKeyword != null) {
       reportError8(ParserErrorCode.FINAL_CLASS, modifiers.finalKeyword, []);
     }
     if (modifiers.varKeyword != null) {
       reportError8(ParserErrorCode.VAR_RETURN_TYPE, modifiers.varKeyword, []);
     }
   }
-  
+
   /**
    * Validate that the given set of modifiers is appropriate for a field and return the 'final',
    * 'const' or 'var' keyword if there is one.
    * @param modifiers the modifiers being validated
    * @return the 'final', 'const' or 'var' keyword associated with the field
    */
   Token validateModifiersForTopLevelVariable(Modifiers modifiers) {
     validateModifiersForTopLevelDeclaration(modifiers);
     if (modifiers.abstractKeyword != null) {
       reportError7(ParserErrorCode.ABSTRACT_TOP_LEVEL_VARIABLE, []);
@@ skipping 11 matching lines @@
       if (varKeyword2 != null) {
         reportError8(ParserErrorCode.CONST_AND_VAR, varKeyword2, []);
       }
     } else if (finalKeyword2 != null) {
       if (varKeyword2 != null) {
         reportError8(ParserErrorCode.FINAL_AND_VAR, varKeyword2, []);
       }
     }
     return lexicallyFirst([constKeyword2, finalKeyword2, varKeyword2]);
   }
-  
+
   /**
    * Validate that the given set of modifiers is appropriate for a class and return the 'abstract'
    * keyword if there is one.
    * @param modifiers the modifiers being validated
    */
   void validateModifiersForTypedef(Modifiers modifiers) {
     validateModifiersForTopLevelDeclaration(modifiers);
     if (modifiers.abstractKeyword != null) {
       reportError8(ParserErrorCode.ABSTRACT_TYPEDEF, modifiers.abstractKeyword, []);
     }
@@ skipping 15 matching lines @@
   KeywordToken_11(Keyword arg0, int arg1) : super(arg0, arg1);
   int get length => 0;
 }
 class AnalysisErrorListener_12 implements AnalysisErrorListener {
   List<bool> errorFound;
   AnalysisErrorListener_12(this.errorFound);
   void onError(AnalysisError error) {
     errorFound[0] = true;
   }
 }
-
 /**
  * The enumeration {@code ParserErrorCode} defines the error codes used for errors detected by the
  * parser. The convention for this class is for the name of the error code to indicate the problem
  * that caused the error to be generated and for the error message to explain what is wrong and,
  * when appropriate, how the problem can be corrected.
  * @coverage dart.engine.parser
  */
 class ParserErrorCode implements Comparable<ParserErrorCode>, ErrorCode {
   static final ParserErrorCode ABSTRACT_CLASS_MEMBER = new ParserErrorCode.con2('ABSTRACT_CLASS_MEMBER', 0, "Members of classes cannot be declared to be 'abstract'");
   static final ParserErrorCode ABSTRACT_STATIC_METHOD = new ParserErrorCode.con2('ABSTRACT_STATIC_METHOD', 1, "Static methods cannot be declared to be 'abstract'");
@@ skipping 108 matching lines @@
   static final ParserErrorCode WRONG_SEPARATOR_FOR_NAMED_PARAMETER = new ParserErrorCode.con2('WRONG_SEPARATOR_FOR_NAMED_PARAMETER', 110, "The default value of a named parameter should be preceeded by ':'");
   static final ParserErrorCode WRONG_SEPARATOR_FOR_POSITIONAL_PARAMETER = new ParserErrorCode.con2('WRONG_SEPARATOR_FOR_POSITIONAL_PARAMETER', 111, "The default value of a positional parameter should be preceeded by '='");
   static final ParserErrorCode WRONG_TERMINATOR_FOR_PARAMETER_GROUP = new ParserErrorCode.con2('WRONG_TERMINATOR_FOR_PARAMETER_GROUP', 112, "Expected '%s' to close parameter group");
   static final ParserErrorCode VAR_AS_TYPE_NAME = new ParserErrorCode.con2('VAR_AS_TYPE_NAME', 113, "The keyword 'var' cannot be used as a type name");
   static final ParserErrorCode VAR_CLASS = new ParserErrorCode.con2('VAR_CLASS', 114, "Classes cannot be declared to be 'var'");
   static final ParserErrorCode VAR_RETURN_TYPE = new ParserErrorCode.con2('VAR_RETURN_TYPE', 115, "The return type cannot be 'var'");
   static final ParserErrorCode VAR_TYPEDEF = new ParserErrorCode.con2('VAR_TYPEDEF', 116, "Type aliases cannot be declared to be 'var'");
   static final ParserErrorCode VOID_PARAMETER = new ParserErrorCode.con2('VOID_PARAMETER', 117, "Parameters cannot have a type of 'void'");
   static final ParserErrorCode VOID_VARIABLE = new ParserErrorCode.con2('VOID_VARIABLE', 118, "Variables cannot have a type of 'void'");
   static final List<ParserErrorCode> values = [ABSTRACT_CLASS_MEMBER, ABSTRACT_STATIC_METHOD, ABSTRACT_TOP_LEVEL_FUNCTION, ABSTRACT_TOP_LEVEL_VARIABLE, ABSTRACT_TYPEDEF, BREAK_OUTSIDE_OF_LOOP, CONST_AND_FINAL, CONST_AND_VAR, CONST_CLASS, CONST_CONSTRUCTOR_WITH_BODY, CONST_FACTORY, CONST_METHOD, CONST_TYPEDEF, CONSTRUCTOR_WITH_RETURN_TYPE, CONTINUE_OUTSIDE_OF_LOOP, CONTINUE_WITHOUT_LABEL_IN_CASE, DEPRECATED_ARGUMENT_DEFINITION_TEST, DIRECTIVE_AFTER_DECLARATION, DUPLICATE_LABEL_IN_SWITCH_STATEMENT, DUPLICATED_MODIFIER, EXPECTED_CASE_OR_DEFAULT, EXPECTED_CLASS_MEMBER, EXPECTED_EXECUTABLE, EXPECTED_LIST_OR_MAP_LITERAL, EXPECTED_STRING_LITERAL, EXPECTED_TOKEN, EXPECTED_TWO_MAP_TYPE_ARGUMENTS, EXPECTED_TYPE_NAME, EXPORT_DIRECTIVE_AFTER_PART_DIRECTIVE, EXTERNAL_AFTER_CONST, EXTERNAL_AFTER_FACTORY, EXTERNAL_AFTER_STATIC, EXTERNAL_CLASS, EXTERNAL_CONSTRUCTOR_WITH_BODY, EXTERNAL_FIELD, EXTERNAL_GETTER_WITH_BODY, EXTERNAL_METHOD_WITH_BODY, EXTERNAL_OPERATOR_WITH_BODY, EXTERNAL_SETTER_WITH_BODY, EXTERNAL_TYPEDEF, FACTORY_TOP_LEVEL_DECLARATION, FACTORY_WITHOUT_BODY, FIELD_INITIALIZER_OUTSIDE_CONSTRUCTOR, FINAL_AND_VAR, FINAL_CLASS, FINAL_CONSTRUCTOR, FINAL_METHOD, FINAL_TYPEDEF, GETTER_WITH_PARAMETERS, ILLEGAL_ASSIGNMENT_TO_NON_ASSIGNABLE, IMPLEMENTS_BEFORE_EXTENDS, IMPLEMENTS_BEFORE_WITH, IMPORT_DIRECTIVE_AFTER_PART_DIRECTIVE, INITIALIZED_VARIABLE_IN_FOR_EACH, INVALID_CODE_POINT, INVALID_COMMENT_REFERENCE, INVALID_HEX_ESCAPE, INVALID_OPERATOR, INVALID_OPERATOR_FOR_SUPER, INVALID_UNICODE_ESCAPE, LIBRARY_DIRECTIVE_NOT_FIRST, MISSING_ASSIGNABLE_SELECTOR, MISSING_CATCH_OR_FINALLY, MISSING_CLASS_BODY, MISSING_CLOSING_PARENTHESIS, MISSING_CONST_FINAL_VAR_OR_TYPE, MISSING_EXPRESSION_IN_THROW, MISSING_FUNCTION_BODY, MISSING_FUNCTION_PARAMETERS, MISSING_IDENTIFIER, MISSING_KEYWORD_OPERATOR, MISSING_NAME_IN_LIBRARY_DIRECTIVE, MISSING_NAME_IN_PART_OF_DIRECTIVE, MISSING_STATEMENT, MISSING_TERMINATOR_FOR_PARAMETER_GROUP, MISSING_TYPEDEF_PARAMETERS, MISSING_VARIABLE_IN_FOR_EACH, MIXED_PARAMETER_GROUPS, MULTIPLE_EXTENDS_CLAUSES, MULTIPLE_IMPLEMENTS_CLAUSES, MULTIPLE_LIBRARY_DIRECTIVES, MULTIPLE_NAMED_PARAMETER_GROUPS, MULTIPLE_PART_OF_DIRECTIVES, MULTIPLE_POSITIONAL_PARAMETER_GROUPS, MULTIPLE_VARIABLES_IN_FOR_EACH, MULTIPLE_WITH_CLAUSES, NAMED_FUNCTION_EXPRESSION, NAMED_PARAMETER_OUTSIDE_GROUP, NATIVE_FUNCTION_BODY_IN_NON_SDK_CODE, NON_CONSTRUCTOR_FACTORY, NON_IDENTIFIER_LIBRARY_NAME, NON_PART_OF_DIRECTIVE_IN_PART, NON_USER_DEFINABLE_OPERATOR, POSITIONAL_AFTER_NAMED_ARGUMENT, POSITIONAL_PARAMETER_OUTSIDE_GROUP, STATIC_AFTER_CONST, STATIC_AFTER_FINAL, STATIC_AFTER_VAR, STATIC_CONSTRUCTOR, STATIC_GETTER_WITHOUT_BODY, STATIC_OPERATOR, STATIC_SETTER_WITHOUT_BODY, STATIC_TOP_LEVEL_DECLARATION, SWITCH_HAS_CASE_AFTER_DEFAULT_CASE, SWITCH_HAS_MULTIPLE_DEFAULT_CASES, TOP_LEVEL_OPERATOR, UNEXPECTED_TERMINATOR_FOR_PARAMETER_GROUP, UNEXPECTED_TOKEN, WITH_BEFORE_EXTENDS, WITH_WITHOUT_EXTENDS, WRONG_SEPARATOR_FOR_NAMED_PARAMETER, WRONG_SEPARATOR_FOR_POSITIONAL_PARAMETER, WRONG_TERMINATOR_FOR_PARAMETER_GROUP, VAR_AS_TYPE_NAME, VAR_CLASS, VAR_RETURN_TYPE, VAR_TYPEDEF, VOID_PARAMETER, VOID_VARIABLE];
-  
+
   /// The name of this enum constant, as declared in the enum declaration.
   final String name;
-  
+
   /// The position in the enum declaration.
   final int ordinal;
-  
+
   /**
    * The severity of this error.
    */
   ErrorSeverity _severity;
-  
+
   /**
    * The message template used to create the message to be displayed for this error.
    */
   String _message;
-  
+
   /**
    * Initialize a newly created error code to have the given severity and message.
    * @param severity the severity of the error
    * @param message the message template used to create the message to be displayed for the error
    */
   ParserErrorCode.con1(this.name, this.ordinal, ErrorSeverity severity2, String message2) {
-    _jtd_constructor_309_impl(severity2, message2);
+    _jtd_constructor_311_impl(severity2, message2);
   }
-  _jtd_constructor_309_impl(ErrorSeverity severity2, String message2) {
+  _jtd_constructor_311_impl(ErrorSeverity severity2, String message2) {
     this._severity = severity2;
     this._message = message2;
   }
-  
+
   /**
    * Initialize a newly created error code to have the given message and a severity of ERROR.
    * @param message the message template used to create the message to be displayed for the error
    */
   ParserErrorCode.con2(this.name, this.ordinal, String message) {
-    _jtd_constructor_310_impl(message);
+    _jtd_constructor_312_impl(message);
   }
-  _jtd_constructor_310_impl(String message) {
-    _jtd_constructor_309_impl(ErrorSeverity.ERROR, message);
+  _jtd_constructor_312_impl(String message) {
+    _jtd_constructor_311_impl(ErrorSeverity.ERROR, message);
   }
   ErrorSeverity get errorSeverity => _severity;
   String get message => _message;
   ErrorType get type => ErrorType.SYNTACTIC_ERROR;
   int compareTo(ParserErrorCode other) => ordinal - other.ordinal;
   String toString() => name;
 }
-
 /**
  * Instances of the class {link ToFormattedSourceVisitor} write a source representation of a visited
  * AST node (and all of it's children) to a writer.
  */
 class ToFormattedSourceVisitor implements ASTVisitor<Object> {
-  
+
   /**
    * The writer to which the source is to be written.
    */
   PrintWriter _writer;
   int _indentLevel = 0;
   String _indentString = "";
-  
+
   /**
    * Initialize a newly created visitor to write source code representing the visited nodes to the
    * given writer.
    * @param writer the writer to which the source is to be written
    */
   ToFormattedSourceVisitor(PrintWriter writer) {
     this._writer = writer;
   }
   Object visitAdjacentStrings(AdjacentStrings node) {
     visitList5(node.strings, " ");
@@ skipping 744 matching lines @@
     _indentLevel += 2;
     _indentString = StringUtils.repeat(" ", _indentLevel);
   }
   void nl() {
     _writer.print("\n");
   }
   void nl2() {
     nl();
     indent();
   }
-  
+
   /**
    * Safely visit the given node.
    * @param node the node to be visited
    */
   void visit(ASTNode node) {
     if (node != null) {
       node.accept(this);
     }
   }
-  
+
   /**
    * Safely visit the given node, printing the suffix after the node if it is non-<code>null</code>.
    * @param suffix the suffix to be printed if there is a node to visit
    * @param node the node to be visited
    */
   void visit6(ASTNode node, String suffix) {
     if (node != null) {
       node.accept(this);
       _writer.print(suffix);
     }
   }
-  
+
   /**
    * Safely visit the given node, printing the prefix before the node if it is non-<code>null</code>
    * .
    * @param prefix the prefix to be printed if there is a node to visit
    * @param node the node to be visited
    */
   void visit7(String prefix, ASTNode node) {
     if (node != null) {
       _writer.print(prefix);
       node.accept(this);
     }
   }
-  
+
   /**
    * Safely visit the given node, printing the suffix after the node if it is non-<code>null</code>.
    * @param suffix the suffix to be printed if there is a node to visit
    * @param node the node to be visited
    */
   void visit8(Token token, String suffix) {
     if (token != null) {
       _writer.print(token.lexeme);
       _writer.print(suffix);
     }
   }
-  
+
   /**
    * Print a list of nodes without any separation.
    * @param nodes the nodes to be printed
    * @param separator the separator to be printed between adjacent nodes
    */
   void visitList(NodeList<ASTNode> nodes) {
     visitList5(nodes, "");
   }
-  
+
   /**
    * Print a list of nodes, separated by the given separator.
    * @param nodes the nodes to be printed
    * @param separator the separator to be printed between adjacent nodes
    */
   void visitList5(NodeList<ASTNode> nodes, String separator) {
     if (nodes != null) {
       int size2 = nodes.length;
       for (int i = 0; i < size2; i++) {
         if ("\n" == separator) {
           _writer.print("\n");
           indent();
         } else if (i > 0) {
           _writer.print(separator);
         }
         nodes[i].accept(this);
       }
     }
   }
-  
+
   /**
    * Print a list of nodes, separated by the given separator.
    * @param nodes the nodes to be printed
    * @param separator the separator to be printed between adjacent nodes
    * @param suffix the suffix to be printed if the list is not empty
    */
   void visitList6(NodeList<ASTNode> nodes, String separator, String suffix) {
     if (nodes != null) {
       int size2 = nodes.length;
       if (size2 > 0) {
         for (int i = 0; i < size2; i++) {
           if (i > 0) {
             _writer.print(separator);
           }
           nodes[i].accept(this);
         }
         _writer.print(suffix);
       }
     }
   }
-  
+
   /**
    * Print a list of nodes, separated by the given separator.
    * @param prefix the prefix to be printed if the list is not empty
    * @param nodes the nodes to be printed
    * @param separator the separator to be printed between adjacent nodes
    */
   void visitList7(String prefix, NodeList<ASTNode> nodes, String separator) {
     if (nodes != null) {
       int size2 = nodes.length;
       if (size2 > 0) {
         _writer.print(prefix);
         for (int i = 0; i < size2; i++) {
           if (i > 0) {
             _writer.print(separator);
           }
           nodes[i].accept(this);
         }
       }
     }
   }
 }