# IN SLR(1) SR CONFLICT [closed]

276 views

Here what will we do check intersection of follow(S) and follow(B) if common find then declare SR CONFLICT or

As S production finish but it's Intersection is only possible with terminal(which is after dot in unfinished production)

closed as a duplicate of: GATE2017-1-43

retagged
1
No this is not SR conflict because shift transition will not present here...shift transition is only on terminals.
0

## Related questions

1
682 views
1 vote
$A→ b.a , \left \{ b \right \}$ $B→ b.,\left \{ a \right \}$ It is a SR conflict in LALR(1). Now how reduce state operated on $a$ for non terminal $B$(and not $b$) ?
Is the given grammar SLR(1)? $\text{E}\rightarrow \text{T+E | T}$ $\text{T}\rightarrow i$
Consider the following grammar: stmt $\rightarrow$ if expr then expr else expr; stmt | $0$ expr $\rightarrow$ term relop term | term term $\rightarrow$ id | number id $\rightarrow$ a | b | c number $\rightarrow [0-9]$ where relop is a relational operator (e.g.. $<$ ... example. the program if $e_1$ then $e_2$ else $e_3$ has $2$ control flow paths. $e_1 \rightarrow e_2$ and $e_1 \rightarrow e_3$.