{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:00Z","timestamp":1759639080969,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031074684"},{"type":"electronic","value":"9783031074691"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07469-1_10","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T14:20:31Z","timestamp":1653661231000},"page":"128-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Syntax Checking Either Way"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9564-2625","authenticated-orcid":false,"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0216-8803","authenticated-orcid":false,"given":"Uwe","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-59136-5_3","volume-title":"Handbook of Formal Languages","author":"J-M Autebert","year":"1997","unstructured":"Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 111\u2013174. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_3"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Geller, M.M., Hunt III, H.B., Szymanski, T.G., Ullman, J.D.: Economy of description by parsers, DPDA\u2019s, and PDA\u2019s. Theor. Comput. Sci. 4, 143\u2013153 (1977)","DOI":"10.1016\/0304-3975(77)90033-0"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","volume":"9","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Greibach, S.A.: Deterministic context-free languages. Inform. Control 9, 620\u2013648 (1966)","journal-title":"Control"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/0304034","volume":"4","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Finite-turn pushdown automata. SIAM J. Contr. 4, 429\u2013453 (1966)","journal-title":"SIAM J. Contr."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.jcss.2005.04.001","volume":"71","author":"J Goldstine","year":"2005","unstructured":"Goldstine, J., Leung, H., Wotschke, D.: Measuring nondeterminism in pushdown automata. J. Comput. Syst. Sci. 71, 440\u2013466 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0304-3975(82)90110-4","volume":"18","author":"J Goldstine","year":"1982","unstructured":"Goldstine, J., Price, J.K., Wotschke, D.: A pushdown automaton or a context-free grammar - which is more economical? Theor. Comput. Sci. 18, 33\u201340 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1145\/321356.321365","volume":"13","author":"SA Greibach","year":"1966","unstructured":"Greibach, S.A.: The unsolvability of the recognition of linear context-free languages. J. ACM 13, 582\u2013587 (1966)","journal-title":"J. ACM"},{"key":"10_CR8","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":"10_CR9","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Context-free languages and Turing machine computations. In: Proceedings Symposia in Applied Mathematics, vol. 19, pp. 42\u201351 (1967)","DOI":"10.1090\/psapm\/019\/0235938"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-57163-9_25","volume-title":"Fundamentals of Computation Theory","author":"M Holzer","year":"1993","unstructured":"Holzer, M., Lange, K.-J.: On the complexities of linear LL(1) and LR(1) grammars. In: \u00c9sik, Z. (ed.) FCT 1993. LNCS, vol. 710, pp. 299\u2013308. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57163-9_25"},{"key":"10_CR11","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","volume":"8","author":"DE Knuth","year":"1965","unstructured":"Knuth, D.E.: On the translation of languages from left to right. Inform. Control 8, 607\u2013639 (1965)","journal-title":"Inform. Control"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF00289517","volume":"1","author":"DE Knuth","year":"1971","unstructured":"Knuth, D.E.: Top-down syntax analysis. Acta Inform. 1, 79\u2013110 (1971)","journal-title":"Acta Inform."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2007.01.015","volume":"376","author":"M Kutrib","year":"2007","unstructured":"Kutrib, M., Malcher, A.: Context-dependent nondeterminism for pushdown automata. Theor. Comput. Sci. 376, 101\u2013111 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(98)00199-6","volume":"242","author":"H Leung","year":"2000","unstructured":"Leung, H., Wotschke, D.: On the size of parsers and LR($$k$$)-grammars. Theor. Comput. Sci. 242, 59\u201369 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0022-0000(83)90010-7","volume":"26","author":"E Ukkonen","year":"1983","unstructured":"Ukkonen, E.: Lower bounds on the size of deterministic parsers. J. Comput. Syst. Sci. 26, 153\u2013170 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0019-9958(76)90173-X","volume":"32","author":"LG Valiant","year":"1976","unstructured":"Valiant, L.G.: A note on the succinctness of descriptions of deterministic languages. Inform. Control 32, 139\u2013145 (1976)","journal-title":"Inform. Control"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07469-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T23:06:26Z","timestamp":1655766386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07469-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031074684","9783031074691"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07469-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2022.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}