{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T10:08:26Z","timestamp":1764842906528,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031661587"},{"type":"electronic","value":"9783031661594"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-66159-4_8","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"98-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Cyclic Operator Precedence Grammars for\u00a0Improved Parallel Parsing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7742-9233","authenticated-orcid":false,"given":"Michele","family":"Chiari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0945-5947","authenticated-orcid":false,"given":"Dino","family":"Mandrioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3039-1084","authenticated-orcid":false,"given":"Matteo","family":"Pradella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009). https:\/\/doi.org\/10.1145\/1516512.1516518","DOI":"10.1145\/1516512.1516518"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Autebert, J., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Handbook of Formal Languages, no. 1, pp. 111\u2013174 (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_3","DOI":"10.1007\/978-3-642-59136-5_3"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.scico.2015.09.002","volume":"112","author":"Barenghi, A., Crespi Reghizzi, S., Mandrioli, D., Panella, F., Pradella, M.","year":"2015","unstructured":"Barenghi, A., Crespi Reghizzi, S., Mandrioli, D., Panella, F., Pradella, M.: Parallel parsing made practical. Sci. Comput. Program. 112(3), 195\u2013226 (2015). https:\/\/doi.org\/10.1016\/j.scico.2015.09.002","journal-title":"Sci. Comput. Program."},{"issue":"7","key":"8_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.ipl.2013.01.008","volume":"113","author":"A Barenghi","year":"2013","unstructured":"Barenghi, A., Crespi Reghizzi, S., Mandrioli, D., Pradella, M.: Parallel parsing of operator precedence grammars. Inf. Process. Lett. 113(7), 245\u2013249 (2013). https:\/\/doi.org\/10.1016\/j.ipl.2013.01.008","journal-title":"Inf. Process. Lett."},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Chiari, M., Mandrioli, D., Pontiggia, F., Pradella, M.: A model checker for operator precedence languages. ACM Trans. Program. Lang. Syst. 45(3), 19:1\u201319:66 (2023). https:\/\/doi.org\/10.1145\/3608443","DOI":"10.1145\/3608443"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chiari, M., Mandrioli, D., Pradella, M.: Cyclic operator precedence grammars for parallel parsing. CoRR arxiv:2309.04200 (2023)","DOI":"10.1007\/978-3-031-66159-4_8"},{"issue":"6","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1016\/j.jcss.2011.12.006","volume":"78","author":"S Crespi Reghizzi","year":"2012","unstructured":"Crespi Reghizzi, S., Mandrioli, D.: Operator precedence and the visibly pushdown property. J. Comput. Syst. Sci. 78(6), 1837\u20131867 (2012). https:\/\/doi.org\/10.1016\/j.jcss.2011.12.006","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0019-9958(78)90474-6","volume":"37","author":"S Crespi Reghizzi","year":"1978","unstructured":"Crespi Reghizzi, S., Mandrioli, D., Martin, D.F.: Algebraic properties of operator precedence languages. Inf. Control 37(2), 115\u2013133 (1978)","journal-title":"Inf. Control"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Crespi Reghizzi, S., Pradella, M.: Beyond operator-precedence grammars and languages. J. Comput. Syst. Sci. 113, 18\u201341 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2020.04.006","DOI":"10.1016\/j.jcss.2020.04.006"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1145\/321172.321179","volume":"10","author":"RW Floyd","year":"1963","unstructured":"Floyd, R.W.: Syntactic analysis and operator precedence. J. ACM 10(3), 316\u2013333 (1963)","journal-title":"J. ACM"},{"key":"8_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68954-8","volume-title":"Parsing Techniques: A Practical Guide","author":"D Grune","year":"2008","unstructured":"Grune, D., Jacobs, C.J.: Parsing Techniques: A Practical Guide. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-68954-8"},{"key":"8_CR12","volume-title":"Introduction to Formal Language Theory","author":"MA Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison Wesley, Boston (1978)"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A., Kebis, P., Mazzocchi, N., Sara\u00e7, N.E.: Regular methods for operator precedence languages. In: Etessami, K., Feige, U., Puppis, G. (eds.) 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, Paderborn, Germany, 10\u201314 July 2023. LIPIcs, vol.\u00a0261, pp. 129:1\u2013129:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2023.129","DOI":"10.4230\/LIPIcs.ICALP.2023.129"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Li, L., Taura, K.: Associative operator precedence parsing: a method to increase data parsing parallelism. In: Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region, HPC Asia 2023, Singapore, 27 February\u20132 March 2023, pp. 75\u201387. ACM (2023).https:\/\/doi.org\/10.1145\/3578178.3578233","DOI":"10.1145\/3578178.3578233"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1137\/140978818","volume":"44","author":"Lonati, V., Mandrioli, D., Panella, F., Pradella, M.","year":"2015","unstructured":"Lonati, V., Mandrioli, D., Panella, F., Pradella, M.: Operator precedence languages: their automata-theoretic and logic characterization. SIAM J. Comput. 44(4), 1026\u20131088 (2015). https:\/\/doi.org\/10.1137\/140978818","journal-title":"SIAM J. Comput."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cosrev.2017.12.001","volume":"27","author":"D Mandrioli","year":"2018","unstructured":"Mandrioli, D., Pradella, M.: Generalizing input-driven languages: theoretical and practical benefits. Comput. Sci. Rev. 27, 61\u201387 (2018). https:\/\/doi.org\/10.1016\/j.cosrev.2017.12.001","journal-title":"Comput. Sci. Rev."},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Mandrioli, D., Pradella, M., Crespi Reghizzi, S.: Aperiodicity, star-freeness, and first-order definability of structured context-free languages. Logical Methods Comput. Sci. 19 (2023).https:\/\/doi.org\/10.46298\/lmcs-19(4:12)2023","DOI":"10.46298\/lmcs-19(4:12)2023"},{"key":"8_CR18","volume-title":"Counter-Free Automata","author":"R McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"8_CR19","volume-title":"Formal Languages","author":"AK Salomaa","year":"1973","unstructured":"Salomaa, A.K.: Formal Languages. Academic Press, New York (1973)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66159-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T08:03:06Z","timestamp":1729324986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}