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