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

Tue, 28 Dec 2010 15:54:52 -0800

author
ohair
date
Tue, 28 Dec 2010 15:54:52 -0800
changeset 798
4868a36f6fd8
parent 788
8ec3a824f925
child 816
7c537f4298fb
permissions
-rw-r--r--

6962318: Update copyright year
Reviewed-by: xdono

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

mercurial