Home / Engineering / Theory of Computation and Compiler Design / Question
M
Q.) Consider the following two sets of LR(1) items of an LR(1) grammar.
X -> c.X, c/d
X -> .cX, c/d
X -> .d, c/d
X -> c.X, $
X -> .cX, $
X -> .d, $
Which of the following statements related to merging of the two sets in the
corresponding LALR parser is/are FALSE?
1. Cannot be merged since look aheads are different.
2. Can be merged but will result in S-R conflict.
3. Can be merged but will result in R-R conflict.
4. Cannot be merged since goto on c will lead to two different sets.
Related MCQs on Theory of Computation and Compiler Design
Q. Size of the memory mainly depends on the size of the address bus.
Q. Which of the following invokes functions in sql?
Q. specifies the function that will be called when the client disconnects.
Q. Proof Carrying Code ...............
Q. The full form of OSI is OSI model is
Discusssion
Login to discuss.