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 oe = 6; int penfont = 7;
...draw the AST and evaluation results for the following expression:
oe - 6 - (2 + penfont * 2)
Things to double-check in your solution:
Given the following variables:
int pespru = 7; boolean clepiac = true; boolean eii = true; double to = 3.0; int nonlar = 7;
...draw the AST and evaluation results for the following expression:
pespru != 2 && clepiac && eii && to < nonlar
Things to double-check in your solution:
Draw the AST and evaluation results for the following expression:
0 + (1 + 2 + "3") + 4 + 5
Things to double-check in your solution:
Related puzzles: