• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | GATE CS 1996 | Question 33

If L1 and L2 are context free languages and R a regular set, one of the languages below is not necessarily a context free language, which one?

(A)

L1 . L2

(B)

L1 ∩ L2

(C)

L1 ∩ R

(D)

L1 ∪ L2

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments