GATE 2024 Compiler Design Foundation Quiz 95

Consider the following grammar G

P → Sa | dSe | xe

S → a

What is the number of states required by the LR(1) parser?

Consider the augmented grammar given below:

S'→S

S→(A)/id

A→A:S/S

Let I₀= Closure [S'→⋅S]. The number of items in the set GOTO (I_o,( ) is:

Consider the following grammar and state which of the following is true?

S → +ET

E → *F

F → F*T

T → a

What is the time complexity of an LL(1) parser to parse a string?

Consider the following LL(1) parsing table, parse the input "baaab". (Assume stack # and it will be counted as one symbol and when input is $ and stack contains #, then it is accepted.)

While parsing the string "baaab$" the maximum number of symbols in the parser stack at a time is _____