论算法翻译器的构建

ACM '59 Pub Date : 1959-09-01 DOI:10.1145/612201.612230
B. Arden
{"title":"论算法翻译器的构建","authors":"B. Arden","doi":"10.1145/612201.612230","DOIUrl":null,"url":null,"abstract":"In the exa~pies that follow lo~.~er case letters are floating point variables except i~ J~ and k which ore fixed point integers° Constants are considG~ed as fixed point integer~ if they appear without a docimal point-otherwise floating° Also constants when they appear arc considered ~o be She names of numbers whose values equal the names. The binary operators +~-, / are used in the nor;ual fashion. The multiplication operator (*) is always wrltton~ contiguou3 letters (or leSters separated only by left parentheses) implies subscription (). The expression on the right of the substitution operator (=) defines the new value to be assumed by the verlable on the lefto The statements operated on by current \"formula\" and \"algebraic\" translators such as the statements x(leJ+k) = s+bee+3°l~+(a-b)*c/d, are algorithmic statements in that they describe a procedure for determining a value° The role of the translator program is to produce a set of machine instructions which are equivalent to the original algorithmic statement° I. Statement Decomposition° A co~m-non approach to this task is to first reduce the statement to some standard form which is more directly translatable to machine lan~zuage. For state:~onts h~ving an slgebralc form such as the one above the diegra~atic \"logical tree\" sugDests itself.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the construction of algorithm translators\",\"authors\":\"B. Arden\",\"doi\":\"10.1145/612201.612230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the exa~pies that follow lo~.~er case letters are floating point variables except i~ J~ and k which ore fixed point integers° Constants are considG~ed as fixed point integer~ if they appear without a docimal point-otherwise floating° Also constants when they appear arc considered ~o be She names of numbers whose values equal the names. The binary operators +~-, / are used in the nor;ual fashion. The multiplication operator (*) is always wrltton~ contiguou3 letters (or leSters separated only by left parentheses) implies subscription (). The expression on the right of the substitution operator (=) defines the new value to be assumed by the verlable on the lefto The statements operated on by current \\\"formula\\\" and \\\"algebraic\\\" translators such as the statements x(leJ+k) = s+bee+3°l~+(a-b)*c/d, are algorithmic statements in that they describe a procedure for determining a value° The role of the translator program is to produce a set of machine instructions which are equivalent to the original algorithmic statement° I. Statement Decomposition° A co~m-non approach to this task is to first reduce the statement to some standard form which is more directly translatable to machine lan~zuage. For state:~onts h~ving an slgebralc form such as the one above the diegra~atic \\\"logical tree\\\" sugDests itself.\",\"PeriodicalId\":109454,\"journal\":{\"name\":\"ACM '59\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1959-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '59\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/612201.612230\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '59","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/612201.612230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在接下来的额外的馅饼里。除了i~ J~和k以外,其他字母都是浮点变量,它们是定点整数。如果常量出现时没有尾点,则被认为是定点整数。如果常量出现时没有尾点,则被认为是浮点数。二进制操作符+~-、/以常规方式使用。乘法运算符(*)总是连续3个字母(或仅用左括号分隔的字母)表示订阅()。替换操作符(=)右边的表达式定义了左边的变量所假定的新值。当前“公式”和“代数”转换器所操作的语句,如语句x(leJ+k) = s+bee+3°l~+(a-b)*c/d,是算法语句,因为它们描述了一个确定值的过程。翻译程序的作用是产生一组与原始算法语句等价的机器指令。语句分解。完成这项任务的一种co~m-non方法是首先将语句简化为某种更直接可翻译为机器语言的标准形式。对于状态:表示有一个逻辑形式,例如上面的逻辑“逻辑树”。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the construction of algorithm translators
In the exa~pies that follow lo~.~er case letters are floating point variables except i~ J~ and k which ore fixed point integers° Constants are considG~ed as fixed point integer~ if they appear without a docimal point-otherwise floating° Also constants when they appear arc considered ~o be She names of numbers whose values equal the names. The binary operators +~-, / are used in the nor;ual fashion. The multiplication operator (*) is always wrltton~ contiguou3 letters (or leSters separated only by left parentheses) implies subscription (). The expression on the right of the substitution operator (=) defines the new value to be assumed by the verlable on the lefto The statements operated on by current "formula" and "algebraic" translators such as the statements x(leJ+k) = s+bee+3°l~+(a-b)*c/d, are algorithmic statements in that they describe a procedure for determining a value° The role of the translator program is to produce a set of machine instructions which are equivalent to the original algorithmic statement° I. Statement Decomposition° A co~m-non approach to this task is to first reduce the statement to some standard form which is more directly translatable to machine lan~zuage. For state:~onts h~ving an slgebralc form such as the one above the diegra~atic "logical tree" sugDests itself.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信