(i) Every regular grammar is LL(1)
- No, because regular grammar can be ambiguous/ left recursive/left factored.
(ii) Every LL(1) grammar is LALR(1)
- No, It's opposite.
(iii) All LR(0) grammars are LL(k)
- No, both are different types of parser. LR(0) just need to be unambiguous but LL(1) needs to be unambiguous + Not left recursive + not left factored.
(iv) A context-free grammar without left factoring and left recursion can be ambiguous
- True.