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

Question

TuteeHUB · Accepted Answer

None of the mentioned

TuteeHUB · Answer

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

TuteeHUB · Answer

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

TuteeHUB · Answer

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

TuteeHUB · Answer

None of the mentioned

1.	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
Answer» D. None of the mentioned

Discussion