Control Stack in Compiler Design Tutorial

Control Stack in Compiler Design Tutorial

Control Stack

The flow of the control in a program corresponds to a depth first traversal f the activation tree that

  1. Starts at the root,
  2. Visits a node before its children,
  3. Recursively visits children at each node and a left-to-right order.
  • A slack called control stack can he used to keep track of live proceed
  1. An activation record is pushed onto the control stack as activation starts.
  2. That activation record is popped when that activation ends.
  • when node n is at the top of 6th control stack, the stack contain nodes along the path from n to the root.

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,  facebookGoogle Plus

Leave a Reply

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