INTRODUCTION TO COMPILER DESIGN
OVERVIEW OF COMPILERS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The graph that shows basic blocks and their successor relationship is called
|
|
DAG
|
|
|
Flow graph
|
|
|
Control graph
|
|
|
Hamilton graph
|
Explanation:
Detailed explanation-1: -The graph that shows the basic blocks and their successor relationship is called control graph.
Detailed explanation-2: -In a control-flow graph, nodes represent blocks of code and edges represent transfers of control between blocks.
Detailed explanation-3: -There are two type of basic block optimization. These are as follows: Structure-Preserving Transformations. Algebraic Transformations.
There is 1 question to complete.