CYK algorithm in theory of computation
It's true.
If the CFG is not null free, and the input sentence is not null, you can remove the null from the CFG and then parse the input sentence with the resulting grammar.  You already know how to do that in cubic time.
If the CFG is not null free, and the input sentence is null, you can immediately tell whether the input sentence is accepted by the CFG.