Attribute grammars and recursive program schemes II

Abstract

We show that an attribute system can be translated (in a certain way) into a recursive program scheme if and only if it is strongly noncircular. This property introduced by Kennedy and Warren [20] is decidable in polynomial time. We obtain an algorithm to decide the equivalence problem for purely synthesized attribute systems. This is the second part of a work which has been divided for editorial reasons. Sections 1,2,3,4 can be found in the first part. The numbering of theorems, propositions, etc.... indicates the section: Theorem 3.16 can be found in Section 3.