MadeEasy Test Series 2018: Compiler Design - Syntax Directed Translation

Question

Consider the following schema shown below:

Here ‘num’ is a token that represents an integer and num.val represents the corresponding integer value. For an input string ‘2 + 3 + 7 × 5 $’ this translation schema will print:

a:)  2 3 × × 7 5 + $

b:)  2 3 + 7 + 5 × $

c:) 2 3 × 7 5 + × $

d:) × × + 2 3 7 5

I am not able to generate any option.Please verify?

Comments

they have given c but why did not you take Q->Q+R {Pf(*)} R 

You have skipped last R

---

@rahul

Sorry, I had mistakenly taken

Q->Q+R {Pf(*)} | R | S

R->R*R {Pf(+)} | ϵ | S

So,above answer are according to that.

---

yeah. According to given rules,none options matched

Answer 1

I am able to generate both options a and c. 

 

 

 

Kindly correct me if I'm wrong...

Comments

yes, you skipped the R (in bold),

Q → Q + R {Print(‘x’)} R  |  S