Jazayeri [J. ACM 28, 4 (Oct. 198 l), 7 15-7201 proposes a simpler construction for use in the proof by Jazayeri et al. [Commun. ACM 18, 12 (Dec. 1975), 697-7061 that the circularity problem for attribute grammars has inherent exponential time complexity. The simplification introduces a flaw that invalidates the proof. The flaw can be corrected, at the cost of eliminating some of the simplification claimed for the new construction.

ABSTRAC T Structured design and programmin g techniques can be extended from high-leve l languages to assembly language . Over th e past three years at Brown University , beginning assembly language programmer s have been successfully taught these techniques using clearly defined standards . These standards and the solutions t o several of the typical problems that aris e in structured assembly language programming are discussed in this paper . INTRODUCTIO N