GATE Computer Science (CS) 2015 Shift 2 Solved Paper

Question : 28 of 65

Marks: +1, -0

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

In both AST and CFG, let node N₂ be the successor of node N₁. In the input program, the code corresponding to N₂ is present after the code corresponding to N₁
For any input program, neither AST nor CFG will contain a cycle
The maximum number of successors of a node in an AST and a CFG depends on the input program
Each node in AST and CFG corresponds to at most one statement in the input program

Go to Question:

Prev Question

Next Question