{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T23:40:59Z","timestamp":1697758859539},"reference-count":9,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":8125,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1984,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Ideally the syntactic part of a PL\/I compiler would be generated directly from the semi\u2010formal definition of ANSI Standard PL\/I. A practical approach to this is described, using finite state machines and an LALR parser generator.<\/jats:p><jats:p>The parser uses a method due to Aoe which avoids list searching. Adapted for this method the PL\/I grammar has 841 states. The parse table generator exploits the freedom to renumber states in a way that improves on previous algorithms for compacting the tables. The parser tables occupy less than 4K bytes.<\/jats:p>","DOI":"10.1002\/spe.4380140807","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T03:27:34Z","timestamp":1163820454000},"page":"775-789","source":"Crossref","is-referenced-by-count":0,"title":["Taming the PL\/I syntax"],"prefix":"10.1002","volume":"14","author":[{"given":"B. L.","family":"Marks","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"ANSI X3.53\u20131976 \u2018Programming Language PL\/I\u2019 1976."},{"key":"e_1_2_1_3_2","volume-title":"Compiler Construction","author":"Bauer F. L."},{"issue":"4","key":"e_1_2_1_4_2","article-title":"Practical method for optimizing LR(k) parser using matrix structure","volume":"10","author":"Aoe J.","year":"1979","journal-title":"Systems Computers Controls"},{"key":"e_1_2_1_5_2","unstructured":"W. A.BarrettandJ. D.Couch Compiler Construction Theory and Practice Science Research Associates1979."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/872732.806960"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(80)90006-5"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/872726.806978"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(82)90020-0"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207168208803329"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380140807","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380140807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T22:59:27Z","timestamp":1697756367000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380140807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":9,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["10.1002\/spe.4380140807"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380140807","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}