×

zbMATH — the first resource for mathematics

Attribute grammars and recursive program schemes. I. II. (English) Zbl 0481.68068

MSC:
68Q45 Formal languages and automata
68Q60 Specification and verification (program logics, model checking, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Birkhoff, G.; Lipson, J., Heterogeneous algebras, J. combinatorial theory, 8, 115-133, (1970) · Zbl 0211.02003
[2] Chirica, L., Contributions to compiler correctness, ()
[3] Chirica, L.; Martin, D., An order-algebraic definition of Knuthian semantics, Math. systems theory, 13, 1-27, (1979) · Zbl 0397.68087
[4] Courcelle, B., An axiomatic approach to the korenjak-hopcroft algorithms, () · Zbl 0462.68008
[5] Courcelle, B.; Franchi-Zannettacci, P., On the equivalence problem for attribute systems, () · Zbl 0529.68005
[6] Damm, W., Higher type recursion and self-application as control structures, () · Zbl 0373.68021
[7] Duske, J., IO-macrolanguages and attributed translations, Information and control, 35, 87-105, (1977) · Zbl 0367.68059
[8] Engelfriet, J., Bottom-up and top-down tree transformations—a comparison, Math. systems theory, 9, 198-231, (1975) · Zbl 0335.68061
[9] Engelfriet, J., Some open questions and recent results on tree transducers and tree languages, (), 241-286
[10] Engelfriet, J.; Filé, G., The formal power of one-visit attribute grammars, () · Zbl 0471.68044
[11] Esik, Z., On functional tree-transducers, () · Zbl 0415.68045
[12] Fang, I., FOLDS, a declarative formal language definition system, (1972), Computer Science Department, Stanford University Palo Alto, California, STAN-CS-329
[13] Goguen, J., Initial algebra semantics and continuous algebras, J. ACM, 24, 68-95, (1977) · Zbl 0359.68018
[14] Harrison, M., On equivalence of grammars through transformation trees, Theoret. comput. sci., 9, 173-205, (1979) · Zbl 0409.68041
[15] Huet, G., Confluent reductions: abstract properties and applications to term rewriting systems, J. ACM, 27, 792-821, (1980) · Zbl 0458.68007
[16] Huet, G.; Levy, J.J., Call by need computations in non-ambiguous linear term rewriting systems, Laboria report 359, (1979)
[17] Jazaveri, M., The intrinsically exponential complexity of the circularity problem for attribute grammars, Comm. ACM, 18, 697-706, (1975) · Zbl 0318.68051
[18] Jones, N., Circularity testing of attribute grammars requires exponential time: a simpler proof, ()
[19] Kastens, U., Ordered attribute grammars, Acta informat., 13, 229-256, (1980) · Zbl 0404.68078
[20] Kennedy, K.; Warren, S.K., Automatic generation of efficient evaluators for attribute grammars, Atlanta, Georgia, Proc. 3rd ACM conference on principles of programming languages, 32-49, (1976)
[21] Knuth, D., Semantics of context-free languages, Math. systems theory, 2, 127-145, (1968) · Zbl 0169.01401
[22] Knuth, D., Semantics of context-free languages; correction, Math. systems theory, 5, 95-96, (1971) · Zbl 0219.68035
[23] Lorho, B., De la définition à la traduction des langages de programmation: méthode des attributs sémantiques, ()
[24] Lorho, B.; Pair, C., Algorithms for checking consistency of attribute grammars, (), 29-54
[25] Mayoh, B., Attribute grammars and mathematical semantics, () · Zbl 0462.68062
[26] Engelfriet, J.; Filé, G., Simple multi-visit attribute grammars, () · Zbl 0524.68048
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.