MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Flow graph is defined as a function in a program that can be represented as a control flow graph and the nodes in the flow graph are defined as program statements while the directed edges are the flow of control. A flow graph consists of nodes and edges. Was this answer helpful?

Detailed explanation-2: -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-3: -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-4: -In compiler construction, a basic block is a straight-line code sequence with no branches in except to the entry and no branches out except at the exit. This restricted form makes a basic block highly amenable to analysis.