public void visitError(Attribute.Error e) { result = Erroneous(); } public void visitCompound(Attribute.Compound compound) {
public void visitError(Attribute.Error e) { result = Erroneous(); } public void visitCompound(Attribute.Compound compound) {
public void visitError(Attribute.Error e) { result = Erroneous(); } public void visitCompound(Attribute.Compound compound) {
public void visitError(Attribute.Error e) { result = Erroneous(); } public void visitCompound(Attribute.Compound compound) {
public JCErroneous Erroneous() { return Erroneous(List.<JCTree>nil()); }
public JCErroneous Erroneous() { return Erroneous(List.<JCTree>nil()); }
public JCErroneous Erroneous() { return Erroneous(List.<JCTree>nil()); }
public JCErroneous Erroneous() { return Erroneous(List.<JCTree>nil()); }
public JCTree visitErroneous(ErroneousTree node, P p) { JCErroneous t = (JCErroneous) node; List<? extends JCTree> errs = copy(t.errs, p); return M.at(t.pos).Erroneous(errs); }
public JCTree visitErroneous(ErroneousTree node, P p) { JCErroneous t = (JCErroneous) node; List<? extends JCTree> errs = copy(t.errs, p); return M.at(t.pos).Erroneous(errs); }
public JCTree visitErroneous(ErroneousTree node, P p) { JCErroneous t = (JCErroneous) node; List<? extends JCTree> errs = copy(t.errs, p); return M.at(t.pos).Erroneous(errs); }
public JCTree visitErroneous(ErroneousTree node, P p) { JCErroneous t = (JCErroneous) node; List<? extends JCTree> errs = copy(t.errs, p); return M.at(t.pos).Erroneous(errs); }
/** Check that given tree is a legal expression statement. */ protected JCExpression checkExprStat(JCExpression t) { switch(t.tag) { case JCTree.PREINC: case JCTree.PREDEC: case JCTree.POSTINC: case JCTree.POSTDEC: case JCTree.ASSIGN: case JCTree.BITOR_ASG: case JCTree.BITXOR_ASG: case JCTree.BITAND_ASG: case JCTree.SL_ASG: case JCTree.SR_ASG: case JCTree.USR_ASG: case JCTree.PLUS_ASG: case JCTree.MINUS_ASG: case JCTree.MUL_ASG: case JCTree.DIV_ASG: case JCTree.MOD_ASG: case JCTree.APPLY: case JCTree.NEWCLASS: case JCTree.ERRONEOUS: return t; default: log.error(t.pos, "not.stmt"); return F.at(t.pos).Erroneous(List.<JCTree>of(t)); } }
/** Check that given tree is a legal expression statement. */ protected JCExpression checkExprStat(JCExpression t) { if (!TreeInfo.isExpressionStatement(t)) { JCExpression ret = F.at(t.pos).Erroneous(List.<JCTree>of(t)); error(ret, "not.stmt"); return ret; } else { return t; } }
public ErroneousTree Erroneous(List<? extends Tree> errorTrees) { ListBuffer<JCTree> errors = new ListBuffer<JCTree>(); for (Tree t : errorTrees) errors.append((JCTree)t); return make.at(NOPOS).Erroneous(errors.toList()); }
private JCErroneous syntaxError(int pos, List<JCTree> errs, String key, Object... arg) { setErrorEndPos(pos); reportSyntaxError(pos, key, arg); return toP(F.at(pos).Erroneous(errs)); }
private JCErroneous syntaxError(int pos, List<JCTree> errs, String key, Object... arg) { setErrorEndPos(pos); reportSyntaxError(pos, key, arg); return toP(F.at(pos).Erroneous(errs)); }
/** Check that given tree is a legal expression statement. */ protected JCExpression checkExprStat(JCExpression t) { if (!TreeInfo.isExpressionStatement(t)) { JCExpression ret = F.at(t.pos).Erroneous(List.<JCTree>of(t)); error(ret, "not.stmt"); return ret; } else { return t; } }
private JCErroneous syntaxError(int pos, List<JCTree> errs, String key, TokenKind... args) { setErrorEndPos(pos); JCErroneous err = F.at(pos).Erroneous(errs); reportSyntaxError(err, key, (Object[])args); if (errs != null) { JCTree last = errs.last(); if (last != null) storeEnd(last, pos); } return toP(err); }
private JCErroneous syntaxError(int pos, List<JCTree> errs, String key, TokenKind... args) { setErrorEndPos(pos); JCErroneous err = F.at(pos).Erroneous(errs); reportSyntaxError(err, key, (Object[])args); if (errs != null) { JCTree last = errs.last(); if (last != null) storeEnd(last, pos); } return toP(err); }