... precompiling additional information, parsing can be broken down into recognition followed by parse recovery; • providing a formal treatment of the algo- rithms for transforming and minimising ... annotations are unioned; • the parser maintains for each item in the table the set of trees that are valid for the item: initially this is all the valid trees for the automaton, but gets intersected ... where for 1 < k < n, Mk = (Qk, P,k, qk,~k, Fk). Construction of a single automaton for F is a two step process. First we build an automa- ton that accepts all elementary computations for...