{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:05:41Z","timestamp":1726409141713},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319097039"},{"type":"electronic","value":"9783319097046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09704-6_8","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T09:43:21Z","timestamp":1405071801000},"page":"77-89","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Extended vs. Classic LR Parsers"],"prefix":"10.1007","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","reference":[{"key":"8_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, Englewood Cliffs (2006)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-04921-2_18","volume-title":"Language and Automata Theory and Applications","author":"L. Breveglieri","year":"2014","unstructured":"Breveglieri, L., Crespi Reghizzi, S., Morzenti, A.: Shift-reduce parsers for transition networks. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol.\u00a08370, pp. 222\u2013235. Springer, Heidelberg (2014)"},{"issue":"7","key":"8_CR3","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/366663.366704","volume":"6","author":"M.E. Conway","year":"1963","unstructured":"Conway, M.E.: Design of a separable transition-diagram compiler. Comm. ACM\u00a06(7), 396\u2013408 (1963)","journal-title":"Comm. ACM"},{"key":"8_CR4","doi-asserted-by":"publisher","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"},{"key":"8_CR5","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":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-00982-2_35","volume-title":"Language and Automata Theory and Applications","author":"K. Hemerik","year":"2009","unstructured":"Hemerik, K.: Towards a taxonomy for ECFG and RRPG parsing. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 410\u2013421. Springer, Heidelberg (2009)"},{"key":"8_CR7","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. Information and Control\u00a08, 607\u2013639 (1965)","journal-title":"Information and Control"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF00290336","volume":"7","author":"D. Pager","year":"1977","unstructured":"Pager, D.: A practical general method for constructing LR(k) parsers. Acta Inf.\u00a07, 249\u2013268 (1977)","journal-title":"Acta Inf."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09704-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T09:02:43Z","timestamp":1558947763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09704-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319097039","9783319097046"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09704-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}