Q15

MCQ1 mark, −0.33

Let $G_{1}, G_{2}$ be Context Free Grammars (CFGs) and $R$ be a regular expression. For a grammar $G$ , let $L(G)$ denote the language generated by $G$ . Which ONE among the following questions is decidable?

(A)

Is $L\left(G_{1}\right)=L\left(G_{2}\right) ?$

(B)

Is $L\left(G_{1}\right) \cap L\left(G_{2}\right)=\emptyset$ ?

(C)

Is $L\left(G_{1}\right)=L(R) ?$

(D)

Is $L\left(G_{1}\right)=\emptyset$ ?

Loading…