Given the following type declarations:
public interface Feid {
public Feid begh(Feid an);
}
public class Thomoan implements Feid {
public Feid begh(Feid an) {
return this;
}
}
public class Spis implements Feid {
public Feid begh(Feid an) {
return an;
}
}
...and given the following setup code:
Thomoan foo = new Thomoan(); Spis bar = new Spis();
Draw an AST for the following expression, labeling the static type (a.k.a. compile-time type) of each node in the tree:
foo.begh(bar).begh(bar)
(The static type of an expression is the type that the compiler uses to check the code before it runs.)
Draw an AST for the same expression, this time labeling the runtime type of each node in the tree.
(The runtime type of an expression is the type of the actual value that appears when the code runs.)
Related puzzles: