Evaluating SDT

Question

Here a as well as c can be the answer based on the construction of the parse tree. So how to decide which one to choose?

Answer 1

im getting A as answer. Note that + is left associative and left recursive.

Comments

But the answer given is C ). Even I marked it A)

---

I think answer is wrong. I will ask my batchmates and let you know if we can prove (a) answer wrong.

---

Actually we can construct parse tree for both a and c as well. We can get C as an answer by considering + as left associative.

My doubt is can SDT be ambiguous ? Is it allowed ?

---

SDT = Grammer + Semantic rules

So we just apply semantic rules to grammer to do later phase work of compiler with early phase while parsing. (Like generating three address code while parsing).

So i strongly think that it can't be ambiguous as the grammer upon which semantic rules are being applied can't be ambiguous.

Answer 2

Ans seems to be C as R->R*R is left recursive