An incremental LL(1) parsing algorithm

Given a parse tree for a sentence xzy and a string z̄, an in cremental parser builds the parse tree for the sentence xz̄y by reusing as much of the parse tree for xzy as possible. The incremental LL(1) parsing algorithm in this paper makes use of a break-point table to identify reusable subtrees of the original parse tree in building the new parse tree. The break-point table may be computed from the grammar.