Discussion
The graph that shows basic blocks and their successor relationship is called
Answer: B
The graph is called a flow graph.
In compiler design, a flow graph has the basic blocks of a program as its nodes, with an edge from one block to another whenever control can pass directly from the first to the second, its successor. It is the basis of data-flow analysis and loop optimisation.
A DAG represents the expressions computed within a single basic block, 'control graph' is not the standard term, and a Hamiltonian graph is a graph-theory idea unrelated to compilers.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development