{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T19:40:36Z","timestamp":1698090036027},"reference-count":27,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":5295,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1992,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>One of the difficult problems that faces a compiler writer is to devise a grammar that is suitable for both efficient parsing and semantic attribution. This paper describes a system that resolves conflicts in LR(1) parsing by taking advantage of information in the parse tree. The system, which functions as part of a compiler generator, rewrites the user's grammar to remove parsing conflicts. It then places code into the generated compiler that rewrites the parse tree during parsing so as to produce the tree of the original grammar. The compiler writer can then write the semantic attribution to fit his or her original grammar without any knowledge of the changes made. The method is expected to be efficient in most cases, even in parsing systems that do not explicitly build the entire parse tree. The method complements previous work in its capabilities and advantages. The system has been implemented and integrated into a compiler generator system.<\/jats:p>","DOI":"10.1002\/spe.4380220505","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T19:40:21Z","timestamp":1163792421000},"page":"419-437","source":"Crossref","is-referenced-by-count":0,"title":["A new parsing method for non\u2010LR(1) grammars"],"prefix":"10.1002","volume":"22","author":[{"given":"A. Gayler","family":"Harford","sequence":"first","affiliation":[]},{"given":"Vincent P.","family":"Heurinc","sequence":"additional","affiliation":[]},{"given":"Michael G.","family":"Main","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80050-9"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/947923.947926"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102809"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90030-1"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"M. E.BermudezandK. M.Schimpf \u2018A practical arbitrary look\u2010ahead LR parsing technique\u2019 Proceedings of ACM SIGPLAN Symposium on Compiler ConstructionJune1986 pp.136\u2013144.","DOI":"10.1145\/13310.13325"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(90)90037-L"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321972"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90082-X"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/129630.129637"},{"key":"e_1_2_1_11_2","unstructured":"A. G.Harford \u2018A new parsing method for non\u2010LALR(1) grammars\u2019 Technical Report Department of Electrical and Computer Engineering University of Colorado Boulder CO 80309 U.S.A. Software Engineering Group Report No. 90\u201301.1990. Copies available upon request."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90426-2"},{"key":"e_1_2_1_13_2","volume-title":"Compilers","author":"Aho A. V.","year":"1986"},{"key":"e_1_2_1_14_2","volume-title":"Theory and Practice of Compiler Writing","author":"Tremblay J\u2010P.","year":"1985"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5192-7"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/57669.57684"},{"key":"e_1_2_1_17_2","volume-title":"GAG: A Practical Compiler Generator","author":"Kastens U.","year":"1982"},{"key":"e_1_2_1_18_2","unstructured":"G. M.Clemm \u2018The Odin system\u2014an object manager for software environments\u2019 Ph.D. Thesis Department of Computer Science University of Colorado Boulder CO 1986."},{"key":"e_1_2_1_19_2","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1002\/j.1097-024X.1986.tb00011.x","article-title":"The automatic generation of fast lexical analysers","volume":"16","author":"Heuring V. P.","year":"1986","journal-title":"Software\u2014Practice and Experience"},{"key":"e_1_2_1_20_2","unstructured":"J.GroschandE.Klein \u2018User manual for the PGS\u2010system\u2019 Gesellschaft fur Mathematik und Datenverarbeitung Research Institute at the University of Karlsruhe 1988."},{"key":"e_1_2_1_21_2","unstructured":"A.Bahrami \u2018CAGT\u2014an automated approach to abstract and parsing grammars\u2019 M. S. Thesis Department of Electrical and Computer Engineering University of Colorado at Boulder 1986."},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207168808803647"},{"key":"e_1_2_1_23_2","unstructured":"R.Farshi \u2018LRRL(k) grammars: a left to right parsing technique with reduced lookaheads\u2019 Ph.D. Thesis University of Alberta Edmonton Alberta Canada 1986."},{"key":"e_1_2_1_24_2","unstructured":"J. P.Schmeiser \u2018An RLALR(k) parser generator\u2019 M.Sc. Thesis University of Saskatchewan Saskatoon Saskatchewan Canada 1988."},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/321724.321732"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264257"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321924"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/355611.362536"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380220505","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380220505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T19:17:04Z","timestamp":1698088624000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380220505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["10.1002\/spe.4380220505"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380220505","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}