Author:
Drewes Frank,Hoffmann Berthold,Minas Mark
Publisher
Springer International Publishing
Reference21 articles.
1. Aalbersberg, I., Ehrenfeucht, A., Rozenberg, G.: On the membership problem for regular DNLC grammars. Discrete Appl. Math. 13, 79–85 (1986)
2. 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 Linguistic. Long Papers, vol. 1, pp. 924–932 (2013)
3. Costagliola, G., De Lucia, A., Orefice, S., Tortora, G.: A parsing methodology for the implementation of visual systems. IEEE Trans. Softw. Eng. 23, 777–799 (1997)
4. DeRemer, F.L.: Simple LR(k) grammars. Commun. ACM 14(7), 453–460 (1971)
5. Drewes, F.: Recognising
$$k$$
-connected hypergraphs in cubic time. Theor. Comput. Sci. 109, 83–122 (1993)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power;Graph Transformation;2022
2. Uniform parsing for hyperedge replacement grammars;Journal of Computer and System Sciences;2021-06
3. Visual exploration of visual parser execution;Multimedia Tools and Applications;2021-03-18
4. ParVis;Proceedings of the International Conference on Advanced Visual Interfaces;2020-09-28
5. Run-time conflict detection in visual language parsing;Journal of Computer Languages;2020-04