edited by
342 views

1 Answer

1 votes
1 votes

Okay ..

To check,  this is LR(0) or not check Conflicts.

There are two type conflict 1) SR Conflict and 2) RR conflict

A full parsing table is not needed, only the canonical collection. In the canonical collection, find all final items (and only final items), and see if:

  • There are both shift and reduce in the same item ("shift-reduce", s/r)
  • There are two reduce actions in the same item ("reduce-reduce", r/r)

If none of these is true, there are no conflicts means it is LR(0).

And If it is LR(0) then it is also SLR.

 

Here you can see there is no conflict. 

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
Jyoti Kumari97 asked Nov 18, 2018
239 views
answer is option dcan anyone tell me how option d is the correct answer?
0 votes
0 votes
1 answer
3
Jyoti Kumari97 asked Nov 18, 2018
339 views
COMMENT(how the below statement is true)LL(k) languages are proper subset of LL(k-1) languages.