Question

In the context of abstract-syntax-tree and control-flow-graph. Which one of the following is true?

(a) In both AST and CFG if node N2 be the successor of node N1

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

(c) The max number of successors of a node in an AST and a CFG depends on the input program

(d) None of the mentioned

I got this question in exam.

This question is from Predictive Top-Down Parsing topic in chapter Topdown Parsing of Compiler

Answer 1

Right answer is (c) The max number of successors of a node in an AST and a CFG depends on the input program

For explanation I would say: Successors depends on input .