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 preapre = 2; double pi = 4.0; int hewrat = 2;
...draw the AST and evaluation results for the following expression:
preapre / 1 * pi + (1 * hewrat + 8)
Things to double-check in your solution:
Given the following variables:
double pou = 2.0; double e = 1.0; boolean hanon = true; boolean lismhic = false;
...draw the AST and evaluation results for the following expression:
(9 > pou || 2 != 9 == (e != 2) == hanon) && lismhic
Things to double-check in your solution:
Draw the AST and evaluation results for the following expression:
0 + 1 + 2 + ("3" + 4 + 5 + 6)
Things to double-check in your solution:
Related puzzles: