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 glinvoss = 2;
...draw the AST and evaluation results for the following expression:
2 - 1 * 5 + glinvoss % 1 / 9 + 9
Things to double-check in your solution:
Given the following variables:
double alljess = 1.0; double prenhir = 4.0; boolean ird = true; double esm = 2.0; boolean smoch = false; int prenpron = 8; boolean oelfri = true;
...draw the AST and evaluation results for the following expression:
alljess >= prenhir || ird || 0 >= esm || smoch != prenpron >= 5 == oelfri
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"
Things to double-check in your solution:
Related puzzles: