M

Mr. Dubey • 52.48K 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
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Need for sophisticated IT systems on the rise, especially in supporting the growth in passenger travels, especially in the .

Q. The usual BUS structure used to connect the I/O devices is

Q. Best-first search (BFS) algorithms can search both graphs and trees.

Q. Which of the following describe(s) a global marketplace?

Q. Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge

Q. The excess-3 code for 597 is given by

Q. The process of viewing the cross-tab (Single dimensional) with a fixed value of one attribute is

Q. The relation R defined on the set of natural numbers as {(a, b): a differs from b by 3} is given

Q. Programmers prefer programming to testing and sometimes they take shortcuts when writing tests. For example, they may write incomplete tests that do n

Q. IBM’s Blue Cloud uses a special software for monitoring of virtual cluster operations and acts as a provisioning manager is known as ________.

Question analytics