For each of the Java expressions below:
Be sure that your tree accurately reflects how Java would evaluate the expression.
Given the following variables:
int phionpus = 1; int li = 2; int il = 1; int beph = 7; double ia = 1.0;
...draw the AST and evaluation results for the following expression:
6 * 4 * 2 - 3 - phionpus * li % il - beph % ia
Things to double-check in your solution:
Given the following variables:
double xin = 3.0; boolean gomed = false; double jes = 1.0; double ma = 4.0; boolean iass = true; boolean har = false; boolean cegos = false;
...draw the AST and evaluation results for the following expression:
4 >= xin && gomed || jes != 4 != (2 == ma) == 6 >= 2 || iass && har || cegos
Things to double-check in your solution:
Draw the AST and evaluation results for the following expression:
0 + 1 + 2 + 3 + 4 + (5 + 6 + "7" + 8 + "9")
Things to double-check in your solution:
Related puzzles: