(a) Construct all the parse trees corresponding to i + j * k for the grammar E…

PYQ GATE 2002

(a) Construct all the parse trees corresponding to i + j * k for the grammar

E → E+E
E → E*E
E → id

(b) In this grammar, what is the precedence of the two operators * and +? (c) If only one parse tree is desired for any string in the same language, what changes are to be made so that the resulting LALR(1) grammar is non-ambiguous?

Sign up free to check your answer

Sign up free

Explore the full course: Compiler Design

Loading lesson…