Linear grammar indicates that all linear languages are context-free and that regular languages are its proper subset.
All linear languages are context-free; conversely, an example of a context-free, non-linear language is the Dyck language of well-balanced bracket pairs. Hence, the regular languages are a proper subset of the linear languages, which in turn are a proper subset of the context-free languages. 
