{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T10:40:19Z","timestamp":1734086419029,"version":"3.30.2"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,6,12]],"date-time":"2004-06-12T00:00:00Z","timestamp":1086998400000},"content-version":"vor","delay-in-days":5641,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1989]]},"DOI":"10.1016\/0096-0551(89)90028-3","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:04:53Z","timestamp":1060297493000},"page":"25-33","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Semantic predicates in parser generators"],"prefix":"10.1016","volume":"14","author":[{"given":"Mahadevan","family":"Ganapathi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1973","series-title":"The Theory of Parsing, Translation, and Compiling","author":"Aho","key":"10.1016\/0096-0551(89)90028-3_BIB1"},{"year":"1976","series-title":"Compiler Design Theory","author":"Lewis","key":"10.1016\/0096-0551(89)90028-3_BIB2"},{"key":"10.1016\/0096-0551(89)90028-3_BIB3","series-title":"Proceedings of the '79 Symposium on Compiler Construction","article-title":"An ALL(1) compiler generator","author":"Milton","year":"1979"},{"article-title":"A simple and practical implementation of predicates in context free parsers","year":"1983","author":"Fischer","key":"10.1016\/0096-0551(89)90028-3_BIB4"},{"key":"10.1016\/0096-0551(89)90028-3_BIB5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/4472.4486","article-title":"Affix grammar driven code generation","volume":"7","author":"Ganapathi","year":"1985","journal-title":"ACM Trans. Prog. Lang. Sys."},{"issue":"1","key":"10.1016\/0096-0551(89)90028-3_BIB6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF00268846","article-title":"Integrating code generation and peephole optimization","volume":"25","author":"Ganapathi","year":"1988","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/0096-0551(89)90028-3_BIB7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/spe.4380140406","article-title":"Attributed linear intermediate representations for retargetable code generators","volume":"14","author":"Ganapathi","year":"1984","journal-title":"Software-Practice Exper."},{"issue":"4","key":"10.1016\/0096-0551(89)90028-3_BIB8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF00286489","article-title":"Semantic routines and LR(k) parsers","volume":"14","author":"Purdom","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0096-0551(89)90028-3_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00276181","article-title":"The parsing problem for affix grammars","volume":"8","author":"Watt","year":"1977","journal-title":"Acta Inform."},{"year":"1986","series-title":"Compilers, Principles, Techniques and Tools","author":"Aho","key":"10.1016\/0096-0551(89)90028-3_BIB10"},{"key":"10.1016\/0096-0551(89)90028-3_BIB11","series-title":"Unix System Programmer's Manual","article-title":"YACC\u2014Yet another compiler compiler","author":"Johnson","year":"1975"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055189900283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055189900283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T09:30:49Z","timestamp":1734082249000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055189900283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989]]}},"alternative-id":["0096055189900283"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(89)90028-3","relation":{},"ISSN":["0096-0551"],"issn-type":[{"type":"print","value":"0096-0551"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Semantic predicates in parser generators","name":"articletitle","label":"Article Title"},{"value":"Computer Languages","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0096-0551(89)90028-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}