#testbook test series

Question

Comments

only iv) ??

Answer 1

(i) False, as Left linear grammar is regular but not LL(1).

(ii) False, every LL(1) is topdown and  LALR(1) is a bottom up parser.

(iii) False, LR(0) is bottom up and LL(k) is top down

(iv) True, if a context free language is inherently ambiguous then every grammar generating that language is ambiguous.

Comments

@AnilGoudar,
(ii).and (iii) are false but your reasons are not correct....you cant say topdown grammers cant be parsed by bottomup parsers,
every LL(1) is CLR(1), and this implies that topdown grammers can also be parsed by bottomup parsers

---

we have studied that every LL(1) grammar is LALR(1).

so correct ans should be ii) and iv).

correct me if wrong?????

---

“every LL(1) grammar is LALR(1) “?

refer here