In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG),…

PYQ GATE 2015

In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE?

  1. A.

    In both AST and CFG, let node N2N_2 be the successor of node N1N_1. In the input program, the code corresponding to N2N_2 is present after the code corresponding to N1N_1

  2. B.

    For any input program, neither AST nor CFG will contain a cycle

  3. C.

    The maximum number of successors of a node in an AST and a CFG depends on the input program

  4. D.

    Each node in AST and CFG corresponds to at most one statement in the input program

Attempted by 156 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…