A Practical Attribute Grammar Circularity Test


Matthew Belmonte

ABSTRACT

Efficient implementations for two optimisations to Knuth's attribute grammar circularity test are described. A new method for eliminating useless visits to productions is introduced. This improves upon a somewhat weaker mechanism introduced previously by Deransart et al. Data structures and algorithms for graph covering and elimination of redundant unions are discussed and proven correct.

CITED IN:

  1. Kuiper MF, Swierstra SD. Parallel attribute evaluation - structure of evaluators and detection of parallelism. In: Deransart P, Jourdan M (eds.), Attribute Grammars and their Applications (Lecture Notes in Computer Science 461), pp 61-75 (1990).

DOWNLOAD A REPRINT