Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
A grammar ( G ) is LL(1) if and only if the following conditions hold for two distinct productions \(A \rightarrow \alpha\) and \(A \rightarrow \beta\):
I. \(\text{First}(\alpha) \cap \text{First}(\beta) = \emptyset\)
II. \(\lambda \notin \text{First}(\alpha) \cap \text{First}(\beta)\)
III. \(\text{First}(\alpha) \cap \text{Follow}(A) = \emptyset ) if ( \lambda \in \text{First}(\beta)\)
1
I and III
2
I and II
3
I, II and III
4
II and III
5
Question Not Attempted