{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:12Z","timestamp":1725566652846},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148217"},{"type":"electronic","value":"9783642148224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14822-4_4","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T03:32:56Z","timestamp":1285385576000},"page":"30-39","source":"Crossref","is-referenced-by-count":0,"title":["A Fast General Parser for Automatic Code Generation"],"prefix":"10.1007","author":[{"given":"Wuu","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1145\/69558.75700","volume":"11","author":"A.V. Aho","year":"1989","unstructured":"Aho, A.V., Ganapathi, M., Tjian, S.W.K.: Code Generation Using Tree Matching and Dynamic Programming. ACM Transactions on Programming Languages and Systems\u00a011(4), 491\u2013516 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR2","volume-title":"Compilers, Principles, Techniques, and Tools","author":"A.V. Aho","year":"2007","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers, Principles, Techniques, and Tools, 2nd edn. Addison-Wesley, New York (2007)","edition":"2"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/502874.502877","volume-title":"Proceedings of the 1984 SIGPLAN symposium on Compiler construction, ACM SIGPLAN Notices","author":"T.W. Christopher","year":"1984","unstructured":"Christopher, T.W., Hatcher, P.J., Kukuk, R.C.: Using Dynamic Programming to Generate Optimized Code in a Graham-Glanville-Style Code Generator. In: Proceedings of the 1984 SIGPLAN symposium on Compiler construction, ACM SIGPLAN Notices, vol.\u00a084, pp. 25\u201336. ACM, New York (1984)"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"Earley, J.: An efficient context-free parsing algorithm. ACM Comm.\u00a013(2), 94\u2013102 (1970)","journal-title":"ACM Comm."},{"key":"4_CR5","volume-title":"Crafting a Compiler with C","author":"C.N. Fischer","year":"1991","unstructured":"Fischer, C.N., LeBlanc Jr., R.J.: Crafting a Compiler with C. Benjamin\/Cummings, Reading (1991)"},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/151640.151642","volume":"1","author":"C.W. Fraser","year":"1992","unstructured":"Fraser, C.W., Hanson, D.R., Proebsting, T.A.: Engineering a Simple, Efficient Code Generator Generator. ACM Letters on Programming Languages and Systems\u00a01(3), 213\u2013226 (1992)","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"4_CR7","unstructured":"Glanville, R.S.: A machine independent algorithm for code generation and its use in retargetable compilers. Ph.D. dissertation, University of California, Berkeley (December 1977)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Steven Glanville, R., Graham, S.L.: A new method for compiler code generation. In: Proceedings of 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, Tucson, Arizona, pp. 231\u2013254 (1978)","DOI":"10.1145\/512760.512785"},{"key":"4_CR9","first-page":"33","volume":"20","author":"R. Nigel Horspool","year":"1987","unstructured":"Nigel Horspool, R.: An Alternative to the Graham-Glanville Code-Generation Method. IEEE Computers\u00a020, 33\u201339 (1987)","journal-title":"IEEE Computers"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-540-49382-2_11","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"M. Madhavan","year":"1998","unstructured":"Madhavan, M., Shankar, P.: Optimal regular tree pattern matching using pushdown automata. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 122\u2013133. Springer, Heidelberg (1998)"},{"issue":"6","key":"4_CR11","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1145\/371880.371881","volume":"22","author":"M. Madhavan","year":"2000","unstructured":"Madhavan, M., Shankar, P., Rai, S., Ramakrishna, U.: Extending Graham-Glanville Techniques for Optimal Code Generation. ACM Transactions on Programming Languages and Systems\u00a022(6), 973\u20131001 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR12","unstructured":"Sun Microsystems, Connected, Limited Device Configuration, Specification Version 1.0a, Java 2 Platform Micro Edition 1.0a, CA, USA (May 19, 2000)"}],"container-title":["Lecture Notes in Computer Science","Methods and Tools of Parallel Programming Multicomputers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14822-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:39:10Z","timestamp":1619771950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14822-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642148217","9783642148224"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14822-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}