GATE CS 2019 (Forenoon) — Question 29

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

Consider the grammar given below: S \(\rightarrow\) Aa A \(\rightarrow\) BD B \(\rightarrow\) b | \(\epsilon\) D \(\rightarrow\) d | \(\epsilon\) Let a, b, d and \( be indexed as follows: [IMAGE_Q_13] Compute the FOLLOW set of the non-terminal B and write the index values for the symbols in the FOLLOW set in the descending order. (For example, if the FOLLOW set is {a, b, d, \)}, then the answer should be 3210)
Practise the full 2019-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