compiler design

Question

A shift reduce parser carries out the actions specified with in braces immediately after reducing with the corresponding rule of grammar.

S -> AS      { print 1 }

S -> AB      { print 2 }

A -> a        { print 3 }

B -> bC      { print 4 }

B -> dB     { print 5 }

C -> c       { print 6 }

This SDT scheme translates a language whose terminal symbols are a, b, c and d into another language whose terminal symbols are 1, 2, 3, 4, 5, 6. What is the translation of "aaadbc" ?

A) 333546211

B) 654211

C) 645323131

D) 645233311

Answer 1

It is 333645211.

Comments

I thought so, but the given answer is D.

then D must be wrong.

---

i think 333645211 should be ans plz chck and correct me

---

can you explain me how to solve this question

Answer 2

The grammar production for deriving the string $“aaadbc”$ is as follows:

• $S\rightarrow AS\rightarrow aS\rightarrow aAS\rightarrow aaS\rightarrow aaAB\rightarrow aaaB\rightarrow aaadB\rightarrow aaadbC\rightarrow aaadbc$

Print the given terminal symbol in the grammar immediately after the reduce move is performed, we get $333645211$