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

Tue, 09 Sep 2008 10:40:50 -0700

author
jjg
date
Tue, 09 Sep 2008 10:40:50 -0700
changeset 111
a92b756a888f
parent 80
src/share/classes/com/sun/tools/javac/parser/Parser.java@5c9cdeb740f2
child 113
eff38cc97183
permissions
-rw-r--r--

6724118: change JavaCompiler to not use Scanner directly
6736119: refactor Parser and Parser.Factory
Reviewed-by: mcimadamore

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

mercurial