Tree automata and attribute grammars

1. Bochman, G. V. (1976), Semantic evaluation from left to right. CACM 19, No. 2, 55–62.

   Google Scholar 

2. Courcelle, B. and Franchi-Zannettacci, P. (1982), Attribute grammars and recursive program schemes I. Theoretical Computer Science 17, 163–191.

   Google Scholar 

3. Engelfriet, J. (1975), Tree automata and tree grammars. Lecture Notes DAIMI FN-10, University of Aarhus, Denmark.

   Google Scholar 

4. Engelfriet, J. (1979), Some open questions and recent results on tree transducers and tree languages. In Proc. of the Symposium on Formal Language Theory, Santa Barbara, 241–286.

   Google Scholar 

5. Engelfriet, J. et. al., (1980), Tree transducers, L systems and two-way machines. JCSS 20, 150–202.

   Google Scholar 

6. Engelfriet, J. and Filé, G. (1981), Passes, sweeps and visits. Proc. of 8th ICALP, 193–207.

   Google Scholar 

7. Kamimura, T. and Slutzki, G. (1981), Parallel and two-way automata on directed ordered acyclic graphs. Information and Control 49, 10–51.

   Google Scholar 

8. Kennedy, K. and Warren, S. K. (1976), Automatic generation of efficient evaluators for attribute grammars. Proc. of 3rd POPL, 32–49.

   Google Scholar 

9. Knuth, D. E. (1968), Semantics of context-free languages. Mathematical Systems Theory 2, 127–145.

   Google Scholar 

10. Lewis, P. M., Rosenkrantz, D. J. and Stearns, R. E. (1974), Attribute translations. JCSS 9, 4, 279–307.

    Google Scholar 

11. Thatcher, J. W. (1973), Tree automata: informal survey in Currents in the Theory of Computing, (A. V. Aho, Ed.). Prentice-Hall, Engelwood Cliffs, NJ, 143–172.

    Google Scholar 

Download references