{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:55:19Z","timestamp":1743155719956,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031428326"},{"type":"electronic","value":"9783031428333"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-42833-3_8","type":"book-chapter","created":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T12:02:09Z","timestamp":1697544129000},"page":"325-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tunnel Parsing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0681-6871","authenticated-orcid":false,"given":"Nikolay","family":"Handzhiyski","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3393-1058","authenticated-orcid":false,"given":"Elena","family":"Somova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,18]]},"reference":[{"key":"8_CR1","unstructured":"Abstract syntax tree metamodel. https:\/\/www.omg.org\/spec\/ASTM\/. Accessed 30 Nov 2019"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Johnson, S.C.: LR parsing. ACM Comput. Surv. 6, 26 (1974)","DOI":"10.1145\/356628.356629"},{"key":"8_CR3","unstructured":"Aho, A.V.: Compilers: principles, techniques, & tools. Pearson\/Addison Wesley (2007)"},{"key":"8_CR4","unstructured":"Another tool for language recognition (antlr). https:\/\/www.antlr.org\/. Accessed 12 Apr 2020"},{"key":"8_CR5","unstructured":"Augmented BNF for syntax specifications: ABNF. https:\/\/tools.ietf.org\/html\/rfc5234. Accessed 30 Nov 2019"},{"key":"8_CR6","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events (1962)"},{"key":"8_CR7","unstructured":"Case-sensitive string support in ABNF. https:\/\/tools.ietf.org\/html\/rfc7405. Accessed 30 Nov 2019"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Chomsky, N.: On certain formal properties of grammars. Inf. Control 2, 137\u2013167 (1959)","DOI":"10.1016\/S0019-9958(59)90362-6"},{"key":"8_CR9","unstructured":"Copeland, T.: Generating Parsers with JavaCC: an easy-to-use guide tor developers. Centennial Books, 2nd ed. (2007)"},{"key":"8_CR10","unstructured":"Extensible markup language (xml). https:\/\/www.w3.org\/TR\/xml\/. Accessed 01 Sept 2019"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Ford, B.: Parsing expression grammars: a recognition-based syntactic foundation. SIGPLAN Not. (2004)","DOI":"10.1145\/964001.964011"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Frost, R.A., Hafiz, R.: A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time. SIGPLAN Not. (2006)","DOI":"10.1145\/1149982.1149988"},{"key":"8_CR13","unstructured":"Grune, D., Jacobs, C.J.H.: Parsing techniques: a practical guide. Ellis Horwood (1990)"},{"key":"8_CR14","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley Publishing Company (1979)"},{"key":"8_CR15","unstructured":"Java Compiler Compiler (JavaCC). https:\/\/javacc.org\/. Accessed 12 Apr 2020"},{"key":"8_CR16","unstructured":"Microsoft windows API: profileapi.h header. https:\/\/docs.microsoft.com\/en-us\/windows\/win32\/api\/profileapi\/. Accessed 05 Sept 2020"},{"key":"8_CR17","unstructured":"Moore, R.C.: Removing left recursion from context-free grammars. In: Proceedings of the 1st North American Chapter of the Association for Computational Linguistics Conference (2000)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop. 3, 114\u2013125 (1959)","DOI":"10.1147\/rd.32.0114"},{"key":"8_CR19","unstructured":"Parr, T.: Language implementation patterns: create your own domain-specific and general programming languages (pragmatic programmers). Pragmatic Bookshelf (2010)"},{"key":"8_CR20","unstructured":"Saraiva, J.: HaLeX: a Haskell library to model, manipulate and animate regular languages. In: Proceedings of the ACM Workshop on Functional and Declarative Programming in Education, University of Kiel Technical Report 0210 (2002)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Scott, E., Johnstone, A.: GLL parsing. Electron. Notes Theoret. Comput. Sci. 253, 177\u2013189 (2010)","DOI":"10.1016\/j.entcs.2010.08.041"},{"key":"8_CR22","unstructured":"Sipser, M.: Introduction to the theory of computation. Course Technology, 2nd ed. (2006)"},{"key":"8_CR23","unstructured":"The javascript object notation (json) data interchange format. https:\/\/tools.ietf.org\/html\/rfc8259. Accessed 01 Sept 2019"},{"key":"8_CR24","unstructured":"Tunnel grammar studio. https:\/\/www.experasoft.com\/products\/tgs\/. Accessed 14 Apr 2020"},{"key":"8_CR25","unstructured":"Uniform resource identifier (uri): Generic syntax. https:\/\/tools.ietf.org\/html\/rfc3986. Accessed 01 Sept 2019"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Zhu, Z., Zhang, Y., Ko, H.-S., Martins, P., Saraiva, J., Hu, Z.: Parsing and reflective printing, bidirectionally. In Proceedings of the 2016 ACM SIGPLAN International Conference on Software Language Engineering. ACM (2016)","DOI":"10.1145\/2997364.2997369"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Zhu, Z., Ko, H.-S., Zhang, Y., Martins, P., Saraiva, J., Hu, Z.: Unifying parsing and reflective printing for fully disambiguated grammars. New Generation Computing (2020)","DOI":"10.1007\/s00354-019-00082-y"}],"container-title":["Lecture Notes in Computer Science","Composability, Comprehensibility and Correctness of Working Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42833-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T12:03:40Z","timestamp":1697544220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42833-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031428326","9783031428333"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42833-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CEFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Central European Functional Programming School","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Budapest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cefp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/people.inf.elte.hu\/cefp\/index.html","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":"13","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":"7","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":"4","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":"54% - 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":"2","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":"1","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)"}}]}}