Handbook of Computer Science(cs) and IT

 

Activation Tree

We can create a tree (known as activation tree) to show the way control enters and leaves activations. 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.

 

Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95

Leave a Reply

Your email address will not be published. Required fields are marked *