Drawing ASTs for expressions: Correct Solution

For each of the Java expressions below:

• Draw an AST for the expression.
• Show how the expression evaluates at each node in the tree.

Be sure that your tree accurately reflects how Java would evaluate the expression.

Part 1

Given the following variables:

double prorhod = 2.0;
int garism = 2;
int gialun = 1;

...draw the AST and evaluation results for the following expression:

0 + 3 % 5 - prorhod % 5 * garism % gialun

Solution

Things to double-check in your solution:

• Do you have the left and right branches on the correct side?
• Did you indicate the difference between ints and floating point values?

Part 2

Given the following variables:

boolean tresups = true;
double zass = 3.0;
int ve = 4;
double a = 1.0;
boolean pherm = false;

...draw the AST and evaluation results for the following expression:

!tresups != 7 >= zass || 9 != ve == ((a != 3) || pherm) != (!(5 != 3))

Solution

Things to double-check in your solution:

• Does your tree correctly reflect the precedence of && and ||?
• Did you correctly show short-circuiting? (That is when the right branch of && or || is never evaluated because the left branch already determines the answer.)

Part 3

Draw the AST and evaluation results for the following expression:

0 + 1 + 2 + (3 + 4 + 5 + "6" + 7)

Solution

Things to double-check in your solution:

• Did you indicate the distinction between ints and Strings?
• Are your left/right branches correct?

Related puzzles:

• Class declarations and object modeling: Correct Solution (17vu-8qyq-es4r-jddt-2)
• Class declarations and object modeling: Correct Solution (17uz-zyyj-oud2-etj5-k)