{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:43Z","timestamp":1725543463414},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_10","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T01:55:49Z","timestamp":1150854949000},"page":"95-107","source":"Crossref","is-referenced-by-count":2,"title":["Noncanonical LALR(1) Parsing"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Schmitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Johnson, S.C.: YACC \u2014 yet another compiler compiler. Computing science technical report 32, AT&T Bell Laboratories, Murray Hill, New Jersey (1975)"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM\u00a013(2), 94\u2013102 (1970)","journal-title":"Communications of the ACM"},{"key":"10_CR3","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)"},{"issue":"2","key":"10_CR4","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":"10_CR5","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":"10_CR6","unstructured":"Charles, P.: A Practical method for Constructing Efficient LALR(k) Parsers with Automatic Error Recovery. PhD thesis, New York University (1991)"},{"key":"10_CR7","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":"2","key":"10_CR8","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":"10_CR9","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-connect construction for LR-regular parsers. In: Wilhelm, R. (ed.) CC 2001. LNCS, vol.\u00a02027, pp. 244\u2013258. Springer, Heidelberg (2001)"},{"issue":"1","key":"10_CR10","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"},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1145\/69622.357187","volume":"4","author":"F. DeRemer","year":"1982","unstructured":"DeRemer, F., Pennello, T.: Efficient computation of LALR(1) look-ahead sets. ACM Transactions on Programming Languages and Systems\u00a04(4), 615\u2013649 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR12","unstructured":"Schmitz, S.: Noncanonical LALR(1) parsing. Technical Report I3S\/RR-2005-21-FR, Laboratoire I3S (2005), \n                    \n                      http:\/\/www.i3s.unice.fr\/~mh\/RR\/2005\/RR-05.21-S.SCHMITZ.pdf"},{"key":"10_CR13","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":"10_CR14","series-title":"LR(k) and LL(k) Parsing of EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-08424-3","volume-title":"Parsing Theory","author":"S. Sippu","year":"1990","unstructured":"Sippu, S., Soisalon-Soininen, E.: Parsing Theory. LR(k) and LL(k) Parsing of EATCS Monographs on Theoretical Computer Science, vol.\u00a0II. Springer, Heidelberg (1990)"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:15:44Z","timestamp":1619493344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11779148_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}