GATE CSE Context-Free Languages, Grammars & Pushdown Automata – TOC Practice Test

GATE CSE Context-Free Languages, Grammars & Pushdown Automata – TOC Practice Test | Set 1

Questions 1-5 of 100

0% completed (0/100 answered)

Question 1

MCQ · Single Correct 1 mark

Which CFL closure property is true?

A Closure under reversal B Closure under arbitrary intersection C Closure under difference of two CFLs D Closure under complement

Question 2

MCQ · Single Correct 1 mark

Which statement about DPDA closure properties is true?

A DCFLs are closed under complement B DCFLs are closed under arbitrary difference C DCFLs are closed under intersection D DCFLs are closed under union

Question 3

NAT · Numerical Answer 1 mark

A PDA stack initially contains only Z0. If 42 symbols are pushed and 20 symbols are later popped, how many stack symbols remain?

Enter your numerical answer

Question 4

MCQ · Single Correct 1 mark

Which problem is decidable for a CFG?

A Whether G is universal B Whether G is ambiguous C Whether a given string belongs to L(G) D Whether two arbitrary CFGs are equivalent

Question 5

MCQ · Single Correct 1 mark

Which grammar is in CNF?

A S -> aA, A -> b B S -> ABC, A -> a C S -> AB, A -> a, B -> b D $S -> aSb, S -> \epsilon$