Computer Sciences > Gate 2020 > CFG
Consider the language L = { an ∣ n≥0 }∪{ anbn∣ n≥0 } and the following statements.
I. L is deterministic context-free.
II. L is context-free but not deterministic context-free.
III. L is not LL(k) for any k.
Which of the above statements is/are TRUE ?
I. L is deterministic context-free.
II. L is context-free but not deterministic context-free.
III. L is not LL(k) for any k.
Which of the above statements is/are TRUE ?
Correct : c
Similar Questions
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is True?
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is True?
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is True?
Total Unique Visitors
Loading......