Register

If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?

3,236 views

1 Answer

Best answer
9 votes
9 votes

S->Aa/bAc/Bc/bBa

A->d

B->d

this grammar is not LL(1) but it is CLR(1). below image will clear your doubt more-

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

8 votes
8 votes
3 answers
1
Parshu gate asked Nov 13, 2017
15,424 views
Finding type of Grammar LL(1), OR LR(0) , OR CLR(1) OR LALR(1)
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1) OR LALR(1)
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1...
User Avatar
0 votes
0 votes
1 answer
2
Rahul Ranjan 1 asked Mar 19, 2018
4,954 views
Check if grammar is LL(1) ?
Given a grammar : $E \rightarrow E + T / T$ $T \rightarrow i$ Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without drawing parsing table ?
Given a grammar :$E \rightarrow E + T / T$$T \rightarrow i$Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without dra...
User Avatar
0 votes
0 votes
2 answers
3
sripo asked Nov 1, 2018
2,366 views
Is the given grammar CLR(1) or not please explain me if there is a shift reduce conflict
S→(X S→E] S→E) X→E) X→E] E→ϵ Is this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E-> epsilon with lookup symbols ),]
S→(XS→E]S→E)X→E)X→E]E→ϵIs this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E- epsilon with lookup symbols ),]
User Avatar
1 votes
1 votes
1 answer
4
smsubham asked Apr 4, 2018
1,038 views
LL(n)
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we are given that maximum length of non-determinism in a production is n - 1. Can we use this grammar for LL(n) predictive parsing?
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we a...
User Avatar
Link Copied!