{"title":"一种规范计算机语言的语法和翻译的正式系统","authors":"J. Donovan, H. Ledgard","doi":"10.1145/1465611.1465685","DOIUrl":null,"url":null,"abstract":"This paper presents two basic results: the use of established methods of recursive definition to present a single method to\n 1. specify the syntax of computer languages (including context sensitive requirements, such as the restrictions implied by declaration statements),\n 2. specify the translation of programs in one computer language into programs in another language.","PeriodicalId":265740,"journal":{"name":"AFIPS '67 (Fall)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A formal system for the specification of the syntax and translation of computer languages\",\"authors\":\"J. Donovan, H. Ledgard\",\"doi\":\"10.1145/1465611.1465685\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents two basic results: the use of established methods of recursive definition to present a single method to\\n 1. specify the syntax of computer languages (including context sensitive requirements, such as the restrictions implied by declaration statements),\\n 2. specify the translation of programs in one computer language into programs in another language.\",\"PeriodicalId\":265740,\"journal\":{\"name\":\"AFIPS '67 (Fall)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1899-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AFIPS '67 (Fall)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1465611.1465685\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AFIPS '67 (Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1465611.1465685","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A formal system for the specification of the syntax and translation of computer languages
This paper presents two basic results: the use of established methods of recursive definition to present a single method to
1. specify the syntax of computer languages (including context sensitive requirements, such as the restrictions implied by declaration statements),
2. specify the translation of programs in one computer language into programs in another language.