/** * Constructor. * <p> * Creates a {@code BinaryOperatorNode} from an operator and both operands. * If either operand is {@code null}, we will synthesize * empty {@link IdentifierNode} to repair the tree. * * @param op operator token * @param left first operand * @param right second operand */ public BinaryOperatorNodeBase(IASToken op, ExpressionNodeBase left, ExpressionNodeBase right) { super(op); // Synthesize an empty ID node if either operand is null. (Fix for CMP-883) if (left == null) leftOperandNode = IdentifierNode.createEmptyIdentifierNodeAfterToken((Token)op); else leftOperandNode = left; if (right == null) rightOperandNode = IdentifierNode.createEmptyIdentifierNodeAfterToken((Token)op); else rightOperandNode = right; span(leftOperandNode, rightOperandNode); }
/** * Constructor. * <p> * Creates a {@code BinaryOperatorNode} from an operator and both operands. * If either operand is {@code null}, we will synthesize * empty {@link IdentifierNode} to repair the tree. * * @param op operator token * @param left first operand * @param right second operand */ public BinaryOperatorNodeBase(IASToken op, ExpressionNodeBase left, ExpressionNodeBase right) { super(op); // Synthesize an empty ID node if either operand is null. (Fix for CMP-883) if (left == null) leftOperandNode = IdentifierNode.createEmptyIdentifierNodeAfterToken((Token)op); else leftOperandNode = left; if (right == null) rightOperandNode = IdentifierNode.createEmptyIdentifierNodeAfterToken((Token)op); else rightOperandNode = right; span(leftOperandNode, rightOperandNode); }
node = IdentifierNode.createEmptyIdentifierNodeAfterToken(current); node = IdentifierNode.createEmptyIdentifierNodeAfterToken(current);
node = IdentifierNode.createEmptyIdentifierNodeAfterToken(current); node = IdentifierNode.createEmptyIdentifierNodeAfterToken(current);
n = IdentifierNode.createEmptyIdentifierNodeAfterToken(op); n = UnaryOperatorNodeBase.createPrefix(op, n);
n = IdentifierNode.createEmptyIdentifierNodeAfterToken(op); n = UnaryOperatorNodeBase.createPrefix(op, n);
p = new PackageNode(name != null ? name : IdentifierNode.createEmptyIdentifierNodeAfterToken(packageT), (ASToken)packageT); p.startBefore(packageT); c.addItem(p);
p = new PackageNode(name != null ? name : IdentifierNode.createEmptyIdentifierNodeAfterToken(packageT), (ASToken)packageT); p.startBefore(packageT); c.addItem(p);
n = IdentifierNode.createEmptyIdentifierNodeAfterToken(op); n = UnaryOperatorNodeBase.createPrefix(op, n);
n = IdentifierNode.createEmptyIdentifierNodeAfterToken(op); n = UnaryOperatorNodeBase.createPrefix(op, n);
placeHolderRightNode = IdentifierNode.createEmptyIdentifierNodeAfterToken(opToken);
placeHolderRightNode = IdentifierNode.createEmptyIdentifierNodeAfterToken(opToken);
name = IdentifierNode.createEmptyIdentifierNodeAfterToken(functionT); f = new FunctionNode((ASToken)functionT, name); n = new FunctionObjectNode(f);
name = IdentifierNode.createEmptyIdentifierNodeAfterToken(functionT); f = new FunctionNode((ASToken)functionT, name); n = new FunctionObjectNode(f);
leftOfIn = IdentifierNode.createEmptyIdentifierNodeAfterToken((ASToken)lparenT);
leftOfIn = IdentifierNode.createEmptyIdentifierNodeAfterToken((ASToken)lparenT);