A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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 to 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 in AST and CFG corresponds to at most one statement in the input program
Answer:The maximum number of successors of a node in an AST and a CFG depends on the input program
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: