Computer Sciences > GATE 2021 SET-1 > LL(1) Parsing
Consider the following context-free grammar where the set of terminals is {a, b, c, d, f}.
S -> daT | Rf
T -> aS | baT | ε
R -> caTR | ε
The following is a partially-filled LL(1) parsing table.
Which one of the following choices represents the correct combination for the numbered cells in the parsing table (“blank” denotes that the corresponding cell is empty)?
S -> daT | Rf
T -> aS | baT | ε
R -> caTR | ε
The following is a partially-filled LL(1) parsing table.
Correct : a
Similar Questions
Consider two grammars G1 and G2 with the production rules given below:G1: S→if E then S|if E then S else S | aE→bG2: S→if E then S|MM→if E t...
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64
Total Unique Visitors
Loading......