Syntax-tree-and-context-flow-graph

Question 1
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE?
A
In both AST and CFG, let node, N2 be the successor of node N1. In the input program, the code corresponding to N2 is present after the code corresponding in N1.
B
For any input program, neither AST nor CFG will contain a cycle
C
The maximum number of successors of a node in an AST and a CFG depends on the input program
D
Each node is AST and CFG corresponds to at most one statement in the input program
       Compiler-Design       Syntax-tree-and-context-flow-graph       GATE 2015 -(Set-2)
Question 1 Explanation: 
Optional (A) is not true when CFG contains cycle
Option (B) is false as CFG can contain cycle
Option (D) is false as a single node can contain block of statements.
There is 1 question to complete.