{"title":"Machines for attribute grammars","authors":"Gilberto Filé","doi":"10.1016/S0019-9958(86)80043-2","DOIUrl":null,"url":null,"abstract":"<div><p>Two automata models are introduced that play, with respect to attribute grammars and attribute-evaluation for them, the same role as pushdown automata have with respect to context-free grammars and their parsing. It is shown, in fact, that these automata define the same class of string-to-value translations as attribute grammars. Their class of tree-to-value translations seems instead to be larger than that of attribute grammars and the difference is overcome by means of (a special type of) context-free grammar interpretations. An extended model of attribute grammar is presented that is as powerful as the automata with respect to tree-to-value translations.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"69 1","pages":"Pages 41-124"},"PeriodicalIF":0.0000,"publicationDate":"1986-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80043-2","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995886800432","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 5
Abstract
Two automata models are introduced that play, with respect to attribute grammars and attribute-evaluation for them, the same role as pushdown automata have with respect to context-free grammars and their parsing. It is shown, in fact, that these automata define the same class of string-to-value translations as attribute grammars. Their class of tree-to-value translations seems instead to be larger than that of attribute grammars and the difference is overcome by means of (a special type of) context-free grammar interpretations. An extended model of attribute grammar is presented that is as powerful as the automata with respect to tree-to-value translations.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
