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:

int courbic = 9;

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

0 + 5 - courbic

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 hoepiss = false;

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

4 < 4 || hoepiss

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:

• Class relationships: Correct Solution (rjua-o014-nm53-Lnir)
• Class relationships: Correct Solution (rg1b-neew-cm6m-jef5)
• Booleans and conditionals: Correct Solution (5mf3-aqk8-qoep-7xbg)
• Stack frames and objects (like the Idea Lab activity): Correct Solution (1d8w-Lir3-afc7-93dh-t)
• Closures and event handling: Correct Solution (Lwqq-t71d-362a-jr8f)