COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
DAG
|
|
|
Flow chart
|
|
|
Control graph
|
|
|
Hamilton graph
|
Detailed explanation-1: -Answers. The graph that shows the basic blocks and their successor relationship is called control graph .
Detailed explanation-2: -The graph that shows the basic blocks and their success of relationship is called flow graph.
Detailed explanation-3: -Basic block is a sequence of intermediate code with single entry and single out. No jumps in the middle. Flow Graph is a directed graph with flow control information added to the basic blocks. The first task is to partition a sequence of three-address code into basic blocks.
Detailed explanation-4: -Definition. In a control-flow graph each node in the graph represents a basic block, i.e. a straight-line piece of code without any jumps or jump targets; jump targets start a block, and jumps end a block.
Detailed explanation-5: -DAG representation for basic blocks. A DAG for basic block is a directed acyclic graph with the following labels on nodes: The leaves of graph are labeled by unique identifier and that identifier can be variable names or constants. Interior nodes of the graph is labeled by an operator symbol.