{"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}
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.