Home / Engineering / Theory of Computation and Compiler Design / Question

M

Mr. Dubey • 51.17K Points
Coach 

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.

(A) 1 only
(B) 2 only
(C) 1 and 4 only
(D) 1, 2, 3, and 4
Correct answer : Option (D) - 1, 2, 3, and 4

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation and Compiler Design

Q. Size of the memory mainly depends on the size of the address bus.

Q. Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?

Q. Which of the following invokes functions in sql?

Q. A decade counter is .

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

Q. Goal Stack Planning breaks up a ______

Q. For which of the following, the length of the string is not equal to the length of the longest palindromic subsequence?

Q. ____________ are some popular OLAP tools.