ALL GATE QUESTIONS SUBJECTWISE
×

Regular Language and Finite Automata

1 Mark Questions 2 Marks Questions 5 Marks Questions

Context Free Language and Pushdown Automata

1 Mark Questions 2 Marks Questions 5 Marks Questions

Contextsensitive Language And Turing Machine

1 Mark Questions 2 Marks Questions 5 Marks Questions

Undecidability

1 Mark Questions 2 Marks Questions




GATE 1995 Question - Mark 1

Consider a grammar with the following productions
S --> aαb|bαc|aB
S --> αS | b
S --> αbb | ab
Sα --> bdb | b The above grammar is:
(a) Context free
(b) Regular
(c) Context sensitive
(d) LR(k)


Total 10 Questions



Share: