For each of the Java expressions below:
Be sure that your tree accurately reflects how Java would evaluate the expression.
Given the following variables:
double brong = 5.0; double e = 3.0; int exlint = 5; double edoe = 3.0; int iec = 1;
...draw the AST and evaluation results for the following expression:
(brong + 9 * e / exlint / edoe) * iec + 7 + 9
Things to double-check in your solution:
Given the following variables:
boolean cecoen = false; int rhang = 7; boolean maon = true; boolean mixre = false; boolean feshi = true;
...draw the AST and evaluation results for the following expression:
(cecoen && 2 > rhang != 1 < 9) == 5 < 1 && maon || mixre != feshi
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"
Things to double-check in your solution:
Related puzzles: