{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T09:20:21Z","timestamp":1769505621607,"version":"3.49.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030513719","type":"print"},{"value":"9783030513726","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-51372-6_13","type":"book-chapter","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:15:38Z","timestamp":1593044138000},"page":"221-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Graph Parsing as Graph Transformation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7349-7693","authenticated-orcid":false,"given":"Frank","family":"Drewes","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5608-996X","authenticated-orcid":false,"given":"Berthold","family":"Hoffmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8968-9013","authenticated-orcid":false,"given":"Mark","family":"Minas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(86)90070-3","volume":"13","author":"I Aalbersberg","year":"1986","unstructured":"Aalbersberg, I., Ehrenfeucht, A., Rozenberg, G.: On the membership problem for regular DNLC grammars. Discrete Appl. Math. 13, 79\u201385 (1986)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"13_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00236-015-0223-4","volume":"52","author":"F Drewes","year":"2015","unstructured":"Drewes, F., Hoffmann, B.: Contextual hyperedge replacement. Acta Informatica 52(6), 497\u2013524 (2015). https:\/\/doi.org\/10.1007\/s00236-015-0223-4","journal-title":"Acta Informatica"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-34176-2_16","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"F Drewes","year":"2012","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Contextual hyperedge replacement. In: Sch\u00fcrr, A., Varr\u00f3, D., Varr\u00f3, G. (eds.) AGTIVE 2011. LNCS, vol. 7233, pp. 182\u2013197. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34176-2_16"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-21145-9_2","volume-title":"Graph Transformation","author":"F Drewes","year":"2015","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Predictive top-down parsing for hyperedge replacement grammars. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 19\u201334. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21145-9_2"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-23611-3_4","volume-title":"Graph Transformation","author":"F Drewes","year":"2019","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars. In: Guerra, E., Orejas, F. (eds.) ICGT 2019. LNCS, vol. 11629, pp. 55\u201372. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23611-3_4"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.jlamp.2018.12.006","volume":"104","author":"F Drewes","year":"2019","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement. J. Locical Algebraic Methods Programm. (JLAMP) 104, 303\u2013341 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2018.12.006","journal-title":"J. Locical Algebraic Methods Programm. (JLAMP)"},{"key":"13_CR7","series-title":"Monographs in Theoretical Computer Science.","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/3-540-31188-2_15","volume-title":"In: Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Implementation of typed attributed graph transformation by AGG. In: Fundamentals of Algebraic Graph Transformation. An EATCS Series, pp. 305\u2013323. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2_15"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013875","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"A Habel","year":"1992","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0013875"},{"issue":"5","key":"13_CR9","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1017\/S0960129501003425","volume":"11","author":"A Habel","year":"2001","unstructured":"Habel, A., M\u00fcller, J., Plump, D.: Double-pushout graph transformation revisited. Math. Struct. Comput. Sci. 11(5), 633\u2013688 (2001)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), 245\u2013296 (2009)","journal-title":"Math. Struct. Comput. Sci."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(81)90067-0","volume":"15","author":"S Heilbrunner","year":"1981","unstructured":"Heilbrunner, S.: A parsing automata approach to LR theory. Theor. Comput. Sci. 15, 117\u2013157 (1981). https:\/\/doi.org\/10.1016\/0304-3975(81)90067-0","journal-title":"Theor. Comput. Sci."},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BFb0000105","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"B Hoffmann","year":"1983","unstructured":"Hoffmann, B.: Modelling compiler generation by graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds.) Graph Grammars 1982. LNCS, vol. 153, pp. 159\u2013171. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/BFb0000105"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-030-13435-8_17","volume-title":"Language and Automata Theory and Applications","author":"B Hoffmann","year":"2019","unstructured":"Hoffmann, B., Minas, M.: Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars. In: Mart\u00edn-Vide, C., Okhotin, A., Shapira, D. (eds.) LATA 2019. LNCS, vol. 11417, pp. 233\u2013245. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-13435-8_17"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0166-218X(87)90051-5","volume":"16","author":"KJ Lange","year":"1987","unstructured":"Lange, K.J., Welzl, E.: String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing. Discrete Appl. Math. 16, 17\u201330 (1987)","journal-title":"Discrete Appl. Math."},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Sippu, S., Soisalon-Soininen, E.: Parsing Theroy I: Languages and Parsing. EATCS Monographs in Theoretical Computer Science, vol. 15. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/978-3-642-61345-6","DOI":"10.1007\/978-3-642-61345-6"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51372-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:55:27Z","timestamp":1710233727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51372-6_13"}},"subtitle":["Correctness of Predictive Top-Down Parsers"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030513719","9783030513726"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51372-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bergen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/av5.ljnet.it\/icgt2020\/","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":"40","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":"0","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":"40% - 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":"5","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)"}},{"value":"4 tool presentations were also accepted and included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}