(a) Check whether the given grammar is LL (1) grammar or not. Give reason. $E \rightarrow E+T / T, T \rightarrow T^{*} F / F, F \rightarrow(E) / i d$.

Explanation

An LL(1) grammar must be unambiguous, meaning that there should be only one possible parse tree for a given input string. The given grammar is ambiguous, which means it is not LL(1).


โฌ† Related Topic

View Topic Hub โ†’

๐Ÿ“˜ Syllabus

View KERALA UNIVERSITY Class 6 Syllabus โ†’

๐Ÿ“ Practice Questions

Practice Previous Year Questions โ†’

๐Ÿค– Practice with AI

Generate Practice Question Paper โ†’


๐Ÿ“š Related Concepts