recategorized by
744 views

3 Answers

1 votes
1 votes
ANS SHOULD BE D

BECAUSE IT DOESN’T  LL(1).

AND IN CASE OF LR(1) ,IT CONTAIN S-R CONFLICT
0 votes
0 votes
It is clr(1) .... option c
0 votes
0 votes
It is not SLR(1) as

follow(A) $\cap$ first(A) $\neq \phi$

As they were having SR conflict but even when you put reduce moves in Follow(A) it has SR conflict again

 

Even after adding lookahead, we are not able to resolve SR conflict.

SO it is not LALR, not CLR, etc

 

It is none of these

Related questions

0 votes
0 votes
1 answer
1
Na462 asked Jan 16, 2019
762 views
Which of the Statements are True :S1: LR(1) grammar can be LR(0) but not LL(1).S2 : Every regular language is LL(1)S3 : Three address code is linear representation of Syn...
3 votes
3 votes
1 answer
2
1 votes
1 votes
0 answers
3
rahul sharma 5 asked Oct 29, 2017
542 views
The given answer is 5,i am getting 616 in CLR and 10 in LALR.Please someone confirm?