GATE Computer Science (CS) 2021 Shift 1 Solved Paper

Question : 36 of 65

Marks: +1, -0

Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation (SDT) actions, given as pseudo-code:
P → D* E*
D → int ID {record that ID.lexeme is of type int}
D → bool ID { record that ID.lexeme is of type bool}
E → E₁ + E₂ {check that E₁.type = E₂.type = int; set E.type := int}
E → !E₁ {check that E₁.type = bool; set E.type := bool}
E → ID {set E.type := int}
With respect to the above grammar; which one of the following choices is correct?

The actions will lead to infinite loop.
The actions can be used to correctly type-check any syntactically correct program.
The actions can be used to type-check syntactically correct boolean variable declarations and boolean expressions.
The actions can be used to type-check syntactically correct integer variable declarations and integer expressions.

Validate

Go to Question:

Prev Question

Next Question