Theory Of Computation MCQ

1:

Consider a grammar with the following productions

                                     S-->   aab | bac | aB
                                     S -->  α S | b
                                     S -->  α b b | ab
                                     Sα --> bdb | b


               The above grammar is 

A.

Context free

B.

regular

C.

context sensitive

D.

LR ( k )

 

Answer : C

Explanation :

Vandana said: (6:40am on Thursday 15th February 2018)
Sa---> b This production is contracting , hence this can't be CSG , this grammer is unrestricted grammer.

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.