merge fasta.PrecedenceInfo into analyzer.TokenType

pkg/front_end/lib/src/fasta/scanner/token.dart

 // Copyright (c) 2011, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 library fasta.scanner.token;
 
 import '../../scanner/token.dart' as analyzer;
+import '../../scanner/token.dart' show TokenType;
 
 import 'precedence.dart'
-    show
-        AS_INFO,
-        BAD_INPUT_INFO,
-        EOF_INFO,
-        IS_INFO,
-        KEYWORD_INFO,
-        PrecedenceInfo;
+    show AS_INFO, BAD_INPUT_INFO, EOF_INFO, IS_INFO, KEYWORD_INFO;
 
 import 'token_constants.dart' show IDENTIFIER_TOKEN;
 
 import 'string_canonicalizer.dart';
 
 /**
  * A token that doubles as a linked list.
  */
 abstract class Token implements analyzer.TokenWithComment {
   /**
@@ skipping 32 matching lines @@
   void set precedingComments(analyzer.CommentToken token) {
     precedingCommentTokens = token;
   }
 
   /**
    * The precedence info for this token. [info] determines the kind and the
    * precedence level of this token.
    *
    * Defined as getter to save a field in the [KeywordToken] subclass.
    */
-  PrecedenceInfo get info;
+  TokenType get info;
 
   /**
    * The string represented by this token, a substring of the source code.
    *
    * For [StringToken]s the [lexeme] includes the quotes, explicit escapes, etc.
    */
   String get lexeme;
 
   /**
    * For symbol and keyword tokens, returns the string value represented by this
    * token. For [StringToken]s this method returns [:null:].
    *
    * For [SymbolToken]s and [KeywordToken]s, the string value is a compile-time
-   * constant originating in the [PrecedenceInfo] or in the [Keyword] instance.
+   * constant originating in the [TokenType] or in the [Keyword] instance.
    * This allows testing for keywords and symbols using [:identical:], e.g.,
    * [:identical('class', token.value):].
    *
    * Note that returning [:null:] for string tokens is important to identify
    * symbols and keywords, we cannot use [lexeme] instead. The string literal
    *   "$a($b"
    * produces ..., SymbolToken($), StringToken(a), StringToken((), ...
    *
    * After parsing the identifier 'a', the parser tests for a function
    * declaration using [:identical(next.stringValue, '('):], which (rightfully)
@@ skipping 148 matching lines @@
 
   @override
   Object value() => lexeme;
 }
 
 /**
  * A [SymbolToken] represents the symbol in its precedence info.
  * Also used for end of file with EOF_INFO.
  */
 class SymbolToken extends Token {
-  final PrecedenceInfo info;
+  final TokenType info;
 
   SymbolToken(this.info, int charOffset) : super(charOffset);
 
   factory SymbolToken.eof(int charOffset) {
     var eof = new SyntheticSymbolToken(EOF_INFO, charOffset);
     // EOF points to itself so there's always infinite look-ahead.
     eof.previousToken = eof;
     eof.next = eof;
     return eof;
   }
@@ skipping 19 matching lines @@
       : new SymbolToken(info, charOffset);
 }
 
 /**
  * A [SyntheticSymbolToken] represents the symbol in its precedence info
  * which does not exist in the original source.
  * For example, if the scanner finds '(' missing a ')'
  * then it will insert an synthetic ')'.
  */
 class SyntheticSymbolToken extends SymbolToken {
-  SyntheticSymbolToken(PrecedenceInfo info, int charOffset)
+  SyntheticSymbolToken(TokenType info, int charOffset)
       : super(info, charOffset);
 
   @override
   int get charCount => 0;
 
   @override
   bool get isSynthetic => true;
 
   @override
   Token copyWithoutComments() => isEof
       ? new SymbolToken.eof(charOffset)
       : new SyntheticSymbolToken(info, charOffset);
 }
 
 /**
  * A [BeginGroupToken] represents a symbol that may be the beginning of
  * a pair of brackets, i.e., ( { [ < or ${
  * The [endGroup] token points to the matching closing bracked in case
  * it can be identified during scanning.
  */
 class BeginGroupToken extends SymbolToken
     implements analyzer.BeginTokenWithComment {
   Token endGroup;
 
-  BeginGroupToken(PrecedenceInfo info, int charOffset)
-      : super(info, charOffset);
+  BeginGroupToken(TokenType info, int charOffset) : super(info, charOffset);
 
   @override
   analyzer.Token get endToken => endGroup;
 
   @override
   void set endToken(analyzer.Token token) {
     endGroup = token;
   }
 
   @override
   Token copyWithoutComments() => new BeginGroupToken(info, charOffset);
 }
 
 /**
  * A keyword token.
  */
 class KeywordToken extends Token implements analyzer.KeywordTokenWithComment {
   final analyzer.Keyword keyword;
 
   KeywordToken(this.keyword, int charOffset) : super(charOffset);
 
-  PrecedenceInfo get info => keyword.info;
+  TokenType get info => keyword.info;
 
   String get lexeme => keyword.syntax;
 
   String get stringValue => keyword.syntax;
 
   bool isIdentifier() => keyword.isPseudo || keyword.isBuiltIn;
 
   bool get isPseudo => keyword.isPseudo;
 
   bool get isBuiltInIdentifier => keyword.isBuiltIn;
@@ skipping 43 matching lines @@
    *
    * For string tokens that are substrings of the program source, the actual
    * substring extraction is performed lazily. This is beneficial because
    * not all scanned code is actually used. For unused parts, the substrings
    * are never computed and allocated.
    */
   static const int LAZY_THRESHOLD = 4;
 
   var /* String | LazySubtring */ valueOrLazySubstring;
 
-  final PrecedenceInfo info;
+  final TokenType info;
 
   /**
    * Creates a non-lazy string token. If [canonicalize] is true, the string
    * is canonicalized before the token is created.
    */
   StringToken.fromString(this.info, String value, int charOffset,
       {bool canonicalize: false})
       : valueOrLazySubstring =
             canonicalizedString(value, 0, value.length, canonicalize),
         super(charOffset);
@@ skipping 78 matching lines @@
 
   @override
   String value() => lexeme;
 }
 
 /**
  * A String-valued token that does not exist in the original source.
  */
 class SyntheticStringToken extends StringToken
     implements analyzer.SyntheticStringToken {
-  SyntheticStringToken(PrecedenceInfo info, String value, int offset)
+  SyntheticStringToken(TokenType info, String value, int offset)
       : super._(info, value, offset);
 
   @override
   bool get isSynthetic => true;
 
   @override
   int get length => 0;
 
   @override
   Token copyWithoutComments() =>
       new SyntheticStringToken(info, valueOrLazySubstring, offset);
 }
 
 class CommentToken extends StringToken implements analyzer.CommentToken {
   @override
   analyzer.TokenWithComment parent;
 
   /**
    * Creates a lazy comment token. If [canonicalize] is true, the string
    * is canonicalized before the token is created.
    */
   CommentToken.fromSubstring(
-      PrecedenceInfo info, String data, int start, int end, int charOffset,
+      TokenType info, String data, int start, int end, int charOffset,
       {bool canonicalize: false})
       : super.fromSubstring(info, data, start, end, charOffset,
             canonicalize: canonicalize);
 
   /**
    * Creates a non-lazy comment token.
    */
-  CommentToken.fromString(PrecedenceInfo info, String lexeme, int charOffset)
+  CommentToken.fromString(TokenType info, String lexeme, int charOffset)
       : super.fromString(info, lexeme, charOffset);
 
   /**
    * Creates a lazy string token. If [asciiOnly] is false, the byte array
    * is passed through a UTF-8 decoder.
    */
-  CommentToken.fromUtf8Bytes(PrecedenceInfo info, List<int> data, int start,
-      int end, bool asciiOnly, int charOffset)
+  CommentToken.fromUtf8Bytes(TokenType info, List<int> data, int start, int end,
+      bool asciiOnly, int charOffset)
       : super.fromUtf8Bytes(info, data, start, end, asciiOnly, charOffset);
 
-  CommentToken._(PrecedenceInfo info, valueOrLazySubstring, int charOffset)
+  CommentToken._(TokenType info, valueOrLazySubstring, int charOffset)
       : super._(info, valueOrLazySubstring, charOffset);
 
   @override
   CommentToken copy() =>
       new CommentToken._(info, valueOrLazySubstring, charOffset);
 
   @override
   void remove() {
     if (previous != null) {
       previous.setNextWithoutSettingPrevious(next);
@@ skipping 12 matching lines @@
    * This list will be empty unless this is a documentation comment that has
    * references embedded within it.
    */
   final List<Token> references = <Token>[];
 
   /**
    * Creates a lazy comment token. If [canonicalize] is true, the string
    * is canonicalized before the token is created.
    */
   DartDocToken.fromSubstring(
-      PrecedenceInfo info, String data, int start, int end, int charOffset,
+      TokenType info, String data, int start, int end, int charOffset,
       {bool canonicalize: false})
       : super.fromSubstring(info, data, start, end, charOffset,
             canonicalize: canonicalize);
 
   /**
    * Creates a lazy string token. If [asciiOnly] is false, the byte array
    * is passed through a UTF-8 decoder.
    */
-  DartDocToken.fromUtf8Bytes(PrecedenceInfo info, List<int> data, int start,
-      int end, bool asciiOnly, int charOffset)
+  DartDocToken.fromUtf8Bytes(TokenType info, List<int> data, int start, int end,
+      bool asciiOnly, int charOffset)
       : super.fromUtf8Bytes(info, data, start, end, asciiOnly, charOffset);
 
-  DartDocToken._(PrecedenceInfo info, valueOrLazySubstring, int charOffset)
+  DartDocToken._(TokenType info, valueOrLazySubstring, int charOffset)
       : super._(info, valueOrLazySubstring, charOffset);
 
   @override
   DartDocToken copy() {
     DartDocToken copy =
         new DartDocToken._(info, valueOrLazySubstring, charOffset);
     references.forEach((ref) => copy.references.add(ref.copy()));
     return copy;
   }
 }
@@ skipping 87 matching lines @@
       identical(value, "<=") ||
       identical(value, "<") ||
       identical(value, "&") ||
       identical(value, "^") ||
       identical(value, "|");
 }
 
 bool isTernaryOperator(String value) => identical(value, "[]=");
 
 bool isMinusOperator(String value) => identical(value, "-");