private static boolean isReductionOpportunity(ASTNode oper, ASTNode node) { ASTNode n = node; return (n != null && n.isLiteral() && (n = n.nextASTNode) != null && reducacbleOperator(n.getOperator()) && PTABLE[oper.getOperator()] <= PTABLE[n.getOperator()] && (n = n.nextASTNode) != null && n.isLiteral() && n.getLiteralValue() instanceof Number); }
private static boolean isReductionOpportunity(ASTNode oper, ASTNode node) { ASTNode n = node; return (n != null && n.isLiteral() && (n = n.nextASTNode) != null && reducacbleOperator(n.getOperator()) && PTABLE[oper.getOperator()] <= PTABLE[n.getOperator()] && (n = n.nextASTNode) != null && n.isLiteral() && n.getLiteralValue() instanceof Number); }
private static boolean isReductionOpportunity(ASTNode oper, ASTNode node) { ASTNode n = node; return (n != null && n.isLiteral() && (n = n.nextASTNode) != null && reducacbleOperator(n.getOperator()) && PTABLE[oper.getOperator()] <= PTABLE[n.getOperator()] && (n = n.nextASTNode) != null && n.isLiteral() && n.getLiteralValue() instanceof Number); }
public String toString() { return isOperator() ? "<<" + DebugTools.getOperatorName(getOperator()) + ">>" : (PCTX_STORED & fields) != 0 ? nameCache : new String(expr, start, offset); }
public String toString() { return isOperator() ? "<<" + DebugTools.getOperatorName(getOperator()) + ">>" : (PCTX_STORED & fields) != 0 ? nameCache : new String(expr, start, offset); }
public String toString() { return isOperator() ? "<<" + DebugTools.getOperatorName(getOperator()) + ">>" : String.valueOf(literal); } }
sbuf.append("OPERATOR [").append(getOperatorName(tk.getOperator())).append("]: ") .append(tk.getName());
sbuf.append("OPERATOR [").append(getOperatorName(tk.getOperator())).append("]: ") .append(tk.getName());
sbuf.append("OPERATOR [").append(getOperatorName(tk.getOperator())).append("]: ") .append(tk.getName());
protected ASTNode verify(ParserContext pCtx, ASTNode tk) { if (tk.isOperator() && (tk.getOperator().equals(Operator.AND) || tk.getOperator().equals(Operator.OR))) { secondPassOptimization = true;
protected ASTNode verify(ParserContext pCtx, ASTNode tk) { if (tk.isOperator() && (tk.getOperator().equals(Operator.AND) || tk.getOperator().equals(Operator.OR))) { secondPassOptimization = true;
protected ASTNode verify(ParserContext pCtx, ASTNode tk) { if (tk.isOperator() && (tk.getOperator().equals(Operator.AND) || tk.getOperator().equals(Operator.OR))) { secondPassOptimization = true;
optimizedAst.addTokenNode(tk, tkOp); else if (tkOp.isOperator() && tkOp.getOperator() < 21) { int op = tkOp.getOperator(); int op2; Object val = new BinaryOperation(oper.getOperator(), inv ? new LiteralNode(signNumber(tk2.getLiteralValue()), pCtx) : tk2, rightNode, pCtx) .getReducedValueAccelerated(null, null, null); && (reducacbleOperator(astLinkedList.peekNode().getOperator())) && astLinkedList.peekNext().isLiteral(); bo = new BinaryOperation(tkOp.getOperator(), tk, new LiteralNode(p_inv ? signNumber(val) : val, pCtx), pCtx); && tkOp2.getFields() != -1 && (op2 = tkOp2.getOperator()) != -1 && op2 < 21) { optimizeOperator(tkOp2.getOperator(), bo, tkOp2, astLinkedList, optimizedAst, pCtx); optimizeOperator(tkOp.getOperator(), tk, tkOp, astLinkedList, optimizedAst, pCtx); && (tkOp.getOperator() == Operator.AND || tkOp.getOperator() == Operator.OR)) { if (tkOp.getOperator() == Operator.AND) { bool = new And(tk, astLinkedList.nextNode(), pCtx.isStrongTyping(), pCtx); if ((tkOp = tkOp2).getOperator() == Operator.AND) { bool.setRightMost(new And(bool.getRightMost(), astLinkedList.nextNode(), pCtx.isStrongTyping(), pCtx));
if (isArithmeticOperator(operator2 = tk.getOperator()) && PTABLE[operator2] > PTABLE[operator]) { stk.xswap(); if ((tk = nextToken()) != null && (operator2 = tk.getOperator()) != -1 && operator2 != END_OF_STMT && PTABLE[operator2] > PTABLE[operator]) { operator = tk.getOperator();
if (isArithmeticOperator(operator2 = tk.getOperator()) && PTABLE[operator2] > PTABLE[operator]) { stk.xswap(); ASTNode previousToken = tk; if ((tk = nextToken()) != null && (operator2 = tk.getOperator()) != -1 && operator2 != END_OF_STMT && PTABLE[operator2] > PTABLE[operator]) { operator = tk.getOperator();
if (isArithmeticOperator(operator = tk.getOperator())) { stk.push(nextToken().getReducedValue(ctx, ctx, variableFactory), operator); switch (procBooleanOperator(operator = tk.getOperator())) { case OP_TERMINATE: return stk.peek();
switch (operator = tk.getOperator()) { case NOOP: continue;
if (isArithmeticOperator(operator = tk.getOperator())) { stk.push(nextToken().getReducedValue(ctx, ctx, variableFactory), operator); switch (procBooleanOperator(operator = tk.getOperator())) { case RETURN: variableFactory.setTiltFlag(true);
if (isArithmeticOperator(operator = tk.getOperator())) { stk.push(nextToken().getReducedValue(ctx, ctx, variableFactory), operator); switch (procBooleanOperator(operator = tk.getOperator())) { case RETURN: variableFactory.setTiltFlag(true);
switch (operator = tk.getOperator()) { case RETURN: variableFactory.setTiltFlag(true);