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 prulir = 2.0;
int sontlar = 1;

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

prulir * sontlar - 7

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 uct = true;
double pedco = 3.0;

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

uct && 9 >= pedco

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"

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 (1dae-6Lb6-xp2o-rfzd-z)
• Closures and event handling: Correct Solution (Lznc-3gno-4232-s6a2)