On the one hand, if one disregards step (ii) (a disguised recency heuristic spuriously mixed with binding constraints) and considers the result of verifying binding constraints to be the assignment to an NP of the set of indices of its antecedent candidates, then it is possible to discard the proliferation of indexed trees as a way to express anaphoric ambiguity.
johnson's algorithm is embodied in Prolog code.