The Gateway to Computer Science Excellence
+1 vote
163 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?

Reference:- https://gateoverflow.in/113114/slr-parsing-table#c113505

in Compiler Design by Loyal (9.3k points) | 163 views
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!!

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,292 answers
198,232 comments
104,916 users