grouping = "InfixOperator.RIGHT_ASSOCIATIVE"; System.out.println( " new DivideOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", " + iOper.getPrecedence() + ", " + grouping + ")," ); grouping = "InfixOperator.RIGHT_ASSOCIATIVE"; System.out.println( " new SubtractOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", " + iOper.getPrecedence() + ", " + grouping + ")," ); grouping = "InfixOperator.RIGHT_ASSOCIATIVE"; System.out.println( " new InfixOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", " + iOper.getPrecedence() + ", " + grouping + ")," );
public void convertBinaryOperator(final Writer buf, final IAST list, final InfixOperator oper, final int precedence) throws IOException { if (oper.getPrecedence() < precedence) { buf.write("("); } if (list.size() > 1) { convert(buf, list.get(1), oper.getPrecedence()); } for (int i = 2; i < list.size(); i++) { buf.write(oper.getOperatorString()); convert(buf, list.get(i), oper.getPrecedence()); } if (oper.getPrecedence() < precedence) { buf.write(")"); } }
grouping = "InfixOperator.RIGHT_ASSOCIATIVE"; System.out.println(" new DivideOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", " + iOper.getPrecedence() + ", " + grouping + "),"); } else if (oper instanceof SubtractOperator) { grouping = "InfixOperator.RIGHT_ASSOCIATIVE"; System.out.println(" new SubtractOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", " + iOper.getPrecedence() + ", " + grouping + "),"); } else if (oper instanceof InfixOperator) { grouping = "InfixOperator.RIGHT_ASSOCIATIVE"; System.out.println(" new InfixOperator(\"" + iOper.getOperatorString() + "\", \"" + iOper.getFunctionName() + "\", " + iOper.getPrecedence() + ", " + grouping + "),"); } else if (oper instanceof PostfixOperator) {
buf.write(oper.getOperatorString()); } else { if (i < size) { buf.write(oper.getOperatorString());
private final ASTNode parseInfixOperator(ASTNode lhs, InfixOperator infixOperator) { ASTNode rhs; rhs = parseLookaheadOperator(infixOperator.getPrecedence()); lhs = infixOperator.createFunction(fFactory, lhs, rhs); String infixOperatorString = infixOperator.getOperatorString(); while (fToken == TT_OPERATOR && infixOperator.getGrouping() == InfixOperator.NONE && infixOperatorString.equals(fOperatorString)) { getNextToken(); if (";".equals(infixOperatorString)) { if (fToken == TT_EOF || fToken == TT_ARGUMENTS_CLOSE || fToken == TT_LIST_CLOSE || fToken == TT_PRECEDENCE_CLOSE || fToken == TT_COMMA) { ((FunctionNode) lhs).add(fFactory.createSymbol("Null")); break; } } while (fToken == TT_NEWLINE) { getNextToken(); } rhs = parseLookaheadOperator(infixOperator.getPrecedence()); ((FunctionNode) lhs).add(rhs); } return lhs; }
buf.write(oper.getOperatorString()); } else { showOperator = true;
append(buf, "("); } else { if (oper.getOperatorString() == "^") { final Operator operator = getOperator(list.arg1().topHead()); if (operator instanceof PostfixOperator) { append(buf, ")"); } else { if (oper.getOperatorString() == "^") { final Operator operator = getOperator(list.arg1().topHead()); if (operator instanceof PostfixOperator) { append(buf, oper.getOperatorString()); append(buf, oper.getOperatorString()); convert(buf, list.get(i), oper.getPrecedence(), false);
tag(buf, "mo", oper.getOperatorString()); tag(buf, "mo", oper.getOperatorString()); convert(buf, list.get(i), oper.getPrecedence(), false);
append(buf, oper.getOperatorString()); } else { showOperator = true;
String operatorStr = oper.getOperatorString();