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 96-100 of 100

0% completed (0/100 answered)

Question 96

MSQ · Multiple Correct 1 mark

Which statements about CFG equivalence and universality are correct?

A Equivalence of arbitrary CFGs is undecidable. B Universality of arbitrary CFGs is undecidable. C Membership of a CFG is undecidable. D Emptiness of a CFG is decidable.

Question 97

MSQ · Multiple Correct 1 mark

Which languages are context-free?

A ${a^n b^n | n>=0}$ B ${a^n b^{2n} | n>=0}$ C {ww | w in {a,b}*} D ${a^n b^n c^n | n>=0}$

Question 98

MCQ · Single Correct 1 mark

What is the key distinction between CFG ambiguity and language inherent ambiguity?

A They are exactly the same concept B A grammar may be ambiguous even when its language has an unambiguous grammar C Inherent ambiguity concerns only regular languages D An ambiguous grammar cannot be equivalent to an unambiguous one

Question 99

MCQ · Single Correct 1 mark

If L is a CFL and R is regular, what is guaranteed about L ∩ R?

A It is never context-free B It is undecidable C It is regular D It is context-free

Question 100

MSQ · Multiple Correct 1 mark

Which operations are guaranteed to preserve context-freeness when one operand is a CFL and the other is regular?

A Intersection B Union C Difference L-R D Complement of L