Teaching TN TRB CS Mock Test Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Which of the following is true about the context free grammar if L1 and L2 are deterministic context free language (DCFL)?
1
L1 ∩ L2 is DCFL
2
L1 ∪ L2 is DCFL
3
L1 – L2 is DCFL
4
L̅1 is DCFL