DSSSB PGT 2021
October 6, 2023GATE 1999
October 6, 2023GATE 1999
|
Question 42
|
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 42 Explanation:
If a grammar is both left and right recursion, then grammar may or may not be ambiguous.
Correct Answer: C
Question 42 Explanation:
If a grammar is both left and right recursion, then grammar may or may not be ambiguous.