A LR Parsing Algorithm for Tree Adjoining Grammar

트리 접합 문법의 LR파싱 알고리즘

  • Published : 1995.09.01

Abstract

We present a LR,bottom-up parsing algorithms for TAG. We will introduce the adjoining rules system to handle the formal properties of TAG and to describe the parsing process more effectively. We will consider the context-free behavior of TAG at the adjoining instant. Then we will present the LR bottom up parsing algorithm for TAG by using this property. The basic idea behind a LR bottom up parsing algorithm can be applied to parsing TAG with other conventional algorithms.