We describe several tabular algorithms for Tree Adjoining G r a m m a r parsing, creating a continuum from simple pure bottom-up algorithms to complex predictive algorithms and showing what transformations must be applied to each one in order to obtain the next one in the continuum.