Activation Tree in Compiler Design Tutorial with Examples

Activation Tree

We can create a tree (known as activation tree) to show the way control enters and leaves activation. In an activation tree

• Each node represents an activation of a procedure.
• The root represents the activation of the main program.
• The node a is a parent of the node b if and only if the control flows from a to b.

• The node a is left to the node b if the lifetime of a occurs before the brorirne of b.

Sorting in Design and Analysis of Algorithm Study Notes with Example

Learn Sorting in Handbook Series:  Click here 

Follow Us on Social Platforms to get Updated : twiter,  facebook, Google Plus