Let w be a morphic word over a finite alphabet Σ, and let ∆ be a nonempty subset of Σ. We study the behavior of maximal blocks consisting only of letters from ∆ in w, and prove the following: let (ik, jk) denote the starting and ending positions, respectively, of the k’th maximal ∆-block in w. Then lim supk→∞(jk/ik) is algebraic if w is morphic, and rational if w is automatic. As a result, we s...