{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:34:03Z","timestamp":1699835643094},"reference-count":8,"publisher":"Wiley","issue":"11","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":9126,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1981,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a very simple scheme for compiling boolean expressions in the short\u2010circuit manner in one pass. The generated code is of very high quality and avoids most inefficiencies commonly associated with one\u2010pass code generation. In particular, redundant conditional and unconditional branches are kept to a minimum. The scheme is general enough to compile the boolean expressions of a typical high\u2010level language such as Pascal. It is presented in a format suited for syntax\u2010directed translation and can be used with both top\u2010down and bottom\u2010up parsing.<\/jats:p>","DOI":"10.1002\/spe.4380111104","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T11:52:24Z","timestamp":1163764344000},"page":"1197-1214","source":"Crossref","is-referenced-by-count":4,"title":["Compiling short\u2010circuit boolean expressions in one pass"],"prefix":"10.1002","volume":"11","author":[{"given":"George","family":"Logothetis","sequence":"first","affiliation":[]},{"given":"Prateek","family":"Mishra","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Principles of Compiler Design","author":"Aho A. V.","year":"1977"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288743"},{"key":"e_1_2_1_4_2","unstructured":"D.Gries candandcorbeforeand then or elsein ADA;' Technical Report TR79\u2010402 Computer Science Department Cornell University Ithaca N.Y. (Nov1979)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380030406"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/954587.954592"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/988056.988067"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/954587.954594"},{"key":"e_1_2_1_9_2","volume-title":"The Design of an Optimizing Compiler","author":"Wulf W.","year":"1975"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380111104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380111104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T05:59:30Z","timestamp":1699768770000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380111104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":8,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["10.1002\/spe.4380111104"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380111104","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}