Computer Sciences > GATE 2024 Set-2 > Parsing
Consider the following context-free grammar where the start symbol is S and the set of terminals is {a,b,c,d}.
The following is a partially-filled LL(1) parsing table.
Which one of the following options represents the CORRECT combination for the numbered cells in the parsing table? Note: In the options, "blank" denotes that the corresponding cell is empty.
A
(1) S → AaAb (2) S → BbBa (3) A → ϵ (4) B → ϵ
B
(1) S → BbBa (2) S → AaAb (3) A → ϵ (4) B → ϵ
C
(1) S → AaAb (2) S → BbBa (3) blank (4) blank
D
(1) S → BbBa (2) S → AaAb (3) blank (4) blank

Correct : c

Similar Questions

Which one of the following is True at any valid state in shift-reduce parsing?
#76 MCQ
Which of the following statements about the parser is/are correct? I. Canonical LR is more powerful than SLR. II. SLR is more powerful than LALR. III. SLR is...
#161 MCQ
Consider the augmented grammar given below: S′ → S S → ⏐id L → L, S⏐S Let I0= CLOSURE ({[S′ → S]}). The number of items in the set GOTO (I0,
#620 Fill in the Blanks

Related Topics

context-free grammar LL(1) parsing table GATE CS 2024 Q49 compiler design formal languages and automata theory GATE computer science parsing table rules grammar parsing GATE

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: