According to Haas (1989), "a depth-bounded grammar cannot build an unbounded amount of tree structure from a bounded number of symbols".
for each sentential form of length there exist a finite number of partial derivation trees, guaranteeing parsing termination.