CD C1 batch Viva

The number of states are same in

• LARL and CLR

• LALR and SLR

• CLR and SLR

• None of them are true

Recognize the item set for GOTO(I,S) where I = {[S-->(.S)S]} for the grammar:

S-->(S)S | ε

• GOTO(I,S)={ S-->(.S)S, S-->.(S)S }

• GOTO(I,S)={ S-->(.S)S, S-->.(S)S, S--> .}

• GOTO(I,S)={ S-->(S.)S, S-->.(S)S, S--> . }

• GOTO(I,S)={ S-->(S.)S }

YACC implements which parser

• LL(1)

• SLR

• CLR

• LALR

Recognize the kernel items for the following grammar:

S--> aAbB| bBaA

A-->d

B-->b

• S-->.aAbB

• S-->aAb.B

• S-->.bBaA

• A-->.d

The number of tokens generated by following c code are:

switch(i)

{ case 1: b= c* d; break;

default: b=b++; break;

}

• 27

• 29

• 26

• 24

Consider the following grammar:

S-> AB | d

A-> a | Aab

B-> b | Bba

Recognize the LR(1) items in state 0

• S' -> .S,$

  S->.AB,$

  S->.d,$

  A->.a, a/b

  A->.Aab,a/b

• S' -> .S,$

  S->.AB,$

  S->.d,$

  A->.a, b

  A->.Aab,b

• S' -> .S,$

  S->.AB,$

  S->.d,$

  A->.a, a/b

  A->.Aab,a/b

  B->.b, b

  B->.Bba,b

• S' -> .S,$

  S->.AB,$

  S->.d,$

  A->.a, b

  A->.Aab,b

  B->.b, b

  B->.Bba,b