| Item type |
JInfP(1) |
| 公開日 |
1982-03-31 |
| タイトル |
|
|
タイトル |
On Defining Denotational Semantics for Attribute Grammars |
| タイトル |
|
|
言語 |
en |
|
タイトル |
On Defining Denotational Semantics for Attribute Grammars |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
主題Scheme |
Other |
|
主題 |
（IPSJ Best Paper Award、論文賞受賞） |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| 著者所属 |
|
|
|
Department of Computer Science Tokyo Institute of Technology. |
| 著者所属 |
|
|
|
Department of Computer Science Tokyo Institute of Technology. |
| 著者所属(英) |
|
|
|
en |
|
|
Department of Computer Science, Tokyo Institute of Technology. |
| 著者所属(英) |
|
|
|
en |
|
|
Department of Computer Science, Tokyo Institute of Technology. |
| 著者名 |
Masayuki, Takeda
Takuya, Katayama
|
| 著者名(英) |
Masayuki, Takeda
Takuya, Katayama
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
This paper presents a denotational semantics of attribute grammars and proposes a method of attribute evaluation based on it. The denotational semantics of an attribute grammar is defined by the least fix-point semantics among attributes assigned to the nodes of a derivation tree and it is realized by a set of recursive functions which perform the required evaluations. The proposed method for attribute evaluation is directly based on this denotational semantics and handles a wider class of attribute grammars including the well-defined ones. It has the following characteristics: (1)the evaluation functions can be derived directly from the description of a given attribute grammar without resorting to augmented dependency graphs (2)it is an output-oriented evaluation that is only attributes which are related to the required attributes are evaluated (3)it can be easily implemented by a LISP-like programming language. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
This paper presents a denotational semantics of attribute grammars and proposes a method of attribute evaluation based on it. The denotational semantics of an attribute grammar is defined by the least fix-point semantics among attributes assigned to the nodes of a derivation tree and it is realized by a set of recursive functions which perform the required evaluations. The proposed method for attribute evaluation is directly based on this denotational semantics and handles a wider class of attribute grammars including the well-defined ones. It has the following characteristics: (1)the evaluation functions can be derived directly from the description of a given attribute grammar without resorting to augmented dependency graphs, (2)it is an output-oriented evaluation, that is, only attributes which are related to the required attributes are evaluated, (3)it can be easily implemented by a LISP-like programming language. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA00700121 |
| 書誌情報 |
Journal of Information Processing
巻 5,
号 1,
p. 21-29,
発行日 1982-03-31
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
1882-6652 |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-JIP0501004 (1.2 MB)
