Basic Blocks and Flow Graphs│Compiler Design│Part# 47│Learn CSE Malayalam

Описание: Flow graphs are the graphical representation of intermediate code and is constructed with the help of basic blocks. The intermediate code can be divided into a number of basic blocks with maximum sequence of codes. In an intermediate code the control enter into a basic block only through the first instruction and thus left the block with the last instruction. No condition or unconditional jumps and halting instructions are included in any basic block except the last instruction. The basic block can be generated by identifying the leaders in a code. The basic block contains the instructions in an intermediate code from a leader to the instruction just before next leader.
These basic blocks are the nodes of the flow graph and the edge in a flow graph shows the control flow between the basic blocks. Identification of loops is a major factor in code transformation. Thus the loops can be efficiently identified from a flow graph.

00:49 : Basic Blocks
08:58 : Flow Graphs
15:44 : Loops

Conditional and unconditional jumps :    • Jump Statements in C│C programming│Part# 2...  
for Loop :    • Decision Making and Looping: The for loop ...  
while and do-while Loop :    • while and do-while loop in C│C programming...  

Please comment your suggestions & required topics.
Mail us to: [email protected]
Follow us in:   / learncsemalayalam