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 onder = 8; int le = 2; double ia = 3.0; double supriod = 3.0;
...draw the AST and evaluation results for the following expression:
onder + le % 9 - 7 - 0 + ia * (supriod * 7)
Things to double-check in your solution:
Given the following variables:
boolean sedri = true; int staclen = 5; int pesba = 2; int istwin = 9; int assti = 4; int verbe = 9; int an = 2; int chisskor = 1;
...draw the AST and evaluation results for the following expression:
sedri || staclen == 0 || (3 >= pesba != !(istwin >= assti) == 2 < 7) == (3 == verbe) == an > chisskor
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: