made easy compiler design theory book [closed]

Question

 

answer is option c

Comments

If a grammar has either two left most derivations or two right most derivations then it is ambiguous but here for any string we get one leftmost derivation and one rightmost derivation. so not ambiguous.

Correct me if I'm wrong.

---

I have the same doubt.

---

what does conflict means here exactly??

---

https://gist.github.com/DmitrySoshnikov/b8639c2cc39f8dc9ba95

@Jyoti Kumari97 and @priyanka manwani

Answer 1

string "aca" can be generated by 2 parse tree..