{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:21:17Z","timestamp":1725664877027},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540610533"},{"type":"electronic","value":"9783540499398"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61053-7_69","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:13:52Z","timestamp":1330290832000},"page":"294-306","source":"Crossref","is-referenced-by-count":4,"title":["One-pass, optimal tree parsing \u2014 With or without trees"],"prefix":"10.1007","author":[{"given":"Todd A.","family":"Proebsting","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin R.","family":"Whaley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/69558.75700","volume":"11","author":"A. V. Aho","year":"1989","unstructured":"Alfred V. Aho, Mahedevan Ganapathi, and Steven W. K. Tjiang. Code generation using tree matching and dynamic programming. ACM Transactions on Programming Languages and Systems, 11(4):491\u2013516, October 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"21_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0096-0551(90)90006-B","volume":"15","author":"A. Balachandran","year":"1990","unstructured":"A. Balachandran, D. M. Dhamdhere, and S. Biswas. Efficient retargetable code generation using bottom-up tree pattern matching. Computer Languages, 15(3):127\u2013140, 1990.","journal-title":"Computer Languages"},{"key":"21_CR3","first-page":"227","volume-title":"BEG\u2014a generator for efficient back ends","author":"H. Emmelmann","year":"1989","unstructured":"Helmut Emmelmann, Friedrich-Wilhelm Schr\u00f6er, and Rudolf Landwehr. BEG\u2014a generator for efficient back ends. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pages 227\u2013237, New York, 1989. ACM."},{"key":"21_CR4","volume-title":"A Retargetable C Compiler: Design and Implementation","author":"C. W. Fraser","year":"1995","unstructured":"Christopher W. Fraser and David R. Hanson. A Retargetable C Compiler: Design and Implementation. Benjamin\/Cummings, Redwood City, California, 1995."},{"issue":"3","key":"21_CR5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/151640.151642","volume":"1","author":"C. W. Fraser","year":"1992","unstructured":"Christopher W. Fraser, David R. Hanson, and Todd A. Proebsting. Engineering a simple, efficient code-generator generator. ACM Letters on Programming Languages and Systems, 1(3):213\u2013226, September 1992.","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"4","key":"21_CR6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/131080.131089","volume":"27","author":"C. W. Fraser","year":"1992","unstructured":"Christopher W. Fraser, Robert R. Henry, and Todd A. Proebsting. BURG \u2014 fast optimal instruction selection and tree parsing. SIGPLAN Notices, 27(4):68\u201376, April 1992.","journal-title":"SIGPLAN Notices"},{"issue":"1","key":"21_CR7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C. M. Hoffmann","year":"1982","unstructured":"Christoph M. Hoffmann and Michael J. O'Donnell. Pattern matching in trees. Journal of the ACM, 29(1):68\u201395, January 1982.","journal-title":"Journal of the ACM"},{"key":"21_CR8","first-page":"294","volume-title":"Optimal code generation for expression trees: An application of BURS theory","author":"E. Pelegri-Llopart","year":"1988","unstructured":"Eduardo Pelegri-Llopart and Susan L. Graham. Optimal code generation for expression trees: An application of BURS theory. In Proceedings of the 15th Annual Symposium on Principles of Programming Languages, pages 294\u2013308, New York, 1988. ACM."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Todd A. Proebsting. Simple and efficient BURS table generation. In Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation, pages 331\u2013340, New York, June 1992. ACM.","DOI":"10.1145\/143103.143145"},{"key":"21_CR10","unstructured":"N. Wirth and J. Gutknecht. Project Oberon, the Design of an Operating System and Computer. Addison Wesley, 1992."}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61053-7_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:53Z","timestamp":1605647033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61053-7_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610533","9783540499398"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-61053-7_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}