For the grammar below, a partial LL(1) parsing table is also presented along…

GATE · 2012 · CS · Computer Science & IT

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. $\varepsilon$ is the empty string, $ indicates end of input, and, | separates alternate right hand sides of productions.

S $\to$ a A b B | b A a B | $\varepsilon$

A $\to$ S

B $\to$ S

The appropriate entries for E1, E2, and E3 are

A.
E1: S $\to$ aAbB, A $\to$ S
E2: S $\to$ bAaB, B $\to$ S
E3: B $\to$ S
B.
E1: S $\to$ aAbB, S $\to$ $\varepsilon$
E2: S $\to$ bAaB, S $\to$ $\varepsilon$
E3: S $\to$ $\varepsilon$
C.
E1: S $\to$ aAbB, S $\to$ $\varepsilon$
E2: S $\to$ bAaB, S $\to$ $\varepsilon$
E3: B $\to$ S
D.
E1: A $\to$ S, S $\to$ $\varepsilon$
E2: B $\to$ S, S $\to$ $\varepsilon$
E3: B $\to$ S

Attempted by 178 students.

Explore the full course: Gate Guidance By Sanchit Sir