Following problem is decidable:
Given a context-free grammar $G$, is $L(G) = \varnothing$?
Following problem is undecidable:
Given a context-free grammar $G$, is $L(G) = A^{\ast}$?
Is there a characterization of context-free languages $M$ with decidable equality $L(G) = M$?