Without loss of generality, we assume Algorithm 1 fills C with derivations in the following order: where x 0 is the initial derivation, x m is the first goal derivation in the sequence, and Denote the status of chart right after x k being filled as C k .
to find a better model for best-first search would be an interesting topic for future work.