Computation sequences: A way to characterize classes of attribute grammars
Acta Informatica - Tập 19 - Trang 255-268
Tóm tắt
A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of wellknown subclasses of attribute grammars. Especially the absolutely noncircular attribute grammars are considered.
Tài liệu tham khảo
Aho, A.V., Ullman, J.D.: The Theory of Parsing. Translation and Compiling, Volume I: Parsing. Prentice-Hall 1972
Bochmann, G.V.: Semantic evaluation from left to right. CACM 19, 55–62 (1976)
Engelfriet, J, Filè, G.: Simple multi-visit attribute grammars. JCSS 24, 283–314 (1982)
Engelfriet, J., Filè, G.: Passes, sweeps and visits. In: Automata, Languages and Programming. Goos, G, Hartmanis, J. (eds.). Lecture Notes in Computer Science 115, 193–207. Berlin Heidelberg New York: 1981
Jazayeri, M., Walter, K.G.: Alternating semantic evaluator. Proc. ACM 1975 Annual Conf., 1975
Kastens, U.: Ordered attribute grammars. Acta Informat. 13, 229–256 (1980)
Kennedy, K., Warren, S.K.: Automatic generation of efficient evaluators for attribute grammars. Conf. Record of the Third ACM Symp. on Principles of Programming Languages pp. 32–49, 1976
Knuth, D.E.: Semantics of context free languages. Math. Syst. Theory 2, 127–145 (1968)
Knuth, D.E.: Semantics of context free languages: Correction. Math. Syst. Theory 5, 95–96 (1971)
Nielson, H.R.: Using Computation sequences to define evaluators for attribute grammars, DAIMI PB-139, Aarhus University, Denmark (1981)
Riis, H, Skyum, S.: k-visit grammars. Math. Syst. Theory 15, 17–28 (1981)