{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:23:35Z","timestamp":1762917815751},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T00:00:00Z","timestamp":1509753600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00236-017-0308-3","type":"journal-article","created":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T11:18:41Z","timestamp":1509794321000},"page":"547-574","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast deterministic parsers for transition networks"],"prefix":"10.1007","volume":"55","author":[{"given":"Angelo","family":"Borsotti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Breveglieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Crespi Reghizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Morzenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,4]]},"reference":[{"key":"308_CR1","volume-title":"Compilers: Principles, Techniques and Tools","author":"A Aho","year":"2006","unstructured":"Aho, A., Lam, M., Sethi, R., Ullman, J.: Compilers: Principles, Techniques and Tools. Prentice-Hall, Englewoof Cliffs (2006)"},{"issue":"4","key":"308_CR2","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1145\/322344.322350","volume":"29","author":"J Beatty","year":"1982","unstructured":"Beatty, J.: On the relationship between the LL(1) and LR(1) grammars. JACM 29(4), 1007\u20131022 (1982)","journal-title":"JACM"},{"key":"308_CR3","doi-asserted-by":"crossref","unstructured":"Borsotti, A., Breveglieri, L., Crespi Reghizzi, S., Morzenti, A.: Complexity of extended vs classic LR parsers. In: Descriptional Complexity of Formal Systems (DCFS), LNCS, vol. 8614, pp. 77\u201389. Springer (2014)","DOI":"10.1007\/978-3-319-09704-6_8"},{"key":"308_CR4","doi-asserted-by":"crossref","unstructured":"Breveglieri, L., Crespi Reghizzi, S., Morzenti, A.: Shift-reduce parsers for transition networks. In: Language and Automata Theory and Applications (LATA), LNCS, vol. 8370, pp. 222\u2013235. Springer (2014)","DOI":"10.1007\/978-3-319-04921-2_18"},{"issue":"2","key":"308_CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0096-0551(81)90069-2","volume":"6","author":"A Celentano","year":"1981","unstructured":"Celentano, A.: LR parsing technique for extended context-free grammars. Comput. Lang. 6(2), 95\u2013107 (1981)","journal-title":"Comput. Lang."},{"key":"308_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF00289138","volume":"21","author":"N Chapman","year":"1984","unstructured":"Chapman, N.: LALR(1,1) parser generation for regular right part grammars. Acta Inform. 21, 29\u201345 (1984). https:\/\/doi.org\/10.1007\/BF00289138","journal-title":"Acta Inform."},{"issue":"7","key":"308_CR7","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/366663.366704","volume":"6","author":"M Conway","year":"1963","unstructured":"Conway, M.: Design of a separable transition-diagram compiler. Commun. ACM 6(7), 396\u2013408 (1963)","journal-title":"Commun. ACM"},{"key":"308_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5514-0","volume-title":"Formal Languages and Compilation","author":"S Crespi Reghizzi","year":"2013","unstructured":"Crespi Reghizzi, S., Breveglieri, L., Morzenti, A.: Formal Languages and Compilation, 2nd edn. Springer, London (2013)","edition":"2"},{"issue":"1","key":"308_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(77)90043-3","volume":"5","author":"J Engelfriet","year":"1977","unstructured":"Engelfriet, J.: Iterating iterated substitution. Theor. Comput. Sci. 5(1), 85\u2013100 (1977). https:\/\/doi.org\/10.1016\/0304-3975(77)90043-3","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"308_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0020-0190(94)00051-4","volume":"50","author":"J G\u00e1lvez","year":"1994","unstructured":"G\u00e1lvez, J.: A note on a proposed LALR parser for extended context-free grammars. Inf. Process. Lett. 50(6), 303\u2013305 (1994). https:\/\/doi.org\/10.1016\/0020-0190(94)00051-4","journal-title":"Inf. Process. Lett."},{"key":"308_CR11","volume-title":"Parsing Techniques: A Practical Guide","author":"D Grune","year":"2009","unstructured":"Grune, D., Jacobs, C.: Parsing Techniques: A Practical Guide, 2nd edn. Springer, London (2009)","edition":"2"},{"key":"308_CR12","unstructured":"Gruska, J.: On a classification of context-free languages. Kybernetika 3(1), 22\u201329 (1967). http:\/\/www.kybernetika.cz\/content\/1967\/1\/22"},{"key":"308_CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00264023","volume":"11","author":"S Heilbrunner","year":"1979","unstructured":"Heilbrunner, S.: On the definition of ELR(k) and ELL(k) grammars. Acta Inform. 11, 169\u2013176 (1979)","journal-title":"Acta Inform."},{"key":"308_CR14","doi-asserted-by":"publisher","unstructured":"Hemerik, K.: Towards a taxonomy for ECFG and RRPG parsing. In: Language and Automata Theory and Applications (LATA), LNCS, vol. 5457, pp. 410\u2013421. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-00982-2","DOI":"10.1007\/978-3-642-00982-2"},{"key":"308_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-06950-X","volume-title":"Pascal User Manual and Report. LNCS","author":"K Jensen","year":"1975","unstructured":"Jensen, K., Wirth, N.: Pascal User Manual and Report. LNCS, vol. 18, 2nd edn. Springer, Berlin (1975). https:\/\/doi.org\/10.1007\/3-540-06950-X","edition":"2"},{"key":"308_CR16","unstructured":"Kannapinn, S.: Reconstructing LR theory to eliminate redundance, with an application to the construction of ELR parsers. Ph.D. thesis, Technical University of Berlin (2001). (in German)"},{"key":"308_CR17","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","volume":"8","author":"D Knuth","year":"1965","unstructured":"Knuth, D.: On the translation of languages from left to right. Inform. Control 8, 607\u2013639 (1965)","journal-title":"Inform. Control"},{"key":"308_CR18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00289517","volume":"1","author":"D Knuth","year":"1971","unstructured":"Knuth, D.: Top-down syntax analysis. Acta Inform. 1, 79\u2013110 (1971)","journal-title":"Acta Inform."},{"key":"308_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF00264024","volume":"11","author":"W LaLonde","year":"1979","unstructured":"LaLonde, W.: Constructing LR parsers for regular right part grammars. Acta Inform. 11, 177\u2013193 (1979). https:\/\/doi.org\/10.1007\/BF00264024","journal-title":"Acta Inform."},{"issue":"2","key":"308_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(97)00152-X","volume":"64","author":"G Lee","year":"1997","unstructured":"Lee, G., Kim, D.: Characterization of extended LR(k) grammars. Inf. Process. Lett. 64(2), 75\u201382 (1997). https:\/\/doi.org\/10.1016\/S0020-0190(97)00152-X","journal-title":"Inf. Process. Lett."},{"key":"308_CR21","volume-title":"A Programming Methodology in Compiler Construction: Part I and II","author":"J Lewi","year":"1979","unstructured":"Lewi, J., De Vlaminck, K., Huens, J., Huybrechts, M.: A Programming Methodology in Compiler Construction: Part I and II. North-Holland, Amsterdam (1979)"},{"key":"308_CR22","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/PL00013318","volume":"37","author":"S Morimoto","year":"2001","unstructured":"Morimoto, S., Sassa, M.: Yet another generation of LALR parsers for regular right part grammars. Acta Inform. 37, 671\u2013697 (2001)","journal-title":"Acta Inform."},{"issue":"3","key":"308_CR23","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","volume":"17","author":"D Rosenkrantz","year":"1970","unstructured":"Rosenkrantz, D., Stearns, R.: Properties of deterministic top-down grammars. Inform. Control 17(3), 226\u2013256 (1970)","journal-title":"Inform. Control"},{"issue":"2","key":"308_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(87)90104-9","volume":"24","author":"M Sassa","year":"1987","unstructured":"Sassa, M., Nakata, I.: A simple realization of LR-parsers for regular right part grammars. Inf. Process. Lett. 24(2), 113\u2013120 (1987). https:\/\/doi.org\/10.1016\/0020-0190(87)90104-9","journal-title":"Inf. Process. Lett."},{"key":"308_CR25","volume-title":"Algorithms $$+$$ + Data Structures","author":"N Wirth","year":"1975","unstructured":"Wirth, N.: Algorithms $$+$$ + Data Structures $$=$$ = Programs. Prentice-Hall, Englewood Cliffs (1975)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-017-0308-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-017-0308-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-017-0308-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T16:03:35Z","timestamp":1570291415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-017-0308-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,4]]},"references-count":25,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["308"],"URL":"https:\/\/doi.org\/10.1007\/s00236-017-0308-3","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,4]]}}}