Formal properties of one-visit and multi-pass attribute grammars (extended abstract)

  • Joost Engelfriet
  • Gilberto Filè
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)


The purpose of this paper is to study the formal power of certain classes of attribute-grammars (AG). We first consider the class of 1S-AG and extend a result of [DPSS]. Then we compare the formal power of "one-visit" AG with that of related types of AG. Finally, using a partial characterization of the formal power of arbitrary AG we prove some results on deciding whether an AG is (left-to-right) multi-pass.

In Section 1 we give some necessary definitions about AG and related concepts. Section 2 consists of the study of 1S-AG. In Section 3 we extend some of the results of Section 2 to "one-visit" AG and we finally summarize the relations existing among all the classes of AG we considered. In Section 4 we show that the multi-pass problem for AG is complete in exponential time. No complete proofs are given, they can be found in [EF1] and [EF2].


Semantic Rule Semantic Domain Tree Language Oriented Cycle Tree Transducer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A]
    H. Alblas; The limitations of attribute-evaluation in passes, Memorandum, Twente University of Technology, 1979.Google Scholar
  2. [AU]
    A.V. Aho and J.D. Ullman: The theory of parsing, translation and compiling, Vols. 1 and 2; Prentice-Hall, Englewood Cliffs, N.J., 1972.Google Scholar
  3. [B]
    G.V. Bochmann; Semantic evaluation from left-to-right, Comm. of the ACM 19 (1976), 55–62.Google Scholar
  4. [DPSS]
    J. Duske, R. Parchmann, M. Sedello and J. Specht; IO-macro languages and attributed translations, Inf. and Control 35 (1977), 87–105.Google Scholar
  5. [EF1]
    J. Engelfriet and G. Filè; The formal power of one-visit attribute grammars; Memorandum 286, Twente University of Technology, 1979.Google Scholar
  6. [EF2]
    J. Engelfriet and G. Filè; work in progress.Google Scholar
  7. [ERS]
    J. Engelfriet, G. Rozenberg and G. Slutzki; Tree transducers, L systems and two-way machines; Memorandum 187, Twente University of Technology, 1977 (also in: Proc. 10-th Ann. ACM Symp. on Theory of Computing, San Diego, 1978), to appear in J. Comp. Syst. Sci.Google Scholar
  8. [ES]
    J. Engelfriet and E. Meineche Schmidt; IO and OI, J. Comp. System Sci. 15 (1977), 328–353, and J. Comp. System Sci. 16 (1978), 67–99.Google Scholar
  9. [Fi]
    M.J. Fischer; Grammars with macro-like productions, Ph. D.Thesis, Harvard University, 1968 (see also the 9-th Conference on Switching and Automata Theory, pp. 131–142).Google Scholar
  10. [JOR]
    M. Jazayeri, W.F. Ogden and W.C. Rounds; The intrinsically exponential complexity of the circularity problem for attribute grammars; Comm. of the ACM 18 (1975), 697–706.Google Scholar
  11. [Kn]
    D.E. Knuth; Semantics of context-free languages, Math. Syst. Theory 2 (1968), 127–145, Correction: Math. Syst. Theory 5 (1971), 95–96.Google Scholar
  12. [Kw]
    K. Kennedy and S.K. Warren; Automatic generation of efficient evaluators for attribute grammars, Conf. Record of the Third Symp. on Principles of Programming Languages, 1976, 32–49.Google Scholar
  13. [P]
    R. Parchmann; Grammatiken mit Attributschema und zweistufige Auswertung attributierter Grammatiken, Bericht nr. 46, Technische Hochschule Aachen, Informatik, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Joost Engelfriet
    • 1
  • Gilberto Filè
    • 1
  1. 1.Twente University of TechnologyEnschedeThe Netherlands

Personalised recommendations