GATE CS 2026 (Afternoon) — Question 41

Compiler DesignLexical Analysis & Parsing Architectures (LL(1), LR(1), LALR)MCQ2 marks · −2/3 if wrongHard

Consider the canonical \( LR(0) \) parsing of the grammar below using terminals \( \{a, b, c\} \) and non-terminals \( \{A, B, C, S\} \) with \( S \) as the start symbol. \( S \rightarrow ACB \) \( A \rightarrow \alpha A \mid \epsilon \) \( C \rightarrow cC \mid \epsilon \) \( B \rightarrow bB \mid b \) Which one of the following options gives the number of shift-reduce conflicts that will occur in the \( LR(0) \) ACTION table?
  1. A
    2
  2. B
    3
  3. C
    4
  4. D
    5
Practise the full 2026-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group