Multiple Choice
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 thecorresponding 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.
A) 1 only
B) 2 only
C) 1 and 4 only
D) 1, 2, 3, and 4
Correct Answer:

Verified
Correct Answer:
Verified
Q13: Consider the following grammar. S -> S
Q14: Consider the grammar S ? (S) |
Q15: In compiler optimization, operator strength reduction uses
Q16: The grammar A ? AA | (A)
Q17: Which of the following describes a handle
Q19: An LALR(1) parser for a grammar G
Q20: Consider the following two statements:<br>P: Every regular
Q21: Consider the following grammar:<br>S ? FR<br>R ?
Q22: Consider the following expression grammar. The seman-tic
Q23: Debugger is a program that<br>A)allows to examine