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

Fri, 26 Jun 2009 19:47:12 -0700

author
jjg
date
Fri, 26 Jun 2009 19:47:12 -0700
changeset 310
7c154fdc3547
parent 308
03944ee4fac4
child 383
8109aa93b212
permissions
-rw-r--r--

6854796: update JSR308 impl with latest code from type-annotations repo
Reviewed-by: jjg, mcimadamore, darcy
Contributed-by: mernst@cs.washington.edu, mali@csail.mit.edu, mpapi@csail.mit.edu

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();
duke@1 590 int base = ((Character.toLowerCase(s.charAt(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();
duke@1 758 // optimization, was odStack = new Tree[...]; opStack = new Tree[...];
duke@1 759 int top = 0;
duke@1 760 odStack[0] = t;
duke@1 761 int startPos = S.pos();
duke@1 762 Token topOp = ERROR;
duke@1 763 while (prec(S.token()) >= minprec) {
duke@1 764 opStack[top] = topOp;
duke@1 765 top++;
duke@1 766 topOp = S.token();
duke@1 767 int pos = S.pos();
duke@1 768 S.nextToken();
jjg@111 769 odStack[top] = topOp == INSTANCEOF ? parseType() : term3();
duke@1 770 while (top > 0 && prec(topOp) >= prec(S.token())) {
duke@1 771 odStack[top-1] = makeOp(pos, topOp, odStack[top-1],
duke@1 772 odStack[top]);
duke@1 773 top--;
duke@1 774 topOp = opStack[top];
duke@1 775 }
duke@1 776 }
duke@1 777 assert top == 0;
duke@1 778 t = odStack[0];
duke@1 779
duke@1 780 if (t.getTag() == JCTree.PLUS) {
duke@1 781 StringBuffer buf = foldStrings(t);
duke@1 782 if (buf != null) {
duke@1 783 t = toP(F.at(startPos).Literal(TypeTags.CLASS, buf.toString()));
duke@1 784 }
duke@1 785 }
duke@1 786
duke@1 787 odStackSupply.elems = savedOd; // optimization
duke@1 788 opStackSupply.elems = savedOp; // optimization
duke@1 789 return t;
duke@1 790 }
duke@1 791 //where
duke@1 792 /** Construct a binary or type test node.
duke@1 793 */
duke@1 794 private JCExpression makeOp(int pos,
duke@1 795 Token topOp,
duke@1 796 JCExpression od1,
duke@1 797 JCExpression od2)
duke@1 798 {
duke@1 799 if (topOp == INSTANCEOF) {
duke@1 800 return F.at(pos).TypeTest(od1, od2);
duke@1 801 } else {
duke@1 802 return F.at(pos).Binary(optag(topOp), od1, od2);
duke@1 803 }
duke@1 804 }
duke@1 805 /** If tree is a concatenation of string literals, replace it
duke@1 806 * by a single literal representing the concatenated string.
duke@1 807 */
duke@1 808 protected StringBuffer foldStrings(JCTree tree) {
duke@1 809 List<String> buf = List.nil();
duke@1 810 while (true) {
duke@1 811 if (tree.getTag() == JCTree.LITERAL) {
duke@1 812 JCLiteral lit = (JCLiteral) tree;
duke@1 813 if (lit.typetag == TypeTags.CLASS) {
duke@1 814 StringBuffer sbuf =
duke@1 815 new StringBuffer((String)lit.value);
duke@1 816 while (buf.nonEmpty()) {
duke@1 817 sbuf.append(buf.head);
duke@1 818 buf = buf.tail;
duke@1 819 }
duke@1 820 return sbuf;
duke@1 821 }
duke@1 822 } else if (tree.getTag() == JCTree.PLUS) {
duke@1 823 JCBinary op = (JCBinary)tree;
duke@1 824 if (op.rhs.getTag() == JCTree.LITERAL) {
duke@1 825 JCLiteral lit = (JCLiteral) op.rhs;
duke@1 826 if (lit.typetag == TypeTags.CLASS) {
duke@1 827 buf = buf.prepend((String) lit.value);
duke@1 828 tree = op.lhs;
duke@1 829 continue;
duke@1 830 }
duke@1 831 }
duke@1 832 }
duke@1 833 return null;
duke@1 834 }
duke@1 835 }
duke@1 836
duke@1 837 /** optimization: To save allocating a new operand/operator stack
duke@1 838 * for every binary operation, we use supplys.
duke@1 839 */
duke@1 840 ListBuffer<JCExpression[]> odStackSupply = new ListBuffer<JCExpression[]>();
duke@1 841 ListBuffer<Token[]> opStackSupply = new ListBuffer<Token[]>();
duke@1 842
duke@1 843 private JCExpression[] newOdStack() {
duke@1 844 if (odStackSupply.elems == odStackSupply.last)
duke@1 845 odStackSupply.append(new JCExpression[infixPrecedenceLevels + 1]);
duke@1 846 JCExpression[] odStack = odStackSupply.elems.head;
duke@1 847 odStackSupply.elems = odStackSupply.elems.tail;
duke@1 848 return odStack;
duke@1 849 }
duke@1 850
duke@1 851 private Token[] newOpStack() {
duke@1 852 if (opStackSupply.elems == opStackSupply.last)
duke@1 853 opStackSupply.append(new Token[infixPrecedenceLevels + 1]);
duke@1 854 Token[] opStack = opStackSupply.elems.head;
duke@1 855 opStackSupply.elems = opStackSupply.elems.tail;
duke@1 856 return opStack;
duke@1 857 }
duke@1 858
duke@1 859 /** Expression3 = PrefixOp Expression3
duke@1 860 * | "(" Expr | TypeNoParams ")" Expression3
duke@1 861 * | Primary {Selector} {PostfixOp}
duke@1 862 * Primary = "(" Expression ")"
duke@1 863 * | Literal
duke@1 864 * | [TypeArguments] THIS [Arguments]
duke@1 865 * | [TypeArguments] SUPER SuperSuffix
duke@1 866 * | NEW [TypeArguments] Creator
jjg@308 867 * | [Annotations] Ident { "." Ident }
jjg@308 868 * [ [Annotations] "[" ( "]" BracketsOpt "." CLASS | Expression "]" )
duke@1 869 * | Arguments
duke@1 870 * | "." ( CLASS | THIS | [TypeArguments] SUPER Arguments | NEW [TypeArguments] InnerCreator )
duke@1 871 * ]
duke@1 872 * | BasicType BracketsOpt "." CLASS
duke@1 873 * PrefixOp = "++" | "--" | "!" | "~" | "+" | "-"
duke@1 874 * PostfixOp = "++" | "--"
duke@1 875 * Type3 = Ident { "." Ident } [TypeArguments] {TypeSelector} BracketsOpt
duke@1 876 * | BasicType
duke@1 877 * TypeNoParams3 = Ident { "." Ident } BracketsOpt
duke@1 878 * Selector = "." [TypeArguments] Ident [Arguments]
duke@1 879 * | "." THIS
duke@1 880 * | "." [TypeArguments] SUPER SuperSuffix
duke@1 881 * | "." NEW [TypeArguments] InnerCreator
duke@1 882 * | "[" Expression "]"
duke@1 883 * TypeSelector = "." Ident [TypeArguments]
duke@1 884 * SuperSuffix = Arguments | "." Ident [Arguments]
duke@1 885 */
duke@1 886 protected JCExpression term3() {
duke@1 887 int pos = S.pos();
duke@1 888 JCExpression t;
duke@1 889 List<JCExpression> typeArgs = typeArgumentsOpt(EXPR);
duke@1 890 switch (S.token()) {
duke@1 891 case QUES:
duke@1 892 if ((mode & TYPE) != 0 && (mode & (TYPEARG|NOPARAMS)) == TYPEARG) {
duke@1 893 mode = TYPE;
duke@1 894 return typeArgument();
duke@1 895 } else
duke@1 896 return illegal();
duke@1 897 case PLUSPLUS: case SUBSUB: case BANG: case TILDE: case PLUS: case SUB:
duke@1 898 if (typeArgs == null && (mode & EXPR) != 0) {
duke@1 899 Token token = S.token();
duke@1 900 S.nextToken();
duke@1 901 mode = EXPR;
duke@1 902 if (token == SUB &&
duke@1 903 (S.token() == INTLITERAL || S.token() == LONGLITERAL) &&
duke@1 904 S.radix() == 10) {
duke@1 905 mode = EXPR;
duke@1 906 t = literal(names.hyphen);
duke@1 907 } else {
duke@1 908 t = term3();
duke@1 909 return F.at(pos).Unary(unoptag(token), t);
duke@1 910 }
duke@1 911 } else return illegal();
duke@1 912 break;
duke@1 913 case LPAREN:
duke@1 914 if (typeArgs == null && (mode & EXPR) != 0) {
duke@1 915 S.nextToken();
duke@1 916 mode = EXPR | TYPE | NOPARAMS;
duke@1 917 t = term3();
duke@1 918 if ((mode & TYPE) != 0 && S.token() == LT) {
duke@1 919 // Could be a cast to a parameterized type
duke@1 920 int op = JCTree.LT;
duke@1 921 int pos1 = S.pos();
duke@1 922 S.nextToken();
duke@1 923 mode &= (EXPR | TYPE);
duke@1 924 mode |= TYPEARG;
duke@1 925 JCExpression t1 = term3();
duke@1 926 if ((mode & TYPE) != 0 &&
duke@1 927 (S.token() == COMMA || S.token() == GT)) {
duke@1 928 mode = TYPE;
duke@1 929 ListBuffer<JCExpression> args = new ListBuffer<JCExpression>();
duke@1 930 args.append(t1);
duke@1 931 while (S.token() == COMMA) {
duke@1 932 S.nextToken();
duke@1 933 args.append(typeArgument());
duke@1 934 }
duke@1 935 accept(GT);
duke@1 936 t = F.at(pos1).TypeApply(t, args.toList());
duke@1 937 checkGenerics();
mcimadamore@185 938 while (S.token() == DOT) {
mcimadamore@185 939 S.nextToken();
mcimadamore@185 940 mode = TYPE;
mcimadamore@185 941 t = toP(F.at(S.pos()).Select(t, ident()));
mcimadamore@185 942 t = typeArgumentsOpt(t);
mcimadamore@185 943 }
mcimadamore@195 944 t = bracketsOpt(toP(t));
duke@1 945 } else if ((mode & EXPR) != 0) {
duke@1 946 mode = EXPR;
duke@1 947 t = F.at(pos1).Binary(op, t, term2Rest(t1, TreeInfo.shiftPrec));
duke@1 948 t = termRest(term1Rest(term2Rest(t, TreeInfo.orPrec)));
duke@1 949 } else {
duke@1 950 accept(GT);
duke@1 951 }
mcimadamore@185 952 }
mcimadamore@185 953 else {
duke@1 954 t = termRest(term1Rest(term2Rest(t, TreeInfo.orPrec)));
duke@1 955 }
duke@1 956 accept(RPAREN);
duke@1 957 lastmode = mode;
duke@1 958 mode = EXPR;
duke@1 959 if ((lastmode & EXPR) == 0) {
duke@1 960 JCExpression t1 = term3();
duke@1 961 return F.at(pos).TypeCast(t, t1);
duke@1 962 } else if ((lastmode & TYPE) != 0) {
duke@1 963 switch (S.token()) {
duke@1 964 /*case PLUSPLUS: case SUBSUB: */
duke@1 965 case BANG: case TILDE:
duke@1 966 case LPAREN: case THIS: case SUPER:
duke@1 967 case INTLITERAL: case LONGLITERAL: case FLOATLITERAL:
duke@1 968 case DOUBLELITERAL: case CHARLITERAL: case STRINGLITERAL:
duke@1 969 case TRUE: case FALSE: case NULL:
duke@1 970 case NEW: case IDENTIFIER: case ASSERT: case ENUM:
duke@1 971 case BYTE: case SHORT: case CHAR: case INT:
duke@1 972 case LONG: case FLOAT: case DOUBLE: case BOOLEAN: case VOID:
duke@1 973 JCExpression t1 = term3();
duke@1 974 return F.at(pos).TypeCast(t, t1);
duke@1 975 }
duke@1 976 }
duke@1 977 } else return illegal();
duke@1 978 t = toP(F.at(pos).Parens(t));
duke@1 979 break;
duke@1 980 case THIS:
duke@1 981 if ((mode & EXPR) != 0) {
duke@1 982 mode = EXPR;
duke@1 983 t = to(F.at(pos).Ident(names._this));
duke@1 984 S.nextToken();
duke@1 985 if (typeArgs == null)
duke@1 986 t = argumentsOpt(null, t);
duke@1 987 else
duke@1 988 t = arguments(typeArgs, t);
duke@1 989 typeArgs = null;
duke@1 990 } else return illegal();
duke@1 991 break;
duke@1 992 case SUPER:
duke@1 993 if ((mode & EXPR) != 0) {
duke@1 994 mode = EXPR;
duke@1 995 t = to(superSuffix(typeArgs, F.at(pos).Ident(names._super)));
duke@1 996 typeArgs = null;
duke@1 997 } else return illegal();
duke@1 998 break;
duke@1 999 case INTLITERAL: case LONGLITERAL: case FLOATLITERAL: case DOUBLELITERAL:
duke@1 1000 case CHARLITERAL: case STRINGLITERAL:
duke@1 1001 case TRUE: case FALSE: case NULL:
duke@1 1002 if (typeArgs == null && (mode & EXPR) != 0) {
duke@1 1003 mode = EXPR;
duke@1 1004 t = literal(names.empty);
duke@1 1005 } else return illegal();
duke@1 1006 break;
duke@1 1007 case NEW:
duke@1 1008 if (typeArgs != null) return illegal();
duke@1 1009 if ((mode & EXPR) != 0) {
duke@1 1010 mode = EXPR;
duke@1 1011 S.nextToken();
duke@1 1012 if (S.token() == LT) typeArgs = typeArguments();
duke@1 1013 t = creator(pos, typeArgs);
duke@1 1014 typeArgs = null;
duke@1 1015 } else return illegal();
duke@1 1016 break;
jjg@308 1017 case MONKEYS_AT:
jjg@308 1018
jjg@308 1019 // only annotated targetting class literals or cast types are valid
jjg@308 1020 List<JCTypeAnnotation> typeAnnos = typeAnnotationsOpt();
jjg@308 1021 if (typeAnnos.isEmpty()) {
jjg@308 1022 // else there would be no '@'
jjg@308 1023 throw new AssertionError("type annos is empty");
jjg@308 1024 }
jjg@308 1025
jjg@308 1026 JCExpression expr = term3();
jjg@308 1027
jjg@308 1028 // Type annotations: If term3 just parsed a non-type, expect a
jjg@308 1029 // class literal (and issue a syntax error if there is no class
jjg@308 1030 // literal). Otherwise, create a JCAnnotatedType.
jjg@308 1031 if ((mode & TYPE) == 0) {
jjg@308 1032 if (expr.getTag() != JCTree.SELECT)
jjg@308 1033 return illegal(typeAnnos.head.pos);
jjg@308 1034 JCFieldAccess sel = (JCFieldAccess)expr;
jjg@308 1035 if (sel.name != names._class)
jjg@308 1036 return illegal();
jjg@308 1037 else {
jjg@308 1038 sel.selected = F.AnnotatedType(typeAnnos, sel.selected);
jjg@308 1039 t = expr;
jjg@308 1040 }
jjg@308 1041 } else {
jjg@308 1042 // type annotation targeting a cast
jjg@308 1043 t = toP(F.at(S.pos()).AnnotatedType(typeAnnos, expr));
jjg@308 1044 }
jjg@308 1045 break;
duke@1 1046 case IDENTIFIER: case ASSERT: case ENUM:
duke@1 1047 if (typeArgs != null) return illegal();
duke@1 1048 t = toP(F.at(S.pos()).Ident(ident()));
duke@1 1049 loop: while (true) {
duke@1 1050 pos = S.pos();
jjg@308 1051 final List<JCTypeAnnotation> annos = typeAnnotationsOpt();
jjg@308 1052
jjg@308 1053 // need to report an error later if LBRACKET is for array
jjg@308 1054 // index access rather than array creation level
jjg@308 1055 if (!annos.isEmpty() && S.token() != LBRACKET && S.token() != ELLIPSIS)
jjg@308 1056 return illegal(annos.head.pos);
duke@1 1057 switch (S.token()) {
duke@1 1058 case LBRACKET:
duke@1 1059 S.nextToken();
jjg@308 1060
duke@1 1061 if (S.token() == RBRACKET) {
jjg@308 1062
duke@1 1063 S.nextToken();
jjg@308 1064
jjg@308 1065 t = bracketsOpt(t, annos);
duke@1 1066 t = toP(F.at(pos).TypeArray(t));
duke@1 1067 t = bracketsSuffix(t);
duke@1 1068 } else {
duke@1 1069 if ((mode & EXPR) != 0) {
duke@1 1070 mode = EXPR;
duke@1 1071 JCExpression t1 = term();
jjg@308 1072 if (!annos.isEmpty()) t = illegal(annos.head.pos);
duke@1 1073 t = to(F.at(pos).Indexed(t, t1));
duke@1 1074 }
duke@1 1075 accept(RBRACKET);
duke@1 1076 }
duke@1 1077 break loop;
duke@1 1078 case LPAREN:
duke@1 1079 if ((mode & EXPR) != 0) {
duke@1 1080 mode = EXPR;
duke@1 1081 t = arguments(typeArgs, t);
duke@1 1082 typeArgs = null;
duke@1 1083 }
duke@1 1084 break loop;
duke@1 1085 case DOT:
duke@1 1086 S.nextToken();
mcimadamore@26 1087 int oldmode = mode;
mcimadamore@26 1088 mode &= ~NOPARAMS;
duke@1 1089 typeArgs = typeArgumentsOpt(EXPR);
mcimadamore@26 1090 mode = oldmode;
duke@1 1091 if ((mode & EXPR) != 0) {
duke@1 1092 switch (S.token()) {
duke@1 1093 case CLASS:
duke@1 1094 if (typeArgs != null) return illegal();
duke@1 1095 mode = EXPR;
duke@1 1096 t = to(F.at(pos).Select(t, names._class));
duke@1 1097 S.nextToken();
duke@1 1098 break loop;
duke@1 1099 case THIS:
duke@1 1100 if (typeArgs != null) return illegal();
duke@1 1101 mode = EXPR;
duke@1 1102 t = to(F.at(pos).Select(t, names._this));
duke@1 1103 S.nextToken();
duke@1 1104 break loop;
duke@1 1105 case SUPER:
duke@1 1106 mode = EXPR;
duke@1 1107 t = to(F.at(pos).Select(t, names._super));
duke@1 1108 t = superSuffix(typeArgs, t);
duke@1 1109 typeArgs = null;
duke@1 1110 break loop;
duke@1 1111 case NEW:
duke@1 1112 if (typeArgs != null) return illegal();
duke@1 1113 mode = EXPR;
duke@1 1114 int pos1 = S.pos();
duke@1 1115 S.nextToken();
duke@1 1116 if (S.token() == LT) typeArgs = typeArguments();
duke@1 1117 t = innerCreator(pos1, typeArgs, t);
duke@1 1118 typeArgs = null;
duke@1 1119 break loop;
duke@1 1120 }
duke@1 1121 }
duke@1 1122 // typeArgs saved for next loop iteration.
duke@1 1123 t = toP(F.at(pos).Select(t, ident()));
duke@1 1124 break;
jjg@308 1125 case ELLIPSIS:
jjg@308 1126 assert this.permitTypeAnnotationsPushBack;
jjg@308 1127 typeAnnotationsPushedBack = annos;
jjg@308 1128 break loop;
duke@1 1129 default:
duke@1 1130 break loop;
duke@1 1131 }
duke@1 1132 }
duke@1 1133 if (typeArgs != null) illegal();
duke@1 1134 t = typeArgumentsOpt(t);
duke@1 1135 break;
duke@1 1136 case BYTE: case SHORT: case CHAR: case INT: case LONG: case FLOAT:
duke@1 1137 case DOUBLE: case BOOLEAN:
duke@1 1138 if (typeArgs != null) illegal();
duke@1 1139 t = bracketsSuffix(bracketsOpt(basicType()));
duke@1 1140 break;
duke@1 1141 case VOID:
duke@1 1142 if (typeArgs != null) illegal();
duke@1 1143 if ((mode & EXPR) != 0) {
duke@1 1144 S.nextToken();
duke@1 1145 if (S.token() == DOT) {
duke@1 1146 JCPrimitiveTypeTree ti = toP(F.at(pos).TypeIdent(TypeTags.VOID));
duke@1 1147 t = bracketsSuffix(ti);
duke@1 1148 } else {
duke@1 1149 return illegal(pos);
duke@1 1150 }
duke@1 1151 } else {
jrose@267 1152 // Support the corner case of myMethodHandle.<void>invoke() by passing
jrose@267 1153 // a void type (like other primitive types) to the next phase.
jrose@267 1154 // The error will be reported in Attr.attribTypes or Attr.visitApply.
jrose@267 1155 JCPrimitiveTypeTree ti = to(F.at(pos).TypeIdent(TypeTags.VOID));
jrose@267 1156 S.nextToken();
jrose@267 1157 return ti;
jrose@267 1158 //return illegal();
duke@1 1159 }
duke@1 1160 break;
duke@1 1161 default:
duke@1 1162 return illegal();
duke@1 1163 }
duke@1 1164 if (typeArgs != null) illegal();
duke@1 1165 while (true) {
duke@1 1166 int pos1 = S.pos();
jjg@308 1167
jjg@308 1168 final List<JCTypeAnnotation> annos = typeAnnotationsOpt();
jjg@308 1169
duke@1 1170 if (S.token() == LBRACKET) {
duke@1 1171 S.nextToken();
jjg@308 1172
duke@1 1173 if ((mode & TYPE) != 0) {
duke@1 1174 int oldmode = mode;
duke@1 1175 mode = TYPE;
duke@1 1176 if (S.token() == RBRACKET) {
duke@1 1177 S.nextToken();
jjg@308 1178 t = bracketsOpt(t, annos);
duke@1 1179 t = toP(F.at(pos1).TypeArray(t));
duke@1 1180 return t;
duke@1 1181 }
duke@1 1182 mode = oldmode;
duke@1 1183 }
duke@1 1184 if ((mode & EXPR) != 0) {
duke@1 1185 mode = EXPR;
duke@1 1186 JCExpression t1 = term();
duke@1 1187 t = to(F.at(pos1).Indexed(t, t1));
duke@1 1188 }
duke@1 1189 accept(RBRACKET);
duke@1 1190 } else if (S.token() == DOT) {
duke@1 1191 S.nextToken();
duke@1 1192 typeArgs = typeArgumentsOpt(EXPR);
duke@1 1193 if (S.token() == SUPER && (mode & EXPR) != 0) {
duke@1 1194 mode = EXPR;
duke@1 1195 t = to(F.at(pos1).Select(t, names._super));
duke@1 1196 S.nextToken();
duke@1 1197 t = arguments(typeArgs, t);
duke@1 1198 typeArgs = null;
duke@1 1199 } else if (S.token() == NEW && (mode & EXPR) != 0) {
duke@1 1200 if (typeArgs != null) return illegal();
duke@1 1201 mode = EXPR;
duke@1 1202 int pos2 = S.pos();
duke@1 1203 S.nextToken();
duke@1 1204 if (S.token() == LT) typeArgs = typeArguments();
duke@1 1205 t = innerCreator(pos2, typeArgs, t);
duke@1 1206 typeArgs = null;
duke@1 1207 } else {
duke@1 1208 t = toP(F.at(pos1).Select(t, ident()));
duke@1 1209 t = argumentsOpt(typeArgs, typeArgumentsOpt(t));
duke@1 1210 typeArgs = null;
duke@1 1211 }
duke@1 1212 } else {
jjg@308 1213 if (!annos.isEmpty()) {
jjg@308 1214 if (permitTypeAnnotationsPushBack)
jjg@308 1215 typeAnnotationsPushedBack = annos;
jjg@308 1216 else
jjg@308 1217 return illegal(annos.head.pos);
jjg@308 1218 }
duke@1 1219 break;
duke@1 1220 }
duke@1 1221 }
duke@1 1222 while ((S.token() == PLUSPLUS || S.token() == SUBSUB) && (mode & EXPR) != 0) {
duke@1 1223 mode = EXPR;
duke@1 1224 t = to(F.at(S.pos()).Unary(
duke@1 1225 S.token() == PLUSPLUS ? JCTree.POSTINC : JCTree.POSTDEC, t));
duke@1 1226 S.nextToken();
duke@1 1227 }
jjg@308 1228
duke@1 1229 return toP(t);
duke@1 1230 }
duke@1 1231
duke@1 1232 /** SuperSuffix = Arguments | "." [TypeArguments] Ident [Arguments]
duke@1 1233 */
duke@1 1234 JCExpression superSuffix(List<JCExpression> typeArgs, JCExpression t) {
duke@1 1235 S.nextToken();
duke@1 1236 if (S.token() == LPAREN || typeArgs != null) {
duke@1 1237 t = arguments(typeArgs, t);
duke@1 1238 } else {
duke@1 1239 int pos = S.pos();
duke@1 1240 accept(DOT);
duke@1 1241 typeArgs = (S.token() == LT) ? typeArguments() : null;
duke@1 1242 t = toP(F.at(pos).Select(t, ident()));
duke@1 1243 t = argumentsOpt(typeArgs, t);
duke@1 1244 }
duke@1 1245 return t;
duke@1 1246 }
duke@1 1247
duke@1 1248 /** BasicType = BYTE | SHORT | CHAR | INT | LONG | FLOAT | DOUBLE | BOOLEAN
duke@1 1249 */
duke@1 1250 JCPrimitiveTypeTree basicType() {
duke@1 1251 JCPrimitiveTypeTree t = to(F.at(S.pos()).TypeIdent(typetag(S.token())));
duke@1 1252 S.nextToken();
duke@1 1253 return t;
duke@1 1254 }
duke@1 1255
duke@1 1256 /** ArgumentsOpt = [ Arguments ]
duke@1 1257 */
duke@1 1258 JCExpression argumentsOpt(List<JCExpression> typeArgs, JCExpression t) {
duke@1 1259 if ((mode & EXPR) != 0 && S.token() == LPAREN || typeArgs != null) {
duke@1 1260 mode = EXPR;
duke@1 1261 return arguments(typeArgs, t);
duke@1 1262 } else {
duke@1 1263 return t;
duke@1 1264 }
duke@1 1265 }
duke@1 1266
duke@1 1267 /** Arguments = "(" [Expression { COMMA Expression }] ")"
duke@1 1268 */
duke@1 1269 List<JCExpression> arguments() {
duke@1 1270 ListBuffer<JCExpression> args = lb();
duke@1 1271 if (S.token() == LPAREN) {
duke@1 1272 S.nextToken();
duke@1 1273 if (S.token() != RPAREN) {
jjg@111 1274 args.append(parseExpression());
duke@1 1275 while (S.token() == COMMA) {
duke@1 1276 S.nextToken();
jjg@111 1277 args.append(parseExpression());
duke@1 1278 }
duke@1 1279 }
duke@1 1280 accept(RPAREN);
duke@1 1281 } else {
mcimadamore@80 1282 syntaxError(S.pos(), "expected", LPAREN);
duke@1 1283 }
duke@1 1284 return args.toList();
duke@1 1285 }
duke@1 1286
duke@1 1287 JCMethodInvocation arguments(List<JCExpression> typeArgs, JCExpression t) {
duke@1 1288 int pos = S.pos();
duke@1 1289 List<JCExpression> args = arguments();
duke@1 1290 return toP(F.at(pos).Apply(typeArgs, t, args));
duke@1 1291 }
duke@1 1292
duke@1 1293 /** TypeArgumentsOpt = [ TypeArguments ]
duke@1 1294 */
duke@1 1295 JCExpression typeArgumentsOpt(JCExpression t) {
duke@1 1296 if (S.token() == LT &&
duke@1 1297 (mode & TYPE) != 0 &&
duke@1 1298 (mode & NOPARAMS) == 0) {
duke@1 1299 mode = TYPE;
duke@1 1300 checkGenerics();
duke@1 1301 return typeArguments(t);
duke@1 1302 } else {
duke@1 1303 return t;
duke@1 1304 }
duke@1 1305 }
duke@1 1306 List<JCExpression> typeArgumentsOpt() {
duke@1 1307 return typeArgumentsOpt(TYPE);
duke@1 1308 }
duke@1 1309
duke@1 1310 List<JCExpression> typeArgumentsOpt(int useMode) {
duke@1 1311 if (S.token() == LT) {
duke@1 1312 checkGenerics();
duke@1 1313 if ((mode & useMode) == 0 ||
duke@1 1314 (mode & NOPARAMS) != 0) {
duke@1 1315 illegal();
duke@1 1316 }
duke@1 1317 mode = useMode;
duke@1 1318 return typeArguments();
duke@1 1319 }
duke@1 1320 return null;
duke@1 1321 }
duke@1 1322
duke@1 1323 /** TypeArguments = "<" TypeArgument {"," TypeArgument} ">"
duke@1 1324 */
duke@1 1325 List<JCExpression> typeArguments() {
duke@1 1326 ListBuffer<JCExpression> args = lb();
duke@1 1327 if (S.token() == LT) {
duke@1 1328 S.nextToken();
jjg@111 1329 args.append(((mode & EXPR) == 0) ? typeArgument() : parseType());
duke@1 1330 while (S.token() == COMMA) {
duke@1 1331 S.nextToken();
jjg@111 1332 args.append(((mode & EXPR) == 0) ? typeArgument() : parseType());
duke@1 1333 }
duke@1 1334 switch (S.token()) {
duke@1 1335 case GTGTGTEQ:
duke@1 1336 S.token(GTGTEQ);
duke@1 1337 break;
duke@1 1338 case GTGTEQ:
duke@1 1339 S.token(GTEQ);
duke@1 1340 break;
duke@1 1341 case GTEQ:
duke@1 1342 S.token(EQ);
duke@1 1343 break;
duke@1 1344 case GTGTGT:
duke@1 1345 S.token(GTGT);
duke@1 1346 break;
duke@1 1347 case GTGT:
duke@1 1348 S.token(GT);
duke@1 1349 break;
duke@1 1350 default:
duke@1 1351 accept(GT);
duke@1 1352 break;
duke@1 1353 }
duke@1 1354 } else {
mcimadamore@80 1355 syntaxError(S.pos(), "expected", LT);
duke@1 1356 }
duke@1 1357 return args.toList();
duke@1 1358 }
duke@1 1359
duke@1 1360 /** TypeArgument = Type
jjg@308 1361 * | [Annotations] "?"
jjg@308 1362 * | [Annotations] "?" EXTENDS Type {"&" Type}
jjg@308 1363 * | [Annotations] "?" SUPER Type
duke@1 1364 */
duke@1 1365 JCExpression typeArgument() {
jjg@308 1366 List<JCTypeAnnotation> annotations = typeAnnotationsOpt();
jjg@308 1367 if (S.token() != QUES) return parseType(annotations);
duke@1 1368 int pos = S.pos();
duke@1 1369 S.nextToken();
jjg@308 1370 JCExpression result;
duke@1 1371 if (S.token() == EXTENDS) {
duke@1 1372 TypeBoundKind t = to(F.at(S.pos()).TypeBoundKind(BoundKind.EXTENDS));
duke@1 1373 S.nextToken();
jjg@308 1374 result = F.at(pos).Wildcard(t, parseType());
duke@1 1375 } else if (S.token() == SUPER) {
duke@1 1376 TypeBoundKind t = to(F.at(S.pos()).TypeBoundKind(BoundKind.SUPER));
duke@1 1377 S.nextToken();
jjg@308 1378 result = F.at(pos).Wildcard(t, parseType());
duke@1 1379 } else if (S.token() == IDENTIFIER) {
duke@1 1380 //error recovery
duke@1 1381 reportSyntaxError(S.prevEndPos(), "expected3",
mcimadamore@80 1382 GT, EXTENDS, SUPER);
duke@1 1383 TypeBoundKind t = F.at(Position.NOPOS).TypeBoundKind(BoundKind.UNBOUND);
duke@1 1384 JCExpression wc = toP(F.at(pos).Wildcard(t, null));
duke@1 1385 JCIdent id = toP(F.at(S.pos()).Ident(ident()));
jjg@308 1386 result = F.at(pos).Erroneous(List.<JCTree>of(wc, id));
duke@1 1387 } else {
duke@1 1388 TypeBoundKind t = F.at(Position.NOPOS).TypeBoundKind(BoundKind.UNBOUND);
jjg@308 1389 result = toP(F.at(pos).Wildcard(t, null));
duke@1 1390 }
jjg@308 1391 if (!annotations.isEmpty())
jjg@308 1392 result = toP(F.at(annotations.head.pos).AnnotatedType(annotations,result));
jjg@308 1393 return result;
duke@1 1394 }
duke@1 1395
duke@1 1396 JCTypeApply typeArguments(JCExpression t) {
duke@1 1397 int pos = S.pos();
duke@1 1398 List<JCExpression> args = typeArguments();
duke@1 1399 return toP(F.at(pos).TypeApply(t, args));
duke@1 1400 }
duke@1 1401
jjg@308 1402 /**
jjg@308 1403 * BracketsOpt = { [Annotations] "[" "]" }
jjg@308 1404 *
jjg@308 1405 * <p>
jjg@308 1406 *
jjg@308 1407 * <code>annotations</code> is the list of annotations targeting
jjg@308 1408 * the expression <code>t</code>.
duke@1 1409 */
jjg@308 1410 private JCExpression bracketsOpt(JCExpression t,
jjg@308 1411 List<JCTypeAnnotation> annotations) {
jjg@308 1412 List<JCTypeAnnotation> nextLevelAnnotations = typeAnnotationsOpt();
jjg@308 1413
duke@1 1414 if (S.token() == LBRACKET) {
duke@1 1415 int pos = S.pos();
duke@1 1416 S.nextToken();
jjg@308 1417
jjg@308 1418 JCExpression orig = t;
jjg@308 1419 t = bracketsOptCont(t, pos, nextLevelAnnotations);
jjg@308 1420 } else if (!nextLevelAnnotations.isEmpty()) {
jjg@308 1421 if (permitTypeAnnotationsPushBack) {
jjg@308 1422 this.typeAnnotationsPushedBack = nextLevelAnnotations;
jjg@308 1423 } else
jjg@308 1424 return illegal(nextLevelAnnotations.head.pos);
duke@1 1425 }
jjg@308 1426
jjg@308 1427 int apos = S.pos();
jjg@308 1428 if (!annotations.isEmpty())
jjg@308 1429 t = F.at(apos).AnnotatedType(annotations, t);
duke@1 1430 return t;
duke@1 1431 }
duke@1 1432
jjg@308 1433 /** BracketsOpt = {"[" TypeAnnotations "]"}
jjg@308 1434 */
jjg@308 1435 private JCExpression bracketsOpt(JCExpression t) {
jjg@308 1436 return bracketsOpt(t, List.<JCTypeAnnotation>nil());
jjg@308 1437 }
jjg@308 1438
jjg@308 1439 private JCArrayTypeTree bracketsOptCont(JCExpression t, int pos,
jjg@308 1440 List<JCTypeAnnotation> annotations) {
duke@1 1441 accept(RBRACKET);
jjg@308 1442 t = bracketsOpt(t, annotations);
duke@1 1443 return toP(F.at(pos).TypeArray(t));
duke@1 1444 }
duke@1 1445
duke@1 1446 /** BracketsSuffixExpr = "." CLASS
duke@1 1447 * BracketsSuffixType =
duke@1 1448 */
duke@1 1449 JCExpression bracketsSuffix(JCExpression t) {
duke@1 1450 if ((mode & EXPR) != 0 && S.token() == DOT) {
duke@1 1451 mode = EXPR;
duke@1 1452 int pos = S.pos();
duke@1 1453 S.nextToken();
duke@1 1454 accept(CLASS);
duke@1 1455 if (S.pos() == errorEndPos) {
duke@1 1456 // error recovery
duke@1 1457 Name name = null;
duke@1 1458 if (S.token() == IDENTIFIER) {
duke@1 1459 name = S.name();
duke@1 1460 S.nextToken();
duke@1 1461 } else {
duke@1 1462 name = names.error;
duke@1 1463 }
duke@1 1464 t = F.at(pos).Erroneous(List.<JCTree>of(toP(F.at(pos).Select(t, name))));
duke@1 1465 } else {
duke@1 1466 t = toP(F.at(pos).Select(t, names._class));
duke@1 1467 }
duke@1 1468 } else if ((mode & TYPE) != 0) {
duke@1 1469 mode = TYPE;
duke@1 1470 } else {
duke@1 1471 syntaxError(S.pos(), "dot.class.expected");
duke@1 1472 }
duke@1 1473 return t;
duke@1 1474 }
duke@1 1475
jjg@308 1476 /** Creator = [Annotations] Qualident [TypeArguments] ( ArrayCreatorRest | ClassCreatorRest )
duke@1 1477 */
duke@1 1478 JCExpression creator(int newpos, List<JCExpression> typeArgs) {
jjg@308 1479
jjg@308 1480 List<JCTypeAnnotation> newAnnotations = typeAnnotationsOpt();
jjg@308 1481
duke@1 1482 switch (S.token()) {
duke@1 1483 case BYTE: case SHORT: case CHAR: case INT: case LONG: case FLOAT:
duke@1 1484 case DOUBLE: case BOOLEAN:
jjg@308 1485 if (typeArgs == null) {
jjg@308 1486 if (newAnnotations.isEmpty())
jjg@308 1487 return arrayCreatorRest(newpos, basicType());
jjg@308 1488 else
jjg@308 1489 return arrayCreatorRest(newpos, F.AnnotatedType(newAnnotations, basicType()));
jjg@308 1490 }
duke@1 1491 break;
duke@1 1492 default:
duke@1 1493 }
duke@1 1494 JCExpression t = qualident();
jjg@308 1495 // handle type annotations for non primitive arrays
jjg@308 1496 if (!newAnnotations.isEmpty())
jjg@308 1497 t = F.AnnotatedType(newAnnotations, t);
jjg@308 1498
duke@1 1499 int oldmode = mode;
duke@1 1500 mode = TYPE;
duke@1 1501 if (S.token() == LT) {
duke@1 1502 checkGenerics();
duke@1 1503 t = typeArguments(t);
duke@1 1504 }
duke@1 1505 while (S.token() == DOT) {
duke@1 1506 int pos = S.pos();
duke@1 1507 S.nextToken();
duke@1 1508 t = toP(F.at(pos).Select(t, ident()));
duke@1 1509 if (S.token() == LT) {
duke@1 1510 checkGenerics();
duke@1 1511 t = typeArguments(t);
duke@1 1512 }
duke@1 1513 }
duke@1 1514 mode = oldmode;
jjg@308 1515 if (S.token() == LBRACKET || S.token() == MONKEYS_AT) {
duke@1 1516 JCExpression e = arrayCreatorRest(newpos, t);
duke@1 1517 if (typeArgs != null) {
duke@1 1518 int pos = newpos;
duke@1 1519 if (!typeArgs.isEmpty() && typeArgs.head.pos != Position.NOPOS) {
duke@1 1520 // note: this should always happen but we should
duke@1 1521 // not rely on this as the parser is continuously
duke@1 1522 // modified to improve error recovery.
duke@1 1523 pos = typeArgs.head.pos;
duke@1 1524 }
duke@1 1525 setErrorEndPos(S.prevEndPos());
duke@1 1526 reportSyntaxError(pos, "cannot.create.array.with.type.arguments");
duke@1 1527 return toP(F.at(newpos).Erroneous(typeArgs.prepend(e)));
duke@1 1528 }
duke@1 1529 return e;
duke@1 1530 } else if (S.token() == LPAREN) {
jjg@308 1531 JCNewClass newClass = classCreatorRest(newpos, null, typeArgs, t);
jjg@308 1532 if (newClass.def != null) {
jjg@308 1533 assert newClass.def.mods.annotations.isEmpty();
jjg@308 1534 newClass.def.mods.annotations = List.convert(JCAnnotation.class, newAnnotations);
jjg@308 1535 }
jjg@308 1536 return newClass;
duke@1 1537 } else {
duke@1 1538 reportSyntaxError(S.pos(), "expected2",
mcimadamore@80 1539 LPAREN, LBRACKET);
duke@1 1540 t = toP(F.at(newpos).NewClass(null, typeArgs, t, List.<JCExpression>nil(), null));
duke@1 1541 return toP(F.at(newpos).Erroneous(List.<JCTree>of(t)));
duke@1 1542 }
duke@1 1543 }
duke@1 1544
duke@1 1545 /** InnerCreator = Ident [TypeArguments] ClassCreatorRest
duke@1 1546 */
duke@1 1547 JCExpression innerCreator(int newpos, List<JCExpression> typeArgs, JCExpression encl) {
duke@1 1548 JCExpression t = toP(F.at(S.pos()).Ident(ident()));
duke@1 1549 if (S.token() == LT) {
duke@1 1550 checkGenerics();
duke@1 1551 t = typeArguments(t);
duke@1 1552 }
duke@1 1553 return classCreatorRest(newpos, encl, typeArgs, t);
duke@1 1554 }
duke@1 1555
jjg@308 1556 /** ArrayCreatorRest = [Annotations] "[" ( "]" BracketsOpt ArrayInitializer
jjg@308 1557 * | Expression "]" {[Annotations] "[" Expression "]"} BracketsOpt )
duke@1 1558 */
duke@1 1559 JCExpression arrayCreatorRest(int newpos, JCExpression elemtype) {
jjg@308 1560
jjg@308 1561 List<JCTypeAnnotation> topAnnos = List.nil();
jjg@308 1562 if (elemtype.getTag() == JCTree.ANNOTATED_TYPE) {
jjg@308 1563 JCAnnotatedType atype = (JCAnnotatedType) elemtype;
jjg@308 1564 topAnnos = atype.annotations;
jjg@308 1565 elemtype = atype.underlyingType;
jjg@308 1566 }
jjg@308 1567
jjg@308 1568 List<JCTypeAnnotation> annos = typeAnnotationsOpt();
jjg@308 1569
duke@1 1570 accept(LBRACKET);
jjg@308 1571
duke@1 1572 if (S.token() == RBRACKET) {
duke@1 1573 accept(RBRACKET);
jjg@308 1574
jjg@308 1575 elemtype = bracketsOpt(elemtype, annos);
jjg@308 1576
duke@1 1577 if (S.token() == LBRACE) {
jjg@308 1578 JCNewArray na = (JCNewArray)arrayInitializer(newpos, elemtype);
jjg@308 1579
jjg@308 1580 na.annotations = topAnnos;
jjg@308 1581
jjg@308 1582 return na;
duke@1 1583 } else {
duke@1 1584 return syntaxError(S.pos(), "array.dimension.missing");
duke@1 1585 }
duke@1 1586 } else {
duke@1 1587 ListBuffer<JCExpression> dims = new ListBuffer<JCExpression>();
jjg@308 1588
jjg@308 1589 // maintain array dimension type annotations
jjg@308 1590 ListBuffer<List<JCTypeAnnotation>> dimAnnotations = ListBuffer.lb();
jjg@308 1591 dimAnnotations.append(annos);
jjg@308 1592
jjg@111 1593 dims.append(parseExpression());
duke@1 1594 accept(RBRACKET);
jjg@308 1595 while (S.token() == LBRACKET
jjg@308 1596 || (S.token() == MONKEYS_AT)) {
jjg@308 1597 List<JCTypeAnnotation> maybeDimAnnos = typeAnnotationsOpt();
duke@1 1598 int pos = S.pos();
duke@1 1599 S.nextToken();
duke@1 1600 if (S.token() == RBRACKET) {
jjg@308 1601 elemtype = bracketsOptCont(elemtype, pos, maybeDimAnnos);
duke@1 1602 } else {
jjg@308 1603 if (S.token() == RBRACKET) { // no dimension
jjg@308 1604 elemtype = bracketsOptCont(elemtype, pos, maybeDimAnnos);
jjg@308 1605 } else {
jjg@308 1606 dimAnnotations.append(maybeDimAnnos);
jjg@308 1607 dims.append(parseExpression());
jjg@308 1608 accept(RBRACKET);
jjg@308 1609 }
duke@1 1610 }
duke@1 1611 }
jjg@308 1612
jjg@308 1613 JCNewArray na = toP(F.at(newpos).NewArray(elemtype, dims.toList(), null));
jjg@308 1614 na.annotations = topAnnos;
jjg@308 1615 na.dimAnnotations = dimAnnotations.toList();
jjg@308 1616 return na;
duke@1 1617 }
duke@1 1618 }
duke@1 1619
duke@1 1620 /** ClassCreatorRest = Arguments [ClassBody]
duke@1 1621 */
jjg@308 1622 JCNewClass classCreatorRest(int newpos,
duke@1 1623 JCExpression encl,
duke@1 1624 List<JCExpression> typeArgs,
duke@1 1625 JCExpression t)
duke@1 1626 {
duke@1 1627 List<JCExpression> args = arguments();
duke@1 1628 JCClassDecl body = null;
duke@1 1629 if (S.token() == LBRACE) {
duke@1 1630 int pos = S.pos();
duke@1 1631 List<JCTree> defs = classOrInterfaceBody(names.empty, false);
duke@1 1632 JCModifiers mods = F.at(Position.NOPOS).Modifiers(0);
duke@1 1633 body = toP(F.at(pos).AnonymousClassDef(mods, defs));
duke@1 1634 }
duke@1 1635 return toP(F.at(newpos).NewClass(encl, typeArgs, t, args, body));
duke@1 1636 }
duke@1 1637
duke@1 1638 /** ArrayInitializer = "{" [VariableInitializer {"," VariableInitializer}] [","] "}"
duke@1 1639 */
duke@1 1640 JCExpression arrayInitializer(int newpos, JCExpression t) {
duke@1 1641 accept(LBRACE);
duke@1 1642 ListBuffer<JCExpression> elems = new ListBuffer<JCExpression>();
duke@1 1643 if (S.token() == COMMA) {
duke@1 1644 S.nextToken();
duke@1 1645 } else if (S.token() != RBRACE) {
duke@1 1646 elems.append(variableInitializer());
duke@1 1647 while (S.token() == COMMA) {
duke@1 1648 S.nextToken();
duke@1 1649 if (S.token() == RBRACE) break;
duke@1 1650 elems.append(variableInitializer());
duke@1 1651 }
duke@1 1652 }
duke@1 1653 accept(RBRACE);
duke@1 1654 return toP(F.at(newpos).NewArray(t, List.<JCExpression>nil(), elems.toList()));
duke@1 1655 }
duke@1 1656
duke@1 1657 /** VariableInitializer = ArrayInitializer | Expression
duke@1 1658 */
duke@1 1659 public JCExpression variableInitializer() {
jjg@111 1660 return S.token() == LBRACE ? arrayInitializer(S.pos(), null) : parseExpression();
duke@1 1661 }
duke@1 1662
duke@1 1663 /** ParExpression = "(" Expression ")"
duke@1 1664 */
duke@1 1665 JCExpression parExpression() {
duke@1 1666 accept(LPAREN);
jjg@111 1667 JCExpression t = parseExpression();
duke@1 1668 accept(RPAREN);
duke@1 1669 return t;
duke@1 1670 }
duke@1 1671
duke@1 1672 /** Block = "{" BlockStatements "}"
duke@1 1673 */
duke@1 1674 JCBlock block(int pos, long flags) {
duke@1 1675 accept(LBRACE);
duke@1 1676 List<JCStatement> stats = blockStatements();
duke@1 1677 JCBlock t = F.at(pos).Block(flags, stats);
duke@1 1678 while (S.token() == CASE || S.token() == DEFAULT) {
mcimadamore@80 1679 syntaxError("orphaned", S.token());
duke@1 1680 switchBlockStatementGroups();
duke@1 1681 }
duke@1 1682 // the Block node has a field "endpos" for first char of last token, which is
duke@1 1683 // usually but not necessarily the last char of the last token.
duke@1 1684 t.endpos = S.pos();
duke@1 1685 accept(RBRACE);
duke@1 1686 return toP(t);
duke@1 1687 }
duke@1 1688
duke@1 1689 public JCBlock block() {
duke@1 1690 return block(S.pos(), 0);
duke@1 1691 }
duke@1 1692
duke@1 1693 /** BlockStatements = { BlockStatement }
duke@1 1694 * BlockStatement = LocalVariableDeclarationStatement
duke@1 1695 * | ClassOrInterfaceOrEnumDeclaration
duke@1 1696 * | [Ident ":"] Statement
duke@1 1697 * LocalVariableDeclarationStatement
duke@1 1698 * = { FINAL | '@' Annotation } Type VariableDeclarators ";"
duke@1 1699 */
duke@1 1700 @SuppressWarnings("fallthrough")
duke@1 1701 List<JCStatement> blockStatements() {
duke@1 1702 //todo: skip to anchor on error(?)
duke@1 1703 int lastErrPos = -1;
duke@1 1704 ListBuffer<JCStatement> stats = new ListBuffer<JCStatement>();
duke@1 1705 while (true) {
duke@1 1706 int pos = S.pos();
duke@1 1707 switch (S.token()) {
duke@1 1708 case RBRACE: case CASE: case DEFAULT: case EOF:
duke@1 1709 return stats.toList();
duke@1 1710 case LBRACE: case IF: case FOR: case WHILE: case DO: case TRY:
duke@1 1711 case SWITCH: case SYNCHRONIZED: case RETURN: case THROW: case BREAK:
duke@1 1712 case CONTINUE: case SEMI: case ELSE: case FINALLY: case CATCH:
jjg@111 1713 stats.append(parseStatement());
duke@1 1714 break;
duke@1 1715 case MONKEYS_AT:
duke@1 1716 case FINAL: {
duke@1 1717 String dc = S.docComment();
duke@1 1718 JCModifiers mods = modifiersOpt();
duke@1 1719 if (S.token() == INTERFACE ||
duke@1 1720 S.token() == CLASS ||
duke@1 1721 allowEnums && S.token() == ENUM) {
duke@1 1722 stats.append(classOrInterfaceOrEnumDeclaration(mods, dc));
duke@1 1723 } else {
jjg@111 1724 JCExpression t = parseType();
duke@1 1725 stats.appendList(variableDeclarators(mods, t,
duke@1 1726 new ListBuffer<JCStatement>()));
duke@1 1727 // A "LocalVariableDeclarationStatement" subsumes the terminating semicolon
duke@1 1728 storeEnd(stats.elems.last(), S.endPos());
duke@1 1729 accept(SEMI);
duke@1 1730 }
duke@1 1731 break;
duke@1 1732 }
duke@1 1733 case ABSTRACT: case STRICTFP: {
duke@1 1734 String dc = S.docComment();
duke@1 1735 JCModifiers mods = modifiersOpt();
duke@1 1736 stats.append(classOrInterfaceOrEnumDeclaration(mods, dc));
duke@1 1737 break;
duke@1 1738 }
duke@1 1739 case INTERFACE:
duke@1 1740 case CLASS:
duke@1 1741 stats.append(classOrInterfaceOrEnumDeclaration(modifiersOpt(),
duke@1 1742 S.docComment()));
duke@1 1743 break;
duke@1 1744 case ENUM:
duke@1 1745 case ASSERT:
duke@1 1746 if (allowEnums && S.token() == ENUM) {
duke@1 1747 log.error(S.pos(), "local.enum");
duke@1 1748 stats.
duke@1 1749 append(classOrInterfaceOrEnumDeclaration(modifiersOpt(),
duke@1 1750 S.docComment()));
duke@1 1751 break;
duke@1 1752 } else if (allowAsserts && S.token() == ASSERT) {
jjg@111 1753 stats.append(parseStatement());
duke@1 1754 break;
duke@1 1755 }
duke@1 1756 /* fall through to default */
duke@1 1757 default:
duke@1 1758 Name name = S.name();
duke@1 1759 JCExpression t = term(EXPR | TYPE);
duke@1 1760 if (S.token() == COLON && t.getTag() == JCTree.IDENT) {
duke@1 1761 S.nextToken();
jjg@111 1762 JCStatement stat = parseStatement();
duke@1 1763 stats.append(F.at(pos).Labelled(name, stat));
duke@1 1764 } else if ((lastmode & TYPE) != 0 &&
duke@1 1765 (S.token() == IDENTIFIER ||
duke@1 1766 S.token() == ASSERT ||
duke@1 1767 S.token() == ENUM)) {
duke@1 1768 pos = S.pos();
duke@1 1769 JCModifiers mods = F.at(Position.NOPOS).Modifiers(0);
duke@1 1770 F.at(pos);
duke@1 1771 stats.appendList(variableDeclarators(mods, t,
duke@1 1772 new ListBuffer<JCStatement>()));
duke@1 1773 // A "LocalVariableDeclarationStatement" subsumes the terminating semicolon
duke@1 1774 storeEnd(stats.elems.last(), S.endPos());
duke@1 1775 accept(SEMI);
duke@1 1776 } else {
duke@1 1777 // This Exec is an "ExpressionStatement"; it subsumes the terminating semicolon
duke@1 1778 stats.append(to(F.at(pos).Exec(checkExprStat(t))));
duke@1 1779 accept(SEMI);
duke@1 1780 }
duke@1 1781 }
duke@1 1782
duke@1 1783 // error recovery
duke@1 1784 if (S.pos() == lastErrPos)
duke@1 1785 return stats.toList();
duke@1 1786 if (S.pos() <= errorEndPos) {
duke@1 1787 skip(false, true, true, true);
duke@1 1788 lastErrPos = S.pos();
duke@1 1789 }
duke@1 1790
duke@1 1791 // ensure no dangling /** @deprecated */ active
duke@1 1792 S.resetDeprecatedFlag();
duke@1 1793 }
duke@1 1794 }
duke@1 1795
duke@1 1796 /** Statement =
duke@1 1797 * Block
duke@1 1798 * | IF ParExpression Statement [ELSE Statement]
duke@1 1799 * | FOR "(" ForInitOpt ";" [Expression] ";" ForUpdateOpt ")" Statement
duke@1 1800 * | FOR "(" FormalParameter : Expression ")" Statement
duke@1 1801 * | WHILE ParExpression Statement
duke@1 1802 * | DO Statement WHILE ParExpression ";"
duke@1 1803 * | TRY Block ( Catches | [Catches] FinallyPart )
duke@1 1804 * | SWITCH ParExpression "{" SwitchBlockStatementGroups "}"
duke@1 1805 * | SYNCHRONIZED ParExpression Block
duke@1 1806 * | RETURN [Expression] ";"
duke@1 1807 * | THROW Expression ";"
duke@1 1808 * | BREAK [Ident] ";"
duke@1 1809 * | CONTINUE [Ident] ";"
duke@1 1810 * | ASSERT Expression [ ":" Expression ] ";"
duke@1 1811 * | ";"
duke@1 1812 * | ExpressionStatement
duke@1 1813 * | Ident ":" Statement
duke@1 1814 */
duke@1 1815 @SuppressWarnings("fallthrough")
jjg@111 1816 public JCStatement parseStatement() {
duke@1 1817 int pos = S.pos();
duke@1 1818 switch (S.token()) {
duke@1 1819 case LBRACE:
duke@1 1820 return block();
duke@1 1821 case IF: {
duke@1 1822 S.nextToken();
duke@1 1823 JCExpression cond = parExpression();
jjg@111 1824 JCStatement thenpart = parseStatement();
duke@1 1825 JCStatement elsepart = null;
duke@1 1826 if (S.token() == ELSE) {
duke@1 1827 S.nextToken();
jjg@111 1828 elsepart = parseStatement();
duke@1 1829 }
duke@1 1830 return F.at(pos).If(cond, thenpart, elsepart);
duke@1 1831 }
duke@1 1832 case FOR: {
duke@1 1833 S.nextToken();
duke@1 1834 accept(LPAREN);
duke@1 1835 List<JCStatement> inits = S.token() == SEMI ? List.<JCStatement>nil() : forInit();
duke@1 1836 if (inits.length() == 1 &&
duke@1 1837 inits.head.getTag() == JCTree.VARDEF &&
duke@1 1838 ((JCVariableDecl) inits.head).init == null &&
duke@1 1839 S.token() == COLON) {
duke@1 1840 checkForeach();
duke@1 1841 JCVariableDecl var = (JCVariableDecl)inits.head;
duke@1 1842 accept(COLON);
jjg@111 1843 JCExpression expr = parseExpression();
duke@1 1844 accept(RPAREN);
jjg@111 1845 JCStatement body = parseStatement();
duke@1 1846 return F.at(pos).ForeachLoop(var, expr, body);
duke@1 1847 } else {
duke@1 1848 accept(SEMI);
jjg@111 1849 JCExpression cond = S.token() == SEMI ? null : parseExpression();
duke@1 1850 accept(SEMI);
duke@1 1851 List<JCExpressionStatement> steps = S.token() == RPAREN ? List.<JCExpressionStatement>nil() : forUpdate();
duke@1 1852 accept(RPAREN);
jjg@111 1853 JCStatement body = parseStatement();
duke@1 1854 return F.at(pos).ForLoop(inits, cond, steps, body);
duke@1 1855 }
duke@1 1856 }
duke@1 1857 case WHILE: {
duke@1 1858 S.nextToken();
duke@1 1859 JCExpression cond = parExpression();
jjg@111 1860 JCStatement body = parseStatement();
duke@1 1861 return F.at(pos).WhileLoop(cond, body);
duke@1 1862 }
duke@1 1863 case DO: {
duke@1 1864 S.nextToken();
jjg@111 1865 JCStatement body = parseStatement();
duke@1 1866 accept(WHILE);
duke@1 1867 JCExpression cond = parExpression();
duke@1 1868 JCDoWhileLoop t = to(F.at(pos).DoLoop(body, cond));
duke@1 1869 accept(SEMI);
duke@1 1870 return t;
duke@1 1871 }
duke@1 1872 case TRY: {
duke@1 1873 S.nextToken();
duke@1 1874 JCBlock body = block();
duke@1 1875 ListBuffer<JCCatch> catchers = new ListBuffer<JCCatch>();
duke@1 1876 JCBlock finalizer = null;
duke@1 1877 if (S.token() == CATCH || S.token() == FINALLY) {
duke@1 1878 while (S.token() == CATCH) catchers.append(catchClause());
duke@1 1879 if (S.token() == FINALLY) {
duke@1 1880 S.nextToken();
duke@1 1881 finalizer = block();
duke@1 1882 }
duke@1 1883 } else {
duke@1 1884 log.error(pos, "try.without.catch.or.finally");
duke@1 1885 }
duke@1 1886 return F.at(pos).Try(body, catchers.toList(), finalizer);
duke@1 1887 }
duke@1 1888 case SWITCH: {
duke@1 1889 S.nextToken();
duke@1 1890 JCExpression selector = parExpression();
duke@1 1891 accept(LBRACE);
duke@1 1892 List<JCCase> cases = switchBlockStatementGroups();
duke@1 1893 JCSwitch t = to(F.at(pos).Switch(selector, cases));
duke@1 1894 accept(RBRACE);
duke@1 1895 return t;
duke@1 1896 }
duke@1 1897 case SYNCHRONIZED: {
duke@1 1898 S.nextToken();
duke@1 1899 JCExpression lock = parExpression();
duke@1 1900 JCBlock body = block();
duke@1 1901 return F.at(pos).Synchronized(lock, body);
duke@1 1902 }
duke@1 1903 case RETURN: {
duke@1 1904 S.nextToken();
jjg@111 1905 JCExpression result = S.token() == SEMI ? null : parseExpression();
duke@1 1906 JCReturn t = to(F.at(pos).Return(result));
duke@1 1907 accept(SEMI);
duke@1 1908 return t;
duke@1 1909 }
duke@1 1910 case THROW: {
duke@1 1911 S.nextToken();
jjg@111 1912 JCExpression exc = parseExpression();
duke@1 1913 JCThrow t = to(F.at(pos).Throw(exc));
duke@1 1914 accept(SEMI);
duke@1 1915 return t;
duke@1 1916 }
duke@1 1917 case BREAK: {
duke@1 1918 S.nextToken();
duke@1 1919 Name label = (S.token() == IDENTIFIER || S.token() == ASSERT || S.token() == ENUM) ? ident() : null;
duke@1 1920 JCBreak t = to(F.at(pos).Break(label));
duke@1 1921 accept(SEMI);
duke@1 1922 return t;
duke@1 1923 }
duke@1 1924 case CONTINUE: {
duke@1 1925 S.nextToken();
duke@1 1926 Name label = (S.token() == IDENTIFIER || S.token() == ASSERT || S.token() == ENUM) ? ident() : null;
duke@1 1927 JCContinue t = to(F.at(pos).Continue(label));
duke@1 1928 accept(SEMI);
duke@1 1929 return t;
duke@1 1930 }
duke@1 1931 case SEMI:
duke@1 1932 S.nextToken();
duke@1 1933 return toP(F.at(pos).Skip());
duke@1 1934 case ELSE:
duke@1 1935 return toP(F.Exec(syntaxError("else.without.if")));
duke@1 1936 case FINALLY:
duke@1 1937 return toP(F.Exec(syntaxError("finally.without.try")));
duke@1 1938 case CATCH:
duke@1 1939 return toP(F.Exec(syntaxError("catch.without.try")));
duke@1 1940 case ASSERT: {
duke@1 1941 if (allowAsserts && S.token() == ASSERT) {
duke@1 1942 S.nextToken();
jjg@111 1943 JCExpression assertion = parseExpression();
duke@1 1944 JCExpression message = null;
duke@1 1945 if (S.token() == COLON) {
duke@1 1946 S.nextToken();
jjg@111 1947 message = parseExpression();
duke@1 1948 }
duke@1 1949 JCAssert t = to(F.at(pos).Assert(assertion, message));
duke@1 1950 accept(SEMI);
duke@1 1951 return t;
duke@1 1952 }
duke@1 1953 /* else fall through to default case */
duke@1 1954 }
duke@1 1955 case ENUM:
duke@1 1956 default:
duke@1 1957 Name name = S.name();
jjg@111 1958 JCExpression expr = parseExpression();
duke@1 1959 if (S.token() == COLON && expr.getTag() == JCTree.IDENT) {
duke@1 1960 S.nextToken();
jjg@111 1961 JCStatement stat = parseStatement();
duke@1 1962 return F.at(pos).Labelled(name, stat);
duke@1 1963 } else {
duke@1 1964 // This Exec is an "ExpressionStatement"; it subsumes the terminating semicolon
duke@1 1965 JCExpressionStatement stat = to(F.at(pos).Exec(checkExprStat(expr)));
duke@1 1966 accept(SEMI);
duke@1 1967 return stat;
duke@1 1968 }
duke@1 1969 }
duke@1 1970 }
duke@1 1971
duke@1 1972 /** CatchClause = CATCH "(" FormalParameter ")" Block
duke@1 1973 */
duke@1 1974 JCCatch catchClause() {
duke@1 1975 int pos = S.pos();
duke@1 1976 accept(CATCH);
duke@1 1977 accept(LPAREN);
duke@1 1978 JCVariableDecl formal =
duke@1 1979 variableDeclaratorId(optFinal(Flags.PARAMETER),
duke@1 1980 qualident());
duke@1 1981 accept(RPAREN);
duke@1 1982 JCBlock body = block();
duke@1 1983 return F.at(pos).Catch(formal, body);
duke@1 1984 }
duke@1 1985
duke@1 1986 /** SwitchBlockStatementGroups = { SwitchBlockStatementGroup }
duke@1 1987 * SwitchBlockStatementGroup = SwitchLabel BlockStatements
duke@1 1988 * SwitchLabel = CASE ConstantExpression ":" | DEFAULT ":"
duke@1 1989 */
duke@1 1990 List<JCCase> switchBlockStatementGroups() {
duke@1 1991 ListBuffer<JCCase> cases = new ListBuffer<JCCase>();
duke@1 1992 while (true) {
duke@1 1993 int pos = S.pos();
duke@1 1994 switch (S.token()) {
duke@1 1995 case CASE: {
duke@1 1996 S.nextToken();
jjg@111 1997 JCExpression pat = parseExpression();
duke@1 1998 accept(COLON);
duke@1 1999 List<JCStatement> stats = blockStatements();
duke@1 2000 JCCase c = F.at(pos).Case(pat, stats);
duke@1 2001 if (stats.isEmpty())
duke@1 2002 storeEnd(c, S.prevEndPos());
duke@1 2003 cases.append(c);
duke@1 2004 break;
duke@1 2005 }
duke@1 2006 case DEFAULT: {
duke@1 2007 S.nextToken();
duke@1 2008 accept(COLON);
duke@1 2009 List<JCStatement> stats = blockStatements();
duke@1 2010 JCCase c = F.at(pos).Case(null, stats);
duke@1 2011 if (stats.isEmpty())
duke@1 2012 storeEnd(c, S.prevEndPos());
duke@1 2013 cases.append(c);
duke@1 2014 break;
duke@1 2015 }
duke@1 2016 case RBRACE: case EOF:
duke@1 2017 return cases.toList();
duke@1 2018 default:
duke@1 2019 S.nextToken(); // to ensure progress
duke@1 2020 syntaxError(pos, "expected3",
mcimadamore@80 2021 CASE, DEFAULT, RBRACE);
duke@1 2022 }
duke@1 2023 }
duke@1 2024 }
duke@1 2025
duke@1 2026 /** MoreStatementExpressions = { COMMA StatementExpression }
duke@1 2027 */
duke@1 2028 <T extends ListBuffer<? super JCExpressionStatement>> T moreStatementExpressions(int pos,
duke@1 2029 JCExpression first,
duke@1 2030 T stats) {
duke@1 2031 // This Exec is a "StatementExpression"; it subsumes no terminating token
duke@1 2032 stats.append(toP(F.at(pos).Exec(checkExprStat(first))));
duke@1 2033 while (S.token() == COMMA) {
duke@1 2034 S.nextToken();
duke@1 2035 pos = S.pos();
jjg@111 2036 JCExpression t = parseExpression();
duke@1 2037 // This Exec is a "StatementExpression"; it subsumes no terminating token
duke@1 2038 stats.append(toP(F.at(pos).Exec(checkExprStat(t))));
duke@1 2039 }
duke@1 2040 return stats;
duke@1 2041 }
duke@1 2042
duke@1 2043 /** ForInit = StatementExpression MoreStatementExpressions
duke@1 2044 * | { FINAL | '@' Annotation } Type VariableDeclarators
duke@1 2045 */
duke@1 2046 List<JCStatement> forInit() {
duke@1 2047 ListBuffer<JCStatement> stats = lb();
duke@1 2048 int pos = S.pos();
duke@1 2049 if (S.token() == FINAL || S.token() == MONKEYS_AT) {
jjg@111 2050 return variableDeclarators(optFinal(0), parseType(), stats).toList();
duke@1 2051 } else {
duke@1 2052 JCExpression t = term(EXPR | TYPE);
duke@1 2053 if ((lastmode & TYPE) != 0 &&
duke@1 2054 (S.token() == IDENTIFIER || S.token() == ASSERT || S.token() == ENUM))
duke@1 2055 return variableDeclarators(modifiersOpt(), t, stats).toList();
duke@1 2056 else
duke@1 2057 return moreStatementExpressions(pos, t, stats).toList();
duke@1 2058 }
duke@1 2059 }
duke@1 2060
duke@1 2061 /** ForUpdate = StatementExpression MoreStatementExpressions
duke@1 2062 */
duke@1 2063 List<JCExpressionStatement> forUpdate() {
duke@1 2064 return moreStatementExpressions(S.pos(),
jjg@111 2065 parseExpression(),
duke@1 2066 new ListBuffer<JCExpressionStatement>()).toList();
duke@1 2067 }
duke@1 2068
jjg@308 2069 enum AnnotationKind { DEFAULT_ANNO, TYPE_ANNO };
jjg@308 2070
duke@1 2071 /** AnnotationsOpt = { '@' Annotation }
duke@1 2072 */
jjg@308 2073 List<JCAnnotation> annotationsOpt(AnnotationKind kind) {
duke@1 2074 if (S.token() != MONKEYS_AT) return List.nil(); // optimization
duke@1 2075 ListBuffer<JCAnnotation> buf = new ListBuffer<JCAnnotation>();
jjg@308 2076 int prevmode = mode;
duke@1 2077 while (S.token() == MONKEYS_AT) {
duke@1 2078 int pos = S.pos();
duke@1 2079 S.nextToken();
jjg@308 2080 buf.append(annotation(pos, kind));
duke@1 2081 }
jjg@308 2082 lastmode = mode;
jjg@308 2083 mode = prevmode;
jjg@308 2084 List<JCAnnotation> annotations = buf.toList();
jjg@308 2085
jjg@308 2086 if (debugJSR308 && kind == AnnotationKind.TYPE_ANNO)
jjg@308 2087 System.out.println("TA: parsing " + annotations
jjg@308 2088 + " in " + log.currentSourceFile());
jjg@308 2089 return annotations;
jjg@308 2090 }
jjg@308 2091
jjg@308 2092 List<JCTypeAnnotation> typeAnnotationsOpt() {
jjg@308 2093 List<JCAnnotation> annotations = annotationsOpt(AnnotationKind.TYPE_ANNO);
jjg@308 2094 return List.convert(JCTypeAnnotation.class, annotations);
duke@1 2095 }
duke@1 2096
duke@1 2097 /** ModifiersOpt = { Modifier }
duke@1 2098 * Modifier = PUBLIC | PROTECTED | PRIVATE | STATIC | ABSTRACT | FINAL
duke@1 2099 * | NATIVE | SYNCHRONIZED | TRANSIENT | VOLATILE | "@"
duke@1 2100 * | "@" Annotation
duke@1 2101 */
duke@1 2102 JCModifiers modifiersOpt() {
duke@1 2103 return modifiersOpt(null);
duke@1 2104 }
duke@1 2105 JCModifiers modifiersOpt(JCModifiers partial) {
duke@1 2106 long flags = (partial == null) ? 0 : partial.flags;
duke@1 2107 if (S.deprecatedFlag()) {
duke@1 2108 flags |= Flags.DEPRECATED;
duke@1 2109 S.resetDeprecatedFlag();
duke@1 2110 }
duke@1 2111 ListBuffer<JCAnnotation> annotations = new ListBuffer<JCAnnotation>();
duke@1 2112 if (partial != null) annotations.appendList(partial.annotations);
duke@1 2113 int pos = S.pos();
duke@1 2114 int lastPos = Position.NOPOS;
duke@1 2115 loop:
duke@1 2116 while (true) {
duke@1 2117 long flag;
duke@1 2118 switch (S.token()) {
duke@1 2119 case PRIVATE : flag = Flags.PRIVATE; break;
duke@1 2120 case PROTECTED : flag = Flags.PROTECTED; break;
duke@1 2121 case PUBLIC : flag = Flags.PUBLIC; break;
duke@1 2122 case STATIC : flag = Flags.STATIC; break;
duke@1 2123 case TRANSIENT : flag = Flags.TRANSIENT; break;
duke@1 2124 case FINAL : flag = Flags.FINAL; break;
duke@1 2125 case ABSTRACT : flag = Flags.ABSTRACT; break;
duke@1 2126 case NATIVE : flag = Flags.NATIVE; break;
duke@1 2127 case VOLATILE : flag = Flags.VOLATILE; break;
duke@1 2128 case SYNCHRONIZED: flag = Flags.SYNCHRONIZED; break;
duke@1 2129 case STRICTFP : flag = Flags.STRICTFP; break;
duke@1 2130 case MONKEYS_AT : flag = Flags.ANNOTATION; break;
duke@1 2131 default: break loop;
duke@1 2132 }
duke@1 2133 if ((flags & flag) != 0) log.error(S.pos(), "repeated.modifier");
duke@1 2134 lastPos = S.pos();
duke@1 2135 S.nextToken();
duke@1 2136 if (flag == Flags.ANNOTATION) {
duke@1 2137 checkAnnotations();
duke@1 2138 if (S.token() != INTERFACE) {
jjg@308 2139 JCAnnotation ann = annotation(lastPos, AnnotationKind.DEFAULT_ANNO);
duke@1 2140 // if first modifier is an annotation, set pos to annotation's.
duke@1 2141 if (flags == 0 && annotations.isEmpty())
duke@1 2142 pos = ann.pos;
duke@1 2143 annotations.append(ann);
duke@1 2144 lastPos = ann.pos;
duke@1 2145 flag = 0;
duke@1 2146 }
duke@1 2147 }
duke@1 2148 flags |= flag;
duke@1 2149 }
duke@1 2150 switch (S.token()) {
duke@1 2151 case ENUM: flags |= Flags.ENUM; break;
duke@1 2152 case INTERFACE: flags |= Flags.INTERFACE; break;
duke@1 2153 default: break;
duke@1 2154 }
duke@1 2155
duke@1 2156 /* A modifiers tree with no modifier tokens or annotations
duke@1 2157 * has no text position. */
duke@1 2158 if (flags == 0 && annotations.isEmpty())
duke@1 2159 pos = Position.NOPOS;
duke@1 2160
duke@1 2161 JCModifiers mods = F.at(pos).Modifiers(flags, annotations.toList());
duke@1 2162 if (pos != Position.NOPOS)
duke@1 2163 storeEnd(mods, S.prevEndPos());
duke@1 2164 return mods;
duke@1 2165 }
duke@1 2166
duke@1 2167 /** Annotation = "@" Qualident [ "(" AnnotationFieldValues ")" ]
duke@1 2168 * @param pos position of "@" token
duke@1 2169 */
jjg@308 2170 JCAnnotation annotation(int pos, AnnotationKind kind) {
duke@1 2171 // accept(AT); // AT consumed by caller
duke@1 2172 checkAnnotations();
jjg@308 2173 if (kind == AnnotationKind.TYPE_ANNO)
jjg@308 2174 checkTypeAnnotations();
duke@1 2175 JCTree ident = qualident();
duke@1 2176 List<JCExpression> fieldValues = annotationFieldValuesOpt();
jjg@308 2177 JCAnnotation ann;
jjg@308 2178 if (kind == AnnotationKind.DEFAULT_ANNO)
jjg@308 2179 ann = F.at(pos).Annotation(ident, fieldValues);
jjg@308 2180 else
jjg@308 2181 ann = F.at(pos).TypeAnnotation(ident, fieldValues);
duke@1 2182 storeEnd(ann, S.prevEndPos());
duke@1 2183 return ann;
duke@1 2184 }
duke@1 2185
duke@1 2186 List<JCExpression> annotationFieldValuesOpt() {
duke@1 2187 return (S.token() == LPAREN) ? annotationFieldValues() : List.<JCExpression>nil();
duke@1 2188 }
duke@1 2189
duke@1 2190 /** AnnotationFieldValues = "(" [ AnnotationFieldValue { "," AnnotationFieldValue } ] ")" */
duke@1 2191 List<JCExpression> annotationFieldValues() {
duke@1 2192 accept(LPAREN);
duke@1 2193 ListBuffer<JCExpression> buf = new ListBuffer<JCExpression>();
duke@1 2194 if (S.token() != RPAREN) {
duke@1 2195 buf.append(annotationFieldValue());
duke@1 2196 while (S.token() == COMMA) {
duke@1 2197 S.nextToken();
duke@1 2198 buf.append(annotationFieldValue());
duke@1 2199 }
duke@1 2200 }
duke@1 2201 accept(RPAREN);
duke@1 2202 return buf.toList();
duke@1 2203 }
duke@1 2204
duke@1 2205 /** AnnotationFieldValue = AnnotationValue
duke@1 2206 * | Identifier "=" AnnotationValue
duke@1 2207 */
duke@1 2208 JCExpression annotationFieldValue() {
duke@1 2209 if (S.token() == IDENTIFIER) {
duke@1 2210 mode = EXPR;
duke@1 2211 JCExpression t1 = term1();
duke@1 2212 if (t1.getTag() == JCTree.IDENT && S.token() == EQ) {
duke@1 2213 int pos = S.pos();
duke@1 2214 accept(EQ);
duke@1 2215 return toP(F.at(pos).Assign(t1, annotationValue()));
duke@1 2216 } else {
duke@1 2217 return t1;
duke@1 2218 }
duke@1 2219 }
duke@1 2220 return annotationValue();
duke@1 2221 }
duke@1 2222
duke@1 2223 /* AnnotationValue = ConditionalExpression
duke@1 2224 * | Annotation
duke@1 2225 * | "{" [ AnnotationValue { "," AnnotationValue } ] "}"
duke@1 2226 */
duke@1 2227 JCExpression annotationValue() {
duke@1 2228 int pos;
duke@1 2229 switch (S.token()) {
duke@1 2230 case MONKEYS_AT:
duke@1 2231 pos = S.pos();
duke@1 2232 S.nextToken();
jjg@308 2233 return annotation(pos, AnnotationKind.DEFAULT_ANNO);
duke@1 2234 case LBRACE:
duke@1 2235 pos = S.pos();
duke@1 2236 accept(LBRACE);
duke@1 2237 ListBuffer<JCExpression> buf = new ListBuffer<JCExpression>();
duke@1 2238 if (S.token() != RBRACE) {
duke@1 2239 buf.append(annotationValue());
duke@1 2240 while (S.token() == COMMA) {
duke@1 2241 S.nextToken();
duke@1 2242 if (S.token() == RPAREN) break;
duke@1 2243 buf.append(annotationValue());
duke@1 2244 }
duke@1 2245 }
duke@1 2246 accept(RBRACE);
duke@1 2247 return toP(F.at(pos).NewArray(null, List.<JCExpression>nil(), buf.toList()));
duke@1 2248 default:
duke@1 2249 mode = EXPR;
duke@1 2250 return term1();
duke@1 2251 }
duke@1 2252 }
duke@1 2253
duke@1 2254 /** VariableDeclarators = VariableDeclarator { "," VariableDeclarator }
duke@1 2255 */
duke@1 2256 public <T extends ListBuffer<? super JCVariableDecl>> T variableDeclarators(JCModifiers mods,
duke@1 2257 JCExpression type,
duke@1 2258 T vdefs)
duke@1 2259 {
duke@1 2260 return variableDeclaratorsRest(S.pos(), mods, type, ident(), false, null, vdefs);
duke@1 2261 }
duke@1 2262
duke@1 2263 /** VariableDeclaratorsRest = VariableDeclaratorRest { "," VariableDeclarator }
duke@1 2264 * ConstantDeclaratorsRest = ConstantDeclaratorRest { "," ConstantDeclarator }
duke@1 2265 *
duke@1 2266 * @param reqInit Is an initializer always required?
duke@1 2267 * @param dc The documentation comment for the variable declarations, or null.
duke@1 2268 */
duke@1 2269 <T extends ListBuffer<? super JCVariableDecl>> T variableDeclaratorsRest(int pos,
duke@1 2270 JCModifiers mods,
duke@1 2271 JCExpression type,
duke@1 2272 Name name,
duke@1 2273 boolean reqInit,
duke@1 2274 String dc,
duke@1 2275 T vdefs)
duke@1 2276 {
duke@1 2277 vdefs.append(variableDeclaratorRest(pos, mods, type, name, reqInit, dc));
duke@1 2278 while (S.token() == COMMA) {
duke@1 2279 // All but last of multiple declarators subsume a comma
duke@1 2280 storeEnd((JCTree)vdefs.elems.last(), S.endPos());
duke@1 2281 S.nextToken();
duke@1 2282 vdefs.append(variableDeclarator(mods, type, reqInit, dc));
duke@1 2283 }
duke@1 2284 return vdefs;
duke@1 2285 }
duke@1 2286
duke@1 2287 /** VariableDeclarator = Ident VariableDeclaratorRest
duke@1 2288 * ConstantDeclarator = Ident ConstantDeclaratorRest
duke@1 2289 */
duke@1 2290 JCVariableDecl variableDeclarator(JCModifiers mods, JCExpression type, boolean reqInit, String dc) {
duke@1 2291 return variableDeclaratorRest(S.pos(), mods, type, ident(), reqInit, dc);
duke@1 2292 }
duke@1 2293
duke@1 2294 /** VariableDeclaratorRest = BracketsOpt ["=" VariableInitializer]
duke@1 2295 * ConstantDeclaratorRest = BracketsOpt "=" VariableInitializer
duke@1 2296 *
duke@1 2297 * @param reqInit Is an initializer always required?
duke@1 2298 * @param dc The documentation comment for the variable declarations, or null.
duke@1 2299 */
duke@1 2300 JCVariableDecl variableDeclaratorRest(int pos, JCModifiers mods, JCExpression type, Name name,
duke@1 2301 boolean reqInit, String dc) {
duke@1 2302 type = bracketsOpt(type);
duke@1 2303 JCExpression init = null;
duke@1 2304 if (S.token() == EQ) {
duke@1 2305 S.nextToken();
duke@1 2306 init = variableInitializer();
duke@1 2307 }
mcimadamore@80 2308 else if (reqInit) syntaxError(S.pos(), "expected", EQ);
duke@1 2309 JCVariableDecl result =
duke@1 2310 toP(F.at(pos).VarDef(mods, name, type, init));
duke@1 2311 attach(result, dc);
duke@1 2312 return result;
duke@1 2313 }
duke@1 2314
duke@1 2315 /** VariableDeclaratorId = Ident BracketsOpt
duke@1 2316 */
duke@1 2317 JCVariableDecl variableDeclaratorId(JCModifiers mods, JCExpression type) {
duke@1 2318 int pos = S.pos();
duke@1 2319 Name name = ident();
duke@1 2320 if ((mods.flags & Flags.VARARGS) == 0)
duke@1 2321 type = bracketsOpt(type);
duke@1 2322 return toP(F.at(pos).VarDef(mods, name, type, null));
duke@1 2323 }
duke@1 2324
duke@1 2325 /** CompilationUnit = [ { "@" Annotation } PACKAGE Qualident ";"] {ImportDeclaration} {TypeDeclaration}
duke@1 2326 */
jjg@111 2327 public JCTree.JCCompilationUnit parseCompilationUnit() {
duke@1 2328 int pos = S.pos();
duke@1 2329 JCExpression pid = null;
duke@1 2330 String dc = S.docComment();
duke@1 2331 JCModifiers mods = null;
duke@1 2332 List<JCAnnotation> packageAnnotations = List.nil();
duke@1 2333 if (S.token() == MONKEYS_AT)
duke@1 2334 mods = modifiersOpt();
duke@1 2335
duke@1 2336 if (S.token() == PACKAGE) {
duke@1 2337 if (mods != null) {
duke@1 2338 checkNoMods(mods.flags);
duke@1 2339 packageAnnotations = mods.annotations;
duke@1 2340 mods = null;
duke@1 2341 }
duke@1 2342 S.nextToken();
duke@1 2343 pid = qualident();
duke@1 2344 accept(SEMI);
duke@1 2345 }
duke@1 2346 ListBuffer<JCTree> defs = new ListBuffer<JCTree>();
jjg@111 2347 boolean checkForImports = true;
duke@1 2348 while (S.token() != EOF) {
duke@1 2349 if (S.pos() <= errorEndPos) {
duke@1 2350 // error recovery
duke@1 2351 skip(checkForImports, false, false, false);
duke@1 2352 if (S.token() == EOF)
duke@1 2353 break;
duke@1 2354 }
duke@1 2355 if (checkForImports && mods == null && S.token() == IMPORT) {
duke@1 2356 defs.append(importDeclaration());
duke@1 2357 } else {
duke@1 2358 JCTree def = typeDeclaration(mods);
duke@1 2359 if (def instanceof JCExpressionStatement)
duke@1 2360 def = ((JCExpressionStatement)def).expr;
duke@1 2361 defs.append(def);
duke@1 2362 if (def instanceof JCClassDecl)
duke@1 2363 checkForImports = false;
duke@1 2364 mods = null;
duke@1 2365 }
duke@1 2366 }
duke@1 2367 JCTree.JCCompilationUnit toplevel = F.at(pos).TopLevel(packageAnnotations, pid, defs.toList());
duke@1 2368 attach(toplevel, dc);
duke@1 2369 if (defs.elems.isEmpty())
duke@1 2370 storeEnd(toplevel, S.prevEndPos());
jjg@111 2371 if (keepDocComments)
jjg@111 2372 toplevel.docComments = docComments;
jjg@111 2373 if (keepLineMap)
jjg@111 2374 toplevel.lineMap = S.getLineMap();
duke@1 2375 return toplevel;
duke@1 2376 }
duke@1 2377
duke@1 2378 /** ImportDeclaration = IMPORT [ STATIC ] Ident { "." Ident } [ "." "*" ] ";"
duke@1 2379 */
duke@1 2380 JCTree importDeclaration() {
duke@1 2381 int pos = S.pos();
duke@1 2382 S.nextToken();
duke@1 2383 boolean importStatic = false;
duke@1 2384 if (S.token() == STATIC) {
duke@1 2385 checkStaticImports();
duke@1 2386 importStatic = true;
duke@1 2387 S.nextToken();
duke@1 2388 }
duke@1 2389 JCExpression pid = toP(F.at(S.pos()).Ident(ident()));
duke@1 2390 do {
duke@1 2391 int pos1 = S.pos();
duke@1 2392 accept(DOT);
duke@1 2393 if (S.token() == STAR) {
duke@1 2394 pid = to(F.at(pos1).Select(pid, names.asterisk));
duke@1 2395 S.nextToken();
duke@1 2396 break;
duke@1 2397 } else {
duke@1 2398 pid = toP(F.at(pos1).Select(pid, ident()));
duke@1 2399 }
duke@1 2400 } while (S.token() == DOT);
duke@1 2401 accept(SEMI);
duke@1 2402 return toP(F.at(pos).Import(pid, importStatic));
duke@1 2403 }
duke@1 2404
duke@1 2405 /** TypeDeclaration = ClassOrInterfaceOrEnumDeclaration
duke@1 2406 * | ";"
duke@1 2407 */
duke@1 2408 JCTree typeDeclaration(JCModifiers mods) {
duke@1 2409 int pos = S.pos();
duke@1 2410 if (mods == null && S.token() == SEMI) {
duke@1 2411 S.nextToken();
duke@1 2412 return toP(F.at(pos).Skip());
duke@1 2413 } else {
duke@1 2414 String dc = S.docComment();
duke@1 2415 return classOrInterfaceOrEnumDeclaration(modifiersOpt(mods), dc);
duke@1 2416 }
duke@1 2417 }
duke@1 2418
duke@1 2419 /** ClassOrInterfaceOrEnumDeclaration = ModifiersOpt
duke@1 2420 * (ClassDeclaration | InterfaceDeclaration | EnumDeclaration)
duke@1 2421 * @param mods Any modifiers starting the class or interface declaration
duke@1 2422 * @param dc The documentation comment for the class, or null.
duke@1 2423 */
duke@1 2424 JCStatement classOrInterfaceOrEnumDeclaration(JCModifiers mods, String dc) {
duke@1 2425 if (S.token() == CLASS) {
duke@1 2426 return classDeclaration(mods, dc);
duke@1 2427 } else if (S.token() == INTERFACE) {
duke@1 2428 return interfaceDeclaration(mods, dc);
duke@1 2429 } else if (allowEnums) {
duke@1 2430 if (S.token() == ENUM) {
duke@1 2431 return enumDeclaration(mods, dc);
duke@1 2432 } else {
duke@1 2433 int pos = S.pos();
duke@1 2434 List<JCTree> errs;
duke@1 2435 if (S.token() == IDENTIFIER) {
duke@1 2436 errs = List.<JCTree>of(mods, toP(F.at(pos).Ident(ident())));
duke@1 2437 setErrorEndPos(S.pos());
duke@1 2438 } else {
duke@1 2439 errs = List.<JCTree>of(mods);
duke@1 2440 }
duke@1 2441 return toP(F.Exec(syntaxError(pos, errs, "expected3",
mcimadamore@80 2442 CLASS, INTERFACE, ENUM)));
duke@1 2443 }
duke@1 2444 } else {
duke@1 2445 if (S.token() == ENUM) {
duke@1 2446 log.error(S.pos(), "enums.not.supported.in.source", source.name);
duke@1 2447 allowEnums = true;
duke@1 2448 return enumDeclaration(mods, dc);
duke@1 2449 }
duke@1 2450 int pos = S.pos();
duke@1 2451 List<JCTree> errs;
duke@1 2452 if (S.token() == IDENTIFIER) {
duke@1 2453 errs = List.<JCTree>of(mods, toP(F.at(pos).Ident(ident())));
duke@1 2454 setErrorEndPos(S.pos());
duke@1 2455 } else {
duke@1 2456 errs = List.<JCTree>of(mods);
duke@1 2457 }
duke@1 2458 return toP(F.Exec(syntaxError(pos, errs, "expected2",
mcimadamore@80 2459 CLASS, INTERFACE)));
duke@1 2460 }
duke@1 2461 }
duke@1 2462
duke@1 2463 /** ClassDeclaration = CLASS Ident TypeParametersOpt [EXTENDS Type]
duke@1 2464 * [IMPLEMENTS TypeList] ClassBody
duke@1 2465 * @param mods The modifiers starting the class declaration
duke@1 2466 * @param dc The documentation comment for the class, or null.
duke@1 2467 */
duke@1 2468 JCClassDecl classDeclaration(JCModifiers mods, String dc) {
duke@1 2469 int pos = S.pos();
duke@1 2470 accept(CLASS);
duke@1 2471 Name name = ident();
duke@1 2472
duke@1 2473 List<JCTypeParameter> typarams = typeParametersOpt();
duke@1 2474
duke@1 2475 JCTree extending = null;
duke@1 2476 if (S.token() == EXTENDS) {
duke@1 2477 S.nextToken();
jjg@111 2478 extending = parseType();
duke@1 2479 }
duke@1 2480 List<JCExpression> implementing = List.nil();
duke@1 2481 if (S.token() == IMPLEMENTS) {
duke@1 2482 S.nextToken();
duke@1 2483 implementing = typeList();
duke@1 2484 }
duke@1 2485 List<JCTree> defs = classOrInterfaceBody(name, false);
duke@1 2486 JCClassDecl result = toP(F.at(pos).ClassDef(
duke@1 2487 mods, name, typarams, extending, implementing, defs));
duke@1 2488 attach(result, dc);
duke@1 2489 return result;
duke@1 2490 }
duke@1 2491
duke@1 2492 /** InterfaceDeclaration = INTERFACE Ident TypeParametersOpt
duke@1 2493 * [EXTENDS TypeList] InterfaceBody
duke@1 2494 * @param mods The modifiers starting the interface declaration
duke@1 2495 * @param dc The documentation comment for the interface, or null.
duke@1 2496 */
duke@1 2497 JCClassDecl interfaceDeclaration(JCModifiers mods, String dc) {
duke@1 2498 int pos = S.pos();
duke@1 2499 accept(INTERFACE);
duke@1 2500 Name name = ident();
duke@1 2501
duke@1 2502 List<JCTypeParameter> typarams = typeParametersOpt();
duke@1 2503
duke@1 2504 List<JCExpression> extending = List.nil();
duke@1 2505 if (S.token() == EXTENDS) {
duke@1 2506 S.nextToken();
duke@1 2507 extending = typeList();
duke@1 2508 }
duke@1 2509 List<JCTree> defs = classOrInterfaceBody(name, true);
duke@1 2510 JCClassDecl result = toP(F.at(pos).ClassDef(
duke@1 2511 mods, name, typarams, null, extending, defs));
duke@1 2512 attach(result, dc);
duke@1 2513 return result;
duke@1 2514 }
duke@1 2515
duke@1 2516 /** EnumDeclaration = ENUM Ident [IMPLEMENTS TypeList] EnumBody
duke@1 2517 * @param mods The modifiers starting the enum declaration
duke@1 2518 * @param dc The documentation comment for the enum, or null.
duke@1 2519 */
duke@1 2520 JCClassDecl enumDeclaration(JCModifiers mods, String dc) {
duke@1 2521 int pos = S.pos();
duke@1 2522 accept(ENUM);
duke@1 2523 Name name = ident();
duke@1 2524
duke@1 2525 List<JCExpression> implementing = List.nil();
duke@1 2526 if (S.token() == IMPLEMENTS) {
duke@1 2527 S.nextToken();
duke@1 2528 implementing = typeList();
duke@1 2529 }
duke@1 2530
duke@1 2531 List<JCTree> defs = enumBody(name);
duke@1 2532 JCModifiers newMods =
duke@1 2533 F.at(mods.pos).Modifiers(mods.flags|Flags.ENUM, mods.annotations);
duke@1 2534 JCClassDecl result = toP(F.at(pos).
duke@1 2535 ClassDef(newMods, name, List.<JCTypeParameter>nil(),
duke@1 2536 null, implementing, defs));
duke@1 2537 attach(result, dc);
duke@1 2538 return result;
duke@1 2539 }
duke@1 2540
duke@1 2541 /** EnumBody = "{" { EnumeratorDeclarationList } [","]
duke@1 2542 * [ ";" {ClassBodyDeclaration} ] "}"
duke@1 2543 */
duke@1 2544 List<JCTree> enumBody(Name enumName) {
duke@1 2545 accept(LBRACE);
duke@1 2546 ListBuffer<JCTree> defs = new ListBuffer<JCTree>();
duke@1 2547 if (S.token() == COMMA) {
duke@1 2548 S.nextToken();
duke@1 2549 } else if (S.token() != RBRACE && S.token() != SEMI) {
duke@1 2550 defs.append(enumeratorDeclaration(enumName));
duke@1 2551 while (S.token() == COMMA) {
duke@1 2552 S.nextToken();
duke@1 2553 if (S.token() == RBRACE || S.token() == SEMI) break;
duke@1 2554 defs.append(enumeratorDeclaration(enumName));
duke@1 2555 }
duke@1 2556 if (S.token() != SEMI && S.token() != RBRACE) {
duke@1 2557 defs.append(syntaxError(S.pos(), "expected3",
mcimadamore@80 2558 COMMA, RBRACE, SEMI));
duke@1 2559 S.nextToken();
duke@1 2560 }
duke@1 2561 }
duke@1 2562 if (S.token() == SEMI) {
duke@1 2563 S.nextToken();
duke@1 2564 while (S.token() != RBRACE && S.token() != EOF) {
duke@1 2565 defs.appendList(classOrInterfaceBodyDeclaration(enumName,
duke@1 2566 false));
duke@1 2567 if (S.pos() <= errorEndPos) {
duke@1 2568 // error recovery
duke@1 2569 skip(false, true, true, false);
duke@1 2570 }
duke@1 2571 }
duke@1 2572 }
duke@1 2573 accept(RBRACE);
duke@1 2574 return defs.toList();
duke@1 2575 }
duke@1 2576
duke@1 2577 /** EnumeratorDeclaration = AnnotationsOpt [TypeArguments] IDENTIFIER [ Arguments ] [ "{" ClassBody "}" ]
duke@1 2578 */
duke@1 2579 JCTree enumeratorDeclaration(Name enumName) {
duke@1 2580 String dc = S.docComment();
duke@1 2581 int flags = Flags.PUBLIC|Flags.STATIC|Flags.FINAL|Flags.ENUM;
duke@1 2582 if (S.deprecatedFlag()) {
duke@1 2583 flags |= Flags.DEPRECATED;
duke@1 2584 S.resetDeprecatedFlag();
duke@1 2585 }
duke@1 2586 int pos = S.pos();
jjg@308 2587 List<JCAnnotation> annotations = annotationsOpt(AnnotationKind.DEFAULT_ANNO);
duke@1 2588 JCModifiers mods = F.at(annotations.isEmpty() ? Position.NOPOS : pos).Modifiers(flags, annotations);
duke@1 2589 List<JCExpression> typeArgs = typeArgumentsOpt();
duke@1 2590 int identPos = S.pos();
duke@1 2591 Name name = ident();
duke@1 2592 int createPos = S.pos();
duke@1 2593 List<JCExpression> args = (S.token() == LPAREN)
duke@1 2594 ? arguments() : List.<JCExpression>nil();
duke@1 2595 JCClassDecl body = null;
duke@1 2596 if (S.token() == LBRACE) {
duke@1 2597 JCModifiers mods1 = F.at(Position.NOPOS).Modifiers(Flags.ENUM | Flags.STATIC);
duke@1 2598 List<JCTree> defs = classOrInterfaceBody(names.empty, false);
duke@1 2599 body = toP(F.at(identPos).AnonymousClassDef(mods1, defs));
duke@1 2600 }
duke@1 2601 if (args.isEmpty() && body == null)
duke@1 2602 createPos = Position.NOPOS;
duke@1 2603 JCIdent ident = F.at(Position.NOPOS).Ident(enumName);
duke@1 2604 JCNewClass create = F.at(createPos).NewClass(null, typeArgs, ident, args, body);
duke@1 2605 if (createPos != Position.NOPOS)
duke@1 2606 storeEnd(create, S.prevEndPos());
duke@1 2607 ident = F.at(Position.NOPOS).Ident(enumName);
duke@1 2608 JCTree result = toP(F.at(pos).VarDef(mods, name, ident, create));
duke@1 2609 attach(result, dc);
duke@1 2610 return result;
duke@1 2611 }
duke@1 2612
duke@1 2613 /** TypeList = Type {"," Type}
duke@1 2614 */
duke@1 2615 List<JCExpression> typeList() {
duke@1 2616 ListBuffer<JCExpression> ts = new ListBuffer<JCExpression>();
jjg@111 2617 ts.append(parseType());
duke@1 2618 while (S.token() == COMMA) {
duke@1 2619 S.nextToken();
jjg@111 2620 ts.append(parseType());
duke@1 2621 }
duke@1 2622 return ts.toList();
duke@1 2623 }
duke@1 2624
duke@1 2625 /** ClassBody = "{" {ClassBodyDeclaration} "}"
duke@1 2626 * InterfaceBody = "{" {InterfaceBodyDeclaration} "}"
duke@1 2627 */
duke@1 2628 List<JCTree> classOrInterfaceBody(Name className, boolean isInterface) {
duke@1 2629 accept(LBRACE);
duke@1 2630 if (S.pos() <= errorEndPos) {
duke@1 2631 // error recovery
duke@1 2632 skip(false, true, false, false);
duke@1 2633 if (S.token() == LBRACE)
duke@1 2634 S.nextToken();
duke@1 2635 }
duke@1 2636 ListBuffer<JCTree> defs = new ListBuffer<JCTree>();
duke@1 2637 while (S.token() != RBRACE && S.token() != EOF) {
duke@1 2638 defs.appendList(classOrInterfaceBodyDeclaration(className, isInterface));
duke@1 2639 if (S.pos() <= errorEndPos) {
duke@1 2640 // error recovery
duke@1 2641 skip(false, true, true, false);
duke@1 2642 }
duke@1 2643 }
duke@1 2644 accept(RBRACE);
duke@1 2645 return defs.toList();
duke@1 2646 }
duke@1 2647
duke@1 2648 /** ClassBodyDeclaration =
duke@1 2649 * ";"
duke@1 2650 * | [STATIC] Block
duke@1 2651 * | ModifiersOpt
duke@1 2652 * ( Type Ident
duke@1 2653 * ( VariableDeclaratorsRest ";" | MethodDeclaratorRest )
duke@1 2654 * | VOID Ident MethodDeclaratorRest
duke@1 2655 * | TypeParameters (Type | VOID) Ident MethodDeclaratorRest
duke@1 2656 * | Ident ConstructorDeclaratorRest
duke@1 2657 * | TypeParameters Ident ConstructorDeclaratorRest
duke@1 2658 * | ClassOrInterfaceOrEnumDeclaration
duke@1 2659 * )
duke@1 2660 * InterfaceBodyDeclaration =
duke@1 2661 * ";"
duke@1 2662 * | ModifiersOpt Type Ident
duke@1 2663 * ( ConstantDeclaratorsRest | InterfaceMethodDeclaratorRest ";" )
duke@1 2664 */
duke@1 2665 List<JCTree> classOrInterfaceBodyDeclaration(Name className, boolean isInterface) {
duke@1 2666 if (S.token() == SEMI) {
duke@1 2667 S.nextToken();
duke@1 2668 return List.<JCTree>of(F.at(Position.NOPOS).Block(0, List.<JCStatement>nil()));
duke@1 2669 } else {
duke@1 2670 String dc = S.docComment();
duke@1 2671 int pos = S.pos();
duke@1 2672 JCModifiers mods = modifiersOpt();
duke@1 2673 if (S.token() == CLASS ||
duke@1 2674 S.token() == INTERFACE ||
duke@1 2675 allowEnums && S.token() == ENUM) {
duke@1 2676 return List.<JCTree>of(classOrInterfaceOrEnumDeclaration(mods, dc));
duke@1 2677 } else if (S.token() == LBRACE && !isInterface &&
duke@1 2678 (mods.flags & Flags.StandardFlags & ~Flags.STATIC) == 0 &&
duke@1 2679 mods.annotations.isEmpty()) {
duke@1 2680 return List.<JCTree>of(block(pos, mods.flags));
duke@1 2681 } else {
duke@1 2682 pos = S.pos();
duke@1 2683 List<JCTypeParameter> typarams = typeParametersOpt();
duke@1 2684 // Hack alert: if there are type arguments but no Modifiers, the start
duke@1 2685 // position will be lost unless we set the Modifiers position. There
duke@1 2686 // should be an AST node for type parameters (BugId 5005090).
duke@1 2687 if (typarams.length() > 0 && mods.pos == Position.NOPOS) {
duke@1 2688 mods.pos = pos;
duke@1 2689 }
jjg@308 2690
jjg@308 2691 List<JCAnnotation> annosAfterParams = annotationsOpt(AnnotationKind.DEFAULT_ANNO);
jjg@308 2692
duke@1 2693 Token token = S.token();
duke@1 2694 Name name = S.name();
duke@1 2695 pos = S.pos();
duke@1 2696 JCExpression type;
duke@1 2697 boolean isVoid = S.token() == VOID;
duke@1 2698 if (isVoid) {
jjg@308 2699 if (annosAfterParams.nonEmpty())
jjg@308 2700 illegal(annosAfterParams.head.pos);
duke@1 2701 type = to(F.at(pos).TypeIdent(TypeTags.VOID));
duke@1 2702 S.nextToken();
duke@1 2703 } else {
jjg@308 2704 mods.annotations = mods.annotations.appendList(annosAfterParams);
jjg@308 2705 // method returns types are un-annotated types
jjg@308 2706 type = unannotatedType();
duke@1 2707 }
duke@1 2708 if (S.token() == LPAREN && !isInterface && type.getTag() == JCTree.IDENT) {
duke@1 2709 if (isInterface || name != className)
duke@1 2710 log.error(pos, "invalid.meth.decl.ret.type.req");
duke@1 2711 return List.of(methodDeclaratorRest(
duke@1 2712 pos, mods, null, names.init, typarams,
duke@1 2713 isInterface, true, dc));
duke@1 2714 } else {
duke@1 2715 pos = S.pos();
duke@1 2716 name = ident();
duke@1 2717 if (S.token() == LPAREN) {
duke@1 2718 return List.of(methodDeclaratorRest(
duke@1 2719 pos, mods, type, name, typarams,
duke@1 2720 isInterface, isVoid, dc));
duke@1 2721 } else if (!isVoid && typarams.isEmpty()) {
duke@1 2722 List<JCTree> defs =
duke@1 2723 variableDeclaratorsRest(pos, mods, type, name, isInterface, dc,
duke@1 2724 new ListBuffer<JCTree>()).toList();
duke@1 2725 storeEnd(defs.last(), S.endPos());
duke@1 2726 accept(SEMI);
duke@1 2727 return defs;
duke@1 2728 } else {
duke@1 2729 pos = S.pos();
duke@1 2730 List<JCTree> err = isVoid
duke@1 2731 ? List.<JCTree>of(toP(F.at(pos).MethodDef(mods, name, type, typarams,
duke@1 2732 List.<JCVariableDecl>nil(), List.<JCExpression>nil(), null, null)))
duke@1 2733 : null;
mcimadamore@80 2734 return List.<JCTree>of(syntaxError(S.pos(), err, "expected", LPAREN));
duke@1 2735 }
duke@1 2736 }
duke@1 2737 }
duke@1 2738 }
duke@1 2739 }
duke@1 2740
duke@1 2741 /** MethodDeclaratorRest =
jjg@308 2742 * FormalParameters BracketsOpt [Annotations] [Throws TypeList] ( MethodBody | [DEFAULT AnnotationValue] ";")
duke@1 2743 * VoidMethodDeclaratorRest =
jjg@308 2744 * FormalParameters [Annotations] [Throws TypeList] ( MethodBody | ";")
duke@1 2745 * InterfaceMethodDeclaratorRest =
jjg@308 2746 * FormalParameters BracketsOpt [Annotations] [THROWS TypeList] ";"
duke@1 2747 * VoidInterfaceMethodDeclaratorRest =
jjg@308 2748 * FormalParameters [Annotations] [THROWS TypeList] ";"
duke@1 2749 * ConstructorDeclaratorRest =
jjg@308 2750 * "(" FormalParameterListOpt ")" [Annotations] [THROWS TypeList] MethodBody
duke@1 2751 */
duke@1 2752 JCTree methodDeclaratorRest(int pos,
duke@1 2753 JCModifiers mods,
duke@1 2754 JCExpression type,
duke@1 2755 Name name,
duke@1 2756 List<JCTypeParameter> typarams,
duke@1 2757 boolean isInterface, boolean isVoid,
duke@1 2758 String dc) {
duke@1 2759 List<JCVariableDecl> params = formalParameters();
jjg@308 2760
jjg@308 2761 List<JCTypeAnnotation> receiverAnnotations;
jjg@308 2762 if (!isVoid) {
jjg@308 2763 // need to distinguish between receiver anno and array anno
jjg@308 2764 // look at typeAnnotationsPushedBack comment
jjg@308 2765 this.permitTypeAnnotationsPushBack = true;
jjg@308 2766 type = methodReturnArrayRest(type);
jjg@308 2767 this.permitTypeAnnotationsPushBack = false;
jjg@308 2768 if (typeAnnotationsPushedBack == null)
jjg@308 2769 receiverAnnotations = List.nil();
jjg@308 2770 else
jjg@308 2771 receiverAnnotations = typeAnnotationsPushedBack;
jjg@308 2772 typeAnnotationsPushedBack = null;
jjg@308 2773 } else
jjg@308 2774 receiverAnnotations = typeAnnotationsOpt();
jjg@308 2775
duke@1 2776 List<JCExpression> thrown = List.nil();
duke@1 2777 if (S.token() == THROWS) {
duke@1 2778 S.nextToken();
duke@1 2779 thrown = qualidentList();
duke@1 2780 }
duke@1 2781 JCBlock body = null;
duke@1 2782 JCExpression defaultValue;
duke@1 2783 if (S.token() == LBRACE) {
duke@1 2784 body = block();
duke@1 2785 defaultValue = null;
duke@1 2786 } else {
duke@1 2787 if (S.token() == DEFAULT) {
duke@1 2788 accept(DEFAULT);
duke@1 2789 defaultValue = annotationValue();
duke@1 2790 } else {
duke@1 2791 defaultValue = null;
duke@1 2792 }
duke@1 2793 accept(SEMI);
duke@1 2794 if (S.pos() <= errorEndPos) {
duke@1 2795 // error recovery
duke@1 2796 skip(false, true, false, false);
duke@1 2797 if (S.token() == LBRACE) {
duke@1 2798 body = block();
duke@1 2799 }
duke@1 2800 }
duke@1 2801 }
duke@1 2802 JCMethodDecl result =
duke@1 2803 toP(F.at(pos).MethodDef(mods, name, type, typarams,
jjg@308 2804 params, receiverAnnotations, thrown,
duke@1 2805 body, defaultValue));
duke@1 2806 attach(result, dc);
duke@1 2807 return result;
duke@1 2808 }
duke@1 2809
jjg@308 2810 /** Parses the array levels after the format parameters list, and append
jjg@308 2811 * them to the return type, while preseving the order of type annotations
jjg@308 2812 */
jjg@308 2813 private JCExpression methodReturnArrayRest(JCExpression type) {
jjg@308 2814 if (type.getTag() != JCTree.TYPEARRAY)
jjg@308 2815 return bracketsOpt(type);
jjg@308 2816
jjg@308 2817 JCArrayTypeTree baseArray = (JCArrayTypeTree)type;
jjg@308 2818 while (TreeInfo.typeIn(baseArray.elemtype) instanceof JCArrayTypeTree)
jjg@308 2819 baseArray = (JCArrayTypeTree)TreeInfo.typeIn(baseArray.elemtype);
jjg@308 2820
jjg@308 2821 if (baseArray.elemtype.getTag() == JCTree.ANNOTATED_TYPE) {
jjg@308 2822 JCAnnotatedType at = (JCAnnotatedType)baseArray.elemtype;
jjg@308 2823 at.underlyingType = bracketsOpt(at.underlyingType);
jjg@308 2824 } else {
jjg@308 2825 baseArray.elemtype = bracketsOpt(baseArray.elemtype);
jjg@308 2826 }
jjg@308 2827
jjg@308 2828 return type;
jjg@308 2829 }
jjg@308 2830
jjg@308 2831 /** QualidentList = [Annotations] Qualident {"," [Annotations] Qualident}
duke@1 2832 */
duke@1 2833 List<JCExpression> qualidentList() {
duke@1 2834 ListBuffer<JCExpression> ts = new ListBuffer<JCExpression>();
jjg@308 2835
jjg@308 2836 List<JCTypeAnnotation> typeAnnos = typeAnnotationsOpt();
jjg@308 2837 if (!typeAnnos.isEmpty())
jjg@308 2838 ts.append(F.AnnotatedType(typeAnnos, qualident()));
jjg@308 2839 else
jjg@308 2840 ts.append(qualident());
duke@1 2841 while (S.token() == COMMA) {
duke@1 2842 S.nextToken();
jjg@308 2843
jjg@308 2844 typeAnnos = typeAnnotationsOpt();
jjg@308 2845 if (!typeAnnos.isEmpty())
jjg@308 2846 ts.append(F.AnnotatedType(typeAnnos, qualident()));
jjg@308 2847 else
jjg@308 2848 ts.append(qualident());
duke@1 2849 }
duke@1 2850 return ts.toList();
duke@1 2851 }
duke@1 2852
duke@1 2853 /** TypeParametersOpt = ["<" TypeParameter {"," TypeParameter} ">"]
duke@1 2854 */
duke@1 2855 List<JCTypeParameter> typeParametersOpt() {
duke@1 2856 if (S.token() == LT) {
duke@1 2857 checkGenerics();
duke@1 2858 ListBuffer<JCTypeParameter> typarams = new ListBuffer<JCTypeParameter>();
duke@1 2859 S.nextToken();
duke@1 2860 typarams.append(typeParameter());
duke@1 2861 while (S.token() == COMMA) {
duke@1 2862 S.nextToken();
duke@1 2863 typarams.append(typeParameter());
duke@1 2864 }
duke@1 2865 accept(GT);
duke@1 2866 return typarams.toList();
duke@1 2867 } else {
duke@1 2868 return List.nil();
duke@1 2869 }
duke@1 2870 }
duke@1 2871
jjg@308 2872 /** TypeParameter = [Annotations] TypeVariable [TypeParameterBound]
duke@1 2873 * TypeParameterBound = EXTENDS Type {"&" Type}
duke@1 2874 * TypeVariable = Ident
duke@1 2875 */
duke@1 2876 JCTypeParameter typeParameter() {
duke@1 2877 int pos = S.pos();
jjg@308 2878 List<JCTypeAnnotation> annos = typeAnnotationsOpt();
duke@1 2879 Name name = ident();
duke@1 2880 ListBuffer<JCExpression> bounds = new ListBuffer<JCExpression>();
duke@1 2881 if (S.token() == EXTENDS) {
duke@1 2882 S.nextToken();
jjg@111 2883 bounds.append(parseType());
duke@1 2884 while (S.token() == AMP) {
duke@1 2885 S.nextToken();
jjg@111 2886 bounds.append(parseType());
duke@1 2887 }
duke@1 2888 }
jjg@308 2889 return toP(F.at(pos).TypeParameter(name, bounds.toList(), annos));
duke@1 2890 }
duke@1 2891
duke@1 2892 /** FormalParameters = "(" [ FormalParameterList ] ")"
duke@1 2893 * FormalParameterList = [ FormalParameterListNovarargs , ] LastFormalParameter
duke@1 2894 * FormalParameterListNovarargs = [ FormalParameterListNovarargs , ] FormalParameter
duke@1 2895 */
duke@1 2896 List<JCVariableDecl> formalParameters() {
duke@1 2897 ListBuffer<JCVariableDecl> params = new ListBuffer<JCVariableDecl>();
duke@1 2898 JCVariableDecl lastParam = null;
duke@1 2899 accept(LPAREN);
duke@1 2900 if (S.token() != RPAREN) {
duke@1 2901 params.append(lastParam = formalParameter());
duke@1 2902 while ((lastParam.mods.flags & Flags.VARARGS) == 0 && S.token() == COMMA) {
duke@1 2903 S.nextToken();
duke@1 2904 params.append(lastParam = formalParameter());
duke@1 2905 }
duke@1 2906 }
duke@1 2907 accept(RPAREN);
duke@1 2908 return params.toList();
duke@1 2909 }
duke@1 2910
duke@1 2911 JCModifiers optFinal(long flags) {
duke@1 2912 JCModifiers mods = modifiersOpt();
duke@1 2913 checkNoMods(mods.flags & ~(Flags.FINAL | Flags.DEPRECATED));
duke@1 2914 mods.flags |= flags;
duke@1 2915 return mods;
duke@1 2916 }
duke@1 2917
duke@1 2918 /** FormalParameter = { FINAL | '@' Annotation } Type VariableDeclaratorId
duke@1 2919 * LastFormalParameter = { FINAL | '@' Annotation } Type '...' Ident | FormalParameter
duke@1 2920 */
duke@1 2921 JCVariableDecl formalParameter() {
duke@1 2922 JCModifiers mods = optFinal(Flags.PARAMETER);
jjg@308 2923 // need to distinguish between vararg annos and array annos
jjg@308 2924 // look at typeAnnotaitonsPushedBack comment
jjg@308 2925 this.permitTypeAnnotationsPushBack = true;
jjg@111 2926 JCExpression type = parseType();
jjg@308 2927 this.permitTypeAnnotationsPushBack = false;
jjg@308 2928
duke@1 2929 if (S.token() == ELLIPSIS) {
jjg@308 2930 List<JCTypeAnnotation> varargsAnnos = typeAnnotationsPushedBack;
jjg@308 2931 typeAnnotationsPushedBack = null;
duke@1 2932 checkVarargs();
duke@1 2933 mods.flags |= Flags.VARARGS;
jjg@308 2934 // insert var arg type annotations
jjg@308 2935 if (varargsAnnos != null && varargsAnnos.nonEmpty())
jjg@308 2936 type = F.at(S.pos()).AnnotatedType(varargsAnnos, type);
duke@1 2937 type = to(F.at(S.pos()).TypeArray(type));
jjg@308 2938
duke@1 2939 S.nextToken();
jjg@308 2940 } else {
jjg@308 2941 // if not a var arg, then typeAnnotationsPushedBack should be null
jjg@308 2942 if (typeAnnotationsPushedBack != null
jjg@308 2943 && !typeAnnotationsPushedBack.isEmpty()) {
jjg@308 2944 reportSyntaxError(typeAnnotationsPushedBack.head.pos,
jjg@308 2945 "illegal.start.of.type");
jjg@308 2946 }
jjg@308 2947 typeAnnotationsPushedBack = null;
duke@1 2948 }
duke@1 2949 return variableDeclaratorId(mods, type);
duke@1 2950 }
duke@1 2951
duke@1 2952 /* ---------- auxiliary methods -------------- */
duke@1 2953
duke@1 2954 /** Check that given tree is a legal expression statement.
duke@1 2955 */
duke@1 2956 protected JCExpression checkExprStat(JCExpression t) {
duke@1 2957 switch(t.getTag()) {
duke@1 2958 case JCTree.PREINC: case JCTree.PREDEC:
duke@1 2959 case JCTree.POSTINC: case JCTree.POSTDEC:
duke@1 2960 case JCTree.ASSIGN:
duke@1 2961 case JCTree.BITOR_ASG: case JCTree.BITXOR_ASG: case JCTree.BITAND_ASG:
duke@1 2962 case JCTree.SL_ASG: case JCTree.SR_ASG: case JCTree.USR_ASG:
duke@1 2963 case JCTree.PLUS_ASG: case JCTree.MINUS_ASG:
duke@1 2964 case JCTree.MUL_ASG: case JCTree.DIV_ASG: case JCTree.MOD_ASG:
duke@1 2965 case JCTree.APPLY: case JCTree.NEWCLASS:
duke@1 2966 case JCTree.ERRONEOUS:
duke@1 2967 return t;
duke@1 2968 default:
duke@1 2969 log.error(t.pos, "not.stmt");
duke@1 2970 return F.at(t.pos).Erroneous(List.<JCTree>of(t));
duke@1 2971 }
duke@1 2972 }
duke@1 2973
duke@1 2974 /** Return precedence of operator represented by token,
duke@1 2975 * -1 if token is not a binary operator. @see TreeInfo.opPrec
duke@1 2976 */
duke@1 2977 static int prec(Token token) {
duke@1 2978 int oc = optag(token);
duke@1 2979 return (oc >= 0) ? TreeInfo.opPrec(oc) : -1;
duke@1 2980 }
duke@1 2981
duke@1 2982 /** Return operation tag of binary operator represented by token,
duke@1 2983 * -1 if token is not a binary operator.
duke@1 2984 */
duke@1 2985 static int optag(Token token) {
duke@1 2986 switch (token) {
duke@1 2987 case BARBAR:
duke@1 2988 return JCTree.OR;
duke@1 2989 case AMPAMP:
duke@1 2990 return JCTree.AND;
duke@1 2991 case BAR:
duke@1 2992 return JCTree.BITOR;
duke@1 2993 case BAREQ:
duke@1 2994 return JCTree.BITOR_ASG;
duke@1 2995 case CARET:
duke@1 2996 return JCTree.BITXOR;
duke@1 2997 case CARETEQ:
duke@1 2998 return JCTree.BITXOR_ASG;
duke@1 2999 case AMP:
duke@1 3000 return JCTree.BITAND;
duke@1 3001 case AMPEQ:
duke@1 3002 return JCTree.BITAND_ASG;
duke@1 3003 case EQEQ:
duke@1 3004 return JCTree.EQ;
duke@1 3005 case BANGEQ:
duke@1 3006 return JCTree.NE;
duke@1 3007 case LT:
duke@1 3008 return JCTree.LT;
duke@1 3009 case GT:
duke@1 3010 return JCTree.GT;
duke@1 3011 case LTEQ:
duke@1 3012 return JCTree.LE;
duke@1 3013 case GTEQ:
duke@1 3014 return JCTree.GE;
duke@1 3015 case LTLT:
duke@1 3016 return JCTree.SL;
duke@1 3017 case LTLTEQ:
duke@1 3018 return JCTree.SL_ASG;
duke@1 3019 case GTGT:
duke@1 3020 return JCTree.SR;
duke@1 3021 case GTGTEQ:
duke@1 3022 return JCTree.SR_ASG;
duke@1 3023 case GTGTGT:
duke@1 3024 return JCTree.USR;
duke@1 3025 case GTGTGTEQ:
duke@1 3026 return JCTree.USR_ASG;
duke@1 3027 case PLUS:
duke@1 3028 return JCTree.PLUS;
duke@1 3029 case PLUSEQ:
duke@1 3030 return JCTree.PLUS_ASG;
duke@1 3031 case SUB:
duke@1 3032 return JCTree.MINUS;
duke@1 3033 case SUBEQ:
duke@1 3034 return JCTree.MINUS_ASG;
duke@1 3035 case STAR:
duke@1 3036 return JCTree.MUL;
duke@1 3037 case STAREQ:
duke@1 3038 return JCTree.MUL_ASG;
duke@1 3039 case SLASH:
duke@1 3040 return JCTree.DIV;
duke@1 3041 case SLASHEQ:
duke@1 3042 return JCTree.DIV_ASG;
duke@1 3043 case PERCENT:
duke@1 3044 return JCTree.MOD;
duke@1 3045 case PERCENTEQ:
duke@1 3046 return JCTree.MOD_ASG;
duke@1 3047 case INSTANCEOF:
duke@1 3048 return JCTree.TYPETEST;
duke@1 3049 default:
duke@1 3050 return -1;
duke@1 3051 }
duke@1 3052 }
duke@1 3053
duke@1 3054 /** Return operation tag of unary operator represented by token,
duke@1 3055 * -1 if token is not a binary operator.
duke@1 3056 */
duke@1 3057 static int unoptag(Token token) {
duke@1 3058 switch (token) {
duke@1 3059 case PLUS:
duke@1 3060 return JCTree.POS;
duke@1 3061 case SUB:
duke@1 3062 return JCTree.NEG;
duke@1 3063 case BANG:
duke@1 3064 return JCTree.NOT;
duke@1 3065 case TILDE:
duke@1 3066 return JCTree.COMPL;
duke@1 3067 case PLUSPLUS:
duke@1 3068 return JCTree.PREINC;
duke@1 3069 case SUBSUB:
duke@1 3070 return JCTree.PREDEC;
duke@1 3071 default:
duke@1 3072 return -1;
duke@1 3073 }
duke@1 3074 }
duke@1 3075
duke@1 3076 /** Return type tag of basic type represented by token,
duke@1 3077 * -1 if token is not a basic type identifier.
duke@1 3078 */
duke@1 3079 static int typetag(Token token) {
duke@1 3080 switch (token) {
duke@1 3081 case BYTE:
duke@1 3082 return TypeTags.BYTE;
duke@1 3083 case CHAR:
duke@1 3084 return TypeTags.CHAR;
duke@1 3085 case SHORT:
duke@1 3086 return TypeTags.SHORT;
duke@1 3087 case INT:
duke@1 3088 return TypeTags.INT;
duke@1 3089 case LONG:
duke@1 3090 return TypeTags.LONG;
duke@1 3091 case FLOAT:
duke@1 3092 return TypeTags.FLOAT;
duke@1 3093 case DOUBLE:
duke@1 3094 return TypeTags.DOUBLE;
duke@1 3095 case BOOLEAN:
duke@1 3096 return TypeTags.BOOLEAN;
duke@1 3097 default:
duke@1 3098 return -1;
duke@1 3099 }
duke@1 3100 }
duke@1 3101
duke@1 3102 void checkGenerics() {
duke@1 3103 if (!allowGenerics) {
duke@1 3104 log.error(S.pos(), "generics.not.supported.in.source", source.name);
duke@1 3105 allowGenerics = true;
duke@1 3106 }
duke@1 3107 }
duke@1 3108 void checkVarargs() {
duke@1 3109 if (!allowVarargs) {
duke@1 3110 log.error(S.pos(), "varargs.not.supported.in.source", source.name);
duke@1 3111 allowVarargs = true;
duke@1 3112 }
duke@1 3113 }
duke@1 3114 void checkForeach() {
duke@1 3115 if (!allowForeach) {
duke@1 3116 log.error(S.pos(), "foreach.not.supported.in.source", source.name);
duke@1 3117 allowForeach = true;
duke@1 3118 }
duke@1 3119 }
duke@1 3120 void checkStaticImports() {
duke@1 3121 if (!allowStaticImport) {
duke@1 3122 log.error(S.pos(), "static.import.not.supported.in.source", source.name);
duke@1 3123 allowStaticImport = true;
duke@1 3124 }
duke@1 3125 }
duke@1 3126 void checkAnnotations() {
duke@1 3127 if (!allowAnnotations) {
duke@1 3128 log.error(S.pos(), "annotations.not.supported.in.source", source.name);
duke@1 3129 allowAnnotations = true;
duke@1 3130 }
duke@1 3131 }
jjg@308 3132 void checkTypeAnnotations() {
jjg@308 3133 if (!allowTypeAnnotations) {
jjg@308 3134 log.error(S.pos(), "type.annotations.not.supported.in.source", source.name);
jjg@308 3135 allowTypeAnnotations = true;
jjg@308 3136 }
jjg@308 3137 }
duke@1 3138 }

mercurial