objective type questions compiler design
ven the grammar: E → E + T | T; T → T F | F; F → (E) | id. Is this grammar suitable for LL(1) parsing? a) Yes, it is LL(1) b) No, it is not LL(1) due to left recursion c) Yes, but only after left factoring d) No, b