A derivation D in a context-free grammar G is said to be fair (a notion borrowed from the realm of nondeterministic programming) if either it is finite and terminating, or it is infinite and for each nonterminal symbol A which appears infinitely many times in D, each rule of the form \(A\to x\) in G is used infnitely many times in D. A context-free grammar is fairly terminating if all its fair derivations are finite; a context-free language is fairly generated if it has a fairly terminating grammar. The main question of the paper is: Is every context-free language fairly generated? The question is answered in the negative, by proving that exactly the non-expansive context-free grammars are fairly terminating (therefore all languages of infinite index are not fairly generated).