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. Hence which one is true?
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

Which of the following is incorrect for the actions of A LR-Parser I) shift s ii) reduce A->ß iii) Accept iv) reject?
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. Hence which one is true?
A optimizing compiler
A garbage is
A shift reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of grammar S—-> xxW ( PRINT “1”) S—-> y { print ” 2 ” } S—-> Sz { print ” 3 ” ) What is the translation of xxxxyzz using the syntax directed translation scheme described by the above rules ?
The address code involves
Running time of a program depends on$
In an absolute loading scheme which loader function is accomplished by assembler?