Parsing

Question

For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?

Comments

LR(k) is a DCFL.

Anyhing that is not deterministic will never be determined by bottom up parser.. Eg: ww^r

---

Thank you!

---

@MiNiPanda U MEAN WHOLE BOTTOM UP PARSERS EVEN OPERATOR PRECEDENCE

---

From Knuth's original paper

https://www.cs.dartmouth.edu/~mckeeman/cs48/mxcom/doc/knuth65.pdf

 

Answer 1

DPDA