A parsing algorithm for unification grammar
Andrew R. Haas · 1989
this paper define the basic concepts of our formalism. Section 4 proves the soundness and completeness of our simplest parser, which is purely bottom-up and excludes rules with empty right-hand sides. Section 5 admits rules with empty right sides, and section 6 adds top-down filtering. Section 7 discusses the implementation and possible exten- sions