mirror of
https://github.com/openjdk/jdk.git
synced 2025-09-20 19:14:38 +02:00
Merge
This commit is contained in:
commit
0b862d6dc1
30 changed files with 1369 additions and 111 deletions
|
@ -0,0 +1,56 @@
|
||||||
|
/*
|
||||||
|
* Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved.
|
||||||
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
|
*
|
||||||
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
* under the terms of the GNU General Public License version 2 only, as
|
||||||
|
* published by the Free Software Foundation. Oracle designates this
|
||||||
|
* particular file as subject to the "Classpath" exception as provided
|
||||||
|
* by Oracle in the LICENSE file that accompanied this code.
|
||||||
|
*
|
||||||
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||||
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||||
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||||
|
* version 2 for more details (a copy is included in the LICENSE file that
|
||||||
|
* accompanied this code).
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License version
|
||||||
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||||
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||||
|
*
|
||||||
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||||
|
* or visit www.oracle.com if you need additional information or have any
|
||||||
|
* questions.
|
||||||
|
*/
|
||||||
|
|
||||||
|
package com.sun.source.tree;
|
||||||
|
|
||||||
|
import java.util.List;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* A tree node for a lambda expression.
|
||||||
|
*
|
||||||
|
* For example:
|
||||||
|
* <pre>
|
||||||
|
* ()->{}
|
||||||
|
* (List<String> ls)->ls.size()
|
||||||
|
* (x,y)-> { return x + y; }
|
||||||
|
* </pre>
|
||||||
|
*/
|
||||||
|
public interface LambdaExpressionTree extends ExpressionTree {
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Lambda expressions come in two forms: (i) expression lambdas, whose body
|
||||||
|
* is an expression, and (ii) statement lambdas, whose body is a block
|
||||||
|
*/
|
||||||
|
public enum BodyKind {
|
||||||
|
/** enum constant for expression lambdas */
|
||||||
|
EXPRESSION,
|
||||||
|
/** enum constant for statement lambdas */
|
||||||
|
STATEMENT;
|
||||||
|
}
|
||||||
|
|
||||||
|
List<? extends VariableTree> getParameters();
|
||||||
|
Tree getBody();
|
||||||
|
BodyKind getBodyKind();
|
||||||
|
}
|
|
@ -0,0 +1,58 @@
|
||||||
|
/*
|
||||||
|
* Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved.
|
||||||
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
|
*
|
||||||
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
* under the terms of the GNU General Public License version 2 only, as
|
||||||
|
* published by the Free Software Foundation. Oracle designates this
|
||||||
|
* particular file as subject to the "Classpath" exception as provided
|
||||||
|
* by Oracle in the LICENSE file that accompanied this code.
|
||||||
|
*
|
||||||
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||||
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||||
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||||
|
* version 2 for more details (a copy is included in the LICENSE file that
|
||||||
|
* accompanied this code).
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License version
|
||||||
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||||
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||||
|
*
|
||||||
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||||
|
* or visit www.oracle.com if you need additional information or have any
|
||||||
|
* questions.
|
||||||
|
*/
|
||||||
|
|
||||||
|
package com.sun.source.tree;
|
||||||
|
|
||||||
|
import java.util.List;
|
||||||
|
|
||||||
|
import javax.lang.model.element.Name;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* A tree node for a member reference expression.
|
||||||
|
*
|
||||||
|
* For example:
|
||||||
|
* <pre>
|
||||||
|
* <em>expression</em> # <em>[ identifier | new ]</em>
|
||||||
|
* </pre>
|
||||||
|
*
|
||||||
|
* @see JSR 292
|
||||||
|
*/
|
||||||
|
public interface MemberReferenceTree extends ExpressionTree {
|
||||||
|
|
||||||
|
/**
|
||||||
|
* There are two kinds of member references: (i) method references and
|
||||||
|
* (ii) constructor references
|
||||||
|
*/
|
||||||
|
public enum ReferenceMode {
|
||||||
|
/** enum constant for method references */
|
||||||
|
INVOKE,
|
||||||
|
/** enum constant for constructor references */
|
||||||
|
NEW
|
||||||
|
}
|
||||||
|
ReferenceMode getMode();
|
||||||
|
ExpressionTree getQualifierExpression();
|
||||||
|
Name getName();
|
||||||
|
List<? extends ExpressionTree> getTypeArguments();
|
||||||
|
}
|
|
@ -131,6 +131,11 @@ public interface Tree {
|
||||||
*/
|
*/
|
||||||
MEMBER_SELECT(MemberSelectTree.class),
|
MEMBER_SELECT(MemberSelectTree.class),
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Used for instances of {@link MemberReferenceTree}.
|
||||||
|
*/
|
||||||
|
MEMBER_REFERENCE(MemberReferenceTree.class),
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Used for instances of {@link ForLoopTree}.
|
* Used for instances of {@link ForLoopTree}.
|
||||||
*/
|
*/
|
||||||
|
@ -186,6 +191,11 @@ public interface Tree {
|
||||||
*/
|
*/
|
||||||
NEW_CLASS(NewClassTree.class),
|
NEW_CLASS(NewClassTree.class),
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Used for instances of {@link LambdaExpressionTree}.
|
||||||
|
*/
|
||||||
|
LAMBDA_EXPRESSION(LambdaExpressionTree.class),
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Used for instances of {@link ParenthesizedTree}.
|
* Used for instances of {@link ParenthesizedTree}.
|
||||||
*/
|
*/
|
||||||
|
|
|
@ -85,9 +85,11 @@ public interface TreeVisitor<R,P> {
|
||||||
R visitModifiers(ModifiersTree node, P p);
|
R visitModifiers(ModifiersTree node, P p);
|
||||||
R visitNewArray(NewArrayTree node, P p);
|
R visitNewArray(NewArrayTree node, P p);
|
||||||
R visitNewClass(NewClassTree node, P p);
|
R visitNewClass(NewClassTree node, P p);
|
||||||
|
R visitLambdaExpression(LambdaExpressionTree node, P p);
|
||||||
R visitParenthesized(ParenthesizedTree node, P p);
|
R visitParenthesized(ParenthesizedTree node, P p);
|
||||||
R visitReturn(ReturnTree node, P p);
|
R visitReturn(ReturnTree node, P p);
|
||||||
R visitMemberSelect(MemberSelectTree node, P p);
|
R visitMemberSelect(MemberSelectTree node, P p);
|
||||||
|
R visitMemberReference(MemberReferenceTree node, P p);
|
||||||
R visitEmptyStatement(EmptyStatementTree node, P p);
|
R visitEmptyStatement(EmptyStatementTree node, P p);
|
||||||
R visitSwitch(SwitchTree node, P p);
|
R visitSwitch(SwitchTree node, P p);
|
||||||
R visitSynchronized(SynchronizedTree node, P p);
|
R visitSynchronized(SynchronizedTree node, P p);
|
||||||
|
|
|
@ -172,6 +172,10 @@ public class SimpleTreeVisitor <R,P> implements TreeVisitor<R,P> {
|
||||||
return defaultAction(node, p);
|
return defaultAction(node, p);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public R visitLambdaExpression(LambdaExpressionTree node, P p) {
|
||||||
|
return defaultAction(node, p);
|
||||||
|
}
|
||||||
|
|
||||||
public R visitParenthesized(ParenthesizedTree node, P p) {
|
public R visitParenthesized(ParenthesizedTree node, P p) {
|
||||||
return defaultAction(node, p);
|
return defaultAction(node, p);
|
||||||
}
|
}
|
||||||
|
@ -208,6 +212,10 @@ public class SimpleTreeVisitor <R,P> implements TreeVisitor<R,P> {
|
||||||
return defaultAction(node, p);
|
return defaultAction(node, p);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public R visitMemberReference(MemberReferenceTree node, P p) {
|
||||||
|
return defaultAction(node, p);
|
||||||
|
}
|
||||||
|
|
||||||
public R visitIdentifier(IdentifierTree node, P p) {
|
public R visitIdentifier(IdentifierTree node, P p) {
|
||||||
return defaultAction(node, p);
|
return defaultAction(node, p);
|
||||||
}
|
}
|
||||||
|
|
|
@ -285,6 +285,12 @@ public class TreeScanner<R,P> implements TreeVisitor<R,P> {
|
||||||
return r;
|
return r;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public R visitLambdaExpression(LambdaExpressionTree node, P p) {
|
||||||
|
R r = scan(node.getParameters(), p);
|
||||||
|
r = scanAndReduce(node.getBody(), p, r);
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
public R visitParenthesized(ParenthesizedTree node, P p) {
|
public R visitParenthesized(ParenthesizedTree node, P p) {
|
||||||
return scan(node.getExpression(), p);
|
return scan(node.getExpression(), p);
|
||||||
}
|
}
|
||||||
|
@ -333,6 +339,12 @@ public class TreeScanner<R,P> implements TreeVisitor<R,P> {
|
||||||
return scan(node.getExpression(), p);
|
return scan(node.getExpression(), p);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public R visitMemberReference(MemberReferenceTree node, P p) {
|
||||||
|
R r = scan(node.getQualifierExpression(), p);
|
||||||
|
r = scanAndReduce(node.getTypeArguments(), p, r);
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
public R visitIdentifier(IdentifierTree node, P p) {
|
public R visitIdentifier(IdentifierTree node, P p) {
|
||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
|
@ -194,6 +194,12 @@ public enum Source {
|
||||||
public boolean allowObjectToPrimitiveCast() {
|
public boolean allowObjectToPrimitiveCast() {
|
||||||
return compareTo(JDK1_7) >= 0;
|
return compareTo(JDK1_7) >= 0;
|
||||||
}
|
}
|
||||||
|
public boolean allowLambda() {
|
||||||
|
return compareTo(JDK1_8) >= 0;
|
||||||
|
}
|
||||||
|
public boolean allowMethodReferences() {
|
||||||
|
return compareTo(JDK1_8) >= 0;
|
||||||
|
}
|
||||||
public static SourceVersion toSourceVersion(Source source) {
|
public static SourceVersion toSourceVersion(Source source) {
|
||||||
switch(source) {
|
switch(source) {
|
||||||
case JDK1_2:
|
case JDK1_2:
|
||||||
|
|
|
@ -1975,6 +1975,16 @@ public class Attr extends JCTree.Visitor {
|
||||||
result = check(tree, owntype, VAL, pkind, pt);
|
result = check(tree, owntype, VAL, pkind, pt);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@Override
|
||||||
|
public void visitLambda(JCLambda that) {
|
||||||
|
throw new UnsupportedOperationException("Lambda expression not supported yet");
|
||||||
|
}
|
||||||
|
|
||||||
|
@Override
|
||||||
|
public void visitReference(JCMemberReference that) {
|
||||||
|
throw new UnsupportedOperationException("Member references not supported yet");
|
||||||
|
}
|
||||||
|
|
||||||
public void visitParens(JCParens tree) {
|
public void visitParens(JCParens tree) {
|
||||||
Type owntype = attribTree(tree.expr, env, pkind, pt);
|
Type owntype = attribTree(tree.expr, env, pkind, pt);
|
||||||
result = check(tree, owntype, pkind, pkind, pt);
|
result = check(tree, owntype, pkind, pkind, pt);
|
||||||
|
|
|
@ -637,6 +637,10 @@ public class JavaTokenizer {
|
||||||
lexError(pos, "unclosed.str.lit");
|
lexError(pos, "unclosed.str.lit");
|
||||||
}
|
}
|
||||||
break loop;
|
break loop;
|
||||||
|
case '#':
|
||||||
|
reader.scanChar();
|
||||||
|
tk = TokenKind.HASH;
|
||||||
|
break loop;
|
||||||
default:
|
default:
|
||||||
if (isSpecial(reader.ch)) {
|
if (isSpecial(reader.ch)) {
|
||||||
scanOperator();
|
scanOperator();
|
||||||
|
|
|
@ -27,6 +27,8 @@ package com.sun.tools.javac.parser;
|
||||||
|
|
||||||
import java.util.*;
|
import java.util.*;
|
||||||
|
|
||||||
|
import com.sun.source.tree.MemberReferenceTree.ReferenceMode;
|
||||||
|
|
||||||
import com.sun.tools.javac.code.*;
|
import com.sun.tools.javac.code.*;
|
||||||
import com.sun.tools.javac.parser.Tokens.*;
|
import com.sun.tools.javac.parser.Tokens.*;
|
||||||
import com.sun.tools.javac.parser.Tokens.Comment.CommentStyle;
|
import com.sun.tools.javac.parser.Tokens.Comment.CommentStyle;
|
||||||
|
@ -110,6 +112,10 @@ public class JavacParser implements Parser {
|
||||||
this.allowDiamond = source.allowDiamond();
|
this.allowDiamond = source.allowDiamond();
|
||||||
this.allowMulticatch = source.allowMulticatch();
|
this.allowMulticatch = source.allowMulticatch();
|
||||||
this.allowStringFolding = fac.options.getBoolean("allowStringFolding", true);
|
this.allowStringFolding = fac.options.getBoolean("allowStringFolding", true);
|
||||||
|
this.allowLambda = source.allowLambda() &&
|
||||||
|
fac.options.isSet("allowLambda");
|
||||||
|
this.allowMethodReferences = source.allowMethodReferences() &&
|
||||||
|
fac.options.isSet("allowMethodReferences");
|
||||||
this.keepDocComments = keepDocComments;
|
this.keepDocComments = keepDocComments;
|
||||||
docComments = keepDocComments ? new HashMap<JCTree,String>() : null;
|
docComments = keepDocComments ? new HashMap<JCTree,String>() : null;
|
||||||
this.keepLineMap = keepLineMap;
|
this.keepLineMap = keepLineMap;
|
||||||
|
@ -166,6 +172,14 @@ public class JavacParser implements Parser {
|
||||||
*/
|
*/
|
||||||
boolean allowStringFolding;
|
boolean allowStringFolding;
|
||||||
|
|
||||||
|
/** Switch: should we recognize lambda expressions?
|
||||||
|
*/
|
||||||
|
boolean allowLambda;
|
||||||
|
|
||||||
|
/** Switch: should we allow method/constructor references?
|
||||||
|
*/
|
||||||
|
boolean allowMethodReferences;
|
||||||
|
|
||||||
/** Switch: should we keep docComments?
|
/** Switch: should we keep docComments?
|
||||||
*/
|
*/
|
||||||
boolean keepDocComments;
|
boolean keepDocComments;
|
||||||
|
@ -203,6 +217,30 @@ public class JavacParser implements Parser {
|
||||||
token = S.token();
|
token = S.token();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
protected boolean peekToken(TokenKind tk) {
|
||||||
|
return S.token(1).kind == tk;
|
||||||
|
}
|
||||||
|
|
||||||
|
protected boolean peekToken(TokenKind tk1, TokenKind tk2) {
|
||||||
|
return S.token(1).kind == tk1 &&
|
||||||
|
S.token(2).kind == tk2;
|
||||||
|
}
|
||||||
|
|
||||||
|
protected boolean peekToken(TokenKind tk1, TokenKind tk2, TokenKind tk3) {
|
||||||
|
return S.token(1).kind == tk1 &&
|
||||||
|
S.token(2).kind == tk2 &&
|
||||||
|
S.token(3).kind == tk3;
|
||||||
|
}
|
||||||
|
|
||||||
|
protected boolean peekToken(TokenKind... kinds) {
|
||||||
|
for (int lookahead = 0 ; lookahead < kinds.length ; lookahead++) {
|
||||||
|
if (S.token(lookahead + 1).kind != kinds[lookahead]) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
/* ---------- error recovery -------------- */
|
/* ---------- error recovery -------------- */
|
||||||
|
|
||||||
private JCErroneous errorTree;
|
private JCErroneous errorTree;
|
||||||
|
@ -749,7 +787,7 @@ public class JavacParser implements Parser {
|
||||||
top++;
|
top++;
|
||||||
topOp = token;
|
topOp = token;
|
||||||
nextToken();
|
nextToken();
|
||||||
odStack[top] = (topOp.kind == INSTANCEOF) ? parseType() : term3();
|
odStack[top] = (topOp.kind == INSTANCEOF) ? parseType() : term3NoParams();
|
||||||
while (top > 0 && prec(topOp.kind) >= prec(token.kind)) {
|
while (top > 0 && prec(topOp.kind) >= prec(token.kind)) {
|
||||||
odStack[top-1] = makeOp(topOp.pos, topOp.kind, odStack[top-1],
|
odStack[top-1] = makeOp(topOp.pos, topOp.kind, odStack[top-1],
|
||||||
odStack[top]);
|
odStack[top]);
|
||||||
|
@ -849,7 +887,10 @@ public class JavacParser implements Parser {
|
||||||
* | [TypeArguments] THIS [Arguments]
|
* | [TypeArguments] THIS [Arguments]
|
||||||
* | [TypeArguments] SUPER SuperSuffix
|
* | [TypeArguments] SUPER SuperSuffix
|
||||||
* | NEW [TypeArguments] Creator
|
* | NEW [TypeArguments] Creator
|
||||||
|
* | "(" Arguments ")" "->" ( Expression | Block )
|
||||||
|
* | Ident "->" ( Expression | Block )
|
||||||
* | Ident { "." Ident }
|
* | Ident { "." Ident }
|
||||||
|
* | Expression3 MemberReferenceSuffix
|
||||||
* [ "[" ( "]" BracketsOpt "." CLASS | Expression "]" )
|
* [ "[" ( "]" BracketsOpt "." CLASS | Expression "]" )
|
||||||
* | Arguments
|
* | Arguments
|
||||||
* | "." ( CLASS | THIS | [TypeArguments] SUPER Arguments | NEW [TypeArguments] InnerCreator )
|
* | "." ( CLASS | THIS | [TypeArguments] SUPER Arguments | NEW [TypeArguments] InnerCreator )
|
||||||
|
@ -890,60 +931,87 @@ public class JavacParser implements Parser {
|
||||||
mode = EXPR;
|
mode = EXPR;
|
||||||
t = literal(names.hyphen, pos);
|
t = literal(names.hyphen, pos);
|
||||||
} else {
|
} else {
|
||||||
t = term3();
|
t = term3NoParams();
|
||||||
return F.at(pos).Unary(unoptag(tk), t);
|
return F.at(pos).Unary(unoptag(tk), t);
|
||||||
}
|
}
|
||||||
} else return illegal();
|
} else return illegal();
|
||||||
break;
|
break;
|
||||||
case LPAREN:
|
case LPAREN:
|
||||||
if (typeArgs == null && (mode & EXPR) != 0) {
|
if (typeArgs == null && (mode & EXPR) != 0) {
|
||||||
nextToken();
|
if (peekToken(FINAL) ||
|
||||||
mode = EXPR | TYPE | NOPARAMS;
|
peekToken(RPAREN) ||
|
||||||
t = term3();
|
peekToken(IDENTIFIER, COMMA) ||
|
||||||
if ((mode & TYPE) != 0 && token.kind == LT) {
|
peekToken(IDENTIFIER, RPAREN, ARROW)) {
|
||||||
// Could be a cast to a parameterized type
|
//implicit n-ary lambda
|
||||||
JCTree.Tag op = JCTree.Tag.LT;
|
t = lambdaExpressionOrStatement(true, peekToken(FINAL), pos);
|
||||||
int pos1 = token.pos;
|
break;
|
||||||
|
} else {
|
||||||
nextToken();
|
nextToken();
|
||||||
mode &= (EXPR | TYPE);
|
mode = EXPR | TYPE;
|
||||||
mode |= TYPEARG;
|
t = term3NoParams();
|
||||||
JCExpression t1 = term3();
|
if ((mode & TYPE) != 0 && token.kind == LT) {
|
||||||
if ((mode & TYPE) != 0 &&
|
// Could be a cast to a parameterized type
|
||||||
(token.kind == COMMA || token.kind == GT)) {
|
JCTree.Tag op = JCTree.Tag.LT;
|
||||||
mode = TYPE;
|
int pos1 = token.pos;
|
||||||
ListBuffer<JCExpression> args = new ListBuffer<JCExpression>();
|
nextToken();
|
||||||
args.append(t1);
|
mode &= (EXPR | TYPE);
|
||||||
while (token.kind == COMMA) {
|
mode |= TYPEARG;
|
||||||
nextToken();
|
JCExpression t1 = term3();
|
||||||
args.append(typeArgument());
|
if ((mode & TYPE) != 0 &&
|
||||||
}
|
(token.kind == COMMA || token.kind == GT)) {
|
||||||
accept(GT);
|
|
||||||
t = toP(F.at(pos1).TypeApply(t, args.toList()));
|
|
||||||
checkGenerics();
|
|
||||||
while (token.kind == DOT) {
|
|
||||||
nextToken();
|
|
||||||
mode = TYPE;
|
mode = TYPE;
|
||||||
t = toP(F.at(token.pos).Select(t, ident()));
|
ListBuffer<JCExpression> args = new ListBuffer<JCExpression>();
|
||||||
t = typeArgumentsOpt(t);
|
args.append(t1);
|
||||||
|
while (token.kind == COMMA) {
|
||||||
|
nextToken();
|
||||||
|
args.append(typeArgument());
|
||||||
|
}
|
||||||
|
accept(GT);
|
||||||
|
t = toP(F.at(pos1).TypeApply(t, args.toList()));
|
||||||
|
checkGenerics();
|
||||||
|
mode = EXPR | TYPE; //could be a lambda or a method ref or a cast to a type
|
||||||
|
t = term3Rest(t, typeArgs);
|
||||||
|
if (token.kind == IDENTIFIER || token.kind == ELLIPSIS) {
|
||||||
|
//explicit lambda (w/ generic type)
|
||||||
|
mode = EXPR;
|
||||||
|
JCModifiers mods = F.at(token.pos).Modifiers(Flags.PARAMETER);
|
||||||
|
if (token.kind == ELLIPSIS) {
|
||||||
|
mods.flags = Flags.VARARGS;
|
||||||
|
t = to(F.at(token.pos).TypeArray(t));
|
||||||
|
nextToken();
|
||||||
|
}
|
||||||
|
t = lambdaExpressionOrStatement(variableDeclaratorId(mods, t), pos);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
Assert.check((mode & EXPR) != 0);
|
||||||
|
mode = EXPR;
|
||||||
|
JCExpression e = term2Rest(t1, TreeInfo.shiftPrec);
|
||||||
|
t = F.at(pos1).Binary(op, t, e);
|
||||||
|
t = termRest(term1Rest(term2Rest(t, TreeInfo.orPrec)));
|
||||||
}
|
}
|
||||||
t = bracketsOpt(toP(t));
|
} else if ((mode & TYPE) != 0 &&
|
||||||
} else if ((mode & EXPR) != 0) {
|
(token.kind == IDENTIFIER || token.kind == ELLIPSIS)) {
|
||||||
|
//explicit lambda (w/ non-generic type)
|
||||||
mode = EXPR;
|
mode = EXPR;
|
||||||
JCExpression e = term2Rest(t1, TreeInfo.shiftPrec);
|
JCModifiers mods = F.at(token.pos).Modifiers(Flags.PARAMETER);
|
||||||
t = F.at(pos1).Binary(op, t, e);
|
if (token.kind == ELLIPSIS) {
|
||||||
t = termRest(term1Rest(term2Rest(t, TreeInfo.orPrec)));
|
mods.flags = Flags.VARARGS;
|
||||||
|
t = to(F.at(token.pos).TypeArray(t));
|
||||||
|
nextToken();
|
||||||
|
}
|
||||||
|
t = lambdaExpressionOrStatement(variableDeclaratorId(mods, t), pos);
|
||||||
|
break;
|
||||||
} else {
|
} else {
|
||||||
accept(GT);
|
t = termRest(term1Rest(term2Rest(t, TreeInfo.orPrec)));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
else {
|
|
||||||
t = termRest(term1Rest(term2Rest(t, TreeInfo.orPrec)));
|
|
||||||
}
|
|
||||||
accept(RPAREN);
|
accept(RPAREN);
|
||||||
lastmode = mode;
|
lastmode = mode;
|
||||||
mode = EXPR;
|
mode = EXPR;
|
||||||
if ((lastmode & EXPR) == 0) {
|
if ((lastmode & EXPR) == 0) {
|
||||||
JCExpression t1 = term3();
|
JCExpression t1 = term3NoParams();
|
||||||
return F.at(pos).TypeCast(t, t1);
|
return F.at(pos).TypeCast(t, t1);
|
||||||
} else if ((lastmode & TYPE) != 0) {
|
} else if ((lastmode & TYPE) != 0) {
|
||||||
switch (token.kind) {
|
switch (token.kind) {
|
||||||
|
@ -953,14 +1021,16 @@ public class JavacParser implements Parser {
|
||||||
case INTLITERAL: case LONGLITERAL: case FLOATLITERAL:
|
case INTLITERAL: case LONGLITERAL: case FLOATLITERAL:
|
||||||
case DOUBLELITERAL: case CHARLITERAL: case STRINGLITERAL:
|
case DOUBLELITERAL: case CHARLITERAL: case STRINGLITERAL:
|
||||||
case TRUE: case FALSE: case NULL:
|
case TRUE: case FALSE: case NULL:
|
||||||
case NEW: case IDENTIFIER: case ASSERT: case ENUM:
|
case NEW: case IDENTIFIER: case ASSERT: case ENUM:
|
||||||
case BYTE: case SHORT: case CHAR: case INT:
|
case BYTE: case SHORT: case CHAR: case INT:
|
||||||
case LONG: case FLOAT: case DOUBLE: case BOOLEAN: case VOID:
|
case LONG: case FLOAT: case DOUBLE: case BOOLEAN: case VOID:
|
||||||
JCExpression t1 = term3();
|
JCExpression t1 = term3NoParams();
|
||||||
return F.at(pos).TypeCast(t, t1);
|
return F.at(pos).TypeCast(t, t1);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
} else return illegal();
|
} else {
|
||||||
|
return illegal();
|
||||||
|
}
|
||||||
t = toP(F.at(pos).Parens(t));
|
t = toP(F.at(pos).Parens(t));
|
||||||
break;
|
break;
|
||||||
case THIS:
|
case THIS:
|
||||||
|
@ -1003,75 +1073,122 @@ public class JavacParser implements Parser {
|
||||||
break;
|
break;
|
||||||
case IDENTIFIER: case ASSERT: case ENUM:
|
case IDENTIFIER: case ASSERT: case ENUM:
|
||||||
if (typeArgs != null) return illegal();
|
if (typeArgs != null) return illegal();
|
||||||
t = toP(F.at(token.pos).Ident(ident()));
|
if ((mode & EXPR) != 0 && peekToken(ARROW)) {
|
||||||
loop: while (true) {
|
t = lambdaExpressionOrStatement(false, false, pos);
|
||||||
pos = token.pos;
|
} else {
|
||||||
switch (token.kind) {
|
t = toP(F.at(token.pos).Ident(ident()));
|
||||||
case LBRACKET:
|
loop: while (true) {
|
||||||
nextToken();
|
pos = token.pos;
|
||||||
if (token.kind == RBRACKET) {
|
switch (token.kind) {
|
||||||
|
case LBRACKET:
|
||||||
nextToken();
|
nextToken();
|
||||||
t = bracketsOpt(t);
|
if (token.kind == RBRACKET) {
|
||||||
t = toP(F.at(pos).TypeArray(t));
|
nextToken();
|
||||||
t = bracketsSuffix(t);
|
t = bracketsOpt(t);
|
||||||
} else {
|
t = toP(F.at(pos).TypeArray(t));
|
||||||
|
t = bracketsSuffix(t);
|
||||||
|
} else {
|
||||||
|
if ((mode & EXPR) != 0) {
|
||||||
|
mode = EXPR;
|
||||||
|
JCExpression t1 = term();
|
||||||
|
t = to(F.at(pos).Indexed(t, t1));
|
||||||
|
}
|
||||||
|
accept(RBRACKET);
|
||||||
|
}
|
||||||
|
break loop;
|
||||||
|
case LPAREN:
|
||||||
if ((mode & EXPR) != 0) {
|
if ((mode & EXPR) != 0) {
|
||||||
mode = EXPR;
|
mode = EXPR;
|
||||||
JCExpression t1 = term();
|
t = arguments(typeArgs, t);
|
||||||
t = to(F.at(pos).Indexed(t, t1));
|
|
||||||
}
|
|
||||||
accept(RBRACKET);
|
|
||||||
}
|
|
||||||
break loop;
|
|
||||||
case LPAREN:
|
|
||||||
if ((mode & EXPR) != 0) {
|
|
||||||
mode = EXPR;
|
|
||||||
t = arguments(typeArgs, t);
|
|
||||||
typeArgs = null;
|
|
||||||
}
|
|
||||||
break loop;
|
|
||||||
case DOT:
|
|
||||||
nextToken();
|
|
||||||
int oldmode = mode;
|
|
||||||
mode &= ~NOPARAMS;
|
|
||||||
typeArgs = typeArgumentsOpt(EXPR);
|
|
||||||
mode = oldmode;
|
|
||||||
if ((mode & EXPR) != 0) {
|
|
||||||
switch (token.kind) {
|
|
||||||
case CLASS:
|
|
||||||
if (typeArgs != null) return illegal();
|
|
||||||
mode = EXPR;
|
|
||||||
t = to(F.at(pos).Select(t, names._class));
|
|
||||||
nextToken();
|
|
||||||
break loop;
|
|
||||||
case THIS:
|
|
||||||
if (typeArgs != null) return illegal();
|
|
||||||
mode = EXPR;
|
|
||||||
t = to(F.at(pos).Select(t, names._this));
|
|
||||||
nextToken();
|
|
||||||
break loop;
|
|
||||||
case SUPER:
|
|
||||||
mode = EXPR;
|
|
||||||
t = to(F.at(pos).Select(t, names._super));
|
|
||||||
t = superSuffix(typeArgs, t);
|
|
||||||
typeArgs = null;
|
typeArgs = null;
|
||||||
break loop;
|
}
|
||||||
case NEW:
|
break loop;
|
||||||
if (typeArgs != null) return illegal();
|
case DOT:
|
||||||
mode = EXPR;
|
nextToken();
|
||||||
|
int oldmode = mode;
|
||||||
|
mode &= ~NOPARAMS;
|
||||||
|
typeArgs = typeArgumentsOpt(EXPR);
|
||||||
|
mode = oldmode;
|
||||||
|
if ((mode & EXPR) != 0) {
|
||||||
|
switch (token.kind) {
|
||||||
|
case CLASS:
|
||||||
|
if (typeArgs != null) return illegal();
|
||||||
|
mode = EXPR;
|
||||||
|
t = to(F.at(pos).Select(t, names._class));
|
||||||
|
nextToken();
|
||||||
|
break loop;
|
||||||
|
case THIS:
|
||||||
|
if (typeArgs != null) return illegal();
|
||||||
|
mode = EXPR;
|
||||||
|
t = to(F.at(pos).Select(t, names._this));
|
||||||
|
nextToken();
|
||||||
|
break loop;
|
||||||
|
case SUPER:
|
||||||
|
mode = EXPR;
|
||||||
|
t = to(F.at(pos).Select(t, names._super));
|
||||||
|
t = superSuffix(typeArgs, t);
|
||||||
|
typeArgs = null;
|
||||||
|
break loop;
|
||||||
|
case NEW:
|
||||||
|
if (typeArgs != null) return illegal();
|
||||||
|
mode = EXPR;
|
||||||
|
int pos1 = token.pos;
|
||||||
|
nextToken();
|
||||||
|
if (token.kind == LT) typeArgs = typeArguments(false);
|
||||||
|
t = innerCreator(pos1, typeArgs, t);
|
||||||
|
typeArgs = null;
|
||||||
|
break loop;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// typeArgs saved for next loop iteration.
|
||||||
|
t = toP(F.at(pos).Select(t, ident()));
|
||||||
|
break;
|
||||||
|
case LT:
|
||||||
|
if ((mode & (TYPE | NOPARAMS)) == 0) {
|
||||||
|
//could be an unbound method reference whose qualifier
|
||||||
|
//is a generic type i.e. A<S>#m
|
||||||
|
mode = EXPR | TYPE;
|
||||||
|
JCTree.Tag op = JCTree.Tag.LT;
|
||||||
int pos1 = token.pos;
|
int pos1 = token.pos;
|
||||||
nextToken();
|
nextToken();
|
||||||
if (token.kind == LT) typeArgs = typeArguments(false);
|
mode |= EXPR | TYPE | TYPEARG;
|
||||||
t = innerCreator(pos1, typeArgs, t);
|
JCExpression t1 = term3();
|
||||||
typeArgs = null;
|
if ((mode & TYPE) != 0 &&
|
||||||
break loop;
|
(token.kind == COMMA || token.kind == GT)) {
|
||||||
|
mode = TYPE;
|
||||||
|
ListBuffer<JCExpression> args = new ListBuffer<JCExpression>();
|
||||||
|
args.append(t1);
|
||||||
|
while (token.kind == COMMA) {
|
||||||
|
nextToken();
|
||||||
|
args.append(typeArgument());
|
||||||
|
}
|
||||||
|
accept(GT);
|
||||||
|
t = toP(F.at(pos1).TypeApply(t, args.toList()));
|
||||||
|
checkGenerics();
|
||||||
|
while (token.kind == DOT) {
|
||||||
|
nextToken();
|
||||||
|
mode = TYPE;
|
||||||
|
t = toP(F.at(token.pos).Select(t, ident()));
|
||||||
|
t = typeArgumentsOpt(t);
|
||||||
|
}
|
||||||
|
if (token.kind != HASH) {
|
||||||
|
//method reference expected here
|
||||||
|
t = illegal();
|
||||||
|
}
|
||||||
|
mode = EXPR;
|
||||||
|
break;
|
||||||
|
} else if ((mode & EXPR) != 0) {
|
||||||
|
//rollback - it was a binary expression
|
||||||
|
mode = EXPR;
|
||||||
|
JCExpression e = term2Rest(t1, TreeInfo.shiftPrec);
|
||||||
|
t = F.at(pos1).Binary(op, t, e);
|
||||||
|
t = termRest(term1Rest(term2Rest(t, TreeInfo.orPrec)));
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
break loop;
|
||||||
|
default:
|
||||||
|
break loop;
|
||||||
}
|
}
|
||||||
// typeArgs saved for next loop iteration.
|
|
||||||
t = toP(F.at(pos).Select(t, ident()));
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
break loop;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if (typeArgs != null) illegal();
|
if (typeArgs != null) illegal();
|
||||||
|
@ -1105,6 +1222,19 @@ public class JavacParser implements Parser {
|
||||||
default:
|
default:
|
||||||
return illegal();
|
return illegal();
|
||||||
}
|
}
|
||||||
|
return term3Rest(t, typeArgs);
|
||||||
|
}
|
||||||
|
|
||||||
|
JCExpression term3NoParams() {
|
||||||
|
try {
|
||||||
|
mode |= NOPARAMS;
|
||||||
|
return term3();
|
||||||
|
} finally {
|
||||||
|
mode &= ~NOPARAMS;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
JCExpression term3Rest(JCExpression t, List<JCExpression> typeArgs) {
|
||||||
if (typeArgs != null) illegal();
|
if (typeArgs != null) illegal();
|
||||||
while (true) {
|
while (true) {
|
||||||
int pos1 = token.pos;
|
int pos1 = token.pos;
|
||||||
|
@ -1149,6 +1279,11 @@ public class JavacParser implements Parser {
|
||||||
t = argumentsOpt(typeArgs, typeArgumentsOpt(t));
|
t = argumentsOpt(typeArgs, typeArgumentsOpt(t));
|
||||||
typeArgs = null;
|
typeArgs = null;
|
||||||
}
|
}
|
||||||
|
} else if ((mode & EXPR) != 0 && token.kind == HASH) {
|
||||||
|
mode = EXPR;
|
||||||
|
if (typeArgs != null) return illegal();
|
||||||
|
accept(HASH);
|
||||||
|
t = memberReferenceSuffix(pos1, t);
|
||||||
} else {
|
} else {
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
@ -1162,12 +1297,59 @@ public class JavacParser implements Parser {
|
||||||
return toP(t);
|
return toP(t);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
JCExpression lambdaExpressionOrStatement(JCVariableDecl firstParam, int pos) {
|
||||||
|
ListBuffer<JCVariableDecl> params = new ListBuffer<JCVariableDecl>();
|
||||||
|
params.append(firstParam);
|
||||||
|
JCVariableDecl lastParam = firstParam;
|
||||||
|
while ((lastParam.mods.flags & Flags.VARARGS) == 0 && token.kind == COMMA) {
|
||||||
|
nextToken();
|
||||||
|
params.append(lastParam = formalParameter());
|
||||||
|
}
|
||||||
|
accept(RPAREN);
|
||||||
|
return lambdaExpressionOrStatementRest(params.toList(), pos);
|
||||||
|
}
|
||||||
|
|
||||||
|
JCExpression lambdaExpressionOrStatement(boolean hasParens, boolean explicitParams, int pos) {
|
||||||
|
List<JCVariableDecl> params = explicitParams ?
|
||||||
|
formalParameters() :
|
||||||
|
implicitParameters(hasParens);
|
||||||
|
|
||||||
|
return lambdaExpressionOrStatementRest(params, pos);
|
||||||
|
}
|
||||||
|
|
||||||
|
JCExpression lambdaExpressionOrStatementRest(List<JCVariableDecl> args, int pos) {
|
||||||
|
if (token.kind != ARROW) {
|
||||||
|
//better error recovery
|
||||||
|
return F.at(pos).Erroneous(args);
|
||||||
|
}
|
||||||
|
|
||||||
|
checkLambda();
|
||||||
|
accept(ARROW);
|
||||||
|
|
||||||
|
return token.kind == LBRACE ?
|
||||||
|
lambdaStatement(args, pos, pos) :
|
||||||
|
lambdaExpression(args, pos);
|
||||||
|
}
|
||||||
|
|
||||||
|
JCExpression lambdaStatement(List<JCVariableDecl> args, int pos, int pos2) {
|
||||||
|
JCBlock block = block(pos2, 0);
|
||||||
|
return toP(F.at(pos).Lambda(args, block));
|
||||||
|
}
|
||||||
|
|
||||||
|
JCExpression lambdaExpression(List<JCVariableDecl> args, int pos) {
|
||||||
|
JCTree expr = parseExpression();
|
||||||
|
return toP(F.at(pos).Lambda(args, expr));
|
||||||
|
}
|
||||||
|
|
||||||
/** SuperSuffix = Arguments | "." [TypeArguments] Ident [Arguments]
|
/** SuperSuffix = Arguments | "." [TypeArguments] Ident [Arguments]
|
||||||
*/
|
*/
|
||||||
JCExpression superSuffix(List<JCExpression> typeArgs, JCExpression t) {
|
JCExpression superSuffix(List<JCExpression> typeArgs, JCExpression t) {
|
||||||
nextToken();
|
nextToken();
|
||||||
if (token.kind == LPAREN || typeArgs != null) {
|
if (token.kind == LPAREN || typeArgs != null) {
|
||||||
t = arguments(typeArgs, t);
|
t = arguments(typeArgs, t);
|
||||||
|
} else if (token.kind == HASH) {
|
||||||
|
if (typeArgs != null) return illegal();
|
||||||
|
t = memberReferenceSuffix(t);
|
||||||
} else {
|
} else {
|
||||||
int pos = token.pos;
|
int pos = token.pos;
|
||||||
accept(DOT);
|
accept(DOT);
|
||||||
|
@ -1377,6 +1559,36 @@ public class JavacParser implements Parser {
|
||||||
return t;
|
return t;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* MemberReferenceSuffix = "#" [TypeArguments] Ident
|
||||||
|
* | "#" [TypeArguments] "new"
|
||||||
|
*/
|
||||||
|
JCExpression memberReferenceSuffix(JCExpression t) {
|
||||||
|
int pos1 = token.pos;
|
||||||
|
accept(HASH);
|
||||||
|
return memberReferenceSuffix(pos1, t);
|
||||||
|
}
|
||||||
|
|
||||||
|
JCExpression memberReferenceSuffix(int pos1, JCExpression t) {
|
||||||
|
checkMethodReferences();
|
||||||
|
mode = EXPR;
|
||||||
|
List<JCExpression> typeArgs = null;
|
||||||
|
if (token.kind == LT) {
|
||||||
|
typeArgs = typeArguments(false);
|
||||||
|
}
|
||||||
|
Name refName = null;
|
||||||
|
ReferenceMode refMode = null;
|
||||||
|
if (token.kind == NEW) {
|
||||||
|
refMode = ReferenceMode.NEW;
|
||||||
|
refName = names.init;
|
||||||
|
nextToken();
|
||||||
|
} else {
|
||||||
|
refMode = ReferenceMode.INVOKE;
|
||||||
|
refName = ident();
|
||||||
|
}
|
||||||
|
return toP(F.at(t.getStartPosition()).Reference(refMode, refName, t, typeArgs));
|
||||||
|
}
|
||||||
|
|
||||||
/** Creator = Qualident [TypeArguments] ( ArrayCreatorRest | ClassCreatorRest )
|
/** Creator = Qualident [TypeArguments] ( ArrayCreatorRest | ClassCreatorRest )
|
||||||
*/
|
*/
|
||||||
JCExpression creator(int newpos, List<JCExpression> typeArgs) {
|
JCExpression creator(int newpos, List<JCExpression> typeArgs) {
|
||||||
|
@ -2779,6 +2991,24 @@ public class JavacParser implements Parser {
|
||||||
return params.toList();
|
return params.toList();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
List<JCVariableDecl> implicitParameters(boolean hasParens) {
|
||||||
|
if (hasParens) {
|
||||||
|
accept(LPAREN);
|
||||||
|
}
|
||||||
|
ListBuffer<JCVariableDecl> params = new ListBuffer<JCVariableDecl>();
|
||||||
|
if (token.kind != RPAREN && token.kind != ARROW) {
|
||||||
|
params.append(implicitParameter());
|
||||||
|
while (token.kind == COMMA) {
|
||||||
|
nextToken();
|
||||||
|
params.append(implicitParameter());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (hasParens) {
|
||||||
|
accept(RPAREN);
|
||||||
|
}
|
||||||
|
return params.toList();
|
||||||
|
}
|
||||||
|
|
||||||
JCModifiers optFinal(long flags) {
|
JCModifiers optFinal(long flags) {
|
||||||
JCModifiers mods = modifiersOpt();
|
JCModifiers mods = modifiersOpt();
|
||||||
checkNoMods(mods.flags & ~(Flags.FINAL | Flags.DEPRECATED));
|
checkNoMods(mods.flags & ~(Flags.FINAL | Flags.DEPRECATED));
|
||||||
|
@ -2801,6 +3031,11 @@ public class JavacParser implements Parser {
|
||||||
return variableDeclaratorId(mods, type);
|
return variableDeclaratorId(mods, type);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
protected JCVariableDecl implicitParameter() {
|
||||||
|
JCModifiers mods = F.at(token.pos).Modifiers(Flags.PARAMETER);
|
||||||
|
return variableDeclaratorId(mods, null);
|
||||||
|
}
|
||||||
|
|
||||||
/* ---------- auxiliary methods -------------- */
|
/* ---------- auxiliary methods -------------- */
|
||||||
|
|
||||||
void error(int pos, String key, Object ... args) {
|
void error(int pos, String key, Object ... args) {
|
||||||
|
@ -3024,6 +3259,18 @@ public class JavacParser implements Parser {
|
||||||
allowTWR = true;
|
allowTWR = true;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
void checkLambda() {
|
||||||
|
if (!allowLambda) {
|
||||||
|
log.error(token.pos, "lambda.not.supported.in.source", source.name);
|
||||||
|
allowLambda = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
void checkMethodReferences() {
|
||||||
|
if (!allowMethodReferences) {
|
||||||
|
log.error(token.pos, "method.references.not.supported.in.source", source.name);
|
||||||
|
allowMethodReferences = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* a functional source tree and end position mappings
|
* a functional source tree and end position mappings
|
||||||
|
|
|
@ -49,6 +49,11 @@ public interface Lexer {
|
||||||
*/
|
*/
|
||||||
Token token();
|
Token token();
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Return token with given lookahead.
|
||||||
|
*/
|
||||||
|
Token token(int lookahead);
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Return the last character position of the previous token.
|
* Return the last character position of the previous token.
|
||||||
*/
|
*/
|
||||||
|
|
|
@ -26,8 +26,9 @@
|
||||||
package com.sun.tools.javac.parser;
|
package com.sun.tools.javac.parser;
|
||||||
|
|
||||||
import java.nio.*;
|
import java.nio.*;
|
||||||
|
import java.util.List;
|
||||||
|
import java.util.ArrayList;
|
||||||
|
|
||||||
import com.sun.tools.javac.util.*;
|
|
||||||
import com.sun.tools.javac.util.Position.LineMap;
|
import com.sun.tools.javac.util.Position.LineMap;
|
||||||
import com.sun.tools.javac.parser.JavaTokenizer.*;
|
import com.sun.tools.javac.parser.JavaTokenizer.*;
|
||||||
|
|
||||||
|
@ -53,6 +54,10 @@ public class Scanner implements Lexer {
|
||||||
*/
|
*/
|
||||||
private Token prevToken;
|
private Token prevToken;
|
||||||
|
|
||||||
|
/** Buffer of saved tokens (used during lookahead)
|
||||||
|
*/
|
||||||
|
private List<Token> savedTokens = new ArrayList<Token>();
|
||||||
|
|
||||||
private JavaTokenizer tokenizer;
|
private JavaTokenizer tokenizer;
|
||||||
/**
|
/**
|
||||||
* Create a scanner from the input array. This method might
|
* Create a scanner from the input array. This method might
|
||||||
|
@ -80,16 +85,35 @@ public class Scanner implements Lexer {
|
||||||
}
|
}
|
||||||
|
|
||||||
public Token token() {
|
public Token token() {
|
||||||
return token;
|
return token(0);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public Token token(int lookahead) {
|
||||||
|
if (lookahead == 0) {
|
||||||
|
return token;
|
||||||
|
} else {
|
||||||
|
ensureLookahead(lookahead);
|
||||||
|
return savedTokens.get(lookahead - 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
//where
|
||||||
|
private void ensureLookahead(int lookahead) {
|
||||||
|
for (int i = savedTokens.size() ; i < lookahead ; i ++) {
|
||||||
|
savedTokens.add(tokenizer.readToken());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
public Token prevToken() {
|
public Token prevToken() {
|
||||||
return prevToken;
|
return prevToken;
|
||||||
}
|
}
|
||||||
|
|
||||||
public void nextToken() {
|
public void nextToken() {
|
||||||
prevToken = token;
|
prevToken = token;
|
||||||
token = tokenizer.readToken();
|
if (!savedTokens.isEmpty()) {
|
||||||
|
token = savedTokens.remove(0);
|
||||||
|
} else {
|
||||||
|
token = tokenizer.readToken();
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
public Token split() {
|
public Token split() {
|
||||||
|
|
|
@ -176,6 +176,8 @@ public class Tokens {
|
||||||
TRUE("true", Tag.NAMED),
|
TRUE("true", Tag.NAMED),
|
||||||
FALSE("false", Tag.NAMED),
|
FALSE("false", Tag.NAMED),
|
||||||
NULL("null", Tag.NAMED),
|
NULL("null", Tag.NAMED),
|
||||||
|
ARROW("->"),
|
||||||
|
HASH("#"),
|
||||||
LPAREN("("),
|
LPAREN("("),
|
||||||
RPAREN(")"),
|
RPAREN(")"),
|
||||||
LBRACE("{"),
|
LBRACE("{"),
|
||||||
|
|
|
@ -1945,6 +1945,16 @@ compiler.err.string.switch.not.supported.in.source=\
|
||||||
strings in switch are not supported in -source {0}\n\
|
strings in switch are not supported in -source {0}\n\
|
||||||
(use -source 7 or higher to enable strings in switch)
|
(use -source 7 or higher to enable strings in switch)
|
||||||
|
|
||||||
|
# 0: string
|
||||||
|
compiler.err.lambda.not.supported.in.source=\
|
||||||
|
lambda expressions are not supported in -source {0}\n\
|
||||||
|
(use -source 8 or higher to enable lambda expressions)
|
||||||
|
|
||||||
|
# 0: string
|
||||||
|
compiler.err.method.references.not.supported.in.source=\
|
||||||
|
method references are not supported in -source {0}\n\
|
||||||
|
(use -source 8 or higher to enable method references)
|
||||||
|
|
||||||
########################################
|
########################################
|
||||||
# Diagnostics for verbose resolution
|
# Diagnostics for verbose resolution
|
||||||
# used by Resolve (debug only)
|
# used by Resolve (debug only)
|
||||||
|
|
|
@ -41,6 +41,8 @@ import com.sun.tools.javac.code.Scope.*;
|
||||||
import com.sun.tools.javac.code.Symbol.*;
|
import com.sun.tools.javac.code.Symbol.*;
|
||||||
import com.sun.tools.javac.parser.EndPosTable;
|
import com.sun.tools.javac.parser.EndPosTable;
|
||||||
import com.sun.source.tree.*;
|
import com.sun.source.tree.*;
|
||||||
|
import com.sun.source.tree.LambdaExpressionTree.BodyKind;
|
||||||
|
import com.sun.source.tree.MemberReferenceTree.ReferenceMode;
|
||||||
|
|
||||||
import static com.sun.tools.javac.code.BoundKind.*;
|
import static com.sun.tools.javac.code.BoundKind.*;
|
||||||
import static com.sun.tools.javac.tree.JCTree.Tag.*;
|
import static com.sun.tools.javac.tree.JCTree.Tag.*;
|
||||||
|
@ -198,6 +200,10 @@ public abstract class JCTree implements Tree, Cloneable, DiagnosticPosition {
|
||||||
*/
|
*/
|
||||||
NEWARRAY,
|
NEWARRAY,
|
||||||
|
|
||||||
|
/** Lambda expression, of type Lambda.
|
||||||
|
*/
|
||||||
|
LAMBDA,
|
||||||
|
|
||||||
/** Parenthesized subexpressions, of type Parens.
|
/** Parenthesized subexpressions, of type Parens.
|
||||||
*/
|
*/
|
||||||
PARENS,
|
PARENS,
|
||||||
|
@ -222,6 +228,10 @@ public abstract class JCTree implements Tree, Cloneable, DiagnosticPosition {
|
||||||
*/
|
*/
|
||||||
SELECT,
|
SELECT,
|
||||||
|
|
||||||
|
/** Member references, of type Reference.
|
||||||
|
*/
|
||||||
|
REFERENCE,
|
||||||
|
|
||||||
/** Simple identifiers, of type Ident.
|
/** Simple identifiers, of type Ident.
|
||||||
*/
|
*/
|
||||||
IDENT,
|
IDENT,
|
||||||
|
@ -1486,6 +1496,56 @@ public abstract class JCTree implements Tree, Cloneable, DiagnosticPosition {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* A lambda expression.
|
||||||
|
*/
|
||||||
|
public static class JCLambda extends JCExpression implements LambdaExpressionTree {
|
||||||
|
|
||||||
|
public List<JCVariableDecl> params;
|
||||||
|
public JCTree body;
|
||||||
|
public Type targetType;
|
||||||
|
public boolean canCompleteNormally = true;
|
||||||
|
public List<Type> inferredThrownTypes;
|
||||||
|
|
||||||
|
public JCLambda(List<JCVariableDecl> params,
|
||||||
|
JCTree body) {
|
||||||
|
this.params = params;
|
||||||
|
this.body = body;
|
||||||
|
}
|
||||||
|
@Override
|
||||||
|
public Tag getTag() {
|
||||||
|
return LAMBDA;
|
||||||
|
}
|
||||||
|
@Override
|
||||||
|
public void accept(Visitor v) {
|
||||||
|
v.visitLambda(this);
|
||||||
|
}
|
||||||
|
@Override
|
||||||
|
public <R, D> R accept(TreeVisitor<R, D> v, D d) {
|
||||||
|
return v.visitLambdaExpression(this, d);
|
||||||
|
}
|
||||||
|
public Kind getKind() {
|
||||||
|
return Kind.LAMBDA_EXPRESSION;
|
||||||
|
}
|
||||||
|
public JCTree getBody() {
|
||||||
|
return body;
|
||||||
|
}
|
||||||
|
public java.util.List<? extends VariableTree> getParameters() {
|
||||||
|
return params;
|
||||||
|
}
|
||||||
|
@Override
|
||||||
|
public JCLambda setType(Type type) {
|
||||||
|
super.setType(type);
|
||||||
|
return this;
|
||||||
|
}
|
||||||
|
@Override
|
||||||
|
public BodyKind getBodyKind() {
|
||||||
|
return body.hasTag(BLOCK) ?
|
||||||
|
BodyKind.STATEMENT :
|
||||||
|
BodyKind.EXPRESSION;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* A parenthesized subexpression ( ... )
|
* A parenthesized subexpression ( ... )
|
||||||
*/
|
*/
|
||||||
|
@ -1746,6 +1806,46 @@ public abstract class JCTree implements Tree, Cloneable, DiagnosticPosition {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Selects a member expression.
|
||||||
|
*/
|
||||||
|
public static class JCMemberReference extends JCExpression implements MemberReferenceTree {
|
||||||
|
public ReferenceMode mode;
|
||||||
|
public Name name;
|
||||||
|
public JCExpression expr;
|
||||||
|
public List<JCExpression> typeargs;
|
||||||
|
public Type targetType;
|
||||||
|
public Symbol sym;
|
||||||
|
|
||||||
|
protected JCMemberReference(ReferenceMode mode, Name name, JCExpression expr, List<JCExpression> typeargs) {
|
||||||
|
this.mode = mode;
|
||||||
|
this.name = name;
|
||||||
|
this.expr = expr;
|
||||||
|
this.typeargs = typeargs;
|
||||||
|
}
|
||||||
|
@Override
|
||||||
|
public void accept(Visitor v) { v.visitReference(this); }
|
||||||
|
|
||||||
|
public Kind getKind() { return Kind.MEMBER_REFERENCE; }
|
||||||
|
@Override
|
||||||
|
public ReferenceMode getMode() { return mode; }
|
||||||
|
@Override
|
||||||
|
public JCExpression getQualifierExpression() { return expr; }
|
||||||
|
@Override
|
||||||
|
public Name getName() { return name; }
|
||||||
|
@Override
|
||||||
|
public List<JCExpression> getTypeArguments() { return typeargs; }
|
||||||
|
|
||||||
|
@Override
|
||||||
|
public <R,D> R accept(TreeVisitor<R,D> v, D d) {
|
||||||
|
return v.visitMemberReference(this, d);
|
||||||
|
}
|
||||||
|
@Override
|
||||||
|
public Tag getTag() {
|
||||||
|
return REFERENCE;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* An identifier
|
* An identifier
|
||||||
* @param idname the name
|
* @param idname the name
|
||||||
|
@ -2271,6 +2371,7 @@ public abstract class JCTree implements Tree, Cloneable, DiagnosticPosition {
|
||||||
public void visitApply(JCMethodInvocation that) { visitTree(that); }
|
public void visitApply(JCMethodInvocation that) { visitTree(that); }
|
||||||
public void visitNewClass(JCNewClass that) { visitTree(that); }
|
public void visitNewClass(JCNewClass that) { visitTree(that); }
|
||||||
public void visitNewArray(JCNewArray that) { visitTree(that); }
|
public void visitNewArray(JCNewArray that) { visitTree(that); }
|
||||||
|
public void visitLambda(JCLambda that) { visitTree(that); }
|
||||||
public void visitParens(JCParens that) { visitTree(that); }
|
public void visitParens(JCParens that) { visitTree(that); }
|
||||||
public void visitAssign(JCAssign that) { visitTree(that); }
|
public void visitAssign(JCAssign that) { visitTree(that); }
|
||||||
public void visitAssignop(JCAssignOp that) { visitTree(that); }
|
public void visitAssignop(JCAssignOp that) { visitTree(that); }
|
||||||
|
@ -2280,6 +2381,7 @@ public abstract class JCTree implements Tree, Cloneable, DiagnosticPosition {
|
||||||
public void visitTypeTest(JCInstanceOf that) { visitTree(that); }
|
public void visitTypeTest(JCInstanceOf that) { visitTree(that); }
|
||||||
public void visitIndexed(JCArrayAccess that) { visitTree(that); }
|
public void visitIndexed(JCArrayAccess that) { visitTree(that); }
|
||||||
public void visitSelect(JCFieldAccess that) { visitTree(that); }
|
public void visitSelect(JCFieldAccess that) { visitTree(that); }
|
||||||
|
public void visitReference(JCMemberReference that) { visitTree(that); }
|
||||||
public void visitIdent(JCIdent that) { visitTree(that); }
|
public void visitIdent(JCIdent that) { visitTree(that); }
|
||||||
public void visitLiteral(JCLiteral that) { visitTree(that); }
|
public void visitLiteral(JCLiteral that) { visitTree(that); }
|
||||||
public void visitTypeIdent(JCPrimitiveTypeTree that) { visitTree(that); }
|
public void visitTypeIdent(JCPrimitiveTypeTree that) { visitTree(that); }
|
||||||
|
|
|
@ -28,6 +28,8 @@ package com.sun.tools.javac.tree;
|
||||||
import java.io.*;
|
import java.io.*;
|
||||||
import java.util.*;
|
import java.util.*;
|
||||||
|
|
||||||
|
import com.sun.source.tree.MemberReferenceTree.ReferenceMode;
|
||||||
|
|
||||||
import com.sun.tools.javac.util.*;
|
import com.sun.tools.javac.util.*;
|
||||||
import com.sun.tools.javac.util.List;
|
import com.sun.tools.javac.util.List;
|
||||||
import com.sun.tools.javac.code.*;
|
import com.sun.tools.javac.code.*;
|
||||||
|
@ -907,6 +909,17 @@ public class Pretty extends JCTree.Visitor {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public void visitLambda(JCLambda tree) {
|
||||||
|
try {
|
||||||
|
print("(");
|
||||||
|
printExprs(tree.params);
|
||||||
|
print(")->");
|
||||||
|
printExpr(tree.body);
|
||||||
|
} catch (IOException e) {
|
||||||
|
throw new UncheckedIOException(e);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
public void visitParens(JCParens tree) {
|
public void visitParens(JCParens tree) {
|
||||||
try {
|
try {
|
||||||
print("(");
|
print("(");
|
||||||
|
@ -1052,6 +1065,21 @@ public class Pretty extends JCTree.Visitor {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public void visitReference(JCMemberReference tree) {
|
||||||
|
try {
|
||||||
|
printExpr(tree.expr);
|
||||||
|
print("#");
|
||||||
|
if (tree.typeargs != null) {
|
||||||
|
print("<");
|
||||||
|
printExprs(tree.typeargs);
|
||||||
|
print(">");
|
||||||
|
}
|
||||||
|
print(tree.getMode() == ReferenceMode.INVOKE ? tree.name : "new");
|
||||||
|
} catch (IOException e) {
|
||||||
|
throw new UncheckedIOException(e);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
public void visitIdent(JCIdent tree) {
|
public void visitIdent(JCIdent tree) {
|
||||||
try {
|
try {
|
||||||
print(tree.name);
|
print(tree.name);
|
||||||
|
|
|
@ -271,6 +271,13 @@ public class TreeCopier<P> implements TreeVisitor<JCTree,P> {
|
||||||
return M.at(t.pos).NewClass(encl, typeargs, clazz, args, def);
|
return M.at(t.pos).NewClass(encl, typeargs, clazz, args, def);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public JCTree visitLambdaExpression(LambdaExpressionTree node, P p) {
|
||||||
|
JCLambda t = (JCLambda) node;
|
||||||
|
List<JCVariableDecl> params = copy(t.params, p);
|
||||||
|
JCTree body = copy(t.body, p);
|
||||||
|
return M.at(t.pos).Lambda(params, body);
|
||||||
|
}
|
||||||
|
|
||||||
public JCTree visitParenthesized(ParenthesizedTree node, P p) {
|
public JCTree visitParenthesized(ParenthesizedTree node, P p) {
|
||||||
JCParens t = (JCParens) node;
|
JCParens t = (JCParens) node;
|
||||||
JCExpression expr = copy(t.expr, p);
|
JCExpression expr = copy(t.expr, p);
|
||||||
|
@ -289,6 +296,13 @@ public class TreeCopier<P> implements TreeVisitor<JCTree,P> {
|
||||||
return M.at(t.pos).Select(selected, t.name);
|
return M.at(t.pos).Select(selected, t.name);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public JCTree visitMemberReference(MemberReferenceTree node, P p) {
|
||||||
|
JCMemberReference t = (JCMemberReference) node;
|
||||||
|
JCExpression expr = copy(t.expr, p);
|
||||||
|
List<JCExpression> typeargs = copy(t.typeargs, p);
|
||||||
|
return M.at(t.pos).Reference(t.mode, t.name, expr, typeargs);
|
||||||
|
}
|
||||||
|
|
||||||
public JCTree visitEmptyStatement(EmptyStatementTree node, P p) {
|
public JCTree visitEmptyStatement(EmptyStatementTree node, P p) {
|
||||||
JCSkip t = (JCSkip) node;
|
JCSkip t = (JCSkip) node;
|
||||||
return M.at(t.pos).Skip();
|
return M.at(t.pos).Skip();
|
||||||
|
|
|
@ -227,6 +227,34 @@ public class TreeInfo {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Return true if the AST corresponds to a static select of the kind A.B
|
||||||
|
*/
|
||||||
|
public static boolean isStaticSelector(JCTree base, Names names) {
|
||||||
|
if (base == null)
|
||||||
|
return false;
|
||||||
|
switch (base.getTag()) {
|
||||||
|
case IDENT:
|
||||||
|
JCIdent id = (JCIdent)base;
|
||||||
|
return id.name != names._this &&
|
||||||
|
id.name != names._super &&
|
||||||
|
isStaticSym(base);
|
||||||
|
case SELECT:
|
||||||
|
return isStaticSym(base) &&
|
||||||
|
isStaticSelector(((JCFieldAccess)base).selected, names);
|
||||||
|
case TYPEAPPLY:
|
||||||
|
return true;
|
||||||
|
default:
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
//where
|
||||||
|
private static boolean isStaticSym(JCTree tree) {
|
||||||
|
Symbol sym = symbol(tree);
|
||||||
|
return (sym.kind == Kinds.TYP ||
|
||||||
|
sym.kind == Kinds.PCK);
|
||||||
|
}
|
||||||
|
|
||||||
/** Return true if a tree represents the null literal. */
|
/** Return true if a tree represents the null literal. */
|
||||||
public static boolean isNull(JCTree tree) {
|
public static boolean isNull(JCTree tree) {
|
||||||
if (!tree.hasTag(LITERAL))
|
if (!tree.hasTag(LITERAL))
|
||||||
|
|
|
@ -351,6 +351,14 @@ public class TreeMaker implements JCTree.Factory {
|
||||||
return tree;
|
return tree;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public JCLambda Lambda(List<JCVariableDecl> params,
|
||||||
|
JCTree body)
|
||||||
|
{
|
||||||
|
JCLambda tree = new JCLambda(params, body);
|
||||||
|
tree.pos = pos;
|
||||||
|
return tree;
|
||||||
|
}
|
||||||
|
|
||||||
public JCParens Parens(JCExpression expr) {
|
public JCParens Parens(JCExpression expr) {
|
||||||
JCParens tree = new JCParens(expr);
|
JCParens tree = new JCParens(expr);
|
||||||
tree.pos = pos;
|
tree.pos = pos;
|
||||||
|
@ -405,6 +413,13 @@ public class TreeMaker implements JCTree.Factory {
|
||||||
return tree;
|
return tree;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public JCMemberReference Reference(JCMemberReference.ReferenceMode mode, Name name,
|
||||||
|
JCExpression expr, List<JCExpression> typeargs) {
|
||||||
|
JCMemberReference tree = new JCMemberReference(mode, name, expr, typeargs);
|
||||||
|
tree.pos = pos;
|
||||||
|
return tree;
|
||||||
|
}
|
||||||
|
|
||||||
public JCIdent Ident(Name name) {
|
public JCIdent Ident(Name name) {
|
||||||
JCIdent tree = new JCIdent(name, null);
|
JCIdent tree = new JCIdent(name, null);
|
||||||
tree.pos = pos;
|
tree.pos = pos;
|
||||||
|
|
|
@ -212,6 +212,11 @@ public class TreeScanner extends Visitor {
|
||||||
scan(tree.elems);
|
scan(tree.elems);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public void visitLambda(JCLambda tree) {
|
||||||
|
scan(tree.body);
|
||||||
|
scan(tree.params);
|
||||||
|
}
|
||||||
|
|
||||||
public void visitParens(JCParens tree) {
|
public void visitParens(JCParens tree) {
|
||||||
scan(tree.expr);
|
scan(tree.expr);
|
||||||
}
|
}
|
||||||
|
@ -254,6 +259,11 @@ public class TreeScanner extends Visitor {
|
||||||
scan(tree.selected);
|
scan(tree.selected);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public void visitReference(JCMemberReference tree) {
|
||||||
|
scan(tree.expr);
|
||||||
|
scan(tree.typeargs);
|
||||||
|
}
|
||||||
|
|
||||||
public void visitIdent(JCIdent tree) {
|
public void visitIdent(JCIdent tree) {
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -282,6 +282,12 @@ public class TreeTranslator extends JCTree.Visitor {
|
||||||
result = tree;
|
result = tree;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public void visitLambda(JCLambda tree) {
|
||||||
|
tree.params = translate(tree.params);
|
||||||
|
tree.body = translate(tree.body);
|
||||||
|
result = tree;
|
||||||
|
}
|
||||||
|
|
||||||
public void visitNewArray(JCNewArray tree) {
|
public void visitNewArray(JCNewArray tree) {
|
||||||
tree.elemtype = translate(tree.elemtype);
|
tree.elemtype = translate(tree.elemtype);
|
||||||
tree.dims = translate(tree.dims);
|
tree.dims = translate(tree.dims);
|
||||||
|
@ -340,6 +346,11 @@ public class TreeTranslator extends JCTree.Visitor {
|
||||||
result = tree;
|
result = tree;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public void visitReference(JCMemberReference tree) {
|
||||||
|
tree.expr = translate(tree.expr);
|
||||||
|
result = tree;
|
||||||
|
}
|
||||||
|
|
||||||
public void visitIdent(JCIdent tree) {
|
public void visitIdent(JCIdent tree) {
|
||||||
result = tree;
|
result = tree;
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
* Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved.
|
* Copyright (c) 2010, 2011, Oracle and/or its affiliates. All rights reserved.
|
||||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
*
|
*
|
||||||
* This code is free software; you can redistribute it and/or modify it
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
@ -23,7 +23,6 @@
|
||||||
|
|
||||||
// key: compiler.err.catch.without.try
|
// key: compiler.err.catch.without.try
|
||||||
// key: compiler.err.expected
|
// key: compiler.err.expected
|
||||||
// key: compiler.err.not.stmt
|
|
||||||
|
|
||||||
class CatchWithoutTry {
|
class CatchWithoutTry {
|
||||||
void m() {
|
void m() {
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
* Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved.
|
* Copyright (c) 2010, 2011, Oracle and/or its affiliates. All rights reserved.
|
||||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
*
|
*
|
||||||
* This code is free software; you can redistribute it and/or modify it
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
@ -24,5 +24,5 @@
|
||||||
// key: compiler.err.illegal.char
|
// key: compiler.err.illegal.char
|
||||||
|
|
||||||
class IllegalChar {
|
class IllegalChar {
|
||||||
int i = #;
|
int i = `;
|
||||||
}
|
}
|
||||||
|
|
|
@ -0,0 +1,29 @@
|
||||||
|
/*
|
||||||
|
* Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved.
|
||||||
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
|
*
|
||||||
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
* under the terms of the GNU General Public License version 2 only, as
|
||||||
|
* published by the Free Software Foundation.
|
||||||
|
*
|
||||||
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||||
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||||
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||||
|
* version 2 for more details (a copy is included in the LICENSE file that
|
||||||
|
* accompanied this code).
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License version
|
||||||
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||||
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||||
|
*
|
||||||
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||||
|
* or visit www.oracle.com if you need additional information or have any
|
||||||
|
* questions.
|
||||||
|
*/
|
||||||
|
|
||||||
|
// key: compiler.err.lambda.not.supported.in.source
|
||||||
|
// options: -source 7 -Xlint:-options
|
||||||
|
|
||||||
|
class LambdaNotSupported {
|
||||||
|
S s = ()->{};
|
||||||
|
}
|
|
@ -0,0 +1,29 @@
|
||||||
|
/*
|
||||||
|
* Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved.
|
||||||
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
|
*
|
||||||
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
* under the terms of the GNU General Public License version 2 only, as
|
||||||
|
* published by the Free Software Foundation.
|
||||||
|
*
|
||||||
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||||
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||||
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||||
|
* version 2 for more details (a copy is included in the LICENSE file that
|
||||||
|
* accompanied this code).
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License version
|
||||||
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||||
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||||
|
*
|
||||||
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||||
|
* or visit www.oracle.com if you need additional information or have any
|
||||||
|
* questions.
|
||||||
|
*/
|
||||||
|
|
||||||
|
// key: compiler.err.method.references.not.supported.in.source
|
||||||
|
// options: -source 7 -Xlint:-options
|
||||||
|
|
||||||
|
class MethodReferencesNotSupported {
|
||||||
|
S s = A#foo;
|
||||||
|
}
|
30
langtools/test/tools/javac/diags/examples/NotAStatement.java
Normal file
30
langtools/test/tools/javac/diags/examples/NotAStatement.java
Normal file
|
@ -0,0 +1,30 @@
|
||||||
|
/*
|
||||||
|
* Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved.
|
||||||
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
|
*
|
||||||
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
* under the terms of the GNU General Public License version 2 only, as
|
||||||
|
* published by the Free Software Foundation.
|
||||||
|
*
|
||||||
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||||
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||||
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||||
|
* version 2 for more details (a copy is included in the LICENSE file that
|
||||||
|
* accompanied this code).
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License version
|
||||||
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||||
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||||
|
*
|
||||||
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||||
|
* or visit www.oracle.com if you need additional information or have any
|
||||||
|
* questions.
|
||||||
|
*/
|
||||||
|
|
||||||
|
// key: compiler.err.not.stmt
|
||||||
|
|
||||||
|
class NotAStatement {
|
||||||
|
void m() {
|
||||||
|
x + 1;
|
||||||
|
}
|
||||||
|
}
|
|
@ -1,5 +1,5 @@
|
||||||
T6665356.java:17:37: compiler.err.improperly.formed.type.param.missing
|
T6665356.java:17:37: compiler.err.improperly.formed.type.param.missing
|
||||||
T6665356.java:18:40: compiler.err.improperly.formed.type.inner.raw.param
|
T6665356.java:18:40: compiler.err.improperly.formed.type.inner.raw.param
|
||||||
T6665356.java:26:23: compiler.err.improperly.formed.type.param.missing
|
T6665356.java:26:22: compiler.err.improperly.formed.type.param.missing
|
||||||
T6665356.java:27:25: compiler.err.improperly.formed.type.inner.raw.param
|
T6665356.java:27:25: compiler.err.improperly.formed.type.inner.raw.param
|
||||||
4 errors
|
4 errors
|
||||||
|
|
276
langtools/test/tools/javac/lambda/LambdaParserTest.java
Normal file
276
langtools/test/tools/javac/lambda/LambdaParserTest.java
Normal file
|
@ -0,0 +1,276 @@
|
||||||
|
/*
|
||||||
|
* Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved.
|
||||||
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
|
*
|
||||||
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
* under the terms of the GNU General Public License version 2 only, as
|
||||||
|
* published by the Free Software Foundation.
|
||||||
|
*
|
||||||
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||||
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||||
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||||
|
* version 2 for more details (a copy is included in the LICENSE file that
|
||||||
|
* accompanied this code).
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License version
|
||||||
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||||
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||||
|
*
|
||||||
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||||
|
* or visit www.oracle.com if you need additional information or have any
|
||||||
|
* questions.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* @test
|
||||||
|
* @bug 7115050
|
||||||
|
* @summary Add parser support for lambda expressions
|
||||||
|
*/
|
||||||
|
|
||||||
|
import com.sun.source.util.JavacTask;
|
||||||
|
import java.net.URI;
|
||||||
|
import java.util.Arrays;
|
||||||
|
import javax.tools.Diagnostic;
|
||||||
|
import javax.tools.JavaCompiler;
|
||||||
|
import javax.tools.JavaFileObject;
|
||||||
|
import javax.tools.SimpleJavaFileObject;
|
||||||
|
import javax.tools.StandardJavaFileManager;
|
||||||
|
import javax.tools.ToolProvider;
|
||||||
|
|
||||||
|
public class LambdaParserTest {
|
||||||
|
|
||||||
|
static int checkCount = 0;
|
||||||
|
|
||||||
|
enum LambdaKind {
|
||||||
|
NILARY_EXPR("()->x"),
|
||||||
|
NILARY_STMT("()->{ return x; }"),
|
||||||
|
ONEARY_SHORT_EXPR("x->x"),
|
||||||
|
ONEARY_SHORT_STMT("x->{ return x; }"),
|
||||||
|
ONEARY_EXPR("(#M1 #T1 x)->x"),
|
||||||
|
ONEARY_STMT("(#M1 #T1 x)->{ return x; }"),
|
||||||
|
TWOARY_EXPR("(#M1 #T1 x, #M2 #T2 y)->x"),
|
||||||
|
TWOARY_STMT("(#M1 #T1 x, #M2 #T2 y)->{ return x; }");
|
||||||
|
|
||||||
|
String lambdaTemplate;
|
||||||
|
|
||||||
|
LambdaKind(String lambdaTemplate) {
|
||||||
|
this.lambdaTemplate = lambdaTemplate;
|
||||||
|
}
|
||||||
|
|
||||||
|
String getLambdaString(LambdaParameterKind pk1, LambdaParameterKind pk2,
|
||||||
|
ModifierKind mk1, ModifierKind mk2) {
|
||||||
|
return lambdaTemplate.replaceAll("#M1", mk1.modifier)
|
||||||
|
.replaceAll("#M2", mk2.modifier)
|
||||||
|
.replaceAll("#T1", pk1.parameterType)
|
||||||
|
.replaceAll("#T2", pk2.parameterType);
|
||||||
|
}
|
||||||
|
|
||||||
|
int arity() {
|
||||||
|
switch (this) {
|
||||||
|
case NILARY_EXPR:
|
||||||
|
case NILARY_STMT: return 0;
|
||||||
|
case ONEARY_SHORT_EXPR:
|
||||||
|
case ONEARY_SHORT_STMT:
|
||||||
|
case ONEARY_EXPR:
|
||||||
|
case ONEARY_STMT: return 1;
|
||||||
|
case TWOARY_EXPR:
|
||||||
|
case TWOARY_STMT: return 2;
|
||||||
|
default: throw new AssertionError("Invalid lambda kind " + this);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
boolean isShort() {
|
||||||
|
return this == ONEARY_SHORT_EXPR ||
|
||||||
|
this == ONEARY_SHORT_STMT;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
enum LambdaParameterKind {
|
||||||
|
IMPLICIT(""),
|
||||||
|
EXPLIICT_SIMPLE("A"),
|
||||||
|
EXPLICIT_VARARGS("A..."),
|
||||||
|
EXPLICIT_GENERIC1("A<X>"),
|
||||||
|
EXPLICIT_GENERIC3("A<? extends X, ? super Y>");
|
||||||
|
|
||||||
|
String parameterType;
|
||||||
|
|
||||||
|
LambdaParameterKind(String parameterType) {
|
||||||
|
this.parameterType = parameterType;
|
||||||
|
}
|
||||||
|
|
||||||
|
boolean explicit() {
|
||||||
|
return this != IMPLICIT;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
enum ModifierKind {
|
||||||
|
NONE(""),
|
||||||
|
FINAL("final"),
|
||||||
|
PUBLIC("public");
|
||||||
|
|
||||||
|
String modifier;
|
||||||
|
|
||||||
|
ModifierKind(String modifier) {
|
||||||
|
this.modifier = modifier;
|
||||||
|
}
|
||||||
|
|
||||||
|
boolean compatibleWith(LambdaParameterKind pk) {
|
||||||
|
switch (this) {
|
||||||
|
case PUBLIC: return false;
|
||||||
|
case FINAL: return pk != LambdaParameterKind.IMPLICIT;
|
||||||
|
case NONE: return true;
|
||||||
|
default: throw new AssertionError("Invalid modifier kind " + this);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
enum ExprKind {
|
||||||
|
NONE("#L#S"),
|
||||||
|
SINGLE_PAREN1("(#L#S)"),
|
||||||
|
SINGLE_PAREN2("(#L)#S"),
|
||||||
|
DOUBLE_PAREN1("((#L#S))"),
|
||||||
|
DOUBLE_PAREN2("((#L)#S)"),
|
||||||
|
DOUBLE_PAREN3("((#L))#S");
|
||||||
|
|
||||||
|
String expressionTemplate;
|
||||||
|
|
||||||
|
ExprKind(String expressionTemplate) {
|
||||||
|
this.expressionTemplate = expressionTemplate;
|
||||||
|
}
|
||||||
|
|
||||||
|
String expressionString(LambdaParameterKind pk1, LambdaParameterKind pk2,
|
||||||
|
ModifierKind mk1, ModifierKind mk2, LambdaKind lk, SubExprKind sk) {
|
||||||
|
return expressionTemplate.replaceAll("#L", lk.getLambdaString(pk1, pk2, mk1, mk2))
|
||||||
|
.replaceAll("#S", sk.subExpression);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
enum SubExprKind {
|
||||||
|
NONE(""),
|
||||||
|
SELECT_FIELD(".f"),
|
||||||
|
SELECT_METHOD(".f()"),
|
||||||
|
SELECT_NEW(".new Foo()"),
|
||||||
|
POSTINC("++"),
|
||||||
|
POSTDEC("--");
|
||||||
|
|
||||||
|
String subExpression;
|
||||||
|
|
||||||
|
SubExprKind(String subExpression) {
|
||||||
|
this.subExpression = subExpression;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public static void main(String... args) throws Exception {
|
||||||
|
|
||||||
|
//create default shared JavaCompiler - reused across multiple compilations
|
||||||
|
JavaCompiler comp = ToolProvider.getSystemJavaCompiler();
|
||||||
|
StandardJavaFileManager fm = comp.getStandardFileManager(null, null, null);
|
||||||
|
|
||||||
|
for (LambdaKind lk : LambdaKind.values()) {
|
||||||
|
for (LambdaParameterKind pk1 : LambdaParameterKind.values()) {
|
||||||
|
if (lk.arity() < 1 && pk1 != LambdaParameterKind.IMPLICIT) continue;
|
||||||
|
for (LambdaParameterKind pk2 : LambdaParameterKind.values()) {
|
||||||
|
if (lk.arity() < 2 && pk2 != LambdaParameterKind.IMPLICIT) continue;
|
||||||
|
for (ModifierKind mk1 : ModifierKind.values()) {
|
||||||
|
if (mk1 != ModifierKind.NONE && lk.isShort()) continue;
|
||||||
|
if (lk.arity() < 1 && mk1 != ModifierKind.NONE) continue;
|
||||||
|
for (ModifierKind mk2 : ModifierKind.values()) {
|
||||||
|
if (lk.arity() < 2 && mk2 != ModifierKind.NONE) continue;
|
||||||
|
for (SubExprKind sk : SubExprKind.values()) {
|
||||||
|
for (ExprKind ek : ExprKind.values()) {
|
||||||
|
new LambdaParserTest(pk1, pk2, mk1, mk2, lk, sk, ek)
|
||||||
|
.run(comp, fm);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
System.out.println("Total check executed: " + checkCount);
|
||||||
|
}
|
||||||
|
|
||||||
|
LambdaParameterKind pk1;
|
||||||
|
LambdaParameterKind pk2;
|
||||||
|
ModifierKind mk1;
|
||||||
|
ModifierKind mk2;
|
||||||
|
LambdaKind lk;
|
||||||
|
SubExprKind sk;
|
||||||
|
ExprKind ek;
|
||||||
|
JavaSource source;
|
||||||
|
DiagnosticChecker diagChecker;
|
||||||
|
|
||||||
|
LambdaParserTest(LambdaParameterKind pk1, LambdaParameterKind pk2, ModifierKind mk1,
|
||||||
|
ModifierKind mk2, LambdaKind lk, SubExprKind sk, ExprKind ek) {
|
||||||
|
this.pk1 = pk1;
|
||||||
|
this.pk2 = pk2;
|
||||||
|
this.mk1 = mk1;
|
||||||
|
this.mk2 = mk2;
|
||||||
|
this.lk = lk;
|
||||||
|
this.sk = sk;
|
||||||
|
this.ek = ek;
|
||||||
|
this.source = new JavaSource();
|
||||||
|
this.diagChecker = new DiagnosticChecker();
|
||||||
|
}
|
||||||
|
|
||||||
|
class JavaSource extends SimpleJavaFileObject {
|
||||||
|
|
||||||
|
String template = "class Test {\n" +
|
||||||
|
" SAM s = #E;\n" +
|
||||||
|
"}";
|
||||||
|
|
||||||
|
String source;
|
||||||
|
|
||||||
|
public JavaSource() {
|
||||||
|
super(URI.create("myfo:/Test.java"), JavaFileObject.Kind.SOURCE);
|
||||||
|
source = template.replaceAll("#E", ek.expressionString(pk1, pk2, mk1, mk2, lk, sk));
|
||||||
|
}
|
||||||
|
|
||||||
|
@Override
|
||||||
|
public CharSequence getCharContent(boolean ignoreEncodingErrors) {
|
||||||
|
return source;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void run(JavaCompiler tool, StandardJavaFileManager fm) throws Exception {
|
||||||
|
JavacTask ct = (JavacTask)tool.getTask(null, fm, diagChecker,
|
||||||
|
Arrays.asList("-XDallowLambda"), null, Arrays.asList(source));
|
||||||
|
try {
|
||||||
|
ct.parse();
|
||||||
|
} catch (Throwable ex) {
|
||||||
|
throw new AssertionError("Error thron when parsing the following source:\n" + source.getCharContent(true));
|
||||||
|
}
|
||||||
|
check();
|
||||||
|
}
|
||||||
|
|
||||||
|
void check() {
|
||||||
|
checkCount++;
|
||||||
|
|
||||||
|
boolean errorExpected = (lk.arity() > 0 && !mk1.compatibleWith(pk1)) ||
|
||||||
|
(lk.arity() > 1 && !mk2.compatibleWith(pk2));
|
||||||
|
|
||||||
|
if (lk.arity() == 2 &&
|
||||||
|
(pk1.explicit() != pk2.explicit() ||
|
||||||
|
pk1 == LambdaParameterKind.EXPLICIT_VARARGS)) {
|
||||||
|
errorExpected = true;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (errorExpected != diagChecker.errorFound) {
|
||||||
|
throw new Error("invalid diagnostics for source:\n" +
|
||||||
|
source.getCharContent(true) +
|
||||||
|
"\nFound error: " + diagChecker.errorFound +
|
||||||
|
"\nExpected error: " + errorExpected);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static class DiagnosticChecker implements javax.tools.DiagnosticListener<JavaFileObject> {
|
||||||
|
|
||||||
|
boolean errorFound;
|
||||||
|
|
||||||
|
public void report(Diagnostic<? extends JavaFileObject> diagnostic) {
|
||||||
|
if (diagnostic.getKind() == Diagnostic.Kind.ERROR) {
|
||||||
|
errorFound = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
233
langtools/test/tools/javac/lambda/MethodReferenceParserTest.java
Normal file
233
langtools/test/tools/javac/lambda/MethodReferenceParserTest.java
Normal file
|
@ -0,0 +1,233 @@
|
||||||
|
/*
|
||||||
|
* Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved.
|
||||||
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
|
*
|
||||||
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
* under the terms of the GNU General Public License version 2 only, as
|
||||||
|
* published by the Free Software Foundation.
|
||||||
|
*
|
||||||
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||||
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||||
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||||
|
* version 2 for more details (a copy is included in the LICENSE file that
|
||||||
|
* accompanied this code).
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License version
|
||||||
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||||
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||||
|
*
|
||||||
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||||
|
* or visit www.oracle.com if you need additional information or have any
|
||||||
|
* questions.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* @test
|
||||||
|
* @bug 7115052
|
||||||
|
* @summary Add parser support for method references
|
||||||
|
*/
|
||||||
|
|
||||||
|
import com.sun.source.util.JavacTask;
|
||||||
|
import java.net.URI;
|
||||||
|
import java.util.Arrays;
|
||||||
|
import javax.tools.Diagnostic;
|
||||||
|
import javax.tools.JavaCompiler;
|
||||||
|
import javax.tools.JavaFileObject;
|
||||||
|
import javax.tools.SimpleJavaFileObject;
|
||||||
|
import javax.tools.StandardJavaFileManager;
|
||||||
|
import javax.tools.ToolProvider;
|
||||||
|
|
||||||
|
public class MethodReferenceParserTest {
|
||||||
|
|
||||||
|
static int checkCount = 0;
|
||||||
|
|
||||||
|
enum ReferenceKind {
|
||||||
|
METHOD_REF("#Q##Gm"),
|
||||||
|
CONSTRUCTOR_REF("#Q##Gnew"),
|
||||||
|
ERR_SUPER("#Q##Gsuper"),
|
||||||
|
ERR_METH0("#Q##Gm()"),
|
||||||
|
ERR_METH1("#Q##Gm(X)"),
|
||||||
|
ERR_CONSTR0("#Q##Gnew()"),
|
||||||
|
ERR_CONSTR1("#Q##Gnew(X)");
|
||||||
|
|
||||||
|
String referenceTemplate;
|
||||||
|
|
||||||
|
ReferenceKind(String referenceTemplate) {
|
||||||
|
this.referenceTemplate = referenceTemplate;
|
||||||
|
}
|
||||||
|
|
||||||
|
String getReferenceString(QualifierKind qk, GenericKind gk) {
|
||||||
|
return referenceTemplate
|
||||||
|
.replaceAll("#Q", qk.qualifier)
|
||||||
|
.replaceAll("#G", gk.typeParameters);
|
||||||
|
}
|
||||||
|
|
||||||
|
boolean erroneous() {
|
||||||
|
switch (this) {
|
||||||
|
case ERR_SUPER:
|
||||||
|
case ERR_METH0:
|
||||||
|
case ERR_METH1:
|
||||||
|
case ERR_CONSTR0:
|
||||||
|
case ERR_CONSTR1:
|
||||||
|
return true;
|
||||||
|
default: return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
enum GenericKind {
|
||||||
|
NONE(""),
|
||||||
|
ONE("<X>"),
|
||||||
|
TWO("<X,Y>");
|
||||||
|
|
||||||
|
String typeParameters;
|
||||||
|
|
||||||
|
GenericKind(String typeParameters) {
|
||||||
|
this.typeParameters = typeParameters;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
enum QualifierKind {
|
||||||
|
THIS("this"),
|
||||||
|
SUPER("super"),
|
||||||
|
NEW("new Foo()"),
|
||||||
|
METHOD("m()"),
|
||||||
|
FIELD("a.f"),
|
||||||
|
UBOUND_SIMPLE("A"),
|
||||||
|
UNBOUND_GENERIC1("A<X>"),
|
||||||
|
UNBOUND_GENERIC2("A<X, Y>"),
|
||||||
|
UNBOUND_GENERIC3("A<? extends X, ? super Y>");
|
||||||
|
|
||||||
|
String qualifier;
|
||||||
|
|
||||||
|
QualifierKind(String qualifier) {
|
||||||
|
this.qualifier = qualifier;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
enum ExprKind {
|
||||||
|
NONE("#R#S"),
|
||||||
|
SINGLE_PAREN1("(#R#S)"),
|
||||||
|
SINGLE_PAREN2("(#R)#S"),
|
||||||
|
DOUBLE_PAREN1("((#R#S))"),
|
||||||
|
DOUBLE_PAREN2("((#R)#S)"),
|
||||||
|
DOUBLE_PAREN3("((#R))#S");
|
||||||
|
|
||||||
|
String expressionTemplate;
|
||||||
|
|
||||||
|
ExprKind(String expressionTemplate) {
|
||||||
|
this.expressionTemplate = expressionTemplate;
|
||||||
|
}
|
||||||
|
|
||||||
|
String expressionString(ReferenceKind rk, QualifierKind qk, GenericKind gk, SubExprKind sk) {
|
||||||
|
return expressionTemplate
|
||||||
|
.replaceAll("#R", rk.getReferenceString(qk, gk))
|
||||||
|
.replaceAll("#S", sk.subExpression);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
enum SubExprKind {
|
||||||
|
NONE(""),
|
||||||
|
SELECT_FIELD(".f"),
|
||||||
|
SELECT_METHOD(".f()"),
|
||||||
|
SELECT_NEW(".new Foo()"),
|
||||||
|
POSTINC("++"),
|
||||||
|
POSTDEC("--");
|
||||||
|
|
||||||
|
String subExpression;
|
||||||
|
|
||||||
|
SubExprKind(String subExpression) {
|
||||||
|
this.subExpression = subExpression;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public static void main(String... args) throws Exception {
|
||||||
|
|
||||||
|
//create default shared JavaCompiler - reused across multiple compilations
|
||||||
|
JavaCompiler comp = ToolProvider.getSystemJavaCompiler();
|
||||||
|
StandardJavaFileManager fm = comp.getStandardFileManager(null, null, null);
|
||||||
|
|
||||||
|
for (ReferenceKind rk : ReferenceKind.values()) {
|
||||||
|
for (QualifierKind qk : QualifierKind.values()) {
|
||||||
|
for (GenericKind gk : GenericKind.values()) {
|
||||||
|
for (SubExprKind sk : SubExprKind.values()) {
|
||||||
|
for (ExprKind ek : ExprKind.values()) {
|
||||||
|
new MethodReferenceParserTest(rk, qk, gk, sk, ek).run(comp, fm);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
System.out.println("Total check executed: " + checkCount);
|
||||||
|
}
|
||||||
|
|
||||||
|
ReferenceKind rk;
|
||||||
|
QualifierKind qk;
|
||||||
|
GenericKind gk;
|
||||||
|
SubExprKind sk;
|
||||||
|
ExprKind ek;
|
||||||
|
JavaSource source;
|
||||||
|
DiagnosticChecker diagChecker;
|
||||||
|
|
||||||
|
MethodReferenceParserTest(ReferenceKind rk, QualifierKind qk, GenericKind gk, SubExprKind sk, ExprKind ek) {
|
||||||
|
this.rk = rk;
|
||||||
|
this.qk = qk;
|
||||||
|
this.gk = gk;
|
||||||
|
this.sk = sk;
|
||||||
|
this.ek = ek;
|
||||||
|
this.source = new JavaSource();
|
||||||
|
this.diagChecker = new DiagnosticChecker();
|
||||||
|
}
|
||||||
|
|
||||||
|
class JavaSource extends SimpleJavaFileObject {
|
||||||
|
|
||||||
|
String template = "class Test {\n" +
|
||||||
|
" SAM s = #E;\n" +
|
||||||
|
"}";
|
||||||
|
|
||||||
|
String source;
|
||||||
|
|
||||||
|
public JavaSource() {
|
||||||
|
super(URI.create("myfo:/Test.java"), JavaFileObject.Kind.SOURCE);
|
||||||
|
source = template.replaceAll("#E", ek.expressionString(rk, qk, gk, sk));
|
||||||
|
}
|
||||||
|
|
||||||
|
@Override
|
||||||
|
public CharSequence getCharContent(boolean ignoreEncodingErrors) {
|
||||||
|
return source;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void run(JavaCompiler tool, StandardJavaFileManager fm) throws Exception {
|
||||||
|
JavacTask ct = (JavacTask)tool.getTask(null, fm, diagChecker,
|
||||||
|
Arrays.asList("-XDallowMethodReferences"), null, Arrays.asList(source));
|
||||||
|
try {
|
||||||
|
ct.parse();
|
||||||
|
} catch (Throwable ex) {
|
||||||
|
throw new AssertionError("Error thrown when parsing the following source:\n" + source.getCharContent(true));
|
||||||
|
}
|
||||||
|
check();
|
||||||
|
}
|
||||||
|
|
||||||
|
void check() {
|
||||||
|
checkCount++;
|
||||||
|
|
||||||
|
if (diagChecker.errorFound != rk.erroneous()) {
|
||||||
|
throw new Error("invalid diagnostics for source:\n" +
|
||||||
|
source.getCharContent(true) +
|
||||||
|
"\nFound error: " + diagChecker.errorFound +
|
||||||
|
"\nExpected error: " + rk.erroneous());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static class DiagnosticChecker implements javax.tools.DiagnosticListener<JavaFileObject> {
|
||||||
|
|
||||||
|
boolean errorFound;
|
||||||
|
|
||||||
|
public void report(Diagnostic<? extends JavaFileObject> diagnostic) {
|
||||||
|
if (diagnostic.getKind() == Diagnostic.Kind.ERROR) {
|
||||||
|
errorFound = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
|
@ -1,4 +1,4 @@
|
||||||
T6999438.java:8:9: compiler.err.illegal.char: 35
|
T6999438.java:8:8: compiler.err.expected: token.identifier
|
||||||
T6999438.java:8:10: compiler.err.illegal.start.of.type
|
T6999438.java:8:10: compiler.err.illegal.start.of.type
|
||||||
T6999438.java:8:25: compiler.err.expected: token.identifier
|
T6999438.java:8:25: compiler.err.expected: token.identifier
|
||||||
T6999438.java:8:26: compiler.err.expected: ';'
|
T6999438.java:8:26: compiler.err.expected: ';'
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue