1 votes 1 votes 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? Reference:- https://gateoverflow.in/113114/slr-parsing-table#c113505 Compiler Design parsing lr-parser compiler-design + – Samujjal Das asked Feb 4, 2017 Samujjal Das 384 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Smriti012 commented Feb 4, 2017 i edited by Smriti012 Feb 4, 2017 reply Follow Share 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: 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. For any two complete items A → a • and B → b • in s, Follow(A) and Follow(B) are disjoint (their intersection is the empty set). Violation of this rule is a Reduce-Reduce Conflict. 0 votes 0 votes bad_engineer commented Feb 4, 2017 reply Follow Share in one state it is considered as single SR or RR conflicts 0 votes 0 votes Samujjal Das commented Feb 4, 2017 reply Follow Share Thank you!! 0 votes 0 votes Please log in or register to add a comment.