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 sondo = 2.0;
double idar = 1.0;
int enoad = 8;
int ka = 2;

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

sondo + (idar / enoad % ka + 9)

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 pasir = true;
double rham = 1.0;
int e = 6;
double flurvis = 1.0;
boolean he = false;

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

pasir || (rham == e || flurvis >= 0 || he)

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

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:

• Stack frames and objects (like the Idea Lab activity): Correct Solution (1dao-mvdc-p730-haur-a)
• Class relationships: Correct Solution (resq-ktk5-fu4i-gdau)