# Self Doubt

1 vote
203 views

If in the state table of a LR parser, in some row, we have more than one SR or RR conflict, then is it considered a single conflict?

0

A Grammar is said to be SLR(1) if and only if, for each and every state s in the SLR(1) automaton, none of the following conditions are violated:

1. For any reducible rule A → a • Xb in state s (where X is some terminal), there must not exist some irreducible rule, B → a • in the same state s such that the follow set of B contains the terminal X. In more formal terms, the intersection of set containing the terminal X and the follow set of B must be empty. Violation of this rule is a Shift-Reduce Conflict.
2. For any two complete items A → a • and B → b • in sFollow(A) and Follow(B) are disjoint (their intersection is the empty set). Violation of this rule is a Reduce-Reduce Conflict.
0
in one state it is considered as single SR or RR conflicts
0
Thank you!!

## Related questions

1
267 views
If a grammar is LL(1) then it would be definitely CLR(1) i.e. LR(1) or LALR(1)
In Fig. $4.56$ is a grammar for certain statements, similar to that discussed in Question $4.4.12$. Again, $e$ and $s$ are terminals standing for conditional expressions and "other statements," respectively. Build an LR parsing table for this grammar, resolving conflicts in the usual way ... your parser on the following inputs: if e then s ; if e then s end while e do begin s ; if e then s ; end