GATE Computer Science (CS) 2012 Solved Paper

Question Numbers: 62-63 For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that need to be filled are indicated as E1, E2, and E3. ε is the empty string, $\begin{aligned} S &\to a A b B \mid b A a B \mid \varepsilon \\ A &\to S \\ B &\to S \end{aligned}$ S E1 E2 S → ε A A → S A → S Error B B → S B → S E3