To overcome this, one can use a tree-structured stack (TSS) to factorize the representations of common prefixes in the stack as described by  for projective dependency parsing.
the discontinuites entail that a limited amount of copying cannot be entirely avoided.