UTpaper

Free mock tests & test series

Question 37Asked in BEL PE Computer Science, 20 Dec 2025 (5:00 PM)

Consider the following given grammar: S → L = R | R

Consider the following given grammar: S → L = R | R L → *R | id R → L Which of the following statements is true about this grammar with respect to LR parsing techniques?
  1. AThe grammar contains a shift-reduce conflict in simple LR parsing and is not LR(0) or SLR(1).
  2. BThe grammar is SLR(1) and can be parsed without shift-reduce conflicts.
  3. CThe grammar is LR(0) and can be parsed by an LR(0) parser without conflicts.
  4. DThe grammar is ambiguous and cannot be parsed by any LR parser.
Show answerHide answer

Correct answer: (A) The grammar contains a shift-reduce conflict in simple LR parsing and is not LR(0) or SLR(1).

From BEL PE Computer Science PYQ, 20 Dec 2025 (5:00 PM)

This is question 37 of BEL PE Computer Science PYQ, 20 Dec 2025 (5:00 PM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.