{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:10:47Z","timestamp":1775873447034,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540186250","type":"print"},{"value":"9783540480334","type":"electronic"}],"license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18625-5_71","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:41:26Z","timestamp":1330198886000},"page":"500-527","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Retrospection on the PQCC compiler structure"],"prefix":"10.1007","author":[{"given":"K. V.","family":"Nori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Pavan","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"issue":"8","key":"35_CR1","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MC.1980.1653748","volume":"13","author":"B. W. Leverett","year":"1980","unstructured":"Leverett, B.W., R.G.G. Cattell, S.O. Hobbs, J.M. Newcomer, A.H. Reiner, B.R. Schatz, and W.A. Wulf, \"An Overview of the Production Quality Compiler Compiler project,\" Computer 13:8(1980), 38\u201349.","journal-title":"Computer"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Glanville, R.S., and S.L. Graham, \"A New Method for Compiler Code Generation,\" 5th ACM symposium on POPL, 1978, 231\u2013240.","DOI":"10.1145\/512760.512785"},{"issue":"6","key":"35_CR3","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1147\/rd.246.0695","volume":"24","author":"F. E. Allen","year":"1980","unstructured":"Allen, F.E., J.L. Carter, J. Fabri, J. Ferrante, W.H. Harrison, P.G. Loewner, and L.H. Trevillyan, \"The Experimental Compiling System,\" IBM Journal Research and Development 24:6(1980), 695\u2013715.","journal-title":"IBM Journal Research and Development"},{"key":"35_CR4","unstructured":"Giegrerich, R., \"Introduction to the Compiler Generating System MUG2,\" Technical Report, TUM-INFO-7913, Technische Universitat Munchen, 1979."},{"key":"35_CR5","volume-title":"The Design of an Optimizing Compiler","author":"W. A. Wulf","year":"1975","unstructured":"Wulf, W.A., R.K. Johnson, C.B. Weinstock, S.O. Hobbs, and C.M. Geschke, \"The Design of an Optimizing Compiler,\" American Elsevier, New York, 1975."},{"key":"35_CR6","unstructured":"Wulf, W.A., M. Barbacci, B. Brosgol, R.G.G. Cattell, R. Conradi, S.O. Hobbs, P. Knueven, B.W. Leverett, J.M. Newcomer, A.H. Reiner, B.R. Schatz, D. Stryker, and F. Turini, \"Specifications for the Phases of the PQCC,\" Internal document PQCC project, Computer Science Department, Carnegie-Mellon University 1980."},{"key":"35_CR7","unstructured":"Newcomer, J.M., \"PQCC Intermediate Machine Description Language,\" Internal document PQCC project, Computer Science Department, Carnegie-Mellon University 1981."},{"key":"35_CR8","unstructured":"Brosgol, B., J.M. Newcomer, D.A. Lamb, D. Levine, M.S. Van Duesen, and W.A. Wulf, \"TCOL-Ada,\" Computer Science Technical Report CMU-CS-80-105, Carnegie-Mellon University, 1980."},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Wulf, W.A., and K.V. Nori, \"Delayed Binding in PQCC Generated Compilers,\" Computer Science Technical Report CMU-CS-82-138, Carnegie-Mellon University, 1982.","DOI":"10.21236\/ADA125935"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Wulf, W.A., and K.V. Nori, \"Code Selection in PQCC Generated Compilers,\" Internal document PQCC project, Computer Science Department, Carnegie-Mellon University, 1983.","DOI":"10.21236\/ADA125935"},{"key":"35_CR11","unstructured":"Cattell, R.G.G., \"Formalization and Automatic Derivation of Code Generators,\" PhD Dissertation, Computer Science Department, Carnegie-Mellon University, 1978."},{"key":"35_CR12","unstructured":"Leverett, B.W., \"Register Allocation in Optimizing Compilers,\" PhD Dissertation, Computer Science Department, Carnegie-Mellon University, 1981."},{"key":"35_CR13","unstructured":"Lamb, D.A., \"IDL \u2014 Interface Description Language,\" PhD Disseartation, Computer Science Department, Carnegie-Mellon University, 1983."},{"key":"35_CR14","unstructured":"Wulf, W.A., \"PQCC: A Machine-Relative Compiler Technology,\" IEEE 4th International COMPSAC conference, 1980, 24\u201336."},{"issue":"2","key":"35_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1145\/357094.357097","volume":"2","author":"R. G. G. G. Cattell","year":"1980","unstructured":"Cattell, R.G.G., \"Automatic Derivation of Code Generators from Machine Descriptions,\" ACM TOPLAS 2:2(1980), 173\u2013190.","journal-title":"ACM TOPLAS"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Goos, G., W.A. Wulf, A. Evans Jr., and K.J. Butler, \"DIANA An Intermediate Language for Ada,\" LNCS vol. 161, Springer-Verlag, 1983.","DOI":"10.1007\/3-540-12695-3"},{"key":"35_CR17","unstructured":"\"C Cross Compiler Design Document,\" vol. I, II and III, Project document, Tata Research Development and Design Centre, Pune, 1985."},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Kumar, S., and V.M. Malhotra, \"Automatic Retargetable Code Generation: A New Technique,\" FST & TCS6 conference, LNCS vol. 241, Springer Verlag, 1986, 57\u201380.","DOI":"10.1007\/3-540-17179-7_4"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Kumar, S., \"Automatic Retargetable Code Generation,\" PhD Dissertation, Computer Science Department, Indian Institute of Technology, Kanpur, 1986.","DOI":"10.1007\/3-540-17179-7_4"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Steel, T.B., Jr. \"A First Version of UNCOL,\" Proc. Winter Joint Computer Conference, 1961, 371\u2013378.","DOI":"10.1145\/1460690.1460733"},{"issue":"4","key":"35_CR21","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/1780.1783","volume":"6","author":"J. W. Davidson","year":"1984","unstructured":"Davidson, J.W., and C.W. Fraser, \"Code Selection Through Object Code Optimization,\" ACM TOPLAS 6:4(1984), 505\u2013526.","journal-title":"ACM TOPLAS"},{"issue":"9","key":"35_CR22","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1145\/358172.358182","volume":"26","author":"A. S. Tanenbaum","year":"1983","unstructured":"Tanenbaum, A.S., H. van Staveren, E.G. Keizer, and J.W. Stevenson, \"A Practical Tool Kit for making Portable Compilers,\" CACM 26:9(1983), 654\u2013660.","journal-title":"CACM"},{"key":"35_CR23","first-page":"21","volume":"4","author":"A.S. Tanenbaum","year":"1982","unstructured":"Tanenbaum, A.S., H. van Staveren, and J.W. Stevenson, \"Using Peephole Optimization on Intermediate Code,\" ACM TOPLAS 4:1(1982), 21:36.","journal-title":"\"Using Peephole Optimization on Intermediate Code,\" ACM TOPLAS"},{"key":"35_CR24","unstructured":"Nestor, J.R., and M. Beard, \"Front End Generator User's Guide,\" Internal document PQCC project, Computer Science Department, Carnegie-Mellon University, 1981."},{"key":"35_CR25","unstructured":"Wulf, W.A., \"BONSAI A Tree Transformer Generator,\" Internal document PQCC project, Computer Science Department, Carnegie-Mellon University, 1981."},{"key":"35_CR26","unstructured":"Stryker, D., \"FLANGE: A Flow Analysis Generator User's Manual,\" Internal document PQCC project, Computer Science Department, Carnegie-Mellon University."},{"key":"35_CR27","unstructured":"Johnson, S.C., \"Yacc \u2014 yet another compiler compiler,\" Computing Science Technical Report 32, AT & T Bell Laboratories, 1975."},{"key":"35_CR28","unstructured":"Lesk, M.E., \"Lex \u2014 a lexical analyzer generator,\" Computing Science Technical Report 39, AT & T Bell Laboratories, 1975."},{"key":"35_CR29","unstructured":"Deodhar, R., and S.M. Jorapur, \"Treegen \u2014 Abstract Syntax Tree Builder,\" Internal document, Tata Research Development and Design Centre, Pune, 1984."},{"key":"35_CR30","unstructured":"Medina-Mora, R. \"Syntax Directed Editing: Towards Integrated Programming Environment,\" PhD Dissertation, Computer Science Department, Carnegie-Mellon University, 1982."},{"key":"35_CR31","unstructured":"Jorapur, S.M., \"TTGEN \u2014 Tree Transformer Generator,\" Internal document, Tata Research Development and Design Centre, Pune, 1985."},{"issue":"1","key":"35_CR32","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C. M. Hoffman","year":"1982","unstructured":"Hoffman, C.M., and M.J. O'Donnell, \"Pattern Matching in Trees,\" Journal ACM 29:1(1982), 68\u201395.","journal-title":"Journal ACM"},{"key":"35_CR33","doi-asserted-by":"crossref","unstructured":"O'Donnell, M.J., \"Computing in Systems Described by Equations,\" LNCS vol. 58, Springer-Verlag, 1977.","DOI":"10.1007\/3-540-08531-9"},{"key":"35_CR34","volume-title":"A Programming System Based on Program Structure","author":"B. H. Jajoo","year":"1980","unstructured":"Jajoo, B.H., \"A Programming System Based on Program Structure,\" PhD Dissertation, Computer Science Department, Indian Institute of Technology, Kanpur, 1980."},{"key":"35_CR35","unstructured":"Joshi, S.M., and K.V. Nori, \"Equational Formulation of Data Flow Analysis,\" Internal document, Tata Research Development and Design Centre, Pune, 1987."},{"key":"35_CR36","unstructured":"Joshi, R.R., and K.V. Nori, \"An Intermediate Representation of Programs with Continuation Free Semantics,\" Internal document, Tata Research Development and Design Centre, Pune, 1987."},{"issue":"6","key":"35_CR37","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"Aho, A.V., and M.J. Corasick, \"Efficient String Matching: an aid to Bibliographic Search,\" CACM 18:6(1975), 333\u2013340.","journal-title":"CACM"},{"issue":"4","key":"35_CR38","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1145\/321607.321620","volume":"17","author":"R. Sethi","year":"1970","unstructured":"Sethi, R., and J.D. Ullman, \"The Generation of Optimal Code for Arithmetic Expressions,\" Journal ACM 17:4(1970), 715\u2013728.","journal-title":"Journal ACM"},{"key":"35_CR39","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J., \"Register Allocation and Spilling via Graph Coloring,\" SIGPLAN symposium on Compiler Construction, 1982, 98\u2013105.","DOI":"10.1145\/872726.806984"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18625-5_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:39:39Z","timestamp":1742589579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18625-5_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540186250","9783540480334"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/3-540-18625-5_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]},"assertion":[{"value":"27 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}