0 votes 0 votes S$\rightarrow aS|Sa|a$ find number of conflict state in DFA with LR(1) items Compiler Design parsing + – amit166 asked Jan 9, 2019 amit166 571 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Mk Utkarsh commented Jan 9, 2019 reply Follow Share 2 states 0 votes 0 votes Lakshman Bhaiya commented Jan 9, 2019 reply Follow Share @Mk Utkarsh Can you make a diagram for the canonical collection of $LR(1)$ item, please$?$ 0 votes 0 votes srestha commented Jan 9, 2019 reply Follow Share it is not LR(1) or LL(1) because it is ambiguous grammar right? 0 votes 0 votes Magma commented Jan 9, 2019 reply Follow Share 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 0 votes 0 votes Mk Utkarsh commented Jan 9, 2019 i reshown by Mk Utkarsh Jan 9, 2019 reply Follow Share ...... 1 votes 1 votes Lakshman Bhaiya commented Jan 9, 2019 reply Follow Share Where is the conflict and which type of$?$ 0 votes 0 votes Mk Utkarsh commented Jan 9, 2019 reply Follow Share Lakshman 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) 1 votes 1 votes Lakshman Bhaiya commented Jan 9, 2019 reply Follow Share thanks 0 votes 0 votes Please log in or register to add a comment.