{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:19Z","timestamp":1725491419283},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_24","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T09:32:31Z","timestamp":1155115951000},"page":"253-264","source":"Crossref","is-referenced-by-count":2,"title":["Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Fortes","family":"G\u00e1lvez","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[]},{"given":"Jacques","family":"Farr\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Donnely, C., Stallman, R.: Bison, The YACC-compatible Parser Generator. The Free Software Foundation (2002)"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0022-0000(81)90030-1","volume":"22","author":"T.P. Baker","year":"1981","unstructured":"Baker, T.P.: Extending lookahead for LR parsers. Journal of Computer and System Sciences\u00a022(2), 243\u2013259 (1981)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"24_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. Journal of Computer and System Sciences\u00a041(2), 230\u2013250 (1990)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR4","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)"},{"issue":"2","key":"24_CR5","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 Journal on Computing\u00a05(2), 231\u2013250 (1976)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"24_CR6","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 Transactions on Programming Languages and Systems\u00a01(2), 295\u2013320 (1979)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11779148_10","volume-title":"Developments in Language Theory","author":"S. Schmitz","year":"2006","unstructured":"Schmitz, S.: Noncanonical LALR(1) parsing. In: Dang, Z., Ibarra, O.H. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 95\u2013107. Springer, Heidelberg (2006)"},{"key":"24_CR8","series-title":"Parsing of Series in Automatic Computation","volume-title":"The Theory of Parsing, Translation, and Compiling","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Parsing of Series in Automatic Computation, vol.\u00a0I. Prentice Hall, Englewood Cliffs (1972)"},{"key":"24_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1885-0","volume-title":"Efficient Parsing for Natural Language","author":"M. Tomita","year":"1986","unstructured":"Tomita, M.: Efficient Parsing for Natural Language. Kluwer Academic Publishers, Dordrecht (1986)"},{"key":"24_CR10","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. Journal of Computer and System Sciences\u00a07, 66\u201396 (1973)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2003.10.006","volume":"313","author":"J. Farr\u00e9","year":"2004","unstructured":"Farr\u00e9, J., Fortes G\u00e1lvez, J.: Bounded-connect noncanonical discriminating-reverse parsers. Theoretical Computer Science\u00a0313(1), 73\u201391 (2004)","journal-title":"Theoretical Computer Science"},{"key":"24_CR12","unstructured":"Fortes G\u00e1lvez, J.: A Discriminating Reverse Approach to LR(k) Parsing. PhD thesis, Universidad de Las Palmas de Gran Canaria and Universit\u00e9 de Nice-Sophia Antipolis (1998)"},{"key":"24_CR13","unstructured":"Grune, D., Jacobs, C.J.H.: Parsing Techniques: A Practical Guide. Ellis Horwood Limited (1990)"},{"issue":"12","key":"24_CR14","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1145\/361227.361232","volume":"18","author":"H.B. Hunt III","year":"1975","unstructured":"Hunt III, H.B., Szymanski, T.G., Ullman, J.D.: On the complexity of LR(k) testing. Communications of the ACM\u00a018(12), 707\u2013716 (1975)","journal-title":"Communications of the ACM"},{"issue":"2","key":"24_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(81)90067-0","volume":"15","author":"S. Heilbrunner","year":"1981","unstructured":"Heilbrunner, S.: A parsing automata approach to LR theory. Theoretical Computer Science\u00a015(2), 117\u2013157 (1981)","journal-title":"Theoretical Computer Science"},{"key":"24_CR16","unstructured":"Sch\u00f6bel-Theuer, T.: Towards a unifying theory of context-free parsing. In: Pighizzini, G., San Pietro, P. (eds.) Proceedings ASMICS Workshop on Parsing Theory. Technical Report 126-1994, Universit\u00e0 di Milano, pp. 89\u2013100 (1994)"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/512950.512973","volume-title":"POPL 1977","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL 1977, pp. 238\u2013252. ACM Press, New York (1977)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:26:56Z","timestamp":1619508416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11812128_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}