Compiler design semester exam question

Question

Can the following grammar be parsed by LR(0) parser?

E -> E+id | id

Is the accept state entry considered on all the terminal symbol columns for LR(0) parser?

Answer 1

LR(0) parser is constructed for LP(0)  grammar in which the parse table is free from multiple entries (conflicts). as we show in the above question the grammar is

E -> E+id | id

 there are multiple entries when you construct a table

Answer 2

If a grammar is left recurcive then it never be LR(0) . Given grammar is left recurcive . Hence it is not parsed by LR(0) .

Comments

Being Left Recursive does not hinder the grammar being parsed by LR(0).

---

we can always remove the left recursive-ness, this grammer isnt LR(0) beacause it will have multiple entries in the parsing Table..