src/share/classes/com/sun/tools/javac/parser/JavacParser.java

Tue, 16 Jun 2009 10:46:16 +0100

author
mcimadamore
date
Tue, 16 Jun 2009 10:46:16 +0100
changeset 298
3ac205ad1f05
parent 267
e2722bd43f3a
child 308
03944ee4fac4
permissions
-rw-r--r--

6835428: regression: return-type inference rejects valid code
Summary: Redundant subtyping test during type-inference ends up in rejecting legal code
Reviewed-by: jjg

duke@1 1 /*
xdono@229 2 * Copyright 1999-2009 Sun Microsystems, Inc. All Rights Reserved.
duke@1 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@1 4 *
duke@1 5 * This code is free software; you can redistribute it and/or modify it
duke@1 6 * under the terms of the GNU General Public License version 2 only, as
duke@1 7 * published by the Free Software Foundation. Sun designates this
duke@1 8 * particular file as subject to the "Classpath" exception as provided
duke@1 9 * by Sun in the LICENSE file that accompanied this code.
duke@1 10 *
duke@1 11 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@1 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@1 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@1 14 * version 2 for more details (a copy is included in the LICENSE file that
duke@1 15 * accompanied this code).
duke@1 16 *
duke@1 17 * You should have received a copy of the GNU General Public License version
duke@1 18 * 2 along with this work; if not, write to the Free Software Foundation,
duke@1 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@1 20 *
duke@1 21 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@1 22 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@1 23 * have any questions.
duke@1 24 */
duke@1 25
duke@1 26 package com.sun.tools.javac.parser;
duke@1 27
duke@1 28 import java.util.*;
duke@1 29
duke@1 30 import com.sun.tools.javac.tree.*;
duke@1 31 import com.sun.tools.javac.code.*;
duke@1 32 import com.sun.tools.javac.util.*;
duke@1 33 import com.sun.tools.javac.util.List;
duke@1 34 import static com.sun.tools.javac.util.ListBuffer.lb;
duke@1 35
duke@1 36 import com.sun.tools.javac.tree.JCTree.*;
duke@1 37
duke@1 38 import static com.sun.tools.javac.parser.Token.*;
duke@1 39
duke@1 40 /** The parser maps a token sequence into an abstract syntax
duke@1 41 * tree. It operates by recursive descent, with code derived
duke@1 42 * systematically from an LL(1) grammar. For efficiency reasons, an
duke@1 43 * operator precedence scheme is used for parsing binary operation
duke@1 44 * expressions.
duke@1 45 *
duke@1 46 * <p><b>This is NOT part of any API supported by Sun Microsystems. If
duke@1 47 * you write code that depends on this, you do so at your own risk.
duke@1 48 * This code and its internal interfaces are subject to change or
duke@1 49 * deletion without notice.</b>
duke@1 50 */
jjg@111 51 public class JavacParser implements Parser {
duke@1 52
duke@1 53 /** The number of precedence levels of infix operators.
duke@1 54 */
duke@1 55 private static final int infixPrecedenceLevels = 10;
duke@1 56
duke@1 57 /** The scanner used for lexical analysis.
duke@1 58 */
duke@1 59 private Lexer S;
duke@1 60
duke@1 61 /** The factory to be used for abstract syntax tree construction.
duke@1 62 */
duke@1 63 protected TreeMaker F;
duke@1 64
duke@1 65 /** The log to be used for error diagnostics.
duke@1 66 */
duke@1 67 private Log log;
duke@1 68
duke@1 69 /** The keyword table. */
duke@1 70 private Keywords keywords;
duke@1 71
duke@1 72 /** The Source language setting. */
duke@1 73 private Source source;
duke@1 74
duke@1 75 /** The name table. */
jjg@113 76 private Names names;
duke@1 77
duke@1 78 /** Construct a parser from a given scanner, tree factory and log.
duke@1 79 */
jjg@111 80 protected JavacParser(ParserFactory fac,
duke@1 81 Lexer S,
jjg@111 82 boolean keepDocComments,
jjg@111 83 boolean keepLineMap) {
duke@1 84 this.S = S;
duke@1 85 S.nextToken(); // prime the pump
duke@1 86 this.F = fac.F;
duke@1 87 this.log = fac.log;
duke@1 88 this.names = fac.names;
duke@1 89 this.keywords = fac.keywords;
duke@1 90 this.source = fac.source;
duke@1 91 this.allowGenerics = source.allowGenerics();
duke@1 92 this.allowVarargs = source.allowVarargs();
duke@1 93 this.allowAsserts = source.allowAsserts();
duke@1 94 this.allowEnums = source.allowEnums();
duke@1 95 this.allowForeach = source.allowForeach();
duke@1 96 this.allowStaticImport = source.allowStaticImport();
duke@1 97 this.allowAnnotations = source.allowAnnotations();
duke@1 98 this.keepDocComments = keepDocComments;
jjg@111 99 if (keepDocComments)
jjg@111 100 docComments = new HashMap<JCTree,String>();
jjg@111 101 this.keepLineMap = keepLineMap;
duke@1 102 this.errorTree = F.Erroneous();
duke@1 103 }
duke@1 104
duke@1 105 /** Switch: Should generics be recognized?
duke@1 106 */
duke@1 107 boolean allowGenerics;
duke@1 108
duke@1 109 /** Switch: Should varargs be recognized?
duke@1 110 */
duke@1 111 boolean allowVarargs;
duke@1 112
duke@1 113 /** Switch: should we recognize assert statements, or just give a warning?
duke@1 114 */
duke@1 115 boolean allowAsserts;
duke@1 116
duke@1 117 /** Switch: should we recognize enums, or just give a warning?
duke@1 118 */
duke@1 119 boolean allowEnums;
duke@1 120
duke@1 121 /** Switch: should we recognize foreach?
duke@1 122 */
duke@1 123 boolean allowForeach;
duke@1 124
duke@1 125 /** Switch: should we recognize foreach?
duke@1 126 */
duke@1 127 boolean allowStaticImport;
duke@1 128
duke@1 129 /** Switch: should we recognize annotations?
duke@1 130 */
duke@1 131 boolean allowAnnotations;
duke@1 132
duke@1 133 /** Switch: should we keep docComments?
duke@1 134 */
duke@1 135 boolean keepDocComments;
duke@1 136
jjg@111 137 /** Switch: should we keep line table?
jjg@111 138 */
jjg@111 139 boolean keepLineMap;
jjg@111 140
duke@1 141 /** When terms are parsed, the mode determines which is expected:
duke@1 142 * mode = EXPR : an expression
duke@1 143 * mode = TYPE : a type
duke@1 144 * mode = NOPARAMS : no parameters allowed for type
duke@1 145 * mode = TYPEARG : type argument
duke@1 146 */
duke@1 147 static final int EXPR = 1;
duke@1 148 static final int TYPE = 2;
duke@1 149 static final int NOPARAMS = 4;
duke@1 150 static final int TYPEARG = 8;
duke@1 151
duke@1 152 /** The current mode.
duke@1 153 */
duke@1 154 private int mode = 0;
duke@1 155
duke@1 156 /** The mode of the term that was parsed last.
duke@1 157 */
duke@1 158 private int lastmode = 0;
duke@1 159
duke@1 160 /* ---------- error recovery -------------- */
duke@1 161
duke@1 162 private JCErroneous errorTree;
duke@1 163
duke@1 164 /** Skip forward until a suitable stop token is found.
duke@1 165 */
duke@1 166 private void skip(boolean stopAtImport, boolean stopAtMemberDecl, boolean stopAtIdentifier, boolean stopAtStatement) {
duke@1 167 while (true) {
duke@1 168 switch (S.token()) {
duke@1 169 case SEMI:
duke@1 170 S.nextToken();
duke@1 171 return;
duke@1 172 case PUBLIC:
duke@1 173 case FINAL:
duke@1 174 case ABSTRACT:
duke@1 175 case MONKEYS_AT:
duke@1 176 case EOF:
duke@1 177 case CLASS:
duke@1 178 case INTERFACE:
duke@1 179 case ENUM:
duke@1 180 return;
duke@1 181 case IMPORT:
duke@1 182 if (stopAtImport)
duke@1 183 return;
duke@1 184 break;
duke@1 185 case LBRACE:
duke@1 186 case RBRACE:
duke@1 187 case PRIVATE:
duke@1 188 case PROTECTED:
duke@1 189 case STATIC:
duke@1 190 case TRANSIENT:
duke@1 191 case NATIVE:
duke@1 192 case VOLATILE:
duke@1 193 case SYNCHRONIZED:
duke@1 194 case STRICTFP:
duke@1 195 case LT:
duke@1 196 case BYTE:
duke@1 197 case SHORT:
duke@1 198 case CHAR:
duke@1 199 case INT:
duke@1 200 case LONG:
duke@1 201 case FLOAT:
duke@1 202 case DOUBLE:
duke@1 203 case BOOLEAN:
duke@1 204 case VOID:
duke@1 205 if (stopAtMemberDecl)
duke@1 206 return;
duke@1 207 break;
duke@1 208 case IDENTIFIER:
duke@1 209 if (stopAtIdentifier)
duke@1 210 return;
duke@1 211 break;
duke@1 212 case CASE:
duke@1 213 case DEFAULT:
duke@1 214 case IF:
duke@1 215 case FOR:
duke@1 216 case WHILE:
duke@1 217 case DO:
duke@1 218 case TRY:
duke@1 219 case SWITCH:
duke@1 220 case RETURN:
duke@1 221 case THROW:
duke@1 222 case BREAK:
duke@1 223 case CONTINUE:
duke@1 224 case ELSE:
duke@1 225 case FINALLY:
duke@1 226 case CATCH:
duke@1 227 if (stopAtStatement)
duke@1 228 return;
duke@1 229 break;
duke@1 230 }
duke@1 231 S.nextToken();
duke@1 232 }
duke@1 233 }
duke@1 234
mcimadamore@80 235 private JCErroneous syntaxError(int pos, String key, Token... args) {
mcimadamore@80 236 return syntaxError(pos, null, key, args);
duke@1 237 }
duke@1 238
mcimadamore@80 239 private JCErroneous syntaxError(int pos, List<JCTree> errs, String key, Token... args) {
duke@1 240 setErrorEndPos(pos);
mcimadamore@80 241 reportSyntaxError(pos, key, (Object[])args);
duke@1 242 return toP(F.at(pos).Erroneous(errs));
duke@1 243 }
duke@1 244
duke@1 245 private int errorPos = Position.NOPOS;
duke@1 246 /**
duke@1 247 * Report a syntax error at given position using the given
duke@1 248 * argument unless one was already reported at the same position.
duke@1 249 */
mcimadamore@80 250 private void reportSyntaxError(int pos, String key, Object... args) {
duke@1 251 if (pos > S.errPos() || pos == Position.NOPOS) {
duke@1 252 if (S.token() == EOF)
duke@1 253 log.error(pos, "premature.eof");
duke@1 254 else
mcimadamore@80 255 log.error(pos, key, args);
duke@1 256 }
duke@1 257 S.errPos(pos);
duke@1 258 if (S.pos() == errorPos)
duke@1 259 S.nextToken(); // guarantee progress
duke@1 260 errorPos = S.pos();
duke@1 261 }
duke@1 262
duke@1 263
duke@1 264 /** Generate a syntax error at current position unless one was already
duke@1 265 * reported at the same position.
duke@1 266 */
duke@1 267 private JCErroneous syntaxError(String key) {
duke@1 268 return syntaxError(S.pos(), key);
duke@1 269 }
duke@1 270
duke@1 271 /** Generate a syntax error at current position unless one was
duke@1 272 * already reported at the same position.
duke@1 273 */
mcimadamore@80 274 private JCErroneous syntaxError(String key, Token arg) {
duke@1 275 return syntaxError(S.pos(), key, arg);
duke@1 276 }
duke@1 277
duke@1 278 /** If next input token matches given token, skip it, otherwise report
duke@1 279 * an error.
duke@1 280 */
duke@1 281 public void accept(Token token) {
duke@1 282 if (S.token() == token) {
duke@1 283 S.nextToken();
duke@1 284 } else {
duke@1 285 setErrorEndPos(S.pos());
mcimadamore@80 286 reportSyntaxError(S.prevEndPos(), "expected", token);
duke@1 287 }
duke@1 288 }
duke@1 289
duke@1 290 /** Report an illegal start of expression/type error at given position.
duke@1 291 */
duke@1 292 JCExpression illegal(int pos) {
duke@1 293 setErrorEndPos(S.pos());
duke@1 294 if ((mode & EXPR) != 0)
duke@1 295 return syntaxError(pos, "illegal.start.of.expr");
duke@1 296 else
duke@1 297 return syntaxError(pos, "illegal.start.of.type");
duke@1 298
duke@1 299 }
duke@1 300
duke@1 301 /** Report an illegal start of expression/type error at current position.
duke@1 302 */
duke@1 303 JCExpression illegal() {
duke@1 304 return illegal(S.pos());
duke@1 305 }
duke@1 306
duke@1 307 /** Diagnose a modifier flag from the set, if any. */
duke@1 308 void checkNoMods(long mods) {
duke@1 309 if (mods != 0) {
duke@1 310 long lowestMod = mods & -mods;
duke@1 311 log.error(S.pos(), "mod.not.allowed.here",
mcimadamore@80 312 Flags.asFlagSet(lowestMod));
duke@1 313 }
duke@1 314 }
duke@1 315
duke@1 316 /* ---------- doc comments --------- */
duke@1 317
duke@1 318 /** A hashtable to store all documentation comments
duke@1 319 * indexed by the tree nodes they refer to.
duke@1 320 * defined only if option flag keepDocComment is set.
duke@1 321 */
duke@1 322 Map<JCTree, String> docComments;
duke@1 323
duke@1 324 /** Make an entry into docComments hashtable,
duke@1 325 * provided flag keepDocComments is set and given doc comment is non-null.
duke@1 326 * @param tree The tree to be used as index in the hashtable
duke@1 327 * @param dc The doc comment to associate with the tree, or null.
duke@1 328 */
duke@1 329 void attach(JCTree tree, String dc) {
duke@1 330 if (keepDocComments && dc != null) {
duke@1 331 // System.out.println("doc comment = ");System.out.println(dc);//DEBUG
duke@1 332 docComments.put(tree, dc);
duke@1 333 }
duke@1 334 }
duke@1 335
duke@1 336 /* -------- source positions ------- */
duke@1 337
duke@1 338 private int errorEndPos = -1;
duke@1 339
duke@1 340 private void setErrorEndPos(int errPos) {
duke@1 341 if (errPos > errorEndPos)
duke@1 342 errorEndPos = errPos;
duke@1 343 }
duke@1 344
duke@1 345 protected int getErrorEndPos() {
duke@1 346 return errorEndPos;
duke@1 347 }
duke@1 348
duke@1 349 /**
duke@1 350 * Store ending position for a tree.
duke@1 351 * @param tree The tree.
duke@1 352 * @param endpos The ending position to associate with the tree.
duke@1 353 */
duke@1 354 protected void storeEnd(JCTree tree, int endpos) {}
duke@1 355
duke@1 356 /**
duke@1 357 * Store ending position for a tree. The ending position should
duke@1 358 * be the ending position of the current token.
duke@1 359 * @param t The tree.
duke@1 360 */
duke@1 361 protected <T extends JCTree> T to(T t) { return t; }
duke@1 362
duke@1 363 /**
duke@1 364 * Store ending position for a tree. The ending position should
duke@1 365 * be greater of the ending position of the previous token and errorEndPos.
duke@1 366 * @param t The tree.
duke@1 367 */
duke@1 368 protected <T extends JCTree> T toP(T t) { return t; }
duke@1 369
duke@1 370 /** Get the start position for a tree node. The start position is
duke@1 371 * defined to be the position of the first character of the first
duke@1 372 * token of the node's source text.
duke@1 373 * @param tree The tree node
duke@1 374 */
duke@1 375 public int getStartPos(JCTree tree) {
duke@1 376 return TreeInfo.getStartPos(tree);
duke@1 377 }
duke@1 378
duke@1 379 /**
duke@1 380 * Get the end position for a tree node. The end position is
duke@1 381 * defined to be the position of the last character of the last
duke@1 382 * token of the node's source text. Returns Position.NOPOS if end
duke@1 383 * positions are not generated or the position is otherwise not
duke@1 384 * found.
duke@1 385 * @param tree The tree node
duke@1 386 */
duke@1 387 public int getEndPos(JCTree tree) {
duke@1 388 return Position.NOPOS;
duke@1 389 }
duke@1 390
duke@1 391
duke@1 392
duke@1 393 /* ---------- parsing -------------- */
duke@1 394
duke@1 395 /**
duke@1 396 * Ident = IDENTIFIER
duke@1 397 */
duke@1 398 Name ident() {
duke@1 399 if (S.token() == IDENTIFIER) {
duke@1 400 Name name = S.name();
duke@1 401 S.nextToken();
duke@1 402 return name;
duke@1 403 } else if (S.token() == ASSERT) {
duke@1 404 if (allowAsserts) {
duke@1 405 log.error(S.pos(), "assert.as.identifier");
duke@1 406 S.nextToken();
duke@1 407 return names.error;
duke@1 408 } else {
duke@1 409 log.warning(S.pos(), "assert.as.identifier");
duke@1 410 Name name = S.name();
duke@1 411 S.nextToken();
duke@1 412 return name;
duke@1 413 }
duke@1 414 } else if (S.token() == ENUM) {
duke@1 415 if (allowEnums) {
duke@1 416 log.error(S.pos(), "enum.as.identifier");
duke@1 417 S.nextToken();
duke@1 418 return names.error;
duke@1 419 } else {
duke@1 420 log.warning(S.pos(), "enum.as.identifier");
duke@1 421 Name name = S.name();
duke@1 422 S.nextToken();
duke@1 423 return name;
duke@1 424 }
duke@1 425 } else {
duke@1 426 accept(IDENTIFIER);
duke@1 427 return names.error;
duke@1 428 }
duke@1 429 }
duke@1 430
duke@1 431 /**
duke@1 432 * Qualident = Ident { DOT Ident }
duke@1 433 */
duke@1 434 public JCExpression qualident() {
duke@1 435 JCExpression t = toP(F.at(S.pos()).Ident(ident()));
duke@1 436 while (S.token() == DOT) {
duke@1 437 int pos = S.pos();
duke@1 438 S.nextToken();
duke@1 439 t = toP(F.at(pos).Select(t, ident()));
duke@1 440 }
duke@1 441 return t;
duke@1 442 }
duke@1 443
duke@1 444 /**
duke@1 445 * Literal =
duke@1 446 * INTLITERAL
duke@1 447 * | LONGLITERAL
duke@1 448 * | FLOATLITERAL
duke@1 449 * | DOUBLELITERAL
duke@1 450 * | CHARLITERAL
duke@1 451 * | STRINGLITERAL
duke@1 452 * | TRUE
duke@1 453 * | FALSE
duke@1 454 * | NULL
duke@1 455 */
duke@1 456 JCExpression literal(Name prefix) {
duke@1 457 int pos = S.pos();
duke@1 458 JCExpression t = errorTree;
duke@1 459 switch (S.token()) {
duke@1 460 case INTLITERAL:
duke@1 461 try {
duke@1 462 t = F.at(pos).Literal(
duke@1 463 TypeTags.INT,
duke@1 464 Convert.string2int(strval(prefix), S.radix()));
duke@1 465 } catch (NumberFormatException ex) {
duke@1 466 log.error(S.pos(), "int.number.too.large", strval(prefix));
duke@1 467 }
duke@1 468 break;
duke@1 469 case LONGLITERAL:
duke@1 470 try {
duke@1 471 t = F.at(pos).Literal(
duke@1 472 TypeTags.LONG,
duke@1 473 new Long(Convert.string2long(strval(prefix), S.radix())));
duke@1 474 } catch (NumberFormatException ex) {
duke@1 475 log.error(S.pos(), "int.number.too.large", strval(prefix));
duke@1 476 }
duke@1 477 break;
duke@1 478 case FLOATLITERAL: {
duke@1 479 String proper = (S.radix() == 16 ? ("0x"+ S.stringVal()) : S.stringVal());
duke@1 480 Float n;
duke@1 481 try {
duke@1 482 n = Float.valueOf(proper);
duke@1 483 } catch (NumberFormatException ex) {
duke@1 484 // error already repoted in scanner
duke@1 485 n = Float.NaN;
duke@1 486 }
duke@1 487 if (n.floatValue() == 0.0f && !isZero(proper))
duke@1 488 log.error(S.pos(), "fp.number.too.small");
duke@1 489 else if (n.floatValue() == Float.POSITIVE_INFINITY)
duke@1 490 log.error(S.pos(), "fp.number.too.large");
duke@1 491 else
duke@1 492 t = F.at(pos).Literal(TypeTags.FLOAT, n);
duke@1 493 break;
duke@1 494 }
duke@1 495 case DOUBLELITERAL: {
duke@1 496 String proper = (S.radix() == 16 ? ("0x"+ S.stringVal()) : S.stringVal());
duke@1 497 Double n;
duke@1 498 try {
duke@1 499 n = Double.valueOf(proper);
duke@1 500 } catch (NumberFormatException ex) {
duke@1 501 // error already reported in scanner
duke@1 502 n = Double.NaN;
duke@1 503 }
duke@1 504 if (n.doubleValue() == 0.0d && !isZero(proper))
duke@1 505 log.error(S.pos(), "fp.number.too.small");
duke@1 506 else if (n.doubleValue() == Double.POSITIVE_INFINITY)
duke@1 507 log.error(S.pos(), "fp.number.too.large");
duke@1 508 else
duke@1 509 t = F.at(pos).Literal(TypeTags.DOUBLE, n);
duke@1 510 break;
duke@1 511 }
duke@1 512 case CHARLITERAL:
duke@1 513 t = F.at(pos).Literal(
duke@1 514 TypeTags.CHAR,
duke@1 515 S.stringVal().charAt(0) + 0);
duke@1 516 break;
duke@1 517 case STRINGLITERAL:
duke@1 518 t = F.at(pos).Literal(
duke@1 519 TypeTags.CLASS,
duke@1 520 S.stringVal());
duke@1 521 break;
duke@1 522 case TRUE: case FALSE:
duke@1 523 t = F.at(pos).Literal(
duke@1 524 TypeTags.BOOLEAN,
duke@1 525 (S.token() == TRUE ? 1 : 0));
duke@1 526 break;
duke@1 527 case NULL:
duke@1 528 t = F.at(pos).Literal(
duke@1 529 TypeTags.BOT,
duke@1 530 null);
duke@1 531 break;
duke@1 532 default:
duke@1 533 assert false;
duke@1 534 }
duke@1 535 if (t == errorTree)
duke@1 536 t = F.at(pos).Erroneous();
duke@1 537 storeEnd(t, S.endPos());
duke@1 538 S.nextToken();
duke@1 539 return t;
duke@1 540 }
duke@1 541 //where
duke@1 542 boolean isZero(String s) {
duke@1 543 char[] cs = s.toCharArray();
duke@1 544 int base = ((Character.toLowerCase(s.charAt(1)) == 'x') ? 16 : 10);
duke@1 545 int i = ((base==16) ? 2 : 0);
duke@1 546 while (i < cs.length && (cs[i] == '0' || cs[i] == '.')) i++;
duke@1 547 return !(i < cs.length && (Character.digit(cs[i], base) > 0));
duke@1 548 }
duke@1 549
duke@1 550 String strval(Name prefix) {
duke@1 551 String s = S.stringVal();
jjg@113 552 return prefix.isEmpty() ? s : prefix + s;
duke@1 553 }
duke@1 554
duke@1 555 /** terms can be either expressions or types.
duke@1 556 */
jjg@111 557 public JCExpression parseExpression() {
duke@1 558 return term(EXPR);
duke@1 559 }
duke@1 560
jjg@111 561 public JCExpression parseType() {
duke@1 562 return term(TYPE);
duke@1 563 }
duke@1 564
duke@1 565 JCExpression term(int newmode) {
duke@1 566 int prevmode = mode;
duke@1 567 mode = newmode;
duke@1 568 JCExpression t = term();
duke@1 569 lastmode = mode;
duke@1 570 mode = prevmode;
duke@1 571 return t;
duke@1 572 }
duke@1 573
duke@1 574 /**
duke@1 575 * Expression = Expression1 [ExpressionRest]
duke@1 576 * ExpressionRest = [AssignmentOperator Expression1]
duke@1 577 * AssignmentOperator = "=" | "+=" | "-=" | "*=" | "/=" |
duke@1 578 * "&=" | "|=" | "^=" |
duke@1 579 * "%=" | "<<=" | ">>=" | ">>>="
duke@1 580 * Type = Type1
duke@1 581 * TypeNoParams = TypeNoParams1
duke@1 582 * StatementExpression = Expression
duke@1 583 * ConstantExpression = Expression
duke@1 584 */
duke@1 585 JCExpression term() {
duke@1 586 JCExpression t = term1();
duke@1 587 if ((mode & EXPR) != 0 &&
duke@1 588 S.token() == EQ || PLUSEQ.compareTo(S.token()) <= 0 && S.token().compareTo(GTGTGTEQ) <= 0)
duke@1 589 return termRest(t);
duke@1 590 else
duke@1 591 return t;
duke@1 592 }
duke@1 593
duke@1 594 JCExpression termRest(JCExpression t) {
duke@1 595 switch (S.token()) {
duke@1 596 case EQ: {
duke@1 597 int pos = S.pos();
duke@1 598 S.nextToken();
duke@1 599 mode = EXPR;
duke@1 600 JCExpression t1 = term();
duke@1 601 return toP(F.at(pos).Assign(t, t1));
duke@1 602 }
duke@1 603 case PLUSEQ:
duke@1 604 case SUBEQ:
duke@1 605 case STAREQ:
duke@1 606 case SLASHEQ:
duke@1 607 case PERCENTEQ:
duke@1 608 case AMPEQ:
duke@1 609 case BAREQ:
duke@1 610 case CARETEQ:
duke@1 611 case LTLTEQ:
duke@1 612 case GTGTEQ:
duke@1 613 case GTGTGTEQ:
duke@1 614 int pos = S.pos();
duke@1 615 Token token = S.token();
duke@1 616 S.nextToken();
duke@1 617 mode = EXPR;
duke@1 618 JCExpression t1 = term();
duke@1 619 return F.at(pos).Assignop(optag(token), t, t1);
duke@1 620 default:
duke@1 621 return t;
duke@1 622 }
duke@1 623 }
duke@1 624
duke@1 625 /** Expression1 = Expression2 [Expression1Rest]
duke@1 626 * Type1 = Type2
duke@1 627 * TypeNoParams1 = TypeNoParams2
duke@1 628 */
duke@1 629 JCExpression term1() {
duke@1 630 JCExpression t = term2();
duke@1 631 if ((mode & EXPR) != 0 && S.token() == QUES) {
duke@1 632 mode = EXPR;
duke@1 633 return term1Rest(t);
duke@1 634 } else {
duke@1 635 return t;
duke@1 636 }
duke@1 637 }
duke@1 638
duke@1 639 /** Expression1Rest = ["?" Expression ":" Expression1]
duke@1 640 */
duke@1 641 JCExpression term1Rest(JCExpression t) {
duke@1 642 if (S.token() == QUES) {
duke@1 643 int pos = S.pos();
duke@1 644 S.nextToken();
duke@1 645 JCExpression t1 = term();
duke@1 646 accept(COLON);
duke@1 647 JCExpression t2 = term1();
duke@1 648 return F.at(pos).Conditional(t, t1, t2);
duke@1 649 } else {
duke@1 650 return t;
duke@1 651 }
duke@1 652 }
duke@1 653
duke@1 654 /** Expression2 = Expression3 [Expression2Rest]
duke@1 655 * Type2 = Type3
duke@1 656 * TypeNoParams2 = TypeNoParams3
duke@1 657 */
duke@1 658 JCExpression term2() {
duke@1 659 JCExpression t = term3();
duke@1 660 if ((mode & EXPR) != 0 && prec(S.token()) >= TreeInfo.orPrec) {
duke@1 661 mode = EXPR;
duke@1 662 return term2Rest(t, TreeInfo.orPrec);
duke@1 663 } else {
duke@1 664 return t;
duke@1 665 }
duke@1 666 }
duke@1 667
duke@1 668 /* Expression2Rest = {infixop Expression3}
duke@1 669 * | Expression3 instanceof Type
duke@1 670 * infixop = "||"
duke@1 671 * | "&&"
duke@1 672 * | "|"
duke@1 673 * | "^"
duke@1 674 * | "&"
duke@1 675 * | "==" | "!="
duke@1 676 * | "<" | ">" | "<=" | ">="
duke@1 677 * | "<<" | ">>" | ">>>"
duke@1 678 * | "+" | "-"
duke@1 679 * | "*" | "/" | "%"
duke@1 680 */
duke@1 681 JCExpression term2Rest(JCExpression t, int minprec) {
duke@1 682 List<JCExpression[]> savedOd = odStackSupply.elems;
duke@1 683 JCExpression[] odStack = newOdStack();
duke@1 684 List<Token[]> savedOp = opStackSupply.elems;
duke@1 685 Token[] opStack = newOpStack();
duke@1 686 // optimization, was odStack = new Tree[...]; opStack = new Tree[...];
duke@1 687 int top = 0;
duke@1 688 odStack[0] = t;
duke@1 689 int startPos = S.pos();
duke@1 690 Token topOp = ERROR;
duke@1 691 while (prec(S.token()) >= minprec) {
duke@1 692 opStack[top] = topOp;
duke@1 693 top++;
duke@1 694 topOp = S.token();
duke@1 695 int pos = S.pos();
duke@1 696 S.nextToken();
jjg@111 697 odStack[top] = topOp == INSTANCEOF ? parseType() : term3();
duke@1 698 while (top > 0 && prec(topOp) >= prec(S.token())) {
duke@1 699 odStack[top-1] = makeOp(pos, topOp, odStack[top-1],
duke@1 700 odStack[top]);
duke@1 701 top--;
duke@1 702 topOp = opStack[top];
duke@1 703 }
duke@1 704 }
duke@1 705 assert top == 0;
duke@1 706 t = odStack[0];
duke@1 707
duke@1 708 if (t.getTag() == JCTree.PLUS) {
duke@1 709 StringBuffer buf = foldStrings(t);
duke@1 710 if (buf != null) {
duke@1 711 t = toP(F.at(startPos).Literal(TypeTags.CLASS, buf.toString()));
duke@1 712 }
duke@1 713 }
duke@1 714
duke@1 715 odStackSupply.elems = savedOd; // optimization
duke@1 716 opStackSupply.elems = savedOp; // optimization
duke@1 717 return t;
duke@1 718 }
duke@1 719 //where
duke@1 720 /** Construct a binary or type test node.
duke@1 721 */
duke@1 722 private JCExpression makeOp(int pos,
duke@1 723 Token topOp,
duke@1 724 JCExpression od1,
duke@1 725 JCExpression od2)
duke@1 726 {
duke@1 727 if (topOp == INSTANCEOF) {
duke@1 728 return F.at(pos).TypeTest(od1, od2);
duke@1 729 } else {
duke@1 730 return F.at(pos).Binary(optag(topOp), od1, od2);
duke@1 731 }
duke@1 732 }
duke@1 733 /** If tree is a concatenation of string literals, replace it
duke@1 734 * by a single literal representing the concatenated string.
duke@1 735 */
duke@1 736 protected StringBuffer foldStrings(JCTree tree) {
duke@1 737 List<String> buf = List.nil();
duke@1 738 while (true) {
duke@1 739 if (tree.getTag() == JCTree.LITERAL) {
duke@1 740 JCLiteral lit = (JCLiteral) tree;
duke@1 741 if (lit.typetag == TypeTags.CLASS) {
duke@1 742 StringBuffer sbuf =
duke@1 743 new StringBuffer((String)lit.value);
duke@1 744 while (buf.nonEmpty()) {
duke@1 745 sbuf.append(buf.head);
duke@1 746 buf = buf.tail;
duke@1 747 }
duke@1 748 return sbuf;
duke@1 749 }
duke@1 750 } else if (tree.getTag() == JCTree.PLUS) {
duke@1 751 JCBinary op = (JCBinary)tree;
duke@1 752 if (op.rhs.getTag() == JCTree.LITERAL) {
duke@1 753 JCLiteral lit = (JCLiteral) op.rhs;
duke@1 754 if (lit.typetag == TypeTags.CLASS) {
duke@1 755 buf = buf.prepend((String) lit.value);
duke@1 756 tree = op.lhs;
duke@1 757 continue;
duke@1 758 }
duke@1 759 }
duke@1 760 }
duke@1 761 return null;
duke@1 762 }
duke@1 763 }
duke@1 764
duke@1 765 /** optimization: To save allocating a new operand/operator stack
duke@1 766 * for every binary operation, we use supplys.
duke@1 767 */
duke@1 768 ListBuffer<JCExpression[]> odStackSupply = new ListBuffer<JCExpression[]>();
duke@1 769 ListBuffer<Token[]> opStackSupply = new ListBuffer<Token[]>();
duke@1 770
duke@1 771 private JCExpression[] newOdStack() {
duke@1 772 if (odStackSupply.elems == odStackSupply.last)
duke@1 773 odStackSupply.append(new JCExpression[infixPrecedenceLevels + 1]);
duke@1 774 JCExpression[] odStack = odStackSupply.elems.head;
duke@1 775 odStackSupply.elems = odStackSupply.elems.tail;
duke@1 776 return odStack;
duke@1 777 }
duke@1 778
duke@1 779 private Token[] newOpStack() {
duke@1 780 if (opStackSupply.elems == opStackSupply.last)
duke@1 781 opStackSupply.append(new Token[infixPrecedenceLevels + 1]);
duke@1 782 Token[] opStack = opStackSupply.elems.head;
duke@1 783 opStackSupply.elems = opStackSupply.elems.tail;
duke@1 784 return opStack;
duke@1 785 }
duke@1 786
duke@1 787 /** Expression3 = PrefixOp Expression3
duke@1 788 * | "(" Expr | TypeNoParams ")" Expression3
duke@1 789 * | Primary {Selector} {PostfixOp}
duke@1 790 * Primary = "(" Expression ")"
duke@1 791 * | Literal
duke@1 792 * | [TypeArguments] THIS [Arguments]
duke@1 793 * | [TypeArguments] SUPER SuperSuffix
duke@1 794 * | NEW [TypeArguments] Creator
duke@1 795 * | Ident { "." Ident }
duke@1 796 * [ "[" ( "]" BracketsOpt "." CLASS | Expression "]" )
duke@1 797 * | Arguments
duke@1 798 * | "." ( CLASS | THIS | [TypeArguments] SUPER Arguments | NEW [TypeArguments] InnerCreator )
duke@1 799 * ]
duke@1 800 * | BasicType BracketsOpt "." CLASS
duke@1 801 * PrefixOp = "++" | "--" | "!" | "~" | "+" | "-"
duke@1 802 * PostfixOp = "++" | "--"
duke@1 803 * Type3 = Ident { "." Ident } [TypeArguments] {TypeSelector} BracketsOpt
duke@1 804 * | BasicType
duke@1 805 * TypeNoParams3 = Ident { "." Ident } BracketsOpt
duke@1 806 * Selector = "." [TypeArguments] Ident [Arguments]
duke@1 807 * | "." THIS
duke@1 808 * | "." [TypeArguments] SUPER SuperSuffix
duke@1 809 * | "." NEW [TypeArguments] InnerCreator
duke@1 810 * | "[" Expression "]"
duke@1 811 * TypeSelector = "." Ident [TypeArguments]
duke@1 812 * SuperSuffix = Arguments | "." Ident [Arguments]
duke@1 813 */
duke@1 814 protected JCExpression term3() {
duke@1 815 int pos = S.pos();
duke@1 816 JCExpression t;
duke@1 817 List<JCExpression> typeArgs = typeArgumentsOpt(EXPR);
duke@1 818 switch (S.token()) {
duke@1 819 case QUES:
duke@1 820 if ((mode & TYPE) != 0 && (mode & (TYPEARG|NOPARAMS)) == TYPEARG) {
duke@1 821 mode = TYPE;
duke@1 822 return typeArgument();
duke@1 823 } else
duke@1 824 return illegal();
duke@1 825 case PLUSPLUS: case SUBSUB: case BANG: case TILDE: case PLUS: case SUB:
duke@1 826 if (typeArgs == null && (mode & EXPR) != 0) {
duke@1 827 Token token = S.token();
duke@1 828 S.nextToken();
duke@1 829 mode = EXPR;
duke@1 830 if (token == SUB &&
duke@1 831 (S.token() == INTLITERAL || S.token() == LONGLITERAL) &&
duke@1 832 S.radix() == 10) {
duke@1 833 mode = EXPR;
duke@1 834 t = literal(names.hyphen);
duke@1 835 } else {
duke@1 836 t = term3();
duke@1 837 return F.at(pos).Unary(unoptag(token), t);
duke@1 838 }
duke@1 839 } else return illegal();
duke@1 840 break;
duke@1 841 case LPAREN:
duke@1 842 if (typeArgs == null && (mode & EXPR) != 0) {
duke@1 843 S.nextToken();
duke@1 844 mode = EXPR | TYPE | NOPARAMS;
duke@1 845 t = term3();
duke@1 846 if ((mode & TYPE) != 0 && S.token() == LT) {
duke@1 847 // Could be a cast to a parameterized type
duke@1 848 int op = JCTree.LT;
duke@1 849 int pos1 = S.pos();
duke@1 850 S.nextToken();
duke@1 851 mode &= (EXPR | TYPE);
duke@1 852 mode |= TYPEARG;
duke@1 853 JCExpression t1 = term3();
duke@1 854 if ((mode & TYPE) != 0 &&
duke@1 855 (S.token() == COMMA || S.token() == GT)) {
duke@1 856 mode = TYPE;
duke@1 857 ListBuffer<JCExpression> args = new ListBuffer<JCExpression>();
duke@1 858 args.append(t1);
duke@1 859 while (S.token() == COMMA) {
duke@1 860 S.nextToken();
duke@1 861 args.append(typeArgument());
duke@1 862 }
duke@1 863 accept(GT);
duke@1 864 t = F.at(pos1).TypeApply(t, args.toList());
duke@1 865 checkGenerics();
mcimadamore@185 866 while (S.token() == DOT) {
mcimadamore@185 867 S.nextToken();
mcimadamore@185 868 mode = TYPE;
mcimadamore@185 869 t = toP(F.at(S.pos()).Select(t, ident()));
mcimadamore@185 870 t = typeArgumentsOpt(t);
mcimadamore@185 871 }
mcimadamore@195 872 t = bracketsOpt(toP(t));
duke@1 873 } else if ((mode & EXPR) != 0) {
duke@1 874 mode = EXPR;
duke@1 875 t = F.at(pos1).Binary(op, t, term2Rest(t1, TreeInfo.shiftPrec));
duke@1 876 t = termRest(term1Rest(term2Rest(t, TreeInfo.orPrec)));
duke@1 877 } else {
duke@1 878 accept(GT);
duke@1 879 }
mcimadamore@185 880 }
mcimadamore@185 881 else {
duke@1 882 t = termRest(term1Rest(term2Rest(t, TreeInfo.orPrec)));
duke@1 883 }
duke@1 884 accept(RPAREN);
duke@1 885 lastmode = mode;
duke@1 886 mode = EXPR;
duke@1 887 if ((lastmode & EXPR) == 0) {
duke@1 888 JCExpression t1 = term3();
duke@1 889 return F.at(pos).TypeCast(t, t1);
duke@1 890 } else if ((lastmode & TYPE) != 0) {
duke@1 891 switch (S.token()) {
duke@1 892 /*case PLUSPLUS: case SUBSUB: */
duke@1 893 case BANG: case TILDE:
duke@1 894 case LPAREN: case THIS: case SUPER:
duke@1 895 case INTLITERAL: case LONGLITERAL: case FLOATLITERAL:
duke@1 896 case DOUBLELITERAL: case CHARLITERAL: case STRINGLITERAL:
duke@1 897 case TRUE: case FALSE: case NULL:
duke@1 898 case NEW: case IDENTIFIER: case ASSERT: case ENUM:
duke@1 899 case BYTE: case SHORT: case CHAR: case INT:
duke@1 900 case LONG: case FLOAT: case DOUBLE: case BOOLEAN: case VOID:
duke@1 901 JCExpression t1 = term3();
duke@1 902 return F.at(pos).TypeCast(t, t1);
duke@1 903 }
duke@1 904 }
duke@1 905 } else return illegal();
duke@1 906 t = toP(F.at(pos).Parens(t));
duke@1 907 break;
duke@1 908 case THIS:
duke@1 909 if ((mode & EXPR) != 0) {
duke@1 910 mode = EXPR;
duke@1 911 t = to(F.at(pos).Ident(names._this));
duke@1 912 S.nextToken();
duke@1 913 if (typeArgs == null)
duke@1 914 t = argumentsOpt(null, t);
duke@1 915 else
duke@1 916 t = arguments(typeArgs, t);
duke@1 917 typeArgs = null;
duke@1 918 } else return illegal();
duke@1 919 break;
duke@1 920 case SUPER:
duke@1 921 if ((mode & EXPR) != 0) {
duke@1 922 mode = EXPR;
duke@1 923 t = to(superSuffix(typeArgs, F.at(pos).Ident(names._super)));
duke@1 924 typeArgs = null;
duke@1 925 } else return illegal();
duke@1 926 break;
duke@1 927 case INTLITERAL: case LONGLITERAL: case FLOATLITERAL: case DOUBLELITERAL:
duke@1 928 case CHARLITERAL: case STRINGLITERAL:
duke@1 929 case TRUE: case FALSE: case NULL:
duke@1 930 if (typeArgs == null && (mode & EXPR) != 0) {
duke@1 931 mode = EXPR;
duke@1 932 t = literal(names.empty);
duke@1 933 } else return illegal();
duke@1 934 break;
duke@1 935 case NEW:
duke@1 936 if (typeArgs != null) return illegal();
duke@1 937 if ((mode & EXPR) != 0) {
duke@1 938 mode = EXPR;
duke@1 939 S.nextToken();
duke@1 940 if (S.token() == LT) typeArgs = typeArguments();
duke@1 941 t = creator(pos, typeArgs);
duke@1 942 typeArgs = null;
duke@1 943 } else return illegal();
duke@1 944 break;
duke@1 945 case IDENTIFIER: case ASSERT: case ENUM:
duke@1 946 if (typeArgs != null) return illegal();
duke@1 947 t = toP(F.at(S.pos()).Ident(ident()));
duke@1 948 loop: while (true) {
duke@1 949 pos = S.pos();
duke@1 950 switch (S.token()) {
duke@1 951 case LBRACKET:
duke@1 952 S.nextToken();
duke@1 953 if (S.token() == RBRACKET) {
duke@1 954 S.nextToken();
duke@1 955 t = bracketsOpt(t);
duke@1 956 t = toP(F.at(pos).TypeArray(t));
duke@1 957 t = bracketsSuffix(t);
duke@1 958 } else {
duke@1 959 if ((mode & EXPR) != 0) {
duke@1 960 mode = EXPR;
duke@1 961 JCExpression t1 = term();
duke@1 962 t = to(F.at(pos).Indexed(t, t1));
duke@1 963 }
duke@1 964 accept(RBRACKET);
duke@1 965 }
duke@1 966 break loop;
duke@1 967 case LPAREN:
duke@1 968 if ((mode & EXPR) != 0) {
duke@1 969 mode = EXPR;
duke@1 970 t = arguments(typeArgs, t);
duke@1 971 typeArgs = null;
duke@1 972 }
duke@1 973 break loop;
duke@1 974 case DOT:
duke@1 975 S.nextToken();
mcimadamore@26 976 int oldmode = mode;
mcimadamore@26 977 mode &= ~NOPARAMS;
duke@1 978 typeArgs = typeArgumentsOpt(EXPR);
mcimadamore@26 979 mode = oldmode;
duke@1 980 if ((mode & EXPR) != 0) {
duke@1 981 switch (S.token()) {
duke@1 982 case CLASS:
duke@1 983 if (typeArgs != null) return illegal();
duke@1 984 mode = EXPR;
duke@1 985 t = to(F.at(pos).Select(t, names._class));
duke@1 986 S.nextToken();
duke@1 987 break loop;
duke@1 988 case THIS:
duke@1 989 if (typeArgs != null) return illegal();
duke@1 990 mode = EXPR;
duke@1 991 t = to(F.at(pos).Select(t, names._this));
duke@1 992 S.nextToken();
duke@1 993 break loop;
duke@1 994 case SUPER:
duke@1 995 mode = EXPR;
duke@1 996 t = to(F.at(pos).Select(t, names._super));
duke@1 997 t = superSuffix(typeArgs, t);
duke@1 998 typeArgs = null;
duke@1 999 break loop;
duke@1 1000 case NEW:
duke@1 1001 if (typeArgs != null) return illegal();
duke@1 1002 mode = EXPR;
duke@1 1003 int pos1 = S.pos();
duke@1 1004 S.nextToken();
duke@1 1005 if (S.token() == LT) typeArgs = typeArguments();
duke@1 1006 t = innerCreator(pos1, typeArgs, t);
duke@1 1007 typeArgs = null;
duke@1 1008 break loop;
duke@1 1009 }
duke@1 1010 }
duke@1 1011 // typeArgs saved for next loop iteration.
duke@1 1012 t = toP(F.at(pos).Select(t, ident()));
duke@1 1013 break;
duke@1 1014 default:
duke@1 1015 break loop;
duke@1 1016 }
duke@1 1017 }
duke@1 1018 if (typeArgs != null) illegal();
duke@1 1019 t = typeArgumentsOpt(t);
duke@1 1020 break;
duke@1 1021 case BYTE: case SHORT: case CHAR: case INT: case LONG: case FLOAT:
duke@1 1022 case DOUBLE: case BOOLEAN:
duke@1 1023 if (typeArgs != null) illegal();
duke@1 1024 t = bracketsSuffix(bracketsOpt(basicType()));
duke@1 1025 break;
duke@1 1026 case VOID:
duke@1 1027 if (typeArgs != null) illegal();
duke@1 1028 if ((mode & EXPR) != 0) {
duke@1 1029 S.nextToken();
duke@1 1030 if (S.token() == DOT) {
duke@1 1031 JCPrimitiveTypeTree ti = toP(F.at(pos).TypeIdent(TypeTags.VOID));
duke@1 1032 t = bracketsSuffix(ti);
duke@1 1033 } else {
duke@1 1034 return illegal(pos);
duke@1 1035 }
duke@1 1036 } else {
jrose@267 1037 // Support the corner case of myMethodHandle.<void>invoke() by passing
jrose@267 1038 // a void type (like other primitive types) to the next phase.
jrose@267 1039 // The error will be reported in Attr.attribTypes or Attr.visitApply.
jrose@267 1040 JCPrimitiveTypeTree ti = to(F.at(pos).TypeIdent(TypeTags.VOID));
jrose@267 1041 S.nextToken();
jrose@267 1042 return ti;
jrose@267 1043 //return illegal();
duke@1 1044 }
duke@1 1045 break;
duke@1 1046 default:
duke@1 1047 return illegal();
duke@1 1048 }
duke@1 1049 if (typeArgs != null) illegal();
duke@1 1050 while (true) {
duke@1 1051 int pos1 = S.pos();
duke@1 1052 if (S.token() == LBRACKET) {
duke@1 1053 S.nextToken();
duke@1 1054 if ((mode & TYPE) != 0) {
duke@1 1055 int oldmode = mode;
duke@1 1056 mode = TYPE;
duke@1 1057 if (S.token() == RBRACKET) {
duke@1 1058 S.nextToken();
duke@1 1059 t = bracketsOpt(t);
duke@1 1060 t = toP(F.at(pos1).TypeArray(t));
duke@1 1061 return t;
duke@1 1062 }
duke@1 1063 mode = oldmode;
duke@1 1064 }
duke@1 1065 if ((mode & EXPR) != 0) {
duke@1 1066 mode = EXPR;
duke@1 1067 JCExpression t1 = term();
duke@1 1068 t = to(F.at(pos1).Indexed(t, t1));
duke@1 1069 }
duke@1 1070 accept(RBRACKET);
duke@1 1071 } else if (S.token() == DOT) {
duke@1 1072 S.nextToken();
duke@1 1073 typeArgs = typeArgumentsOpt(EXPR);
duke@1 1074 if (S.token() == SUPER && (mode & EXPR) != 0) {
duke@1 1075 mode = EXPR;
duke@1 1076 t = to(F.at(pos1).Select(t, names._super));
duke@1 1077 S.nextToken();
duke@1 1078 t = arguments(typeArgs, t);
duke@1 1079 typeArgs = null;
duke@1 1080 } else if (S.token() == NEW && (mode & EXPR) != 0) {
duke@1 1081 if (typeArgs != null) return illegal();
duke@1 1082 mode = EXPR;
duke@1 1083 int pos2 = S.pos();
duke@1 1084 S.nextToken();
duke@1 1085 if (S.token() == LT) typeArgs = typeArguments();
duke@1 1086 t = innerCreator(pos2, typeArgs, t);
duke@1 1087 typeArgs = null;
duke@1 1088 } else {
duke@1 1089 t = toP(F.at(pos1).Select(t, ident()));
duke@1 1090 t = argumentsOpt(typeArgs, typeArgumentsOpt(t));
duke@1 1091 typeArgs = null;
duke@1 1092 }
duke@1 1093 } else {
duke@1 1094 break;
duke@1 1095 }
duke@1 1096 }
duke@1 1097 while ((S.token() == PLUSPLUS || S.token() == SUBSUB) && (mode & EXPR) != 0) {
duke@1 1098 mode = EXPR;
duke@1 1099 t = to(F.at(S.pos()).Unary(
duke@1 1100 S.token() == PLUSPLUS ? JCTree.POSTINC : JCTree.POSTDEC, t));
duke@1 1101 S.nextToken();
duke@1 1102 }
duke@1 1103 return toP(t);
duke@1 1104 }
duke@1 1105
duke@1 1106 /** SuperSuffix = Arguments | "." [TypeArguments] Ident [Arguments]
duke@1 1107 */
duke@1 1108 JCExpression superSuffix(List<JCExpression> typeArgs, JCExpression t) {
duke@1 1109 S.nextToken();
duke@1 1110 if (S.token() == LPAREN || typeArgs != null) {
duke@1 1111 t = arguments(typeArgs, t);
duke@1 1112 } else {
duke@1 1113 int pos = S.pos();
duke@1 1114 accept(DOT);
duke@1 1115 typeArgs = (S.token() == LT) ? typeArguments() : null;
duke@1 1116 t = toP(F.at(pos).Select(t, ident()));
duke@1 1117 t = argumentsOpt(typeArgs, t);
duke@1 1118 }
duke@1 1119 return t;
duke@1 1120 }
duke@1 1121
duke@1 1122 /** BasicType = BYTE | SHORT | CHAR | INT | LONG | FLOAT | DOUBLE | BOOLEAN
duke@1 1123 */
duke@1 1124 JCPrimitiveTypeTree basicType() {
duke@1 1125 JCPrimitiveTypeTree t = to(F.at(S.pos()).TypeIdent(typetag(S.token())));
duke@1 1126 S.nextToken();
duke@1 1127 return t;
duke@1 1128 }
duke@1 1129
duke@1 1130 /** ArgumentsOpt = [ Arguments ]
duke@1 1131 */
duke@1 1132 JCExpression argumentsOpt(List<JCExpression> typeArgs, JCExpression t) {
duke@1 1133 if ((mode & EXPR) != 0 && S.token() == LPAREN || typeArgs != null) {
duke@1 1134 mode = EXPR;
duke@1 1135 return arguments(typeArgs, t);
duke@1 1136 } else {
duke@1 1137 return t;
duke@1 1138 }
duke@1 1139 }
duke@1 1140
duke@1 1141 /** Arguments = "(" [Expression { COMMA Expression }] ")"
duke@1 1142 */
duke@1 1143 List<JCExpression> arguments() {
duke@1 1144 ListBuffer<JCExpression> args = lb();
duke@1 1145 if (S.token() == LPAREN) {
duke@1 1146 S.nextToken();
duke@1 1147 if (S.token() != RPAREN) {
jjg@111 1148 args.append(parseExpression());
duke@1 1149 while (S.token() == COMMA) {
duke@1 1150 S.nextToken();
jjg@111 1151 args.append(parseExpression());
duke@1 1152 }
duke@1 1153 }
duke@1 1154 accept(RPAREN);
duke@1 1155 } else {
mcimadamore@80 1156 syntaxError(S.pos(), "expected", LPAREN);
duke@1 1157 }
duke@1 1158 return args.toList();
duke@1 1159 }
duke@1 1160
duke@1 1161 JCMethodInvocation arguments(List<JCExpression> typeArgs, JCExpression t) {
duke@1 1162 int pos = S.pos();
duke@1 1163 List<JCExpression> args = arguments();
duke@1 1164 return toP(F.at(pos).Apply(typeArgs, t, args));
duke@1 1165 }
duke@1 1166
duke@1 1167 /** TypeArgumentsOpt = [ TypeArguments ]
duke@1 1168 */
duke@1 1169 JCExpression typeArgumentsOpt(JCExpression t) {
duke@1 1170 if (S.token() == LT &&
duke@1 1171 (mode & TYPE) != 0 &&
duke@1 1172 (mode & NOPARAMS) == 0) {
duke@1 1173 mode = TYPE;
duke@1 1174 checkGenerics();
duke@1 1175 return typeArguments(t);
duke@1 1176 } else {
duke@1 1177 return t;
duke@1 1178 }
duke@1 1179 }
duke@1 1180 List<JCExpression> typeArgumentsOpt() {
duke@1 1181 return typeArgumentsOpt(TYPE);
duke@1 1182 }
duke@1 1183
duke@1 1184 List<JCExpression> typeArgumentsOpt(int useMode) {
duke@1 1185 if (S.token() == LT) {
duke@1 1186 checkGenerics();
duke@1 1187 if ((mode & useMode) == 0 ||
duke@1 1188 (mode & NOPARAMS) != 0) {
duke@1 1189 illegal();
duke@1 1190 }
duke@1 1191 mode = useMode;
duke@1 1192 return typeArguments();
duke@1 1193 }
duke@1 1194 return null;
duke@1 1195 }
duke@1 1196
duke@1 1197 /** TypeArguments = "<" TypeArgument {"," TypeArgument} ">"
duke@1 1198 */
duke@1 1199 List<JCExpression> typeArguments() {
duke@1 1200 ListBuffer<JCExpression> args = lb();
duke@1 1201 if (S.token() == LT) {
duke@1 1202 S.nextToken();
jjg@111 1203 args.append(((mode & EXPR) == 0) ? typeArgument() : parseType());
duke@1 1204 while (S.token() == COMMA) {
duke@1 1205 S.nextToken();
jjg@111 1206 args.append(((mode & EXPR) == 0) ? typeArgument() : parseType());
duke@1 1207 }
duke@1 1208 switch (S.token()) {
duke@1 1209 case GTGTGTEQ:
duke@1 1210 S.token(GTGTEQ);
duke@1 1211 break;
duke@1 1212 case GTGTEQ:
duke@1 1213 S.token(GTEQ);
duke@1 1214 break;
duke@1 1215 case GTEQ:
duke@1 1216 S.token(EQ);
duke@1 1217 break;
duke@1 1218 case GTGTGT:
duke@1 1219 S.token(GTGT);
duke@1 1220 break;
duke@1 1221 case GTGT:
duke@1 1222 S.token(GT);
duke@1 1223 break;
duke@1 1224 default:
duke@1 1225 accept(GT);
duke@1 1226 break;
duke@1 1227 }
duke@1 1228 } else {
mcimadamore@80 1229 syntaxError(S.pos(), "expected", LT);
duke@1 1230 }
duke@1 1231 return args.toList();
duke@1 1232 }
duke@1 1233
duke@1 1234 /** TypeArgument = Type
duke@1 1235 * | "?"
duke@1 1236 * | "?" EXTENDS Type {"&" Type}
duke@1 1237 * | "?" SUPER Type
duke@1 1238 */
duke@1 1239 JCExpression typeArgument() {
jjg@111 1240 if (S.token() != QUES) return parseType();
duke@1 1241 int pos = S.pos();
duke@1 1242 S.nextToken();
duke@1 1243 if (S.token() == EXTENDS) {
duke@1 1244 TypeBoundKind t = to(F.at(S.pos()).TypeBoundKind(BoundKind.EXTENDS));
duke@1 1245 S.nextToken();
jjg@111 1246 return F.at(pos).Wildcard(t, parseType());
duke@1 1247 } else if (S.token() == SUPER) {
duke@1 1248 TypeBoundKind t = to(F.at(S.pos()).TypeBoundKind(BoundKind.SUPER));
duke@1 1249 S.nextToken();
jjg@111 1250 return F.at(pos).Wildcard(t, parseType());
duke@1 1251 } else if (S.token() == IDENTIFIER) {
duke@1 1252 //error recovery
duke@1 1253 reportSyntaxError(S.prevEndPos(), "expected3",
mcimadamore@80 1254 GT, EXTENDS, SUPER);
duke@1 1255 TypeBoundKind t = F.at(Position.NOPOS).TypeBoundKind(BoundKind.UNBOUND);
duke@1 1256 JCExpression wc = toP(F.at(pos).Wildcard(t, null));
duke@1 1257 JCIdent id = toP(F.at(S.pos()).Ident(ident()));
duke@1 1258 return F.at(pos).Erroneous(List.<JCTree>of(wc, id));
duke@1 1259 } else {
duke@1 1260 TypeBoundKind t = F.at(Position.NOPOS).TypeBoundKind(BoundKind.UNBOUND);
duke@1 1261 return toP(F.at(pos).Wildcard(t, null));
duke@1 1262 }
duke@1 1263 }
duke@1 1264
duke@1 1265 JCTypeApply typeArguments(JCExpression t) {
duke@1 1266 int pos = S.pos();
duke@1 1267 List<JCExpression> args = typeArguments();
duke@1 1268 return toP(F.at(pos).TypeApply(t, args));
duke@1 1269 }
duke@1 1270
duke@1 1271 /** BracketsOpt = {"[" "]"}
duke@1 1272 */
duke@1 1273 private JCExpression bracketsOpt(JCExpression t) {
duke@1 1274 if (S.token() == LBRACKET) {
duke@1 1275 int pos = S.pos();
duke@1 1276 S.nextToken();
duke@1 1277 t = bracketsOptCont(t, pos);
duke@1 1278 F.at(pos);
duke@1 1279 }
duke@1 1280 return t;
duke@1 1281 }
duke@1 1282
duke@1 1283 private JCArrayTypeTree bracketsOptCont(JCExpression t, int pos) {
duke@1 1284 accept(RBRACKET);
duke@1 1285 t = bracketsOpt(t);
duke@1 1286 return toP(F.at(pos).TypeArray(t));
duke@1 1287 }
duke@1 1288
duke@1 1289 /** BracketsSuffixExpr = "." CLASS
duke@1 1290 * BracketsSuffixType =
duke@1 1291 */
duke@1 1292 JCExpression bracketsSuffix(JCExpression t) {
duke@1 1293 if ((mode & EXPR) != 0 && S.token() == DOT) {
duke@1 1294 mode = EXPR;
duke@1 1295 int pos = S.pos();
duke@1 1296 S.nextToken();
duke@1 1297 accept(CLASS);
duke@1 1298 if (S.pos() == errorEndPos) {
duke@1 1299 // error recovery
duke@1 1300 Name name = null;
duke@1 1301 if (S.token() == IDENTIFIER) {
duke@1 1302 name = S.name();
duke@1 1303 S.nextToken();
duke@1 1304 } else {
duke@1 1305 name = names.error;
duke@1 1306 }
duke@1 1307 t = F.at(pos).Erroneous(List.<JCTree>of(toP(F.at(pos).Select(t, name))));
duke@1 1308 } else {
duke@1 1309 t = toP(F.at(pos).Select(t, names._class));
duke@1 1310 }
duke@1 1311 } else if ((mode & TYPE) != 0) {
duke@1 1312 mode = TYPE;
duke@1 1313 } else {
duke@1 1314 syntaxError(S.pos(), "dot.class.expected");
duke@1 1315 }
duke@1 1316 return t;
duke@1 1317 }
duke@1 1318
duke@1 1319 /** Creator = Qualident [TypeArguments] ( ArrayCreatorRest | ClassCreatorRest )
duke@1 1320 */
duke@1 1321 JCExpression creator(int newpos, List<JCExpression> typeArgs) {
duke@1 1322 switch (S.token()) {
duke@1 1323 case BYTE: case SHORT: case CHAR: case INT: case LONG: case FLOAT:
duke@1 1324 case DOUBLE: case BOOLEAN:
duke@1 1325 if (typeArgs == null)
duke@1 1326 return arrayCreatorRest(newpos, basicType());
duke@1 1327 break;
duke@1 1328 default:
duke@1 1329 }
duke@1 1330 JCExpression t = qualident();
duke@1 1331 int oldmode = mode;
duke@1 1332 mode = TYPE;
duke@1 1333 if (S.token() == LT) {
duke@1 1334 checkGenerics();
duke@1 1335 t = typeArguments(t);
duke@1 1336 }
duke@1 1337 while (S.token() == DOT) {
duke@1 1338 int pos = S.pos();
duke@1 1339 S.nextToken();
duke@1 1340 t = toP(F.at(pos).Select(t, ident()));
duke@1 1341 if (S.token() == LT) {
duke@1 1342 checkGenerics();
duke@1 1343 t = typeArguments(t);
duke@1 1344 }
duke@1 1345 }
duke@1 1346 mode = oldmode;
duke@1 1347 if (S.token() == LBRACKET) {
duke@1 1348 JCExpression e = arrayCreatorRest(newpos, t);
duke@1 1349 if (typeArgs != null) {
duke@1 1350 int pos = newpos;
duke@1 1351 if (!typeArgs.isEmpty() && typeArgs.head.pos != Position.NOPOS) {
duke@1 1352 // note: this should always happen but we should
duke@1 1353 // not rely on this as the parser is continuously
duke@1 1354 // modified to improve error recovery.
duke@1 1355 pos = typeArgs.head.pos;
duke@1 1356 }
duke@1 1357 setErrorEndPos(S.prevEndPos());
duke@1 1358 reportSyntaxError(pos, "cannot.create.array.with.type.arguments");
duke@1 1359 return toP(F.at(newpos).Erroneous(typeArgs.prepend(e)));
duke@1 1360 }
duke@1 1361 return e;
duke@1 1362 } else if (S.token() == LPAREN) {
duke@1 1363 return classCreatorRest(newpos, null, typeArgs, t);
duke@1 1364 } else {
duke@1 1365 reportSyntaxError(S.pos(), "expected2",
mcimadamore@80 1366 LPAREN, LBRACKET);
duke@1 1367 t = toP(F.at(newpos).NewClass(null, typeArgs, t, List.<JCExpression>nil(), null));
duke@1 1368 return toP(F.at(newpos).Erroneous(List.<JCTree>of(t)));
duke@1 1369 }
duke@1 1370 }
duke@1 1371
duke@1 1372 /** InnerCreator = Ident [TypeArguments] ClassCreatorRest
duke@1 1373 */
duke@1 1374 JCExpression innerCreator(int newpos, List<JCExpression> typeArgs, JCExpression encl) {
duke@1 1375 JCExpression t = toP(F.at(S.pos()).Ident(ident()));
duke@1 1376 if (S.token() == LT) {
duke@1 1377 checkGenerics();
duke@1 1378 t = typeArguments(t);
duke@1 1379 }
duke@1 1380 return classCreatorRest(newpos, encl, typeArgs, t);
duke@1 1381 }
duke@1 1382
duke@1 1383 /** ArrayCreatorRest = "[" ( "]" BracketsOpt ArrayInitializer
duke@1 1384 * | Expression "]" {"[" Expression "]"} BracketsOpt )
duke@1 1385 */
duke@1 1386 JCExpression arrayCreatorRest(int newpos, JCExpression elemtype) {
duke@1 1387 accept(LBRACKET);
duke@1 1388 if (S.token() == RBRACKET) {
duke@1 1389 accept(RBRACKET);
duke@1 1390 elemtype = bracketsOpt(elemtype);
duke@1 1391 if (S.token() == LBRACE) {
duke@1 1392 return arrayInitializer(newpos, elemtype);
duke@1 1393 } else {
duke@1 1394 return syntaxError(S.pos(), "array.dimension.missing");
duke@1 1395 }
duke@1 1396 } else {
duke@1 1397 ListBuffer<JCExpression> dims = new ListBuffer<JCExpression>();
jjg@111 1398 dims.append(parseExpression());
duke@1 1399 accept(RBRACKET);
duke@1 1400 while (S.token() == LBRACKET) {
duke@1 1401 int pos = S.pos();
duke@1 1402 S.nextToken();
duke@1 1403 if (S.token() == RBRACKET) {
duke@1 1404 elemtype = bracketsOptCont(elemtype, pos);
duke@1 1405 } else {
jjg@111 1406 dims.append(parseExpression());
duke@1 1407 accept(RBRACKET);
duke@1 1408 }
duke@1 1409 }
duke@1 1410 return toP(F.at(newpos).NewArray(elemtype, dims.toList(), null));
duke@1 1411 }
duke@1 1412 }
duke@1 1413
duke@1 1414 /** ClassCreatorRest = Arguments [ClassBody]
duke@1 1415 */
duke@1 1416 JCExpression classCreatorRest(int newpos,
duke@1 1417 JCExpression encl,
duke@1 1418 List<JCExpression> typeArgs,
duke@1 1419 JCExpression t)
duke@1 1420 {
duke@1 1421 List<JCExpression> args = arguments();
duke@1 1422 JCClassDecl body = null;
duke@1 1423 if (S.token() == LBRACE) {
duke@1 1424 int pos = S.pos();
duke@1 1425 List<JCTree> defs = classOrInterfaceBody(names.empty, false);
duke@1 1426 JCModifiers mods = F.at(Position.NOPOS).Modifiers(0);
duke@1 1427 body = toP(F.at(pos).AnonymousClassDef(mods, defs));
duke@1 1428 }
duke@1 1429 return toP(F.at(newpos).NewClass(encl, typeArgs, t, args, body));
duke@1 1430 }
duke@1 1431
duke@1 1432 /** ArrayInitializer = "{" [VariableInitializer {"," VariableInitializer}] [","] "}"
duke@1 1433 */
duke@1 1434 JCExpression arrayInitializer(int newpos, JCExpression t) {
duke@1 1435 accept(LBRACE);
duke@1 1436 ListBuffer<JCExpression> elems = new ListBuffer<JCExpression>();
duke@1 1437 if (S.token() == COMMA) {
duke@1 1438 S.nextToken();
duke@1 1439 } else if (S.token() != RBRACE) {
duke@1 1440 elems.append(variableInitializer());
duke@1 1441 while (S.token() == COMMA) {
duke@1 1442 S.nextToken();
duke@1 1443 if (S.token() == RBRACE) break;
duke@1 1444 elems.append(variableInitializer());
duke@1 1445 }
duke@1 1446 }
duke@1 1447 accept(RBRACE);
duke@1 1448 return toP(F.at(newpos).NewArray(t, List.<JCExpression>nil(), elems.toList()));
duke@1 1449 }
duke@1 1450
duke@1 1451 /** VariableInitializer = ArrayInitializer | Expression
duke@1 1452 */
duke@1 1453 public JCExpression variableInitializer() {
jjg@111 1454 return S.token() == LBRACE ? arrayInitializer(S.pos(), null) : parseExpression();
duke@1 1455 }
duke@1 1456
duke@1 1457 /** ParExpression = "(" Expression ")"
duke@1 1458 */
duke@1 1459 JCExpression parExpression() {
duke@1 1460 accept(LPAREN);
jjg@111 1461 JCExpression t = parseExpression();
duke@1 1462 accept(RPAREN);
duke@1 1463 return t;
duke@1 1464 }
duke@1 1465
duke@1 1466 /** Block = "{" BlockStatements "}"
duke@1 1467 */
duke@1 1468 JCBlock block(int pos, long flags) {
duke@1 1469 accept(LBRACE);
duke@1 1470 List<JCStatement> stats = blockStatements();
duke@1 1471 JCBlock t = F.at(pos).Block(flags, stats);
duke@1 1472 while (S.token() == CASE || S.token() == DEFAULT) {
mcimadamore@80 1473 syntaxError("orphaned", S.token());
duke@1 1474 switchBlockStatementGroups();
duke@1 1475 }
duke@1 1476 // the Block node has a field "endpos" for first char of last token, which is
duke@1 1477 // usually but not necessarily the last char of the last token.
duke@1 1478 t.endpos = S.pos();
duke@1 1479 accept(RBRACE);
duke@1 1480 return toP(t);
duke@1 1481 }
duke@1 1482
duke@1 1483 public JCBlock block() {
duke@1 1484 return block(S.pos(), 0);
duke@1 1485 }
duke@1 1486
duke@1 1487 /** BlockStatements = { BlockStatement }
duke@1 1488 * BlockStatement = LocalVariableDeclarationStatement
duke@1 1489 * | ClassOrInterfaceOrEnumDeclaration
duke@1 1490 * | [Ident ":"] Statement
duke@1 1491 * LocalVariableDeclarationStatement
duke@1 1492 * = { FINAL | '@' Annotation } Type VariableDeclarators ";"
duke@1 1493 */
duke@1 1494 @SuppressWarnings("fallthrough")
duke@1 1495 List<JCStatement> blockStatements() {
duke@1 1496 //todo: skip to anchor on error(?)
duke@1 1497 int lastErrPos = -1;
duke@1 1498 ListBuffer<JCStatement> stats = new ListBuffer<JCStatement>();
duke@1 1499 while (true) {
duke@1 1500 int pos = S.pos();
duke@1 1501 switch (S.token()) {
duke@1 1502 case RBRACE: case CASE: case DEFAULT: case EOF:
duke@1 1503 return stats.toList();
duke@1 1504 case LBRACE: case IF: case FOR: case WHILE: case DO: case TRY:
duke@1 1505 case SWITCH: case SYNCHRONIZED: case RETURN: case THROW: case BREAK:
duke@1 1506 case CONTINUE: case SEMI: case ELSE: case FINALLY: case CATCH:
jjg@111 1507 stats.append(parseStatement());
duke@1 1508 break;
duke@1 1509 case MONKEYS_AT:
duke@1 1510 case FINAL: {
duke@1 1511 String dc = S.docComment();
duke@1 1512 JCModifiers mods = modifiersOpt();
duke@1 1513 if (S.token() == INTERFACE ||
duke@1 1514 S.token() == CLASS ||
duke@1 1515 allowEnums && S.token() == ENUM) {
duke@1 1516 stats.append(classOrInterfaceOrEnumDeclaration(mods, dc));
duke@1 1517 } else {
jjg@111 1518 JCExpression t = parseType();
duke@1 1519 stats.appendList(variableDeclarators(mods, t,
duke@1 1520 new ListBuffer<JCStatement>()));
duke@1 1521 // A "LocalVariableDeclarationStatement" subsumes the terminating semicolon
duke@1 1522 storeEnd(stats.elems.last(), S.endPos());
duke@1 1523 accept(SEMI);
duke@1 1524 }
duke@1 1525 break;
duke@1 1526 }
duke@1 1527 case ABSTRACT: case STRICTFP: {
duke@1 1528 String dc = S.docComment();
duke@1 1529 JCModifiers mods = modifiersOpt();
duke@1 1530 stats.append(classOrInterfaceOrEnumDeclaration(mods, dc));
duke@1 1531 break;
duke@1 1532 }
duke@1 1533 case INTERFACE:
duke@1 1534 case CLASS:
duke@1 1535 stats.append(classOrInterfaceOrEnumDeclaration(modifiersOpt(),
duke@1 1536 S.docComment()));
duke@1 1537 break;
duke@1 1538 case ENUM:
duke@1 1539 case ASSERT:
duke@1 1540 if (allowEnums && S.token() == ENUM) {
duke@1 1541 log.error(S.pos(), "local.enum");
duke@1 1542 stats.
duke@1 1543 append(classOrInterfaceOrEnumDeclaration(modifiersOpt(),
duke@1 1544 S.docComment()));
duke@1 1545 break;
duke@1 1546 } else if (allowAsserts && S.token() == ASSERT) {
jjg@111 1547 stats.append(parseStatement());
duke@1 1548 break;
duke@1 1549 }
duke@1 1550 /* fall through to default */
duke@1 1551 default:
duke@1 1552 Name name = S.name();
duke@1 1553 JCExpression t = term(EXPR | TYPE);
duke@1 1554 if (S.token() == COLON && t.getTag() == JCTree.IDENT) {
duke@1 1555 S.nextToken();
jjg@111 1556 JCStatement stat = parseStatement();
duke@1 1557 stats.append(F.at(pos).Labelled(name, stat));
duke@1 1558 } else if ((lastmode & TYPE) != 0 &&
duke@1 1559 (S.token() == IDENTIFIER ||
duke@1 1560 S.token() == ASSERT ||
duke@1 1561 S.token() == ENUM)) {
duke@1 1562 pos = S.pos();
duke@1 1563 JCModifiers mods = F.at(Position.NOPOS).Modifiers(0);
duke@1 1564 F.at(pos);
duke@1 1565 stats.appendList(variableDeclarators(mods, t,
duke@1 1566 new ListBuffer<JCStatement>()));
duke@1 1567 // A "LocalVariableDeclarationStatement" subsumes the terminating semicolon
duke@1 1568 storeEnd(stats.elems.last(), S.endPos());
duke@1 1569 accept(SEMI);
duke@1 1570 } else {
duke@1 1571 // This Exec is an "ExpressionStatement"; it subsumes the terminating semicolon
duke@1 1572 stats.append(to(F.at(pos).Exec(checkExprStat(t))));
duke@1 1573 accept(SEMI);
duke@1 1574 }
duke@1 1575 }
duke@1 1576
duke@1 1577 // error recovery
duke@1 1578 if (S.pos() == lastErrPos)
duke@1 1579 return stats.toList();
duke@1 1580 if (S.pos() <= errorEndPos) {
duke@1 1581 skip(false, true, true, true);
duke@1 1582 lastErrPos = S.pos();
duke@1 1583 }
duke@1 1584
duke@1 1585 // ensure no dangling /** @deprecated */ active
duke@1 1586 S.resetDeprecatedFlag();
duke@1 1587 }
duke@1 1588 }
duke@1 1589
duke@1 1590 /** Statement =
duke@1 1591 * Block
duke@1 1592 * | IF ParExpression Statement [ELSE Statement]
duke@1 1593 * | FOR "(" ForInitOpt ";" [Expression] ";" ForUpdateOpt ")" Statement
duke@1 1594 * | FOR "(" FormalParameter : Expression ")" Statement
duke@1 1595 * | WHILE ParExpression Statement
duke@1 1596 * | DO Statement WHILE ParExpression ";"
duke@1 1597 * | TRY Block ( Catches | [Catches] FinallyPart )
duke@1 1598 * | SWITCH ParExpression "{" SwitchBlockStatementGroups "}"
duke@1 1599 * | SYNCHRONIZED ParExpression Block
duke@1 1600 * | RETURN [Expression] ";"
duke@1 1601 * | THROW Expression ";"
duke@1 1602 * | BREAK [Ident] ";"
duke@1 1603 * | CONTINUE [Ident] ";"
duke@1 1604 * | ASSERT Expression [ ":" Expression ] ";"
duke@1 1605 * | ";"
duke@1 1606 * | ExpressionStatement
duke@1 1607 * | Ident ":" Statement
duke@1 1608 */
duke@1 1609 @SuppressWarnings("fallthrough")
jjg@111 1610 public JCStatement parseStatement() {
duke@1 1611 int pos = S.pos();
duke@1 1612 switch (S.token()) {
duke@1 1613 case LBRACE:
duke@1 1614 return block();
duke@1 1615 case IF: {
duke@1 1616 S.nextToken();
duke@1 1617 JCExpression cond = parExpression();
jjg@111 1618 JCStatement thenpart = parseStatement();
duke@1 1619 JCStatement elsepart = null;
duke@1 1620 if (S.token() == ELSE) {
duke@1 1621 S.nextToken();
jjg@111 1622 elsepart = parseStatement();
duke@1 1623 }
duke@1 1624 return F.at(pos).If(cond, thenpart, elsepart);
duke@1 1625 }
duke@1 1626 case FOR: {
duke@1 1627 S.nextToken();
duke@1 1628 accept(LPAREN);
duke@1 1629 List<JCStatement> inits = S.token() == SEMI ? List.<JCStatement>nil() : forInit();
duke@1 1630 if (inits.length() == 1 &&
duke@1 1631 inits.head.getTag() == JCTree.VARDEF &&
duke@1 1632 ((JCVariableDecl) inits.head).init == null &&
duke@1 1633 S.token() == COLON) {
duke@1 1634 checkForeach();
duke@1 1635 JCVariableDecl var = (JCVariableDecl)inits.head;
duke@1 1636 accept(COLON);
jjg@111 1637 JCExpression expr = parseExpression();
duke@1 1638 accept(RPAREN);
jjg@111 1639 JCStatement body = parseStatement();
duke@1 1640 return F.at(pos).ForeachLoop(var, expr, body);
duke@1 1641 } else {
duke@1 1642 accept(SEMI);
jjg@111 1643 JCExpression cond = S.token() == SEMI ? null : parseExpression();
duke@1 1644 accept(SEMI);
duke@1 1645 List<JCExpressionStatement> steps = S.token() == RPAREN ? List.<JCExpressionStatement>nil() : forUpdate();
duke@1 1646 accept(RPAREN);
jjg@111 1647 JCStatement body = parseStatement();
duke@1 1648 return F.at(pos).ForLoop(inits, cond, steps, body);
duke@1 1649 }
duke@1 1650 }
duke@1 1651 case WHILE: {
duke@1 1652 S.nextToken();
duke@1 1653 JCExpression cond = parExpression();
jjg@111 1654 JCStatement body = parseStatement();
duke@1 1655 return F.at(pos).WhileLoop(cond, body);
duke@1 1656 }
duke@1 1657 case DO: {
duke@1 1658 S.nextToken();
jjg@111 1659 JCStatement body = parseStatement();
duke@1 1660 accept(WHILE);
duke@1 1661 JCExpression cond = parExpression();
duke@1 1662 JCDoWhileLoop t = to(F.at(pos).DoLoop(body, cond));
duke@1 1663 accept(SEMI);
duke@1 1664 return t;
duke@1 1665 }
duke@1 1666 case TRY: {
duke@1 1667 S.nextToken();
duke@1 1668 JCBlock body = block();
duke@1 1669 ListBuffer<JCCatch> catchers = new ListBuffer<JCCatch>();
duke@1 1670 JCBlock finalizer = null;
duke@1 1671 if (S.token() == CATCH || S.token() == FINALLY) {
duke@1 1672 while (S.token() == CATCH) catchers.append(catchClause());
duke@1 1673 if (S.token() == FINALLY) {
duke@1 1674 S.nextToken();
duke@1 1675 finalizer = block();
duke@1 1676 }
duke@1 1677 } else {
duke@1 1678 log.error(pos, "try.without.catch.or.finally");
duke@1 1679 }
duke@1 1680 return F.at(pos).Try(body, catchers.toList(), finalizer);
duke@1 1681 }
duke@1 1682 case SWITCH: {
duke@1 1683 S.nextToken();
duke@1 1684 JCExpression selector = parExpression();
duke@1 1685 accept(LBRACE);
duke@1 1686 List<JCCase> cases = switchBlockStatementGroups();
duke@1 1687 JCSwitch t = to(F.at(pos).Switch(selector, cases));
duke@1 1688 accept(RBRACE);
duke@1 1689 return t;
duke@1 1690 }
duke@1 1691 case SYNCHRONIZED: {
duke@1 1692 S.nextToken();
duke@1 1693 JCExpression lock = parExpression();
duke@1 1694 JCBlock body = block();
duke@1 1695 return F.at(pos).Synchronized(lock, body);
duke@1 1696 }
duke@1 1697 case RETURN: {
duke@1 1698 S.nextToken();
jjg@111 1699 JCExpression result = S.token() == SEMI ? null : parseExpression();
duke@1 1700 JCReturn t = to(F.at(pos).Return(result));
duke@1 1701 accept(SEMI);
duke@1 1702 return t;
duke@1 1703 }
duke@1 1704 case THROW: {
duke@1 1705 S.nextToken();
jjg@111 1706 JCExpression exc = parseExpression();
duke@1 1707 JCThrow t = to(F.at(pos).Throw(exc));
duke@1 1708 accept(SEMI);
duke@1 1709 return t;
duke@1 1710 }
duke@1 1711 case BREAK: {
duke@1 1712 S.nextToken();
duke@1 1713 Name label = (S.token() == IDENTIFIER || S.token() == ASSERT || S.token() == ENUM) ? ident() : null;
duke@1 1714 JCBreak t = to(F.at(pos).Break(label));
duke@1 1715 accept(SEMI);
duke@1 1716 return t;
duke@1 1717 }
duke@1 1718 case CONTINUE: {
duke@1 1719 S.nextToken();
duke@1 1720 Name label = (S.token() == IDENTIFIER || S.token() == ASSERT || S.token() == ENUM) ? ident() : null;
duke@1 1721 JCContinue t = to(F.at(pos).Continue(label));
duke@1 1722 accept(SEMI);
duke@1 1723 return t;
duke@1 1724 }
duke@1 1725 case SEMI:
duke@1 1726 S.nextToken();
duke@1 1727 return toP(F.at(pos).Skip());
duke@1 1728 case ELSE:
duke@1 1729 return toP(F.Exec(syntaxError("else.without.if")));
duke@1 1730 case FINALLY:
duke@1 1731 return toP(F.Exec(syntaxError("finally.without.try")));
duke@1 1732 case CATCH:
duke@1 1733 return toP(F.Exec(syntaxError("catch.without.try")));
duke@1 1734 case ASSERT: {
duke@1 1735 if (allowAsserts && S.token() == ASSERT) {
duke@1 1736 S.nextToken();
jjg@111 1737 JCExpression assertion = parseExpression();
duke@1 1738 JCExpression message = null;
duke@1 1739 if (S.token() == COLON) {
duke@1 1740 S.nextToken();
jjg@111 1741 message = parseExpression();
duke@1 1742 }
duke@1 1743 JCAssert t = to(F.at(pos).Assert(assertion, message));
duke@1 1744 accept(SEMI);
duke@1 1745 return t;
duke@1 1746 }
duke@1 1747 /* else fall through to default case */
duke@1 1748 }
duke@1 1749 case ENUM:
duke@1 1750 default:
duke@1 1751 Name name = S.name();
jjg@111 1752 JCExpression expr = parseExpression();
duke@1 1753 if (S.token() == COLON && expr.getTag() == JCTree.IDENT) {
duke@1 1754 S.nextToken();
jjg@111 1755 JCStatement stat = parseStatement();
duke@1 1756 return F.at(pos).Labelled(name, stat);
duke@1 1757 } else {
duke@1 1758 // This Exec is an "ExpressionStatement"; it subsumes the terminating semicolon
duke@1 1759 JCExpressionStatement stat = to(F.at(pos).Exec(checkExprStat(expr)));
duke@1 1760 accept(SEMI);
duke@1 1761 return stat;
duke@1 1762 }
duke@1 1763 }
duke@1 1764 }
duke@1 1765
duke@1 1766 /** CatchClause = CATCH "(" FormalParameter ")" Block
duke@1 1767 */
duke@1 1768 JCCatch catchClause() {
duke@1 1769 int pos = S.pos();
duke@1 1770 accept(CATCH);
duke@1 1771 accept(LPAREN);
duke@1 1772 JCVariableDecl formal =
duke@1 1773 variableDeclaratorId(optFinal(Flags.PARAMETER),
duke@1 1774 qualident());
duke@1 1775 accept(RPAREN);
duke@1 1776 JCBlock body = block();
duke@1 1777 return F.at(pos).Catch(formal, body);
duke@1 1778 }
duke@1 1779
duke@1 1780 /** SwitchBlockStatementGroups = { SwitchBlockStatementGroup }
duke@1 1781 * SwitchBlockStatementGroup = SwitchLabel BlockStatements
duke@1 1782 * SwitchLabel = CASE ConstantExpression ":" | DEFAULT ":"
duke@1 1783 */
duke@1 1784 List<JCCase> switchBlockStatementGroups() {
duke@1 1785 ListBuffer<JCCase> cases = new ListBuffer<JCCase>();
duke@1 1786 while (true) {
duke@1 1787 int pos = S.pos();
duke@1 1788 switch (S.token()) {
duke@1 1789 case CASE: {
duke@1 1790 S.nextToken();
jjg@111 1791 JCExpression pat = parseExpression();
duke@1 1792 accept(COLON);
duke@1 1793 List<JCStatement> stats = blockStatements();
duke@1 1794 JCCase c = F.at(pos).Case(pat, stats);
duke@1 1795 if (stats.isEmpty())
duke@1 1796 storeEnd(c, S.prevEndPos());
duke@1 1797 cases.append(c);
duke@1 1798 break;
duke@1 1799 }
duke@1 1800 case DEFAULT: {
duke@1 1801 S.nextToken();
duke@1 1802 accept(COLON);
duke@1 1803 List<JCStatement> stats = blockStatements();
duke@1 1804 JCCase c = F.at(pos).Case(null, stats);
duke@1 1805 if (stats.isEmpty())
duke@1 1806 storeEnd(c, S.prevEndPos());
duke@1 1807 cases.append(c);
duke@1 1808 break;
duke@1 1809 }
duke@1 1810 case RBRACE: case EOF:
duke@1 1811 return cases.toList();
duke@1 1812 default:
duke@1 1813 S.nextToken(); // to ensure progress
duke@1 1814 syntaxError(pos, "expected3",
mcimadamore@80 1815 CASE, DEFAULT, RBRACE);
duke@1 1816 }
duke@1 1817 }
duke@1 1818 }
duke@1 1819
duke@1 1820 /** MoreStatementExpressions = { COMMA StatementExpression }
duke@1 1821 */
duke@1 1822 <T extends ListBuffer<? super JCExpressionStatement>> T moreStatementExpressions(int pos,
duke@1 1823 JCExpression first,
duke@1 1824 T stats) {
duke@1 1825 // This Exec is a "StatementExpression"; it subsumes no terminating token
duke@1 1826 stats.append(toP(F.at(pos).Exec(checkExprStat(first))));
duke@1 1827 while (S.token() == COMMA) {
duke@1 1828 S.nextToken();
duke@1 1829 pos = S.pos();
jjg@111 1830 JCExpression t = parseExpression();
duke@1 1831 // This Exec is a "StatementExpression"; it subsumes no terminating token
duke@1 1832 stats.append(toP(F.at(pos).Exec(checkExprStat(t))));
duke@1 1833 }
duke@1 1834 return stats;
duke@1 1835 }
duke@1 1836
duke@1 1837 /** ForInit = StatementExpression MoreStatementExpressions
duke@1 1838 * | { FINAL | '@' Annotation } Type VariableDeclarators
duke@1 1839 */
duke@1 1840 List<JCStatement> forInit() {
duke@1 1841 ListBuffer<JCStatement> stats = lb();
duke@1 1842 int pos = S.pos();
duke@1 1843 if (S.token() == FINAL || S.token() == MONKEYS_AT) {
jjg@111 1844 return variableDeclarators(optFinal(0), parseType(), stats).toList();
duke@1 1845 } else {
duke@1 1846 JCExpression t = term(EXPR | TYPE);
duke@1 1847 if ((lastmode & TYPE) != 0 &&
duke@1 1848 (S.token() == IDENTIFIER || S.token() == ASSERT || S.token() == ENUM))
duke@1 1849 return variableDeclarators(modifiersOpt(), t, stats).toList();
duke@1 1850 else
duke@1 1851 return moreStatementExpressions(pos, t, stats).toList();
duke@1 1852 }
duke@1 1853 }
duke@1 1854
duke@1 1855 /** ForUpdate = StatementExpression MoreStatementExpressions
duke@1 1856 */
duke@1 1857 List<JCExpressionStatement> forUpdate() {
duke@1 1858 return moreStatementExpressions(S.pos(),
jjg@111 1859 parseExpression(),
duke@1 1860 new ListBuffer<JCExpressionStatement>()).toList();
duke@1 1861 }
duke@1 1862
duke@1 1863 /** AnnotationsOpt = { '@' Annotation }
duke@1 1864 */
duke@1 1865 List<JCAnnotation> annotationsOpt() {
duke@1 1866 if (S.token() != MONKEYS_AT) return List.nil(); // optimization
duke@1 1867 ListBuffer<JCAnnotation> buf = new ListBuffer<JCAnnotation>();
duke@1 1868 while (S.token() == MONKEYS_AT) {
duke@1 1869 int pos = S.pos();
duke@1 1870 S.nextToken();
duke@1 1871 buf.append(annotation(pos));
duke@1 1872 }
duke@1 1873 return buf.toList();
duke@1 1874 }
duke@1 1875
duke@1 1876 /** ModifiersOpt = { Modifier }
duke@1 1877 * Modifier = PUBLIC | PROTECTED | PRIVATE | STATIC | ABSTRACT | FINAL
duke@1 1878 * | NATIVE | SYNCHRONIZED | TRANSIENT | VOLATILE | "@"
duke@1 1879 * | "@" Annotation
duke@1 1880 */
duke@1 1881 JCModifiers modifiersOpt() {
duke@1 1882 return modifiersOpt(null);
duke@1 1883 }
duke@1 1884 JCModifiers modifiersOpt(JCModifiers partial) {
duke@1 1885 long flags = (partial == null) ? 0 : partial.flags;
duke@1 1886 if (S.deprecatedFlag()) {
duke@1 1887 flags |= Flags.DEPRECATED;
duke@1 1888 S.resetDeprecatedFlag();
duke@1 1889 }
duke@1 1890 ListBuffer<JCAnnotation> annotations = new ListBuffer<JCAnnotation>();
duke@1 1891 if (partial != null) annotations.appendList(partial.annotations);
duke@1 1892 int pos = S.pos();
duke@1 1893 int lastPos = Position.NOPOS;
duke@1 1894 loop:
duke@1 1895 while (true) {
duke@1 1896 long flag;
duke@1 1897 switch (S.token()) {
duke@1 1898 case PRIVATE : flag = Flags.PRIVATE; break;
duke@1 1899 case PROTECTED : flag = Flags.PROTECTED; break;
duke@1 1900 case PUBLIC : flag = Flags.PUBLIC; break;
duke@1 1901 case STATIC : flag = Flags.STATIC; break;
duke@1 1902 case TRANSIENT : flag = Flags.TRANSIENT; break;
duke@1 1903 case FINAL : flag = Flags.FINAL; break;
duke@1 1904 case ABSTRACT : flag = Flags.ABSTRACT; break;
duke@1 1905 case NATIVE : flag = Flags.NATIVE; break;
duke@1 1906 case VOLATILE : flag = Flags.VOLATILE; break;
duke@1 1907 case SYNCHRONIZED: flag = Flags.SYNCHRONIZED; break;
duke@1 1908 case STRICTFP : flag = Flags.STRICTFP; break;
duke@1 1909 case MONKEYS_AT : flag = Flags.ANNOTATION; break;
duke@1 1910 default: break loop;
duke@1 1911 }
duke@1 1912 if ((flags & flag) != 0) log.error(S.pos(), "repeated.modifier");
duke@1 1913 lastPos = S.pos();
duke@1 1914 S.nextToken();
duke@1 1915 if (flag == Flags.ANNOTATION) {
duke@1 1916 checkAnnotations();
duke@1 1917 if (S.token() != INTERFACE) {
duke@1 1918 JCAnnotation ann = annotation(lastPos);
duke@1 1919 // if first modifier is an annotation, set pos to annotation's.
duke@1 1920 if (flags == 0 && annotations.isEmpty())
duke@1 1921 pos = ann.pos;
duke@1 1922 annotations.append(ann);
duke@1 1923 lastPos = ann.pos;
duke@1 1924 flag = 0;
duke@1 1925 }
duke@1 1926 }
duke@1 1927 flags |= flag;
duke@1 1928 }
duke@1 1929 switch (S.token()) {
duke@1 1930 case ENUM: flags |= Flags.ENUM; break;
duke@1 1931 case INTERFACE: flags |= Flags.INTERFACE; break;
duke@1 1932 default: break;
duke@1 1933 }
duke@1 1934
duke@1 1935 /* A modifiers tree with no modifier tokens or annotations
duke@1 1936 * has no text position. */
duke@1 1937 if (flags == 0 && annotations.isEmpty())
duke@1 1938 pos = Position.NOPOS;
duke@1 1939
duke@1 1940 JCModifiers mods = F.at(pos).Modifiers(flags, annotations.toList());
duke@1 1941 if (pos != Position.NOPOS)
duke@1 1942 storeEnd(mods, S.prevEndPos());
duke@1 1943 return mods;
duke@1 1944 }
duke@1 1945
duke@1 1946 /** Annotation = "@" Qualident [ "(" AnnotationFieldValues ")" ]
duke@1 1947 * @param pos position of "@" token
duke@1 1948 */
duke@1 1949 JCAnnotation annotation(int pos) {
duke@1 1950 // accept(AT); // AT consumed by caller
duke@1 1951 checkAnnotations();
duke@1 1952 JCTree ident = qualident();
duke@1 1953 List<JCExpression> fieldValues = annotationFieldValuesOpt();
duke@1 1954 JCAnnotation ann = F.at(pos).Annotation(ident, fieldValues);
duke@1 1955 storeEnd(ann, S.prevEndPos());
duke@1 1956 return ann;
duke@1 1957 }
duke@1 1958
duke@1 1959 List<JCExpression> annotationFieldValuesOpt() {
duke@1 1960 return (S.token() == LPAREN) ? annotationFieldValues() : List.<JCExpression>nil();
duke@1 1961 }
duke@1 1962
duke@1 1963 /** AnnotationFieldValues = "(" [ AnnotationFieldValue { "," AnnotationFieldValue } ] ")" */
duke@1 1964 List<JCExpression> annotationFieldValues() {
duke@1 1965 accept(LPAREN);
duke@1 1966 ListBuffer<JCExpression> buf = new ListBuffer<JCExpression>();
duke@1 1967 if (S.token() != RPAREN) {
duke@1 1968 buf.append(annotationFieldValue());
duke@1 1969 while (S.token() == COMMA) {
duke@1 1970 S.nextToken();
duke@1 1971 buf.append(annotationFieldValue());
duke@1 1972 }
duke@1 1973 }
duke@1 1974 accept(RPAREN);
duke@1 1975 return buf.toList();
duke@1 1976 }
duke@1 1977
duke@1 1978 /** AnnotationFieldValue = AnnotationValue
duke@1 1979 * | Identifier "=" AnnotationValue
duke@1 1980 */
duke@1 1981 JCExpression annotationFieldValue() {
duke@1 1982 if (S.token() == IDENTIFIER) {
duke@1 1983 mode = EXPR;
duke@1 1984 JCExpression t1 = term1();
duke@1 1985 if (t1.getTag() == JCTree.IDENT && S.token() == EQ) {
duke@1 1986 int pos = S.pos();
duke@1 1987 accept(EQ);
duke@1 1988 return toP(F.at(pos).Assign(t1, annotationValue()));
duke@1 1989 } else {
duke@1 1990 return t1;
duke@1 1991 }
duke@1 1992 }
duke@1 1993 return annotationValue();
duke@1 1994 }
duke@1 1995
duke@1 1996 /* AnnotationValue = ConditionalExpression
duke@1 1997 * | Annotation
duke@1 1998 * | "{" [ AnnotationValue { "," AnnotationValue } ] "}"
duke@1 1999 */
duke@1 2000 JCExpression annotationValue() {
duke@1 2001 int pos;
duke@1 2002 switch (S.token()) {
duke@1 2003 case MONKEYS_AT:
duke@1 2004 pos = S.pos();
duke@1 2005 S.nextToken();
duke@1 2006 return annotation(pos);
duke@1 2007 case LBRACE:
duke@1 2008 pos = S.pos();
duke@1 2009 accept(LBRACE);
duke@1 2010 ListBuffer<JCExpression> buf = new ListBuffer<JCExpression>();
duke@1 2011 if (S.token() != RBRACE) {
duke@1 2012 buf.append(annotationValue());
duke@1 2013 while (S.token() == COMMA) {
duke@1 2014 S.nextToken();
duke@1 2015 if (S.token() == RPAREN) break;
duke@1 2016 buf.append(annotationValue());
duke@1 2017 }
duke@1 2018 }
duke@1 2019 accept(RBRACE);
duke@1 2020 return toP(F.at(pos).NewArray(null, List.<JCExpression>nil(), buf.toList()));
duke@1 2021 default:
duke@1 2022 mode = EXPR;
duke@1 2023 return term1();
duke@1 2024 }
duke@1 2025 }
duke@1 2026
duke@1 2027 /** VariableDeclarators = VariableDeclarator { "," VariableDeclarator }
duke@1 2028 */
duke@1 2029 public <T extends ListBuffer<? super JCVariableDecl>> T variableDeclarators(JCModifiers mods,
duke@1 2030 JCExpression type,
duke@1 2031 T vdefs)
duke@1 2032 {
duke@1 2033 return variableDeclaratorsRest(S.pos(), mods, type, ident(), false, null, vdefs);
duke@1 2034 }
duke@1 2035
duke@1 2036 /** VariableDeclaratorsRest = VariableDeclaratorRest { "," VariableDeclarator }
duke@1 2037 * ConstantDeclaratorsRest = ConstantDeclaratorRest { "," ConstantDeclarator }
duke@1 2038 *
duke@1 2039 * @param reqInit Is an initializer always required?
duke@1 2040 * @param dc The documentation comment for the variable declarations, or null.
duke@1 2041 */
duke@1 2042 <T extends ListBuffer<? super JCVariableDecl>> T variableDeclaratorsRest(int pos,
duke@1 2043 JCModifiers mods,
duke@1 2044 JCExpression type,
duke@1 2045 Name name,
duke@1 2046 boolean reqInit,
duke@1 2047 String dc,
duke@1 2048 T vdefs)
duke@1 2049 {
duke@1 2050 vdefs.append(variableDeclaratorRest(pos, mods, type, name, reqInit, dc));
duke@1 2051 while (S.token() == COMMA) {
duke@1 2052 // All but last of multiple declarators subsume a comma
duke@1 2053 storeEnd((JCTree)vdefs.elems.last(), S.endPos());
duke@1 2054 S.nextToken();
duke@1 2055 vdefs.append(variableDeclarator(mods, type, reqInit, dc));
duke@1 2056 }
duke@1 2057 return vdefs;
duke@1 2058 }
duke@1 2059
duke@1 2060 /** VariableDeclarator = Ident VariableDeclaratorRest
duke@1 2061 * ConstantDeclarator = Ident ConstantDeclaratorRest
duke@1 2062 */
duke@1 2063 JCVariableDecl variableDeclarator(JCModifiers mods, JCExpression type, boolean reqInit, String dc) {
duke@1 2064 return variableDeclaratorRest(S.pos(), mods, type, ident(), reqInit, dc);
duke@1 2065 }
duke@1 2066
duke@1 2067 /** VariableDeclaratorRest = BracketsOpt ["=" VariableInitializer]
duke@1 2068 * ConstantDeclaratorRest = BracketsOpt "=" VariableInitializer
duke@1 2069 *
duke@1 2070 * @param reqInit Is an initializer always required?
duke@1 2071 * @param dc The documentation comment for the variable declarations, or null.
duke@1 2072 */
duke@1 2073 JCVariableDecl variableDeclaratorRest(int pos, JCModifiers mods, JCExpression type, Name name,
duke@1 2074 boolean reqInit, String dc) {
duke@1 2075 type = bracketsOpt(type);
duke@1 2076 JCExpression init = null;
duke@1 2077 if (S.token() == EQ) {
duke@1 2078 S.nextToken();
duke@1 2079 init = variableInitializer();
duke@1 2080 }
mcimadamore@80 2081 else if (reqInit) syntaxError(S.pos(), "expected", EQ);
duke@1 2082 JCVariableDecl result =
duke@1 2083 toP(F.at(pos).VarDef(mods, name, type, init));
duke@1 2084 attach(result, dc);
duke@1 2085 return result;
duke@1 2086 }
duke@1 2087
duke@1 2088 /** VariableDeclaratorId = Ident BracketsOpt
duke@1 2089 */
duke@1 2090 JCVariableDecl variableDeclaratorId(JCModifiers mods, JCExpression type) {
duke@1 2091 int pos = S.pos();
duke@1 2092 Name name = ident();
duke@1 2093 if ((mods.flags & Flags.VARARGS) == 0)
duke@1 2094 type = bracketsOpt(type);
duke@1 2095 return toP(F.at(pos).VarDef(mods, name, type, null));
duke@1 2096 }
duke@1 2097
duke@1 2098 /** CompilationUnit = [ { "@" Annotation } PACKAGE Qualident ";"] {ImportDeclaration} {TypeDeclaration}
duke@1 2099 */
jjg@111 2100 public JCTree.JCCompilationUnit parseCompilationUnit() {
duke@1 2101 int pos = S.pos();
duke@1 2102 JCExpression pid = null;
duke@1 2103 String dc = S.docComment();
duke@1 2104 JCModifiers mods = null;
duke@1 2105 List<JCAnnotation> packageAnnotations = List.nil();
duke@1 2106 if (S.token() == MONKEYS_AT)
duke@1 2107 mods = modifiersOpt();
duke@1 2108
duke@1 2109 if (S.token() == PACKAGE) {
duke@1 2110 if (mods != null) {
duke@1 2111 checkNoMods(mods.flags);
duke@1 2112 packageAnnotations = mods.annotations;
duke@1 2113 mods = null;
duke@1 2114 }
duke@1 2115 S.nextToken();
duke@1 2116 pid = qualident();
duke@1 2117 accept(SEMI);
duke@1 2118 }
duke@1 2119 ListBuffer<JCTree> defs = new ListBuffer<JCTree>();
jjg@111 2120 boolean checkForImports = true;
duke@1 2121 while (S.token() != EOF) {
duke@1 2122 if (S.pos() <= errorEndPos) {
duke@1 2123 // error recovery
duke@1 2124 skip(checkForImports, false, false, false);
duke@1 2125 if (S.token() == EOF)
duke@1 2126 break;
duke@1 2127 }
duke@1 2128 if (checkForImports && mods == null && S.token() == IMPORT) {
duke@1 2129 defs.append(importDeclaration());
duke@1 2130 } else {
duke@1 2131 JCTree def = typeDeclaration(mods);
duke@1 2132 if (def instanceof JCExpressionStatement)
duke@1 2133 def = ((JCExpressionStatement)def).expr;
duke@1 2134 defs.append(def);
duke@1 2135 if (def instanceof JCClassDecl)
duke@1 2136 checkForImports = false;
duke@1 2137 mods = null;
duke@1 2138 }
duke@1 2139 }
duke@1 2140 JCTree.JCCompilationUnit toplevel = F.at(pos).TopLevel(packageAnnotations, pid, defs.toList());
duke@1 2141 attach(toplevel, dc);
duke@1 2142 if (defs.elems.isEmpty())
duke@1 2143 storeEnd(toplevel, S.prevEndPos());
jjg@111 2144 if (keepDocComments)
jjg@111 2145 toplevel.docComments = docComments;
jjg@111 2146 if (keepLineMap)
jjg@111 2147 toplevel.lineMap = S.getLineMap();
duke@1 2148 return toplevel;
duke@1 2149 }
duke@1 2150
duke@1 2151 /** ImportDeclaration = IMPORT [ STATIC ] Ident { "." Ident } [ "." "*" ] ";"
duke@1 2152 */
duke@1 2153 JCTree importDeclaration() {
duke@1 2154 int pos = S.pos();
duke@1 2155 S.nextToken();
duke@1 2156 boolean importStatic = false;
duke@1 2157 if (S.token() == STATIC) {
duke@1 2158 checkStaticImports();
duke@1 2159 importStatic = true;
duke@1 2160 S.nextToken();
duke@1 2161 }
duke@1 2162 JCExpression pid = toP(F.at(S.pos()).Ident(ident()));
duke@1 2163 do {
duke@1 2164 int pos1 = S.pos();
duke@1 2165 accept(DOT);
duke@1 2166 if (S.token() == STAR) {
duke@1 2167 pid = to(F.at(pos1).Select(pid, names.asterisk));
duke@1 2168 S.nextToken();
duke@1 2169 break;
duke@1 2170 } else {
duke@1 2171 pid = toP(F.at(pos1).Select(pid, ident()));
duke@1 2172 }
duke@1 2173 } while (S.token() == DOT);
duke@1 2174 accept(SEMI);
duke@1 2175 return toP(F.at(pos).Import(pid, importStatic));
duke@1 2176 }
duke@1 2177
duke@1 2178 /** TypeDeclaration = ClassOrInterfaceOrEnumDeclaration
duke@1 2179 * | ";"
duke@1 2180 */
duke@1 2181 JCTree typeDeclaration(JCModifiers mods) {
duke@1 2182 int pos = S.pos();
duke@1 2183 if (mods == null && S.token() == SEMI) {
duke@1 2184 S.nextToken();
duke@1 2185 return toP(F.at(pos).Skip());
duke@1 2186 } else {
duke@1 2187 String dc = S.docComment();
duke@1 2188 return classOrInterfaceOrEnumDeclaration(modifiersOpt(mods), dc);
duke@1 2189 }
duke@1 2190 }
duke@1 2191
duke@1 2192 /** ClassOrInterfaceOrEnumDeclaration = ModifiersOpt
duke@1 2193 * (ClassDeclaration | InterfaceDeclaration | EnumDeclaration)
duke@1 2194 * @param mods Any modifiers starting the class or interface declaration
duke@1 2195 * @param dc The documentation comment for the class, or null.
duke@1 2196 */
duke@1 2197 JCStatement classOrInterfaceOrEnumDeclaration(JCModifiers mods, String dc) {
duke@1 2198 if (S.token() == CLASS) {
duke@1 2199 return classDeclaration(mods, dc);
duke@1 2200 } else if (S.token() == INTERFACE) {
duke@1 2201 return interfaceDeclaration(mods, dc);
duke@1 2202 } else if (allowEnums) {
duke@1 2203 if (S.token() == ENUM) {
duke@1 2204 return enumDeclaration(mods, dc);
duke@1 2205 } else {
duke@1 2206 int pos = S.pos();
duke@1 2207 List<JCTree> errs;
duke@1 2208 if (S.token() == IDENTIFIER) {
duke@1 2209 errs = List.<JCTree>of(mods, toP(F.at(pos).Ident(ident())));
duke@1 2210 setErrorEndPos(S.pos());
duke@1 2211 } else {
duke@1 2212 errs = List.<JCTree>of(mods);
duke@1 2213 }
duke@1 2214 return toP(F.Exec(syntaxError(pos, errs, "expected3",
mcimadamore@80 2215 CLASS, INTERFACE, ENUM)));
duke@1 2216 }
duke@1 2217 } else {
duke@1 2218 if (S.token() == ENUM) {
duke@1 2219 log.error(S.pos(), "enums.not.supported.in.source", source.name);
duke@1 2220 allowEnums = true;
duke@1 2221 return enumDeclaration(mods, dc);
duke@1 2222 }
duke@1 2223 int pos = S.pos();
duke@1 2224 List<JCTree> errs;
duke@1 2225 if (S.token() == IDENTIFIER) {
duke@1 2226 errs = List.<JCTree>of(mods, toP(F.at(pos).Ident(ident())));
duke@1 2227 setErrorEndPos(S.pos());
duke@1 2228 } else {
duke@1 2229 errs = List.<JCTree>of(mods);
duke@1 2230 }
duke@1 2231 return toP(F.Exec(syntaxError(pos, errs, "expected2",
mcimadamore@80 2232 CLASS, INTERFACE)));
duke@1 2233 }
duke@1 2234 }
duke@1 2235
duke@1 2236 /** ClassDeclaration = CLASS Ident TypeParametersOpt [EXTENDS Type]
duke@1 2237 * [IMPLEMENTS TypeList] ClassBody
duke@1 2238 * @param mods The modifiers starting the class declaration
duke@1 2239 * @param dc The documentation comment for the class, or null.
duke@1 2240 */
duke@1 2241 JCClassDecl classDeclaration(JCModifiers mods, String dc) {
duke@1 2242 int pos = S.pos();
duke@1 2243 accept(CLASS);
duke@1 2244 Name name = ident();
duke@1 2245
duke@1 2246 List<JCTypeParameter> typarams = typeParametersOpt();
duke@1 2247
duke@1 2248 JCTree extending = null;
duke@1 2249 if (S.token() == EXTENDS) {
duke@1 2250 S.nextToken();
jjg@111 2251 extending = parseType();
duke@1 2252 }
duke@1 2253 List<JCExpression> implementing = List.nil();
duke@1 2254 if (S.token() == IMPLEMENTS) {
duke@1 2255 S.nextToken();
duke@1 2256 implementing = typeList();
duke@1 2257 }
duke@1 2258 List<JCTree> defs = classOrInterfaceBody(name, false);
duke@1 2259 JCClassDecl result = toP(F.at(pos).ClassDef(
duke@1 2260 mods, name, typarams, extending, implementing, defs));
duke@1 2261 attach(result, dc);
duke@1 2262 return result;
duke@1 2263 }
duke@1 2264
duke@1 2265 /** InterfaceDeclaration = INTERFACE Ident TypeParametersOpt
duke@1 2266 * [EXTENDS TypeList] InterfaceBody
duke@1 2267 * @param mods The modifiers starting the interface declaration
duke@1 2268 * @param dc The documentation comment for the interface, or null.
duke@1 2269 */
duke@1 2270 JCClassDecl interfaceDeclaration(JCModifiers mods, String dc) {
duke@1 2271 int pos = S.pos();
duke@1 2272 accept(INTERFACE);
duke@1 2273 Name name = ident();
duke@1 2274
duke@1 2275 List<JCTypeParameter> typarams = typeParametersOpt();
duke@1 2276
duke@1 2277 List<JCExpression> extending = List.nil();
duke@1 2278 if (S.token() == EXTENDS) {
duke@1 2279 S.nextToken();
duke@1 2280 extending = typeList();
duke@1 2281 }
duke@1 2282 List<JCTree> defs = classOrInterfaceBody(name, true);
duke@1 2283 JCClassDecl result = toP(F.at(pos).ClassDef(
duke@1 2284 mods, name, typarams, null, extending, defs));
duke@1 2285 attach(result, dc);
duke@1 2286 return result;
duke@1 2287 }
duke@1 2288
duke@1 2289 /** EnumDeclaration = ENUM Ident [IMPLEMENTS TypeList] EnumBody
duke@1 2290 * @param mods The modifiers starting the enum declaration
duke@1 2291 * @param dc The documentation comment for the enum, or null.
duke@1 2292 */
duke@1 2293 JCClassDecl enumDeclaration(JCModifiers mods, String dc) {
duke@1 2294 int pos = S.pos();
duke@1 2295 accept(ENUM);
duke@1 2296 Name name = ident();
duke@1 2297
duke@1 2298 List<JCExpression> implementing = List.nil();
duke@1 2299 if (S.token() == IMPLEMENTS) {
duke@1 2300 S.nextToken();
duke@1 2301 implementing = typeList();
duke@1 2302 }
duke@1 2303
duke@1 2304 List<JCTree> defs = enumBody(name);
duke@1 2305 JCModifiers newMods =
duke@1 2306 F.at(mods.pos).Modifiers(mods.flags|Flags.ENUM, mods.annotations);
duke@1 2307 JCClassDecl result = toP(F.at(pos).
duke@1 2308 ClassDef(newMods, name, List.<JCTypeParameter>nil(),
duke@1 2309 null, implementing, defs));
duke@1 2310 attach(result, dc);
duke@1 2311 return result;
duke@1 2312 }
duke@1 2313
duke@1 2314 /** EnumBody = "{" { EnumeratorDeclarationList } [","]
duke@1 2315 * [ ";" {ClassBodyDeclaration} ] "}"
duke@1 2316 */
duke@1 2317 List<JCTree> enumBody(Name enumName) {
duke@1 2318 accept(LBRACE);
duke@1 2319 ListBuffer<JCTree> defs = new ListBuffer<JCTree>();
duke@1 2320 if (S.token() == COMMA) {
duke@1 2321 S.nextToken();
duke@1 2322 } else if (S.token() != RBRACE && S.token() != SEMI) {
duke@1 2323 defs.append(enumeratorDeclaration(enumName));
duke@1 2324 while (S.token() == COMMA) {
duke@1 2325 S.nextToken();
duke@1 2326 if (S.token() == RBRACE || S.token() == SEMI) break;
duke@1 2327 defs.append(enumeratorDeclaration(enumName));
duke@1 2328 }
duke@1 2329 if (S.token() != SEMI && S.token() != RBRACE) {
duke@1 2330 defs.append(syntaxError(S.pos(), "expected3",
mcimadamore@80 2331 COMMA, RBRACE, SEMI));
duke@1 2332 S.nextToken();
duke@1 2333 }
duke@1 2334 }
duke@1 2335 if (S.token() == SEMI) {
duke@1 2336 S.nextToken();
duke@1 2337 while (S.token() != RBRACE && S.token() != EOF) {
duke@1 2338 defs.appendList(classOrInterfaceBodyDeclaration(enumName,
duke@1 2339 false));
duke@1 2340 if (S.pos() <= errorEndPos) {
duke@1 2341 // error recovery
duke@1 2342 skip(false, true, true, false);
duke@1 2343 }
duke@1 2344 }
duke@1 2345 }
duke@1 2346 accept(RBRACE);
duke@1 2347 return defs.toList();
duke@1 2348 }
duke@1 2349
duke@1 2350 /** EnumeratorDeclaration = AnnotationsOpt [TypeArguments] IDENTIFIER [ Arguments ] [ "{" ClassBody "}" ]
duke@1 2351 */
duke@1 2352 JCTree enumeratorDeclaration(Name enumName) {
duke@1 2353 String dc = S.docComment();
duke@1 2354 int flags = Flags.PUBLIC|Flags.STATIC|Flags.FINAL|Flags.ENUM;
duke@1 2355 if (S.deprecatedFlag()) {
duke@1 2356 flags |= Flags.DEPRECATED;
duke@1 2357 S.resetDeprecatedFlag();
duke@1 2358 }
duke@1 2359 int pos = S.pos();
duke@1 2360 List<JCAnnotation> annotations = annotationsOpt();
duke@1 2361 JCModifiers mods = F.at(annotations.isEmpty() ? Position.NOPOS : pos).Modifiers(flags, annotations);
duke@1 2362 List<JCExpression> typeArgs = typeArgumentsOpt();
duke@1 2363 int identPos = S.pos();
duke@1 2364 Name name = ident();
duke@1 2365 int createPos = S.pos();
duke@1 2366 List<JCExpression> args = (S.token() == LPAREN)
duke@1 2367 ? arguments() : List.<JCExpression>nil();
duke@1 2368 JCClassDecl body = null;
duke@1 2369 if (S.token() == LBRACE) {
duke@1 2370 JCModifiers mods1 = F.at(Position.NOPOS).Modifiers(Flags.ENUM | Flags.STATIC);
duke@1 2371 List<JCTree> defs = classOrInterfaceBody(names.empty, false);
duke@1 2372 body = toP(F.at(identPos).AnonymousClassDef(mods1, defs));
duke@1 2373 }
duke@1 2374 if (args.isEmpty() && body == null)
duke@1 2375 createPos = Position.NOPOS;
duke@1 2376 JCIdent ident = F.at(Position.NOPOS).Ident(enumName);
duke@1 2377 JCNewClass create = F.at(createPos).NewClass(null, typeArgs, ident, args, body);
duke@1 2378 if (createPos != Position.NOPOS)
duke@1 2379 storeEnd(create, S.prevEndPos());
duke@1 2380 ident = F.at(Position.NOPOS).Ident(enumName);
duke@1 2381 JCTree result = toP(F.at(pos).VarDef(mods, name, ident, create));
duke@1 2382 attach(result, dc);
duke@1 2383 return result;
duke@1 2384 }
duke@1 2385
duke@1 2386 /** TypeList = Type {"," Type}
duke@1 2387 */
duke@1 2388 List<JCExpression> typeList() {
duke@1 2389 ListBuffer<JCExpression> ts = new ListBuffer<JCExpression>();
jjg@111 2390 ts.append(parseType());
duke@1 2391 while (S.token() == COMMA) {
duke@1 2392 S.nextToken();
jjg@111 2393 ts.append(parseType());
duke@1 2394 }
duke@1 2395 return ts.toList();
duke@1 2396 }
duke@1 2397
duke@1 2398 /** ClassBody = "{" {ClassBodyDeclaration} "}"
duke@1 2399 * InterfaceBody = "{" {InterfaceBodyDeclaration} "}"
duke@1 2400 */
duke@1 2401 List<JCTree> classOrInterfaceBody(Name className, boolean isInterface) {
duke@1 2402 accept(LBRACE);
duke@1 2403 if (S.pos() <= errorEndPos) {
duke@1 2404 // error recovery
duke@1 2405 skip(false, true, false, false);
duke@1 2406 if (S.token() == LBRACE)
duke@1 2407 S.nextToken();
duke@1 2408 }
duke@1 2409 ListBuffer<JCTree> defs = new ListBuffer<JCTree>();
duke@1 2410 while (S.token() != RBRACE && S.token() != EOF) {
duke@1 2411 defs.appendList(classOrInterfaceBodyDeclaration(className, isInterface));
duke@1 2412 if (S.pos() <= errorEndPos) {
duke@1 2413 // error recovery
duke@1 2414 skip(false, true, true, false);
duke@1 2415 }
duke@1 2416 }
duke@1 2417 accept(RBRACE);
duke@1 2418 return defs.toList();
duke@1 2419 }
duke@1 2420
duke@1 2421 /** ClassBodyDeclaration =
duke@1 2422 * ";"
duke@1 2423 * | [STATIC] Block
duke@1 2424 * | ModifiersOpt
duke@1 2425 * ( Type Ident
duke@1 2426 * ( VariableDeclaratorsRest ";" | MethodDeclaratorRest )
duke@1 2427 * | VOID Ident MethodDeclaratorRest
duke@1 2428 * | TypeParameters (Type | VOID) Ident MethodDeclaratorRest
duke@1 2429 * | Ident ConstructorDeclaratorRest
duke@1 2430 * | TypeParameters Ident ConstructorDeclaratorRest
duke@1 2431 * | ClassOrInterfaceOrEnumDeclaration
duke@1 2432 * )
duke@1 2433 * InterfaceBodyDeclaration =
duke@1 2434 * ";"
duke@1 2435 * | ModifiersOpt Type Ident
duke@1 2436 * ( ConstantDeclaratorsRest | InterfaceMethodDeclaratorRest ";" )
duke@1 2437 */
duke@1 2438 List<JCTree> classOrInterfaceBodyDeclaration(Name className, boolean isInterface) {
duke@1 2439 if (S.token() == SEMI) {
duke@1 2440 S.nextToken();
duke@1 2441 return List.<JCTree>of(F.at(Position.NOPOS).Block(0, List.<JCStatement>nil()));
duke@1 2442 } else {
duke@1 2443 String dc = S.docComment();
duke@1 2444 int pos = S.pos();
duke@1 2445 JCModifiers mods = modifiersOpt();
duke@1 2446 if (S.token() == CLASS ||
duke@1 2447 S.token() == INTERFACE ||
duke@1 2448 allowEnums && S.token() == ENUM) {
duke@1 2449 return List.<JCTree>of(classOrInterfaceOrEnumDeclaration(mods, dc));
duke@1 2450 } else if (S.token() == LBRACE && !isInterface &&
duke@1 2451 (mods.flags & Flags.StandardFlags & ~Flags.STATIC) == 0 &&
duke@1 2452 mods.annotations.isEmpty()) {
duke@1 2453 return List.<JCTree>of(block(pos, mods.flags));
duke@1 2454 } else {
duke@1 2455 pos = S.pos();
duke@1 2456 List<JCTypeParameter> typarams = typeParametersOpt();
duke@1 2457 // Hack alert: if there are type arguments but no Modifiers, the start
duke@1 2458 // position will be lost unless we set the Modifiers position. There
duke@1 2459 // should be an AST node for type parameters (BugId 5005090).
duke@1 2460 if (typarams.length() > 0 && mods.pos == Position.NOPOS) {
duke@1 2461 mods.pos = pos;
duke@1 2462 }
duke@1 2463 Token token = S.token();
duke@1 2464 Name name = S.name();
duke@1 2465 pos = S.pos();
duke@1 2466 JCExpression type;
duke@1 2467 boolean isVoid = S.token() == VOID;
duke@1 2468 if (isVoid) {
duke@1 2469 type = to(F.at(pos).TypeIdent(TypeTags.VOID));
duke@1 2470 S.nextToken();
duke@1 2471 } else {
jjg@111 2472 type = parseType();
duke@1 2473 }
duke@1 2474 if (S.token() == LPAREN && !isInterface && type.getTag() == JCTree.IDENT) {
duke@1 2475 if (isInterface || name != className)
duke@1 2476 log.error(pos, "invalid.meth.decl.ret.type.req");
duke@1 2477 return List.of(methodDeclaratorRest(
duke@1 2478 pos, mods, null, names.init, typarams,
duke@1 2479 isInterface, true, dc));
duke@1 2480 } else {
duke@1 2481 pos = S.pos();
duke@1 2482 name = ident();
duke@1 2483 if (S.token() == LPAREN) {
duke@1 2484 return List.of(methodDeclaratorRest(
duke@1 2485 pos, mods, type, name, typarams,
duke@1 2486 isInterface, isVoid, dc));
duke@1 2487 } else if (!isVoid && typarams.isEmpty()) {
duke@1 2488 List<JCTree> defs =
duke@1 2489 variableDeclaratorsRest(pos, mods, type, name, isInterface, dc,
duke@1 2490 new ListBuffer<JCTree>()).toList();
duke@1 2491 storeEnd(defs.last(), S.endPos());
duke@1 2492 accept(SEMI);
duke@1 2493 return defs;
duke@1 2494 } else {
duke@1 2495 pos = S.pos();
duke@1 2496 List<JCTree> err = isVoid
duke@1 2497 ? List.<JCTree>of(toP(F.at(pos).MethodDef(mods, name, type, typarams,
duke@1 2498 List.<JCVariableDecl>nil(), List.<JCExpression>nil(), null, null)))
duke@1 2499 : null;
mcimadamore@80 2500 return List.<JCTree>of(syntaxError(S.pos(), err, "expected", LPAREN));
duke@1 2501 }
duke@1 2502 }
duke@1 2503 }
duke@1 2504 }
duke@1 2505 }
duke@1 2506
duke@1 2507 /** MethodDeclaratorRest =
duke@1 2508 * FormalParameters BracketsOpt [Throws TypeList] ( MethodBody | [DEFAULT AnnotationValue] ";")
duke@1 2509 * VoidMethodDeclaratorRest =
duke@1 2510 * FormalParameters [Throws TypeList] ( MethodBody | ";")
duke@1 2511 * InterfaceMethodDeclaratorRest =
duke@1 2512 * FormalParameters BracketsOpt [THROWS TypeList] ";"
duke@1 2513 * VoidInterfaceMethodDeclaratorRest =
duke@1 2514 * FormalParameters [THROWS TypeList] ";"
duke@1 2515 * ConstructorDeclaratorRest =
duke@1 2516 * "(" FormalParameterListOpt ")" [THROWS TypeList] MethodBody
duke@1 2517 */
duke@1 2518 JCTree methodDeclaratorRest(int pos,
duke@1 2519 JCModifiers mods,
duke@1 2520 JCExpression type,
duke@1 2521 Name name,
duke@1 2522 List<JCTypeParameter> typarams,
duke@1 2523 boolean isInterface, boolean isVoid,
duke@1 2524 String dc) {
duke@1 2525 List<JCVariableDecl> params = formalParameters();
duke@1 2526 if (!isVoid) type = bracketsOpt(type);
duke@1 2527 List<JCExpression> thrown = List.nil();
duke@1 2528 if (S.token() == THROWS) {
duke@1 2529 S.nextToken();
duke@1 2530 thrown = qualidentList();
duke@1 2531 }
duke@1 2532 JCBlock body = null;
duke@1 2533 JCExpression defaultValue;
duke@1 2534 if (S.token() == LBRACE) {
duke@1 2535 body = block();
duke@1 2536 defaultValue = null;
duke@1 2537 } else {
duke@1 2538 if (S.token() == DEFAULT) {
duke@1 2539 accept(DEFAULT);
duke@1 2540 defaultValue = annotationValue();
duke@1 2541 } else {
duke@1 2542 defaultValue = null;
duke@1 2543 }
duke@1 2544 accept(SEMI);
duke@1 2545 if (S.pos() <= errorEndPos) {
duke@1 2546 // error recovery
duke@1 2547 skip(false, true, false, false);
duke@1 2548 if (S.token() == LBRACE) {
duke@1 2549 body = block();
duke@1 2550 }
duke@1 2551 }
duke@1 2552 }
duke@1 2553 JCMethodDecl result =
duke@1 2554 toP(F.at(pos).MethodDef(mods, name, type, typarams,
duke@1 2555 params, thrown,
duke@1 2556 body, defaultValue));
duke@1 2557 attach(result, dc);
duke@1 2558 return result;
duke@1 2559 }
duke@1 2560
duke@1 2561 /** QualidentList = Qualident {"," Qualident}
duke@1 2562 */
duke@1 2563 List<JCExpression> qualidentList() {
duke@1 2564 ListBuffer<JCExpression> ts = new ListBuffer<JCExpression>();
duke@1 2565 ts.append(qualident());
duke@1 2566 while (S.token() == COMMA) {
duke@1 2567 S.nextToken();
duke@1 2568 ts.append(qualident());
duke@1 2569 }
duke@1 2570 return ts.toList();
duke@1 2571 }
duke@1 2572
duke@1 2573 /** TypeParametersOpt = ["<" TypeParameter {"," TypeParameter} ">"]
duke@1 2574 */
duke@1 2575 List<JCTypeParameter> typeParametersOpt() {
duke@1 2576 if (S.token() == LT) {
duke@1 2577 checkGenerics();
duke@1 2578 ListBuffer<JCTypeParameter> typarams = new ListBuffer<JCTypeParameter>();
duke@1 2579 S.nextToken();
duke@1 2580 typarams.append(typeParameter());
duke@1 2581 while (S.token() == COMMA) {
duke@1 2582 S.nextToken();
duke@1 2583 typarams.append(typeParameter());
duke@1 2584 }
duke@1 2585 accept(GT);
duke@1 2586 return typarams.toList();
duke@1 2587 } else {
duke@1 2588 return List.nil();
duke@1 2589 }
duke@1 2590 }
duke@1 2591
duke@1 2592 /** TypeParameter = TypeVariable [TypeParameterBound]
duke@1 2593 * TypeParameterBound = EXTENDS Type {"&" Type}
duke@1 2594 * TypeVariable = Ident
duke@1 2595 */
duke@1 2596 JCTypeParameter typeParameter() {
duke@1 2597 int pos = S.pos();
duke@1 2598 Name name = ident();
duke@1 2599 ListBuffer<JCExpression> bounds = new ListBuffer<JCExpression>();
duke@1 2600 if (S.token() == EXTENDS) {
duke@1 2601 S.nextToken();
jjg@111 2602 bounds.append(parseType());
duke@1 2603 while (S.token() == AMP) {
duke@1 2604 S.nextToken();
jjg@111 2605 bounds.append(parseType());
duke@1 2606 }
duke@1 2607 }
duke@1 2608 return toP(F.at(pos).TypeParameter(name, bounds.toList()));
duke@1 2609 }
duke@1 2610
duke@1 2611 /** FormalParameters = "(" [ FormalParameterList ] ")"
duke@1 2612 * FormalParameterList = [ FormalParameterListNovarargs , ] LastFormalParameter
duke@1 2613 * FormalParameterListNovarargs = [ FormalParameterListNovarargs , ] FormalParameter
duke@1 2614 */
duke@1 2615 List<JCVariableDecl> formalParameters() {
duke@1 2616 ListBuffer<JCVariableDecl> params = new ListBuffer<JCVariableDecl>();
duke@1 2617 JCVariableDecl lastParam = null;
duke@1 2618 accept(LPAREN);
duke@1 2619 if (S.token() != RPAREN) {
duke@1 2620 params.append(lastParam = formalParameter());
duke@1 2621 while ((lastParam.mods.flags & Flags.VARARGS) == 0 && S.token() == COMMA) {
duke@1 2622 S.nextToken();
duke@1 2623 params.append(lastParam = formalParameter());
duke@1 2624 }
duke@1 2625 }
duke@1 2626 accept(RPAREN);
duke@1 2627 return params.toList();
duke@1 2628 }
duke@1 2629
duke@1 2630 JCModifiers optFinal(long flags) {
duke@1 2631 JCModifiers mods = modifiersOpt();
duke@1 2632 checkNoMods(mods.flags & ~(Flags.FINAL | Flags.DEPRECATED));
duke@1 2633 mods.flags |= flags;
duke@1 2634 return mods;
duke@1 2635 }
duke@1 2636
duke@1 2637 /** FormalParameter = { FINAL | '@' Annotation } Type VariableDeclaratorId
duke@1 2638 * LastFormalParameter = { FINAL | '@' Annotation } Type '...' Ident | FormalParameter
duke@1 2639 */
duke@1 2640 JCVariableDecl formalParameter() {
duke@1 2641 JCModifiers mods = optFinal(Flags.PARAMETER);
jjg@111 2642 JCExpression type = parseType();
duke@1 2643 if (S.token() == ELLIPSIS) {
duke@1 2644 checkVarargs();
duke@1 2645 mods.flags |= Flags.VARARGS;
duke@1 2646 type = to(F.at(S.pos()).TypeArray(type));
duke@1 2647 S.nextToken();
duke@1 2648 }
duke@1 2649 return variableDeclaratorId(mods, type);
duke@1 2650 }
duke@1 2651
duke@1 2652 /* ---------- auxiliary methods -------------- */
duke@1 2653
duke@1 2654 /** Check that given tree is a legal expression statement.
duke@1 2655 */
duke@1 2656 protected JCExpression checkExprStat(JCExpression t) {
duke@1 2657 switch(t.getTag()) {
duke@1 2658 case JCTree.PREINC: case JCTree.PREDEC:
duke@1 2659 case JCTree.POSTINC: case JCTree.POSTDEC:
duke@1 2660 case JCTree.ASSIGN:
duke@1 2661 case JCTree.BITOR_ASG: case JCTree.BITXOR_ASG: case JCTree.BITAND_ASG:
duke@1 2662 case JCTree.SL_ASG: case JCTree.SR_ASG: case JCTree.USR_ASG:
duke@1 2663 case JCTree.PLUS_ASG: case JCTree.MINUS_ASG:
duke@1 2664 case JCTree.MUL_ASG: case JCTree.DIV_ASG: case JCTree.MOD_ASG:
duke@1 2665 case JCTree.APPLY: case JCTree.NEWCLASS:
duke@1 2666 case JCTree.ERRONEOUS:
duke@1 2667 return t;
duke@1 2668 default:
duke@1 2669 log.error(t.pos, "not.stmt");
duke@1 2670 return F.at(t.pos).Erroneous(List.<JCTree>of(t));
duke@1 2671 }
duke@1 2672 }
duke@1 2673
duke@1 2674 /** Return precedence of operator represented by token,
duke@1 2675 * -1 if token is not a binary operator. @see TreeInfo.opPrec
duke@1 2676 */
duke@1 2677 static int prec(Token token) {
duke@1 2678 int oc = optag(token);
duke@1 2679 return (oc >= 0) ? TreeInfo.opPrec(oc) : -1;
duke@1 2680 }
duke@1 2681
duke@1 2682 /** Return operation tag of binary operator represented by token,
duke@1 2683 * -1 if token is not a binary operator.
duke@1 2684 */
duke@1 2685 static int optag(Token token) {
duke@1 2686 switch (token) {
duke@1 2687 case BARBAR:
duke@1 2688 return JCTree.OR;
duke@1 2689 case AMPAMP:
duke@1 2690 return JCTree.AND;
duke@1 2691 case BAR:
duke@1 2692 return JCTree.BITOR;
duke@1 2693 case BAREQ:
duke@1 2694 return JCTree.BITOR_ASG;
duke@1 2695 case CARET:
duke@1 2696 return JCTree.BITXOR;
duke@1 2697 case CARETEQ:
duke@1 2698 return JCTree.BITXOR_ASG;
duke@1 2699 case AMP:
duke@1 2700 return JCTree.BITAND;
duke@1 2701 case AMPEQ:
duke@1 2702 return JCTree.BITAND_ASG;
duke@1 2703 case EQEQ:
duke@1 2704 return JCTree.EQ;
duke@1 2705 case BANGEQ:
duke@1 2706 return JCTree.NE;
duke@1 2707 case LT:
duke@1 2708 return JCTree.LT;
duke@1 2709 case GT:
duke@1 2710 return JCTree.GT;
duke@1 2711 case LTEQ:
duke@1 2712 return JCTree.LE;
duke@1 2713 case GTEQ:
duke@1 2714 return JCTree.GE;
duke@1 2715 case LTLT:
duke@1 2716 return JCTree.SL;
duke@1 2717 case LTLTEQ:
duke@1 2718 return JCTree.SL_ASG;
duke@1 2719 case GTGT:
duke@1 2720 return JCTree.SR;
duke@1 2721 case GTGTEQ:
duke@1 2722 return JCTree.SR_ASG;
duke@1 2723 case GTGTGT:
duke@1 2724 return JCTree.USR;
duke@1 2725 case GTGTGTEQ:
duke@1 2726 return JCTree.USR_ASG;
duke@1 2727 case PLUS:
duke@1 2728 return JCTree.PLUS;
duke@1 2729 case PLUSEQ:
duke@1 2730 return JCTree.PLUS_ASG;
duke@1 2731 case SUB:
duke@1 2732 return JCTree.MINUS;
duke@1 2733 case SUBEQ:
duke@1 2734 return JCTree.MINUS_ASG;
duke@1 2735 case STAR:
duke@1 2736 return JCTree.MUL;
duke@1 2737 case STAREQ:
duke@1 2738 return JCTree.MUL_ASG;
duke@1 2739 case SLASH:
duke@1 2740 return JCTree.DIV;
duke@1 2741 case SLASHEQ:
duke@1 2742 return JCTree.DIV_ASG;
duke@1 2743 case PERCENT:
duke@1 2744 return JCTree.MOD;
duke@1 2745 case PERCENTEQ:
duke@1 2746 return JCTree.MOD_ASG;
duke@1 2747 case INSTANCEOF:
duke@1 2748 return JCTree.TYPETEST;
duke@1 2749 default:
duke@1 2750 return -1;
duke@1 2751 }
duke@1 2752 }
duke@1 2753
duke@1 2754 /** Return operation tag of unary operator represented by token,
duke@1 2755 * -1 if token is not a binary operator.
duke@1 2756 */
duke@1 2757 static int unoptag(Token token) {
duke@1 2758 switch (token) {
duke@1 2759 case PLUS:
duke@1 2760 return JCTree.POS;
duke@1 2761 case SUB:
duke@1 2762 return JCTree.NEG;
duke@1 2763 case BANG:
duke@1 2764 return JCTree.NOT;
duke@1 2765 case TILDE:
duke@1 2766 return JCTree.COMPL;
duke@1 2767 case PLUSPLUS:
duke@1 2768 return JCTree.PREINC;
duke@1 2769 case SUBSUB:
duke@1 2770 return JCTree.PREDEC;
duke@1 2771 default:
duke@1 2772 return -1;
duke@1 2773 }
duke@1 2774 }
duke@1 2775
duke@1 2776 /** Return type tag of basic type represented by token,
duke@1 2777 * -1 if token is not a basic type identifier.
duke@1 2778 */
duke@1 2779 static int typetag(Token token) {
duke@1 2780 switch (token) {
duke@1 2781 case BYTE:
duke@1 2782 return TypeTags.BYTE;
duke@1 2783 case CHAR:
duke@1 2784 return TypeTags.CHAR;
duke@1 2785 case SHORT:
duke@1 2786 return TypeTags.SHORT;
duke@1 2787 case INT:
duke@1 2788 return TypeTags.INT;
duke@1 2789 case LONG:
duke@1 2790 return TypeTags.LONG;
duke@1 2791 case FLOAT:
duke@1 2792 return TypeTags.FLOAT;
duke@1 2793 case DOUBLE:
duke@1 2794 return TypeTags.DOUBLE;
duke@1 2795 case BOOLEAN:
duke@1 2796 return TypeTags.BOOLEAN;
duke@1 2797 default:
duke@1 2798 return -1;
duke@1 2799 }
duke@1 2800 }
duke@1 2801
duke@1 2802 void checkGenerics() {
duke@1 2803 if (!allowGenerics) {
duke@1 2804 log.error(S.pos(), "generics.not.supported.in.source", source.name);
duke@1 2805 allowGenerics = true;
duke@1 2806 }
duke@1 2807 }
duke@1 2808 void checkVarargs() {
duke@1 2809 if (!allowVarargs) {
duke@1 2810 log.error(S.pos(), "varargs.not.supported.in.source", source.name);
duke@1 2811 allowVarargs = true;
duke@1 2812 }
duke@1 2813 }
duke@1 2814 void checkForeach() {
duke@1 2815 if (!allowForeach) {
duke@1 2816 log.error(S.pos(), "foreach.not.supported.in.source", source.name);
duke@1 2817 allowForeach = true;
duke@1 2818 }
duke@1 2819 }
duke@1 2820 void checkStaticImports() {
duke@1 2821 if (!allowStaticImport) {
duke@1 2822 log.error(S.pos(), "static.import.not.supported.in.source", source.name);
duke@1 2823 allowStaticImport = true;
duke@1 2824 }
duke@1 2825 }
duke@1 2826 void checkAnnotations() {
duke@1 2827 if (!allowAnnotations) {
duke@1 2828 log.error(S.pos(), "annotations.not.supported.in.source", source.name);
duke@1 2829 allowAnnotations = true;
duke@1 2830 }
duke@1 2831 }
duke@1 2832 }

mercurial