GATE CS 2020 (Forenoon) — Question 34

Compiler DesignLexical Analysis & Parsing Architectures (LL(1), LR(1), LALR)NAT1 markMedium

Consider the following grammar: \( S \rightarrow aSB \mid d \) \( B \rightarrow b \) The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is ________.
Practise the full 2020-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkCompilers: Principles, Techniques & ToolsThe "Dragon Book" for parsing, syntax-directed translation and code generation.
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