INFDok - Dokumentenvolltextserver des Fachbereichs Informatik

Kurzfassung auf Englisch:

Our intention is to describe a parallel algorithm (using two processors) for evaluating the attribute instances of an attributed derivation tree. In the first section, we present some basic notions (graphs, trees, context free and attribute grammars). The second section emphasizes two ways for representing the ordered oriented trees and the bidirectional traversal is also pointed out. In the third section, we present a new approach for evaluating the attribute instances of an attributed derivation tree. We have called this strategy the bidirectional attribute evaluation. In the last section, we formulate some conclusions and open problems.