We propose to process coordination at the parsing level as a linguistic performance issue, outside the grammar, rather than as a mat- ter of competence. We apply a specific algorithm to combine coordinated syntactic structures that were partially parsed using a coordination- less grammar, resulting in a directed acyclic parse graph in which con- stituent sharing appears sharply. This article presents an algorithm work- ing within the framework of tree-adjoining grammars (although it can be adapted to other formalisms) that is able to handle many types of co- ordinating constructions, including left and right node raising, argument clusters, and verb gapping.