{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:02:01Z","timestamp":1762459321081,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319211442"},{"type":"electronic","value":"9783319211459"}],"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-319-21145-9_2","type":"book-chapter","created":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T10:55:04Z","timestamp":1437044104000},"page":"19-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Predictive Top-Down Parsing for Hyperedge Replacement Grammars"],"prefix":"10.1007","author":[{"given":"Frank","family":"Drewes","sequence":"first","affiliation":[]},{"given":"Berthold","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Minas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,17]]},"reference":[{"key":"2_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."},{"unstructured":"Chiang, D., Andreas, J., Bauer, D., Hermann, K. M., Jones, B., Knight, K.: Parsing graphs with hyperedge replacement grammars. In: Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, Sofia, Bulgaria. Long Papers, vol. 1, pp. 924\u2013932, August 2013","key":"2_CR2"},{"issue":"12","key":"2_CR3","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/32.637392","volume":"23","author":"G Costagliola","year":"1997","unstructured":"Costagliola, G., De Lucia, A., Orefice, S., Tortora, G.: A parsing methodology for the implementation of visual systems. IEEE Trans. Softw. Eng. 23(12), 777\u2013799 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(93)90065-2","volume":"109","author":"F Drewes","year":"1993","unstructured":"Drewes, F.: Recognising $$k$$-connected hypergraphs in cubic time. Theor. Comput. Sci. 109, 83\u2013122 (1993)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Drewes, F., Hoffmann, B.: Contextual hyperedge replacement. Acta Informatica, 31 (2015, accepted for publication). doi:10.1007\/s00236-015-0223-4","key":"2_CR5","DOI":"10.1007\/s00236-015-0223-4"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00289155","volume":"10","author":"R Franck","year":"1978","unstructured":"Franck, R.: A class of linearly parsable graph grammars. Acta Informatica 10(2), 175\u2013201 (1978)","journal-title":"Acta Informatica"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1049\/iet-sen.2010.0081","volume":"5","author":"L F\u00fcrst","year":"2011","unstructured":"F\u00fcrst, L., Mernik, M., Mahni\u010d, V.: Improving the graph grammar parser of Rekers and Sch\u00fcrr. IET Softw. 5(2), 246\u2013261 (2011)","journal-title":"IET Softw."},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Hyperedge Replacement: Grammars and Languages","year":"1992","unstructured":"Habel, A. (ed.): Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992)"},{"unstructured":"Hoffmann, B., Minas, M.: Defining models - meta models versus graph grammars. In: Proceedings of the 6th Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010), Electronic Communications of the EASST, 29, Paphos, Cyprus (2010)","key":"2_CR9"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-18771-5_62","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"M Kaul","year":"1986","unstructured":"Kaul, M.: Practical applications of precedence graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.) Graph-Grammars and Their Application to Computer Science. LNCS, vol. 291, pp. 326\u2013342. Springer, Heidelberg (1986)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00289017","volume":"27","author":"C Lautemann","year":"1990","unstructured":"Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Informatica 27, 399\u2013421 (1990)","journal-title":"Acta Informatica"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/321466.321477","volume":"15","author":"PM Lewis II","year":"1968","unstructured":"Lewis II, P.M., Stearns, R.E.: Syntax-directed transduction. JACM 15(3), 465\u2013488 (1968)","journal-title":"JACM"},{"key":"2_CR13","series-title":"Informatik-Fachberichte","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-642-67838-7_29","volume-title":"GI - 10. Jahrestagung: Saarbr\u00fccken, 30. September - 2. Oktober 1980","author":"HJ Ludwigs","year":"1980","unstructured":"Ludwigs, H.J.: A LR-like analyzer algorithm for graphs. In: Wilhelm, R. (ed.) GI - 10. Jahrestagung: Saarbr\u00fccken, 30. September - 2. Oktober 1980. Informatik-Fachberichte, vol. 33, pp. 321\u2013335. Springer, Heidelberg (1980)"},{"doi-asserted-by":"crossref","unstructured":"Minas, M.: Diagram editing with hypergraph parser support. In: Proceedings of 1997 IEEE Symposium on Visual Languages (VL 1997), Capri, Italy, pp. 226\u2013233 (1997)","key":"2_CR14","DOI":"10.1109\/VL.1997.626587"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. JACM 13(4), 570\u2013581 (1966)","journal-title":"JACM"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jvlc.1996.0027","volume":"8","author":"J Rekers","year":"1997","unstructured":"Rekers, J., Sch\u00fcrr, A.: Defining and parsing visual languages with layered graph grammars. J. Vis. Lang. Comput. 8(1), 27\u201355 (1997)","journal-title":"J. Vis. Lang. Comput."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/BFb0017421","volume-title":"Graph Grammars and Their Application to Computer Science","author":"W Vogler","year":"1991","unstructured":"Vogler, W.: Recognizing edge replacement graph languages in cubic time. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars and Their Application to Computer Science. LNCS, vol. 532, pp. 676\u2013687. Springer, Heidelberg (1991)"}],"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-319-21145-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T08:26:42Z","timestamp":1748507202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21145-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319211442","9783319211459"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21145-9_2","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":"17 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}