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 1987 1st Question - Marks 2

Context-free grammar is ambiguous if:
(a) The grammar contains useless non-terminals.
(b) It produces more than one parse tree for some sentence.
(c) Some production has two non-terminals side by side on the right-hand side.
(d) None of the above.


Total 28 Questions



Share: