operator grammer

Question

someone please explain how to draw operator precedence table to solve this question.

Comments

Thanks for posting this question!

Answer 1

strings in the language generated by this grammar: adcb, aadcbb, aaadcbbb, ... so on

It's an unambiguous grammar. So this grammar decides its own rule.

Rules: 
1. a=b, a and b have the same precedence. 
2. a is right associative hence, hence a<a 
3. d is highest precedence terminal hence d>c, d>b, d>a 
4. c has higher precedence than a and b, so c>a, c>b

(D) is incorrect precedence relation!

To understand more on operator precedence parsing:
https://www.tutorialspoint.com/compiler_design/operator_precedence_parsing.asp

Comments

yes your solution is correct

---

Please check about precedence, I think a,b,c having same precedence as they are at same level.

---

@sunil visit the link which i posted above, then you can understand why c has higher precedence than a and b, and why a is right associative.