S -> (S)| aLet the number of states in SLR(1), LR(1) and LALR(1) pars – McqOptions

MCQOPTIONS

1.	S -> (S)\| aLet the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar n1 n2 and n3 respectively.
A.	n1 < n2 < n3
B.	n1 = n3 < n2
C.	n1 = n2 = n3
D.	n1 $ n3 $ n2
Answer» C. n1 = n2 = n3

Discussion

No Comment Found

Related MCQs

Consider the following C code segment. Which one to the following false?
Consider the following translation scheme. Here id is a taken that represents an integer and id. value represents the corresponding integer value. For an input ‘2 * 3 + 4’, this translation scheme prints?
Consider the following grammar: In the predictive parser table, M , of the grammar the entries M [ S, id] and M [ R,$] respectively.
Consider the following grammar. Given the items above, which two of them will appear in the same set in the canonical sets-of-items for the grammar?
What precedence and associativity properties does the generated parser realize?
Which one of the following is true about the action of yacc for the given grammar?
Consider line 3. Identify the compiler’s response about this line while creating the object-module
S -> (S)| aLet the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar n1 n2 and n3 respectively.
Consider the grammar. For a sentence n + n, form of the reduction are __________
The grammar A ->AA |( A)| ε is not suitable for predictive-parsing because the grammar is ___________