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 FIRST and FOLLOW sets for the non-terminals A and B are

  1. A.

    FIRST(A) = {a, b, ε\varepsilon} = FIRST(B)

    FOLLOW(A) = {a, b}

    FOLLOW(B) = {a, b, $}

  2. B.

    FIRST(A) = {a, b, $}

    FIRST(B) = {a, b, ε\varepsilon} F

    OLLOW(A) = {a, b}

    FOLLOW(B) = {$}

  3. C.

    FIRST(A) = {a, b, ε\varepsilon} = FIRST(B)

    FOLLOW(A) = {a, b}

    FOLLOW(B) = ϕ\phi

  4. D.

    FIRST(A) = {a, b} = FIRST(B)

    FOLLOW(A) = {a, b}

    FOLLOW(B) = {a, b}

Attempted by 164 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…