The Gateway to Computer Science Excellence
0 votes
100 views
S$\rightarrow aS|Sa|a$

find number of conflict state in DFA with LR(1) items
in Compiler Design by | 100 views
0
2 states
0

@

Can you make a diagram for the canonical collection of $LR(1)$ item, please$?$

0
it is not LR(1) or LL(1)

because it is ambiguous grammar

right?
0
Yeah mam it's not LR (1) or LL (1)

that's why the conflict that arise in the state can't be resolve by any parsing

but they ask just no of conflict state arises
+1

...... 

0
Where is the conflict and which type of$?$
+1

 i made a mistake which is not affecting the answer

while seeing S in first state i made 2 different states, so please ignore that.

there are 2 SR conflicts 

check http://jsmachines.sourceforge.net/machines/lr1.html

nice website to check your answers

https://drive.google.com/file/d/1yczdCwbJi-mjr-CWqlG9Mx6Ooc2JQkoQ/view?usp=sharing (for better image quality)

0
thanks

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,315 questions
60,433 answers
201,778 comments
95,257 users