RELATING LOGIC PROGRAMS AND ATTRIBUTE GRAMMARS.

被引：55

作者：

Deransart, Pierre ^{[1
]}

Maluszynski, Jan ^{[1
]}

机构：

[1] Linkoeping Univ, Dep of Computer, Science, Linkoeping, Swed, Linkoeping Univ, Dep of Computer Science, Linkoeping, Swed

来源：

Journal of Logic Programming | 1985年 / 2卷 / 02期

关键词：

COMPUTER PROGRAMMING;

D O I：

10.1016/0743-1066(85)90015-9

中图分类号：

学科分类号：

摘要：

This paper shows that logic programs and attribute grammars are closely related. Constructions are given which transform logic programs into semantically equivalent attribute grammars, and vice versa. This opens for application in logic programming of some methods developed for attribute grammars. These results are used to find a sufficient condition under which no infinite term can be created during a computation of a logic program, and to define a nontrivial class of logic programs which can be run without employing unification in its general form.

引用

页码：119 / 155