Database-Management-System
October 13, 2023Set-Theory
October 13, 2023Compiler-Design
|
Question 43
|
The grammar A → AA | (A) | ε is not suitable for predictive-parsing because the grammar is:
|
ambiguous
|
|
|
left-recursive
|
|
|
right-recursive
|
|
|
an operator-grammar
|
Question 43 Explanation:
The given grammar can be turned into a infinite parse tree. So it is ambiguous.
It have A → AA has left recursion.
It have A → AA has left recursion.
Correct Answer: A
Question 43 Explanation:
The given grammar can be turned into a infinite parse tree. So it is ambiguous.
It have A → AA has left recursion.
It have A → AA has left recursion.
Subscribe
Login
0 Comments