Made Easy Test Series

Question

Can anyone draw the transition diagram for this augmented grammar in LR(1) parser?

$S’\rightarrow S$

$S\rightarrow A|B$

$A\rightarrow fAi|n$

$B\rightarrow fBii|d$

for the above augmented grammar the number of states in LR(1) parser are________.

Answer 1

Number of states in $LR(1)$ Parser is 20.