COMPILER DESIGN LAB QUIZ

Consider the grammar E -> E + id | E × id | id. For a sentence id +id × id the handles in the right sentential form of the reduction are

• Id, E + id and E + E × id

• Id, E + id and E + id × id

• Id, E + id and E × id

• id, id + id and id + id × id

Let SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1 and n2 is:

• n1 is necessarily less than n2

• n1 is necessarily equal to n2

• n1 is necessarily greater than n2

• None of the given options

Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?

• SLR, LALR

• SLR, Canonical LR

• LALR, Canonical LR

• None of the given options

Which is permanent database in the general model of a compiler?

• Terminal table

• Identifier table

• Literal table

• Reduction Table

Which variable does not drive a terminal string in grammar?S→AB ,A→a,B→b,B → C

• A

• B

• C

• S