{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:50Z","timestamp":1725455690807},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370502"},{"type":"electronic","value":"9783642370519"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37051-9_13","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:35:47Z","timestamp":1361216147000},"page":"244-263","source":"Crossref","is-referenced-by-count":0,"title":["On LR Parsing with Selective Delays"],"prefix":"10.1007","author":[{"given":"Eberhard","family":"Bertsch","sequence":"first","affiliation":[]},{"given":"Mark-Jan","family":"Nederhof","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/114005.102809","volume":"13","author":"M. Ancona","year":"1991","unstructured":"Ancona, M., Dodero, G., Gianuzzi, V., Morgavi, M.: Efficient construction of LR(k) states and tables. ACM Trans. Progr. Lang. Syst.\u00a013(1), 150\u2013178 (1991)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Basten, H.J.S.: The usability of ambiguity detection methods for context-free grammars. In: Electronic Notes in Theoretical Computer Science, LDTA 2008, vol.\u00a0238, pp. 35\u201346. Elsevier (2008)","DOI":"10.1016\/j.entcs.2009.09.039"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0022-0000(90)90037-L","volume":"41","author":"M.E. Bermudez","year":"1990","unstructured":"Bermudez, M.E., Schimpf, K.M.: Practical arbitrary lookahead LR parsing. J. Comput. Syst. Sci.\u00a041(2), 230\u2013250 (1990)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"13_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2007.07.003","volume":"104","author":"E. Bertsch","year":"2007","unstructured":"Bertsch, E., Nederhof, M.J.: Some observations on LR-like parsing with delayed reduction. Inf. Process. Lett.\u00a0104(6), 195\u2013199 (2007)","journal-title":"Inf. Process. Lett."},{"key":"13_CR5","unstructured":"Boullier, P.: Contribution \u00e0 la construction automatique d\u2019analyseurs lexicographiques et syntaxiques. Th\u00e8se d\u2019\u00c9tat, Universit\u00e9 d\u2019Orl\u00e9ans (1984)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(73)80050-9","volume":"7","author":"K. \u010culik","year":"1973","unstructured":"\u010culik, K., Cohen, R.: LR-Regular grammars\u2014an extension of LR(k) grammars. J. Comput. Syst. Sci.\u00a07(1), 66\u201396 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Demers, A.J.: Generalized left corner parsing. In: POPL 1977, pp. 170\u2013182. ACM (1977)","DOI":"10.1145\/512950.512966"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45306-7_17","volume-title":"Compiler Construction","author":"J. Farr\u00e9","year":"2001","unstructured":"Farr\u00e9, J., Fortes G\u00e1lvez, J.: A Bounded Graph-Connect Construction for LR-regular Parsers. In: Wilhelm, R. (ed.) CC 2001. LNCS, vol.\u00a02027, pp. 244\u2013258. Springer, Heidelberg (2001)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/11812128_24","volume-title":"Implementation and Application of Automata","author":"J.F. G\u00e1lvez","year":"2006","unstructured":"G\u00e1lvez, J.F., Schmitz, S., Farr\u00e9, J.: Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol.\u00a04094, pp. 253\u2013264. Springer, Heidelberg (2006)"},{"key":"13_CR10","unstructured":"Gosling, J., Joy, B., Steele, G.: The JavaTM Language Specification, 1st edn. Addison-Wesley (1996)"},{"key":"13_CR11","unstructured":"ISO: ISO\/IEC 14882:1998: Programming Languages \u2014 C++. International Organization for Standardization, Geneva, Switzerland (1998)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Kats, L.C., Visser, E., Wachsmuth, G.: Pure and declarative syntax definition: Paradise lost and regained. In: OOPSLA 2010, pp. 918\u2013932. ACM (2010)","DOI":"10.1145\/1932682.1869535"},{"issue":"6","key":"13_CR13","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","volume":"8","author":"D.E. Knuth","year":"1965","unstructured":"Knuth, D.E.: On the translation of languages from left to right. Inform. and Cont.\u00a08(6), 607\u2013639 (1965)","journal-title":"Inform. and Cont."},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(92)90127-2","volume":"104","author":"R. Leermakers","year":"1992","unstructured":"Leermakers, R.: Recursive ascent parsing: from Earley to Marcus. Theor. Comput. Sci.\u00a0104(2), 299\u2013312 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR15","unstructured":"Malloy, B.A., Power, J.F., Waldron, J.T.: Applying software engineering techniques to parser design: the development of a C# parser. In: SAICSIT 2002, pp. 75\u201382. SAICSIT (2002)"},{"key":"13_CR16","unstructured":"Marcus, M.P.: A Theory of Syntactic Recognition for Natural Language. Series in Artificial Intelligence. MIT Press (1980)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-24723-4_6","volume-title":"Compiler Construction","author":"S. McPeak","year":"2004","unstructured":"McPeak, S., Necula, G.C.: Elkhound: A Fast, Practical GLR Parser Generator. In: Duesterwald, E. (ed.) CC 2004. LNCS, vol.\u00a02985, pp. 73\u201388. Springer, Heidelberg (2004)"},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1145\/321958.321972","volume":"23","author":"M.D. Mickunas","year":"1976","unstructured":"Mickunas, M.D., Lancaster, R.L., Schneider, V.B.: Transforming LR(k) grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context grammars. J. ACM\u00a023(3), 511\u2013533 (1976)","journal-title":"J. ACM"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Nijholt, A.: Context-free grammars: Covers, normal forms, and parsing. LNCS, vol.\u00a093. Springer (1980)","DOI":"10.1007\/3-540-10245-0"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/226060.226066","volume":"31","author":"T.J. Parr","year":"1996","unstructured":"Parr, T.J., Quong, R.W.: LL and LR translators need k\u2009>\u20091 lookahead. ACM Sigplan. Not.\u00a031(2), 27\u201334 (1996)","journal-title":"ACM Sigplan. Not."},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1186\/1471-2105-6-153","volume":"6","author":"J. Reeder","year":"2005","unstructured":"Reeder, J., Steffen, P., Giegerich, R.: Effective ambiguity checking in biosequence analysis. BMC Bioinformatics\u00a06, 153 (2005)","journal-title":"BMC Bioinformatics"},{"issue":"1-2","key":"13_CR22","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.scico.2009.07.002","volume":"75","author":"S. Schmitz","year":"2010","unstructured":"Schmitz, S.: An experimental ambiguity detection tool. Science of Computer Programming\u00a075(1-2), 71\u201384 (2010)","journal-title":"Science of Computer Programming"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Sippu, S., Soisalon-Soininen, E.: Parsing Theory, vol. II: LR(k) and LL(k) Parsing. EATCS Monographs on Theoretical Computer Science, vol.\u00a020. Springer (1990)","DOI":"10.1007\/978-3-662-08424-3"},{"issue":"4","key":"13_CR24","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF00268320","volume":"12","author":"E. Soisalon-Soininen","year":"1979","unstructured":"Soisalon-Soininen, E., Ukkonen, E.: A method for transforming grammars into LL(k) form. Acta Inf.\u00a012(4), 339\u2013369 (1979)","journal-title":"Acta Inf."},{"issue":"2","key":"13_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1137\/0205019","volume":"5","author":"T.G. Szymanski","year":"1976","unstructured":"Szymanski, T.G., Williams, J.H.: Noncanonical extensions of bottom-up parsing techniques. SIAM J. Comput.\u00a05(2), 231\u2013250 (1976)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"13_CR26","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/357073.357083","volume":"1","author":"K.C. Tai","year":"1979","unstructured":"Tai, K.C.: Noncanonical SLR(1) grammars. ACM Trans. Progr. Lang. Syst.\u00a01(2), 295\u2013320 (1979)","journal-title":"ACM Trans. Progr. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37051-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T08:28:20Z","timestamp":1557563300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37051-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370502","9783642370519"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37051-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}