ME Compiler Design

Question

Consider the following transition rules:

A->BC

C->+BC|A|$\epsilon$

B->DB{print '+'}|$\epsilon$

D->(A)|id{print num.value}

On input '5+67' this translation scheme prints

A 5+67+

B 5+6+7+

C 5+6+7

D 5+67++

Comments

Is D the Correct answer?

---

Yes can explain...?

---

Draw the parse tree according to given string. Print the values accordingly from bottom up left to right.

Answer 1

If you can check it represents $5+67$

Now Scan them left to right ..... and when $D -> id $ then take action :: {print num.value} means print 5 ..... same for$D -> 6$ and $D ->7.$

And when $B -> DB  $ occurs then take action :: {print '+'}

Then output will be $5+67++$

Comments

Thanks :) I missed last + :D

---

What about this ?