{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:06:52Z","timestamp":1699834012408},"reference-count":8,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":10832,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1977,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Most APL systems delay all parsing until run\u2010time. Because the APL expression language is inherently ambiguous and because identifier binding is delayed until run\u2010time, some runtime parsing is shown to be necessary. Nevertheless we argue that most APL statement parsing can be done at entry\u2010time and that there are several reasons for doing so. Then a technique is described whereby APL statements are partially parsed at entry\u2010time and are parse completed at run\u2010time.<\/jats:p>","DOI":"10.1002\/spe.4380070207","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:33:55Z","timestamp":1163766835000},"page":"193-200","source":"Crossref","is-referenced-by-count":12,"title":["Does APL really need run\u2010time parsing?"],"prefix":"10.1002","volume":"7","author":[{"given":"George O.","family":"Strawn","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"ACM Symposium on Principles of Programming Languages","author":"Aho A. V.","year":"1973"},{"key":"e_1_2_1_3_2","unstructured":"J.Earley \u2018Ambiguity and precedence in syntax description\u2019 Technical Report 13 Dept. of Electrical Engineering and Computer Sciences University of California Berkeley 1973."},{"key":"e_1_2_1_4_2","unstructured":"G. O.Strawn \u2018An algebraic proof of correctness of a partial parser for an inherently ambiguous language\u2019 to be submitted for publication."},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"P. S.Abrams \u2018An APL machine\u2019 Technical Report 3 Stanford Electronics Lab. Stanford 1970.","DOI":"10.2172\/4169175"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380040205"},{"key":"e_1_2_1_7_2","volume-title":"APLSV User's Manual","author":"Falkoffand A. D.","year":"1973"},{"key":"e_1_2_1_8_2","volume-title":"APL\/360: User's Manual","author":"Falkoffand A. D.","year":"1968"},{"key":"e_1_2_1_9_2","volume-title":"The Theory of Parsing, Translation and Compiling","author":"Aho A. V.","year":"1972"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380070207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380070207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:23:22Z","timestamp":1699781002000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380070207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,3]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977,3]]}},"alternative-id":["10.1002\/spe.4380070207"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380070207","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,3]]}}}