Chapter PDF
References
H. Alblas; A characterization of attribute evaluation in passes; Memorandum 315, Twente University of Technology, 1980.
G.V. Bochmann; Semantic evaluation from left to tight; CACM 19 (1976), 55–62.
J. Engelfriet, G. Filè; Formal properties of one-visit and multi-pass attribute grammars; Proc. of the 7th ICALP at Noordwijkerhout, pp. 182–194, 1980.
J. Engelfriet, G. Filè; Simple multi-visit attribute grammars; Memorandum 314, Twente University of Technology, 1980.
J. Engelfriet, G. Filè; Passes and paths of attribute grammars; Memorandum 323, Twente University of Technology, 1980.
M. Jazayeri, W.F. Ogden, W.C. Rounds; The intrinsically exponential complexity of the circularity problem for attribute grammars; CACM 18 (1975), 697–706.
M. Jazayeri, K.G. Walter; Alternating semantic evaluator; Proc. ACM 1975 Ann. Conference, pp. 230–234.
U. Kastens; Ordered attributed grammars; Bericht Nr. 7/78, Universität Karlsruhe, 1978.
U. Kastens; Ordered attributed grammars; Acta Informatica 13 (1980), 229–256.
D.E. Knuth; Semantics of context-free languages; Math. Syst. Theory 2 (1968), 127–145. Correction: Math. Syst. Theory 5 (1971), 95–96.
K. Kennedy, S.K. Warren; Automatic generation of efficient evaluators for attribute grammars; Conf. Record of 3d Symp. on Principles of Programming Languages, pp. 32–49, 1976.
B.H. Mayoh; Attribute grammars and mathematical semantics; Report DAIMI PB-80, Aarhus University, 1978.
R. Parchmann; Grammatiken mit Attributenschema und zweistufige Auswertung attributierter Grammatiken; Bericht Nr. 46, Technische Hochschule Aachen, 1978.
H. Riis; Subclasses of attribute grammars; Report DAIMI PB-114, Aarhus University, 1980.
H. Riis, S. Skyum; k-Visit attribute grammars; Report DAIMI PB-121, Aarhus University, 1980.
K.-J. Räihä, E. Ukkonen; On the optimal assignment of attributes to passes in multi-pass attribute evaluators; Proc. of the 7th ICALP at Noordwijkerhout, pp. 500–511, 1980.
J.W. Thatcher; Tree automata: an informal survey; In "Currents in the Theory of Computing" (A.V. Aho, ed.), Prentice-Hall (1973).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J., Filè, G. (1981). Passes, sweeps and visits. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive