DMS - AMBIGUOUS GRAMMAR

1. A CFG is ambiguous if

• It has more than one rightmost derivations
• It has more than one leftmost derivations
• No parse tree can be generated for the CFG
• None of the mentioned

2. Which of the following are always unambiguous?

• Deterministic Context free grammars
• Non-Deterministic Regular grammars
• Context sensitive grammar
• None of the mentioned

3. A CFG is not closed under

• Dot operation
• Union Operation
• Concatenation
• Iteration

4. Which of the following is an real-world programming language ambiguity?

• dangling else problem
• halting problem
• maze problem
• none of the mentioned

5. Which of the following is a parser for an ambiguous grammar?

• GLR parser
• Chart parser
• All of the mentioned
• None of the mentioned

6. A language that admits only ambiguous grammar:

• Inherent Ambiguous language
• Inherent Unambiguous language
• Context free language
• Context Sensitive language

7. Which of the following is an example of inherent ambiguous language?

• {an|n>1}
• {anbncmdm| n,m > 0}
• {0n1n|n>0}
• None of the mentioned

8. State true or false: Statement: R->R|T T->ε is an ambiguous grammar

• true
• False

9. In context to ambiguity, the number of times the following programming statement can be interpreted as: Statement: if R then if T then P else V

• 2
• 3
• 4
• 1

10. CFGs can be parsed in polynomial time using

• LR parser
• CYK algorithm
• SLR parser
• None of the mentioned