著者

長尾 真 辻井 潤一

出版者

一般社団法人情報処理学会

雑誌

情報処理 (ISSN:04478053)

巻号頁・発行日

vol.15, no.9, pp.654-661, 1974-09-15

---

We constructed a Programming Language for Tree-Operation, named PLATON. This accepts strings, trees and lists and transforms them in arbitrary way. Based on the augmented transition network of W.Woods, this has several additional capabilities such as pattern-matching, flexible back-tracking mechanism and so on. Because the system maintains the clarity of natural language grammars, we can easily develop various kinds of grammars, test and improve them. The system also has various flexible constructions in order to make use of semantics and pragmatics during its syntactic analysis. The detailed specification and organization of PLATON are given in this paper, and an example of using this is also given, which analyzes simple Japanese sentences.