Consider the following two sets of LR(1) items of an LR(1) grammar.X -> c.X, c/dX -> .cX, c/dX -> .d, c/dX -> 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.

Consider the following two sets of LR(1) items of an LR(1) grammar.X -

1.	Consider the following two sets of LR(1) items of an LR(1) grammar.X -> c.X, c/dX -> .cX, c/dX -> .d, c/dX -> 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
Answer» E.

Discussion

No Comment Found

Related MCQs

Consider the languagesL1={0^{i}1^{j}|i != j},L2={0^{i}1^{j}|i = j},L3 = {0^{i}1^{j}|i = 2j+1},L4 = {0^{i}1^{j}|i != 2j}.Which one of the following statements is true?
Let L = L1 cap L2, where L1 and L2 are languages as defined below: L1 = {a^{m}b^{m}ca^{n}b^{n} | m, n >= 0 } L2 = {a^{i}b^{j}c^{k} | i, j, k >= 0 } Then L is
Consider the language L1,L2,L3 as given below.L1={0^{p}1^{q} | p,q in N}L2={0^{p}1^{q} | p,q in N and p=q} L3={0^{p}1^{q}1^{r} | p,q,r in N and p=q=r}Which of the following statements is NOT TRUE?
Which of the following problems are decidable?1) Does a given program ever produce an output?2) If L is a context-free language, then is L (complement of L) also context-free?3) If L is a regular language, then is L also regular?4) If L is a recursive language, then, is L also recursive?
Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression
Consider the following two problems on undirected graphs: : Given G(V,E), does G have an independent set of size |v| 4? : Given G(V,E), does G have an independent set of size 5?Which one of the following is TRUE?
S > aSa| bSb| a| b ; The language generated by the above grammar over the alphabet {a,b} is the set of
Consider the grammar with the following translation rules and E as the start symbol.E E1 # T { E.value = E1.value * T.value } | T{ E.value = T.value }T T1 & F { T.value = T1.value + F.value } | F{ T.value = F.value }F num { F.value = num.value }Compute E.value for the root of the parse tree for the expression: 2 # 3 & 5 # 6 & 4.
Which of the following grammar rules violate the requirements of an operator grammar ? P, Q, R are nonterminals, and r, s, t are terminals.1. P Q R2. P Q s R3. P 4. P Q t R r
Consider the translation scheme shown belowS T RR + T {print ('+');} R | T num {print (num.val);}Here num is a token that represents an integer and num.val represents thecorresponding integer value. For an input string '9 + 5 + 2', this translation scheme willprint

Discussion

No Comment Found

Related MCQs

Reply to Comment