Assume that the SLR parser for a grammar G has n1 states and the LALR – McqOptions

MCQOPTIONS

1.	Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.
A.	n1 is necessarily less than n2
B.	n1 is necessarily equal to n2
C.	n1 is necessarily greater than n2
D.	none of the mentioned
Answer» C. n1 is necessarily greater than n2

Discussion

No Comment Found

Related MCQs

Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
Consider a program P that consists of two source modules M1(contains reference to a function defined in M2) and M2 contained in two different files.
Given the following expression grammar: which of the following is true?
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?
The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called?
Which of the following derivations does a top-down parser use while parsing an input string?