• retagged by
11,982 views

2 Answers

Best answer
6 6 votes
==>as the given grammar is left recursive (S->Sc),so it is not LL(1) grammar.

==>as the given grammar has SR conflict,it is not LR(0) grammar(A->S.d and A->S.)

==>it is SLR(1) as there is no any SR conflict

so answer is A) SLR(1)
• selected by
1 1 vote

I am getting A as answer . Correct me if I am wrong 

• edited by
Position:
Show:

Related questions

2 2 votes
4 4 answers
6.1k
6.1k views
Prashant Gupta asked Sep 8, 2014
6,103 views
Among LR(0), SLR(1) and LALR(1) which parser is going to detect error faster and why??
0 0 votes
1 answers 1 answer
1.2k
1.2k views
1 1 vote
1 1 answer
1.1k
1.1k views
vaibhav101 asked Jan 13, 2018
1,057 views
According to my understanding, we LALR is constructed by reducing LR(1) automaton states. So I think it should be LR(1)However, we construct SLR(1) items from the LR(0) a...
2 2 votes
1 answers 1 answer
1.4k
1.4k views