Register

Grammar is LALR or not

• retagged by
695 views
0 votes
0 votes

• retagged by
User Avatar

1 Answer

Best answer
0 votes
0 votes
I4 contains 2 productions and I7 contains only one production,so we cannot merge these two state.

when we merge is same productions but differ in lookahead symbols

so the grammmar is CLR(1) and LALR(1)
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
sripo asked Nov 10, 2018
3,265 views
If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?
Can you give an example which is not LL(1) but is CLR(1)
Can you give an example which is not LL(1) but is CLR(1)
User Avatar
8 votes
8 votes
3 answers
2
Parshu gate asked Nov 13, 2017
15,517 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
2 answers
3
sripo asked Nov 1, 2018
2,403 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
Link Copied!