论文信息 - Two-Level Graph Grammars

Two-Level Graph Grammars

Two-level graph grammars (2GG) combine the concepts of (one-level) graph grammars — as defined by PRATT — and of two-level (string) grammars — as introduced by v. WIJNGAARDEN for the formal definition of ALGOL 68. 2GG's settle both the inadequacies of one-level graph grammars and of two-level string grammars, the former resulting from the lack of parameters, the latter from the general lack of structure of string manipulation systems. As a field of application of 2GG's, the formal description of programming languages is focussed.

Wolfgang Hesse | W. Hesse

[1] B. J. Mailloux,et al. Report on the Algorithmic Language , 1971 .

[2] Terrence W. Pratt. A hierarchical graph model of the semantics of programs , 1969, AFIPS '69 (Spring).

[3] Friedrich L. Bauer,et al. Report on the algorithmic language ALGOL 60 , 1960, Commun. ACM.

[4] B. J. Mailloux,et al. Report on the Algorithmic Language ALGOL 68 , 1969 .

[5] Terrence W. Pratt,et al. Pair Grammars, Graph Languages and String-to-Graph Translations , 1971, J. Comput. Syst. Sci..

[6] Friedrich L. Bauer,et al. Revised report on the algorithm language ALGOL 60 , 1963, CACM.