in Compiler Design edited by
272 views
0 votes
0 votes
For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?
in Compiler Design edited by
by
272 views

4 Comments

LR(k) is a DCFL.

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

2
2
Thank you!
0
0

@MiNiPanda U MEAN WHOLE BOTTOM UP PARSERS EVEN OPERATOR PRECEDENCE

0
0
3
3

1 Answer

0 votes
0 votes
DPDA