GATE 2024 compiler design rank Booster Quiz 17

Recursive descent parser is a type of ?

Which of the following is a top-down parser?

Consider the grammar:

E → TE’

E’ → +TE’ | €

T → FT’

T’ → *FT’ | €

F → (E) | id

Follow(F) is?

Consider the grammar G:

S -> aSb | Sc | d | ε

Which of the following terminal is not present in First(S)?

Consider the following grammar with terminal alphabet Σ{a,(, ), +,*}and start symbol E.
The production rules of the grammar are:
E →aA
E →(E)
A →+E
A →*E
A →epsilon

Compute the FIRST(E) and FOLLOW(A).

Consider the following statements about parsers:
S₁ : Top-down parser can’t parse left recursive grammar.
S₂ : Keywords of a language are recognized during parsing of the program.
Choose the suitable option about above statements.

Consider the following grammar :

E → TE'

E' → / +TE'

T → FT'

T' → / *FT'

F → id / (E)

Find the number of common symbols in Follow(F) , Follow(T) and Follow(T') ___________.