DMS - AMBIGUOUS GRAMMAR
Authored by VANITHA K
others
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
2. Which of the following are always unambiguous?
Deterministic Context free grammars
Non-Deterministic Regular grammars
Context sensitive grammar
None of the mentioned
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
3. A CFG is not closed under
Dot operation
Union Operation
Concatenation
Iteration
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
4. Which of the following is an real-world programming language ambiguity?
dangling else problem
halting problem
maze problem
none of the mentioned
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
6. A language that admits only ambiguous grammar:
Inherent Ambiguous language
Inherent Unambiguous language
Context free language
Context Sensitive language
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
