GATE CSE 2022 CS Q65: Compiler Design

Consider the following grammar along with translation rules.

Here # and % are operators and

is a token that represents an integer and

represents the corresponding integer value. The set of non-terminals is

and a subscripted non-terminal indicates an instance of the non-terminal.

Using this translation scheme, the computed value of

for root of the parse tree for the expression

is __________.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

EXPLORE & PRACTISE

Paper and topic context

See where this question comes from and choose what to practise next.

Explore more previous year questions using this question’s imported topic tags.

You’re not logged in. Log in or create an account to see discussions and add comments.