Computer Sciences > Gate 2015 Set-2 > CFG
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.

Correct : CFG

Similar Questions

For any two languages L1 and L2 such that L1 is context free and L2 is recursively enumerable but not recursive, which of the following is/are necessarily true?...
#80 MCQ
A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example,...
#86 MCQ
Consider the following languages: L1= {anbmcn+m : m, n >= 1} L2= {anbnc2n : n >= 1} Which one of the following is TRUE?
#89 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: