Search this article
The inversion method proposed by Gliick and Kawabe uses grammar programs as intermediate results, that comprise sequences of operations (data generation, matching, etc.). The semantics of the grammar programs is denned as a stack machine where data terms are stored in the stack. The matching operation for a constructor symbol pops up the topmost term of the stack and pushes its direct subterms to the stack if the topmost term is rooted by the constructor. This paper strengthens the matching operation by augmenting a parameter that specifies what position the matching operation can look into from the top of the stack. This extension is sometimes effective to avoid the failure execution of the determinization method based on LR parsing described in the latter half of the inversion method.
- 電子情報通信学会技術研究報告. SS, ソフトウェアサイエンス
電子情報通信学会技術研究報告. SS, ソフトウェアサイエンス 12 (164), 103-108, 2012-07