Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(305)

Side by Side Diff: pkg/analyzer_experimental/lib/src/generated/scanner.dart

Issue 12803014: New Analysis Engine translation. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Created 7 years, 9 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // This code was auto-generated, is not intended to be edited, and is subject to 1 // This code was auto-generated, is not intended to be edited, and is subject to
2 // significant change. Please see the README file for more information. 2 // significant change. Please see the README file for more information.
3 3
4 library engine.scanner; 4 library engine.scanner;
5 5
6 import 'dart:collection'; 6 import 'dart:collection';
7 import 'java_core.dart'; 7 import 'java_core.dart';
8 import 'source.dart'; 8 import 'source.dart';
9 import 'error.dart'; 9 import 'error.dart';
10 import 'instrumentation.dart'; 10 import 'instrumentation.dart';
(...skipping 167 matching lines...) Expand 10 before | Expand all | Expand 10 after
178 static final Keyword ASSERT = new Keyword.con1('ASSERT', 0, "assert"); 178 static final Keyword ASSERT = new Keyword.con1('ASSERT', 0, "assert");
179 static final Keyword BREAK = new Keyword.con1('BREAK', 1, "break"); 179 static final Keyword BREAK = new Keyword.con1('BREAK', 1, "break");
180 static final Keyword CASE = new Keyword.con1('CASE', 2, "case"); 180 static final Keyword CASE = new Keyword.con1('CASE', 2, "case");
181 static final Keyword CATCH = new Keyword.con1('CATCH', 3, "catch"); 181 static final Keyword CATCH = new Keyword.con1('CATCH', 3, "catch");
182 static final Keyword CLASS = new Keyword.con1('CLASS', 4, "class"); 182 static final Keyword CLASS = new Keyword.con1('CLASS', 4, "class");
183 static final Keyword CONST = new Keyword.con1('CONST', 5, "const"); 183 static final Keyword CONST = new Keyword.con1('CONST', 5, "const");
184 static final Keyword CONTINUE = new Keyword.con1('CONTINUE', 6, "continue"); 184 static final Keyword CONTINUE = new Keyword.con1('CONTINUE', 6, "continue");
185 static final Keyword DEFAULT = new Keyword.con1('DEFAULT', 7, "default"); 185 static final Keyword DEFAULT = new Keyword.con1('DEFAULT', 7, "default");
186 static final Keyword DO = new Keyword.con1('DO', 8, "do"); 186 static final Keyword DO = new Keyword.con1('DO', 8, "do");
187 static final Keyword ELSE = new Keyword.con1('ELSE', 9, "else"); 187 static final Keyword ELSE = new Keyword.con1('ELSE', 9, "else");
188 static final Keyword EXTENDS = new Keyword.con1('EXTENDS', 10, "extends"); 188 static final Keyword ENUM = new Keyword.con1('ENUM', 10, "enum");
189 static final Keyword FALSE = new Keyword.con1('FALSE', 11, "false"); 189 static final Keyword EXTENDS = new Keyword.con1('EXTENDS', 11, "extends");
190 static final Keyword FINAL = new Keyword.con1('FINAL', 12, "final"); 190 static final Keyword FALSE = new Keyword.con1('FALSE', 12, "false");
191 static final Keyword FINALLY = new Keyword.con1('FINALLY', 13, "finally"); 191 static final Keyword FINAL = new Keyword.con1('FINAL', 13, "final");
192 static final Keyword FOR = new Keyword.con1('FOR', 14, "for"); 192 static final Keyword FINALLY = new Keyword.con1('FINALLY', 14, "finally");
193 static final Keyword IF = new Keyword.con1('IF', 15, "if"); 193 static final Keyword FOR = new Keyword.con1('FOR', 15, "for");
194 static final Keyword IN = new Keyword.con1('IN', 16, "in"); 194 static final Keyword IF = new Keyword.con1('IF', 16, "if");
195 static final Keyword IS = new Keyword.con1('IS', 17, "is"); 195 static final Keyword IN = new Keyword.con1('IN', 17, "in");
196 static final Keyword NEW = new Keyword.con1('NEW', 18, "new"); 196 static final Keyword IS = new Keyword.con1('IS', 18, "is");
197 static final Keyword NULL = new Keyword.con1('NULL', 19, "null"); 197 static final Keyword NEW = new Keyword.con1('NEW', 19, "new");
198 static final Keyword RETURN = new Keyword.con1('RETURN', 20, "return"); 198 static final Keyword NULL = new Keyword.con1('NULL', 20, "null");
199 static final Keyword SUPER = new Keyword.con1('SUPER', 21, "super"); 199 static final Keyword RETHROW = new Keyword.con1('RETHROW', 21, "rethrow");
200 static final Keyword SWITCH = new Keyword.con1('SWITCH', 22, "switch"); 200 static final Keyword RETURN = new Keyword.con1('RETURN', 22, "return");
201 static final Keyword THIS = new Keyword.con1('THIS', 23, "this"); 201 static final Keyword SUPER = new Keyword.con1('SUPER', 23, "super");
202 static final Keyword THROW = new Keyword.con1('THROW', 24, "throw"); 202 static final Keyword SWITCH = new Keyword.con1('SWITCH', 24, "switch");
203 static final Keyword TRUE = new Keyword.con1('TRUE', 25, "true"); 203 static final Keyword THIS = new Keyword.con1('THIS', 25, "this");
204 static final Keyword TRY = new Keyword.con1('TRY', 26, "try"); 204 static final Keyword THROW = new Keyword.con1('THROW', 26, "throw");
205 static final Keyword VAR = new Keyword.con1('VAR', 27, "var"); 205 static final Keyword TRUE = new Keyword.con1('TRUE', 27, "true");
206 static final Keyword VOID = new Keyword.con1('VOID', 28, "void"); 206 static final Keyword TRY = new Keyword.con1('TRY', 28, "try");
207 static final Keyword WHILE = new Keyword.con1('WHILE', 29, "while"); 207 static final Keyword VAR = new Keyword.con1('VAR', 29, "var");
208 static final Keyword WITH = new Keyword.con1('WITH', 30, "with"); 208 static final Keyword VOID = new Keyword.con1('VOID', 30, "void");
209 static final Keyword ABSTRACT = new Keyword.con2('ABSTRACT', 31, "abstract", t rue); 209 static final Keyword WHILE = new Keyword.con1('WHILE', 31, "while");
210 static final Keyword AS = new Keyword.con2('AS', 32, "as", true); 210 static final Keyword WITH = new Keyword.con1('WITH', 32, "with");
211 static final Keyword DYNAMIC = new Keyword.con2('DYNAMIC', 33, "dynamic", true ); 211 static final Keyword ABSTRACT = new Keyword.con2('ABSTRACT', 33, "abstract", t rue);
212 static final Keyword EXPORT = new Keyword.con2('EXPORT', 34, "export", true); 212 static final Keyword AS = new Keyword.con2('AS', 34, "as", true);
213 static final Keyword EXTERNAL = new Keyword.con2('EXTERNAL', 35, "external", t rue); 213 static final Keyword DYNAMIC = new Keyword.con2('DYNAMIC', 35, "dynamic", true );
214 static final Keyword FACTORY = new Keyword.con2('FACTORY', 36, "factory", true ); 214 static final Keyword EXPORT = new Keyword.con2('EXPORT', 36, "export", true);
215 static final Keyword GET = new Keyword.con2('GET', 37, "get", true); 215 static final Keyword EXTERNAL = new Keyword.con2('EXTERNAL', 37, "external", t rue);
216 static final Keyword IMPLEMENTS = new Keyword.con2('IMPLEMENTS', 38, "implemen ts", true); 216 static final Keyword FACTORY = new Keyword.con2('FACTORY', 38, "factory", true );
217 static final Keyword IMPORT = new Keyword.con2('IMPORT', 39, "import", true); 217 static final Keyword GET = new Keyword.con2('GET', 39, "get", true);
218 static final Keyword LIBRARY = new Keyword.con2('LIBRARY', 40, "library", true ); 218 static final Keyword IMPLEMENTS = new Keyword.con2('IMPLEMENTS', 40, "implemen ts", true);
219 static final Keyword OPERATOR = new Keyword.con2('OPERATOR', 41, "operator", t rue); 219 static final Keyword IMPORT = new Keyword.con2('IMPORT', 41, "import", true);
220 static final Keyword PART = new Keyword.con2('PART', 42, "part", true); 220 static final Keyword LIBRARY = new Keyword.con2('LIBRARY', 42, "library", true );
221 static final Keyword SET = new Keyword.con2('SET', 43, "set", true); 221 static final Keyword OPERATOR = new Keyword.con2('OPERATOR', 43, "operator", t rue);
222 static final Keyword STATIC = new Keyword.con2('STATIC', 44, "static", true); 222 static final Keyword PART = new Keyword.con2('PART', 44, "part", true);
223 static final Keyword TYPEDEF = new Keyword.con2('TYPEDEF', 45, "typedef", true ); 223 static final Keyword SET = new Keyword.con2('SET', 45, "set", true);
224 static final List<Keyword> values = [ASSERT, BREAK, CASE, CATCH, CLASS, CONST, CONTINUE, DEFAULT, DO, ELSE, EXTENDS, FALSE, FINAL, FINALLY, FOR, IF, IN, IS, N EW, NULL, RETURN, SUPER, SWITCH, THIS, THROW, TRUE, TRY, VAR, VOID, WHILE, WITH, ABSTRACT, AS, DYNAMIC, EXPORT, EXTERNAL, FACTORY, GET, IMPLEMENTS, IMPORT, LIBR ARY, OPERATOR, PART, SET, STATIC, TYPEDEF]; 224 static final Keyword STATIC = new Keyword.con2('STATIC', 46, "static", true);
225 static final Keyword TYPEDEF = new Keyword.con2('TYPEDEF', 47, "typedef", true );
226 static final List<Keyword> values = [ASSERT, BREAK, CASE, CATCH, CLASS, CONST, CONTINUE, DEFAULT, DO, ELSE, ENUM, EXTENDS, FALSE, FINAL, FINALLY, FOR, IF, IN, IS, NEW, NULL, RETHROW, RETURN, SUPER, SWITCH, THIS, THROW, TRUE, TRY, VAR, VOI D, WHILE, WITH, ABSTRACT, AS, DYNAMIC, EXPORT, EXTERNAL, FACTORY, GET, IMPLEMENT S, IMPORT, LIBRARY, OPERATOR, PART, SET, STATIC, TYPEDEF];
225 String __name; 227 String __name;
226 int __ordinal = 0; 228 int __ordinal = 0;
227 int get ordinal => __ordinal; 229 int get ordinal => __ordinal;
228 /** 230 /**
229 * The lexeme for the keyword. 231 * The lexeme for the keyword.
230 */ 232 */
231 String _syntax; 233 String _syntax;
232 /** 234 /**
233 * A flag indicating whether the keyword is a pseudo-keyword. Pseudo keywords can be used as 235 * A flag indicating whether the keyword is a pseudo-keyword. Pseudo keywords can be used as
234 * identifiers. 236 * identifiers.
(...skipping 13 matching lines...) Expand all
248 result[keyword._syntax] = keyword; 250 result[keyword._syntax] = keyword;
249 } 251 }
250 return result; 252 return result;
251 } 253 }
252 /** 254 /**
253 * Initialize a newly created keyword to have the given syntax. The keyword is not a 255 * Initialize a newly created keyword to have the given syntax. The keyword is not a
254 * pseudo-keyword. 256 * pseudo-keyword.
255 * @param syntax the lexeme for the keyword 257 * @param syntax the lexeme for the keyword
256 */ 258 */
257 Keyword.con1(String ___name, int ___ordinal, String syntax) { 259 Keyword.con1(String ___name, int ___ordinal, String syntax) {
258 _jtd_constructor_278_impl(___name, ___ordinal, syntax); 260 _jtd_constructor_282_impl(___name, ___ordinal, syntax);
259 } 261 }
260 _jtd_constructor_278_impl(String ___name, int ___ordinal, String syntax) { 262 _jtd_constructor_282_impl(String ___name, int ___ordinal, String syntax) {
261 _jtd_constructor_279_impl(___name, ___ordinal, syntax, false); 263 _jtd_constructor_283_impl(___name, ___ordinal, syntax, false);
262 } 264 }
263 /** 265 /**
264 * Initialize a newly created keyword to have the given syntax. The keyword is a pseudo-keyword if 266 * Initialize a newly created keyword to have the given syntax. The keyword is a pseudo-keyword if
265 * the given flag is {@code true}. 267 * the given flag is {@code true}.
266 * @param syntax the lexeme for the keyword 268 * @param syntax the lexeme for the keyword
267 * @param isPseudoKeyword {@code true} if this keyword is a pseudo-keyword 269 * @param isPseudoKeyword {@code true} if this keyword is a pseudo-keyword
268 */ 270 */
269 Keyword.con2(String ___name, int ___ordinal, String syntax2, bool isPseudoKeyw ord) { 271 Keyword.con2(String ___name, int ___ordinal, String syntax2, bool isPseudoKeyw ord) {
270 _jtd_constructor_279_impl(___name, ___ordinal, syntax2, isPseudoKeyword); 272 _jtd_constructor_283_impl(___name, ___ordinal, syntax2, isPseudoKeyword);
271 } 273 }
272 _jtd_constructor_279_impl(String ___name, int ___ordinal, String syntax2, bool isPseudoKeyword) { 274 _jtd_constructor_283_impl(String ___name, int ___ordinal, String syntax2, bool isPseudoKeyword) {
273 __name = ___name; 275 __name = ___name;
274 __ordinal = ___ordinal; 276 __ordinal = ___ordinal;
275 this._syntax = syntax2; 277 this._syntax = syntax2;
276 this._isPseudoKeyword2 = isPseudoKeyword; 278 this._isPseudoKeyword2 = isPseudoKeyword;
277 } 279 }
278 /** 280 /**
279 * Return the lexeme for the keyword. 281 * Return the lexeme for the keyword.
280 * @return the lexeme for the keyword 282 * @return the lexeme for the keyword
281 */ 283 */
282 String get syntax => _syntax; 284 String get syntax => _syntax;
(...skipping 968 matching lines...) Expand 10 before | Expand all | Expand 10 after
1251 this._bufferLength = buffer.length(); 1253 this._bufferLength = buffer.length();
1252 this._charOffset = -1; 1254 this._charOffset = -1;
1253 } 1255 }
1254 int get offset => _charOffset; 1256 int get offset => _charOffset;
1255 int advance() { 1257 int advance() {
1256 if (_charOffset + 1 >= _bufferLength) { 1258 if (_charOffset + 1 >= _bufferLength) {
1257 return -1; 1259 return -1;
1258 } 1260 }
1259 return _buffer.charAt(++_charOffset); 1261 return _buffer.charAt(++_charOffset);
1260 } 1262 }
1261 String getString(int start, int endDelta) => _buffer.subSequence(start, _charO ffset + 1 + endDelta).toString(); 1263 String getString(int start, int endDelta) => ((_buffer as CharSequence)).subSe quence(start, _charOffset + 1 + endDelta).toString();
1262 int peek() { 1264 int peek() {
1263 if (_charOffset + 1 >= _buffer.length()) { 1265 if (_charOffset + 1 >= _buffer.length()) {
1264 return -1; 1266 return -1;
1265 } 1267 }
1266 return _buffer.charAt(_charOffset + 1); 1268 return _buffer.charAt(_charOffset + 1);
1267 } 1269 }
1268 } 1270 }
1269 /** 1271 /**
1270 * Instances of the class {@code TokenWithComment} represent a normal token that is preceded by 1272 * Instances of the class {@code TokenWithComment} represent a normal token that is preceded by
1271 * comments. 1273 * comments.
(...skipping 375 matching lines...) Expand 10 before | Expand all | Expand 10 after
1647 static final List<TokenClass> values = [NO_CLASS, ADDITIVE_OPERATOR, ASSIGNMEN T_OPERATOR, BITWISE_AND_OPERATOR, BITWISE_OR_OPERATOR, BITWISE_XOR_OPERATOR, CAS CADE_OPERATOR, CONDITIONAL_OPERATOR, EQUALITY_OPERATOR, LOGICAL_AND_OPERATOR, LO GICAL_OR_OPERATOR, MULTIPLICATIVE_OPERATOR, RELATIONAL_OPERATOR, SHIFT_OPERATOR, UNARY_POSTFIX_OPERATOR, UNARY_PREFIX_OPERATOR]; 1649 static final List<TokenClass> values = [NO_CLASS, ADDITIVE_OPERATOR, ASSIGNMEN T_OPERATOR, BITWISE_AND_OPERATOR, BITWISE_OR_OPERATOR, BITWISE_XOR_OPERATOR, CAS CADE_OPERATOR, CONDITIONAL_OPERATOR, EQUALITY_OPERATOR, LOGICAL_AND_OPERATOR, LO GICAL_OR_OPERATOR, MULTIPLICATIVE_OPERATOR, RELATIONAL_OPERATOR, SHIFT_OPERATOR, UNARY_POSTFIX_OPERATOR, UNARY_PREFIX_OPERATOR];
1648 String __name; 1650 String __name;
1649 int __ordinal = 0; 1651 int __ordinal = 0;
1650 int get ordinal => __ordinal; 1652 int get ordinal => __ordinal;
1651 /** 1653 /**
1652 * The precedence of tokens of this class, or {@code 0} if the such tokens do not represent an 1654 * The precedence of tokens of this class, or {@code 0} if the such tokens do not represent an
1653 * operator. 1655 * operator.
1654 */ 1656 */
1655 int _precedence = 0; 1657 int _precedence = 0;
1656 TokenClass.con1(String ___name, int ___ordinal) { 1658 TokenClass.con1(String ___name, int ___ordinal) {
1657 _jtd_constructor_288_impl(___name, ___ordinal); 1659 _jtd_constructor_292_impl(___name, ___ordinal);
1658 } 1660 }
1659 _jtd_constructor_288_impl(String ___name, int ___ordinal) { 1661 _jtd_constructor_292_impl(String ___name, int ___ordinal) {
1660 _jtd_constructor_289_impl(___name, ___ordinal, 0); 1662 _jtd_constructor_293_impl(___name, ___ordinal, 0);
1661 } 1663 }
1662 TokenClass.con2(String ___name, int ___ordinal, int precedence2) { 1664 TokenClass.con2(String ___name, int ___ordinal, int precedence2) {
1663 _jtd_constructor_289_impl(___name, ___ordinal, precedence2); 1665 _jtd_constructor_293_impl(___name, ___ordinal, precedence2);
1664 } 1666 }
1665 _jtd_constructor_289_impl(String ___name, int ___ordinal, int precedence2) { 1667 _jtd_constructor_293_impl(String ___name, int ___ordinal, int precedence2) {
1666 __name = ___name; 1668 __name = ___name;
1667 __ordinal = ___ordinal; 1669 __ordinal = ___ordinal;
1668 this._precedence = precedence2; 1670 this._precedence = precedence2;
1669 } 1671 }
1670 /** 1672 /**
1671 * Return the precedence of tokens of this class, or {@code 0} if the such tok ens do not represent 1673 * Return the precedence of tokens of this class, or {@code 0} if the such tok ens do not represent
1672 * an operator. 1674 * an operator.
1673 * @return the precedence of tokens of this class 1675 * @return the precedence of tokens of this class
1674 */ 1676 */
1675 int get precedence => _precedence; 1677 int get precedence => _precedence;
(...skipping 105 matching lines...) Expand 10 before | Expand all | Expand 10 after
1781 /** 1783 /**
1782 * The class of the token. 1784 * The class of the token.
1783 */ 1785 */
1784 TokenClass _tokenClass; 1786 TokenClass _tokenClass;
1785 /** 1787 /**
1786 * The lexeme that defines this type of token, or {@code null} if there is mor e than one possible 1788 * The lexeme that defines this type of token, or {@code null} if there is mor e than one possible
1787 * lexeme for this type of token. 1789 * lexeme for this type of token.
1788 */ 1790 */
1789 String _lexeme; 1791 String _lexeme;
1790 TokenType.con1(String ___name, int ___ordinal) { 1792 TokenType.con1(String ___name, int ___ordinal) {
1791 _jtd_constructor_290_impl(___name, ___ordinal); 1793 _jtd_constructor_294_impl(___name, ___ordinal);
1792 } 1794 }
1793 _jtd_constructor_290_impl(String ___name, int ___ordinal) { 1795 _jtd_constructor_294_impl(String ___name, int ___ordinal) {
1794 _jtd_constructor_291_impl(___name, ___ordinal, TokenClass.NO_CLASS, null); 1796 _jtd_constructor_295_impl(___name, ___ordinal, TokenClass.NO_CLASS, null);
1795 } 1797 }
1796 TokenType.con2(String ___name, int ___ordinal, TokenClass tokenClass2, String lexeme2) { 1798 TokenType.con2(String ___name, int ___ordinal, TokenClass tokenClass2, String lexeme2) {
1797 _jtd_constructor_291_impl(___name, ___ordinal, tokenClass2, lexeme2); 1799 _jtd_constructor_295_impl(___name, ___ordinal, tokenClass2, lexeme2);
1798 } 1800 }
1799 _jtd_constructor_291_impl(String ___name, int ___ordinal, TokenClass tokenClas s2, String lexeme2) { 1801 _jtd_constructor_295_impl(String ___name, int ___ordinal, TokenClass tokenClas s2, String lexeme2) {
1800 __name = ___name; 1802 __name = ___name;
1801 __ordinal = ___ordinal; 1803 __ordinal = ___ordinal;
1802 this._tokenClass = tokenClass2 == null ? TokenClass.NO_CLASS : tokenClass2; 1804 this._tokenClass = tokenClass2 == null ? TokenClass.NO_CLASS : tokenClass2;
1803 this._lexeme = lexeme2; 1805 this._lexeme = lexeme2;
1804 } 1806 }
1805 /** 1807 /**
1806 * Return the lexeme that defines this type of token, or {@code null} if there is more than one 1808 * Return the lexeme that defines this type of token, or {@code null} if there is more than one
1807 * possible lexeme for this type of token. 1809 * possible lexeme for this type of token.
1808 * @return the lexeme that defines this type of token 1810 * @return the lexeme that defines this type of token
1809 */ 1811 */
(...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after
1878 * Return {@code true} if this token type represents an operator that can be d efined by users. 1880 * Return {@code true} if this token type represents an operator that can be d efined by users.
1879 * @return {@code true} if this token type represents an operator that can be defined by users 1881 * @return {@code true} if this token type represents an operator that can be defined by users
1880 */ 1882 */
1881 bool isUserDefinableOperator() => identical(_lexeme, "==") || identical(_lexem e, "~") || identical(_lexeme, "[]") || identical(_lexeme, "[]=") || identical(_l exeme, "*") || identical(_lexeme, "/") || identical(_lexeme, "%") || identical(_ lexeme, "~/") || identical(_lexeme, "+") || identical(_lexeme, "-") || identical (_lexeme, "<<") || identical(_lexeme, ">>") || identical(_lexeme, ">=") || ident ical(_lexeme, ">") || identical(_lexeme, "<=") || identical(_lexeme, "<") || ide ntical(_lexeme, "&") || identical(_lexeme, "^") || identical(_lexeme, "|"); 1883 bool isUserDefinableOperator() => identical(_lexeme, "==") || identical(_lexem e, "~") || identical(_lexeme, "[]") || identical(_lexeme, "[]=") || identical(_l exeme, "*") || identical(_lexeme, "/") || identical(_lexeme, "%") || identical(_ lexeme, "~/") || identical(_lexeme, "+") || identical(_lexeme, "-") || identical (_lexeme, "<<") || identical(_lexeme, ">>") || identical(_lexeme, ">=") || ident ical(_lexeme, ">") || identical(_lexeme, "<=") || identical(_lexeme, "<") || ide ntical(_lexeme, "&") || identical(_lexeme, "^") || identical(_lexeme, "|");
1882 String toString() => __name; 1884 String toString() => __name;
1883 } 1885 }
1884 class TokenType_EOF extends TokenType { 1886 class TokenType_EOF extends TokenType {
1885 TokenType_EOF(String ___name, int ___ordinal, TokenClass arg0, String arg1) : super.con2(___name, ___ordinal, arg0, arg1); 1887 TokenType_EOF(String ___name, int ___ordinal, TokenClass arg0, String arg1) : super.con2(___name, ___ordinal, arg0, arg1);
1886 String toString() => "-eof-"; 1888 String toString() => "-eof-";
1887 } 1889 }
OLDNEW
« no previous file with comments | « pkg/analyzer_experimental/lib/src/generated/resolver.dart ('k') | pkg/analyzer_experimental/lib/src/generated/sdk.dart » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698