GATE 2024 Compiler Design Foundation Quiz 94

Consider the following grammar G:

Q → E | A

E → p | d

A → j

Where Q, E and A are non-terminal symbol p, d and j are terminal symbols. The number of states required by using LR(0) parses is _____ .

Which of the following type of derivations is/are not used by LR parsers?

Which one of the following is a top-down parser?

Consider the following CFG, with S as start symbol:

S → aA|CB

A → BaA|ϵ

B → bB|Abc|ϵ

C → B

Which of the following is correct? [Multiselect Question]

Consider the following grammar rule which of the following best fits to parsed by an operator grammar? P, Q, R are non-terminals and a, b, c are terminals.