{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:39:18Z","timestamp":1743010758055,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480564"},{"type":"electronic","value":"9783662480571"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48057-1_12","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T01:29:54Z","timestamp":1439170194000},"page":"154-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Locally Chain-Parsable Languages"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Crespi Reghizzi","sequence":"first","affiliation":[]},{"given":"Violetta","family":"Lonati","sequence":"additional","affiliation":[]},{"given":"Dino","family":"Mandrioli","sequence":"additional","affiliation":[]},{"given":"Matteo","family":"Pradella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 1\u201343 (2009)","journal-title":"J. ACM"},{"key":"12_CR2","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. IPL 113, 245\u2013249 (2013)","journal-title":"IPL"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Barenghi, A., Crespi Reghizzi, S., Mandrioli, D., Pradella, M.: Parallel parsing made practical. SCP (2015). under revision","DOI":"10.1016\/j.scico.2015.09.002"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/S0304-3975(02)00070-1","volume":"290","author":"M Beaudry","year":"2003","unstructured":"Beaudry, M., Holzer, M., Niemann, G., Otto, F.: McNaughton families of languages. TCS 290(3), 1581\u20131628 (2003)","journal-title":"TCS"},{"issue":"3","key":"12_CR5","first-page":"332","volume":"31","author":"L Boasson","year":"1985","unstructured":"Boasson, L., S\u00e9nizergues, G.: NTS languages are deterministic and congruential. J. CSS 31(3), 332\u2013342 (1985)","journal-title":"J. CSS"},{"issue":"6","key":"12_CR6","first-page":"1837","volume":"78","author":"S Crespi Reghizzi","year":"2012","unstructured":"Crespi Reghizzi, S., Mandrioli, D.: Operator precedence and the visibly pushdown property. J. CSS 78(6), 1837\u20131867 (2012)","journal-title":"J. CSS"},{"issue":"3","key":"12_CR7","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":"12_CR8","volume-title":"Introduction to Formal Language Theory","author":"MA Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison Wesley, New York (1978)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Lonati, V., Mandrioli, D., Panella, F., Pradella, M.: Operator precedence languages: Their automata-theoretic and logic characterization. SICOMP (2015). to appear","DOI":"10.1137\/140978818"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/42282.42284","volume":"35","author":"R McNaughton","year":"1988","unstructured":"McNaughton, R., Narendran, P., Otto, F.: Church-rosser thue systems and formal languages. J. ACM 35(2), 324\u2013344 (1988)","journal-title":"J. ACM"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"K Mehlhorn","year":"1980","unstructured":"Mehlhorn, K.: Pebbling mountain ranges and its application of DCFL-recognition. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85. Springer, Heidelberg (1980)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48057-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:40:15Z","timestamp":1674567615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48057-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480564","9783662480571"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48057-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}