Machine-translated by Google. Questions are authored in English.
Top

Discussion

A flow graph represents

  • A.the syntax of the program as derived by the parser
  • B.the sequence of phases through which the compiler eventually passes
  • C.the nesting of scopes recorded in the symbol table
  • D.basic blocks as nodes with edges showing possible control flow

Answer: D

Correct answer: basic blocks as nodes with edges showing possible control flow

The flow graph abstracts the program to its control structure: each node is a basic block, and an edge from one to another means control may pass between them.

Loops appear as cycles and conditionals as branching and rejoining paths. It is the structure on which global data flow analysis runs, since questions such as "which definitions reach this point" are answered by propagating facts along the edges until they settle.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.