Abstract
The parsing algorithm for pregroup grammars presented here exploits regularities of types of a pregroup grammar. Sufficient conditions are given for the algorithm to be linear and complete. Its working is illustrated by a grammar which handles unbounded dependencies and agreement with clitics in French. The grammar includes control of the complement of the infinitive by modal and causal verbs.