We model graph parsing with an encoder-decoder architecture that takes as input a sentence w and outputs a directed acyclic graph G derived using the rewriting system of Section 2.
we model its derivation tree in top-down, left-toright order as a sequence of actions a = a 1 .