Consider the Following Context Free Grammar (G) :- S → A B B → + A B | ε A → C…

PYQ UGC NET 2026

Consider the Following Context Free Grammar (G) :-

S → A B

B → + A B | ε

A → C D

D → * C D | ε

C → [ S ] | x

Variable = { S, A, B, C, D }

Terminals = { +, *, [, ], x }

In the LL(1) Parsing table of the given CFG, how many valid non blank entries will be there in the rows for variables ‘B’ and ‘D’ ?

  1. A.

    B – 3 entries; D – 4 entries

  2. B.

    B – 6 entries; D – 5 entries

  3. C.

    B – 2 entries; D – 3 entries

  4. D.

    B – 1 entry; D – 2 entries

Attempted by 9 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…