Activation Trees

q(1,9)

p(1,9)

q(1,3)

q(5,9)

p(1,3)

q(1,0)

q(2,3)

• each node represents an activation
• the root represents the main program
• node A is a parent of node B if A calls B
• the order of siblings is determined by the lifetimes of the activations

Previous slide

Next slide

Back to first slide

View graphic version