private static void parenthesizeIfRequired(final Expression expression, final int minimumPrecedence) { if (getPrecedence(expression) < minimumPrecedence) { parenthesize(expression); } }
private static void parenthesizeIfRequired(final Expression expression, final int minimumPrecedence) { if (getPrecedence(expression) < minimumPrecedence) { parenthesize(expression); } }
private static void parenthesizeIfRequired(final Expression expression, final int minimumPrecedence) { if (getPrecedence(expression) < minimumPrecedence) { parenthesize(expression); } }
@Override public Void visitUnaryOperatorExpression(final UnaryOperatorExpression node, final Void data) { final Expression child = node.getExpression(); parenthesizeIfRequired(child, getPrecedence(node)); if (_insertParenthesesForReadability && child instanceof UnaryOperatorExpression) { parenthesize(child); } return super.visitUnaryOperatorExpression(node, data); }
@Override public Void visitUnaryOperatorExpression(final UnaryOperatorExpression node, final Void data) { final Expression child = node.getExpression(); parenthesizeIfRequired(child, getPrecedence(node)); if (_insertParenthesesForReadability && child instanceof UnaryOperatorExpression) { parenthesize(child); } return super.visitUnaryOperatorExpression(node, data); }
@Override public Void visitUnaryOperatorExpression(final UnaryOperatorExpression node, final Void data) { final Expression child = node.getExpression(); parenthesizeIfRequired(child, getPrecedence(node)); if (_insertParenthesesForReadability && child instanceof UnaryOperatorExpression) { parenthesize(child); } return super.visitUnaryOperatorExpression(node, data); }
@Override public Void visitBinaryOperatorExpression(final BinaryOperatorExpression node, final Void data) { final int precedence = getPrecedence(node); if (_insertParenthesesForReadability && precedence < EQUALITY) { if (getBinaryOperatorType(node.getLeft()) == node.getOperator()) { parenthesizeIfRequired(node.getLeft(), precedence); } else { parenthesizeIfRequired(node.getLeft(), EQUALITY); } parenthesizeIfRequired(node.getRight(), EQUALITY); } else { parenthesizeIfRequired(node.getLeft(), precedence); parenthesizeIfRequired(node.getRight(), precedence + 1); } return super.visitBinaryOperatorExpression(node, data); }
@Override public Void visitBinaryOperatorExpression(final BinaryOperatorExpression node, final Void data) { final int precedence = getPrecedence(node); if (_insertParenthesesForReadability && precedence < EQUALITY) { if (getBinaryOperatorType(node.getLeft()) == node.getOperator()) { parenthesizeIfRequired(node.getLeft(), precedence); } else { parenthesizeIfRequired(node.getLeft(), EQUALITY); } parenthesizeIfRequired(node.getRight(), EQUALITY); } else { parenthesizeIfRequired(node.getLeft(), precedence); parenthesizeIfRequired(node.getRight(), precedence + 1); } return super.visitBinaryOperatorExpression(node, data); }
@Override public Void visitBinaryOperatorExpression(final BinaryOperatorExpression node, final Void data) { final int precedence = getPrecedence(node); if (_insertParenthesesForReadability && precedence < EQUALITY) { if (getBinaryOperatorType(node.getLeft()) == node.getOperator()) { parenthesizeIfRequired(node.getLeft(), precedence); } else { parenthesizeIfRequired(node.getLeft(), EQUALITY); } parenthesizeIfRequired(node.getRight(), EQUALITY); } else { parenthesizeIfRequired(node.getLeft(), precedence); parenthesizeIfRequired(node.getRight(), precedence + 1); } return super.visitBinaryOperatorExpression(node, data); }