Is the set of all context-free languages contained in the set of all languages that have a w-grammar?
The class of languages accepted by this kind of grammar is known as linear languages (the definition on Wikipedia is slightly different, but equivalent). According to Wikipedia, the language of all balanced parentheses (generated by $S \to SS \mid (S) \mid \epsilon$) is context-free but not linear.