DSSSB PGT 2021
October 6, 2023Data-Structures
October 6, 2023Grammar
Question 3 |
A grammar that is both left and right recursive for a non-terminal, is
Ambiguous | |
Unambiguous | |
Information is not sufficient to decide whether it is ambiguous or unambiguous | |
None of the above |
Question 3 Explanation:
If a grammar is both left and right recursion, then grammar may or may not be ambiguous.
Correct Answer: C
Question 3 Explanation:
If a grammar is both left and right recursion, then grammar may or may not be ambiguous.
Subscribe
Login
0 Comments