closed by
366 views
0 votes
0 votes
closed as a duplicate of: GATE CSE 2005 | Question: 14
The grammar A → AA | (A) | ε is not suitable for predictive parsing because the grammar is

(A) ambiguous
(B) left-recursive
(C) right-recursive
(D) an operator-grammar

 please clear this ambiguity

if grammar is ambiguous then it is not suitable for LL(1)

or grammar is left recursive then it is not suitable for LL(1)  

or grammar is ambiguous and left recursive then it is not suitable for LL(1) grammar.
closed by

Related questions

0 votes
0 votes
0 answers
2
BASANT KUMAR asked Nov 13, 2018
288 views
consider the grammer S->SS/a/$\epsilon$ .what will be the total number of inadequate state in DFA for LR(1) items is....................explanation require.
0 votes
0 votes
1 answer
3
Utsav09 asked Jan 31, 2018
373 views
Consider the grammar given$S\rightarrow AA$$A\rightarrow aA / b$How many entries will be blank in the GOTO table for SR(0) items?
2 votes
2 votes
1 answer
4
Kuldeep Pal asked Nov 5, 2017
7,223 views
Choose the correct answer for following grammarS → Aa | bAc | Bc | bBaA → dB → d(A) It is LL(1), LALR(1), and CLR(1)(B) LR(0), LALR(1), and CLR(1), but not SLR(1)(C...