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

Wed, 14 Apr 2010 12:23:29 +0100

author
mcimadamore
date
Wed, 14 Apr 2010 12:23:29 +0100
changeset 536
396b117c1743
parent 516
7f5db2e8b423
child 537
9d9d08922405
permissions
-rw-r--r--

6939618: Revert 'simple' diamond implementation
Summary: backout changeset for 6840638
Reviewed-by: jjg

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

mercurial