L = { | G is a CFG that generates all strings of length k}

Prove that the language is decidable.