GATE CS 2019 — Question 41

Numerical answer 2 marks Question 41 2019

Question 41

NAT 2 marks · no negative Compiler Design

Consider the grammar given below:

S → a S B | d
B → b

The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is ______.

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2019 Compiler Design

Source: GATE 2019 Computer Science and Information Technology, Q41 (question number approximate)

All Compiler Design questions