Finding circular attributes in attribute grammars

Michael Rodeh, Mooly Sagiv

Research output: Contribution to journalArticlepeer-review


The problem of finding the circular attributes in an attribute grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially exponential. It is also shown that finding the circular attributes is harder than testing circularity.

Original languageEnglish
Pages (from-to)556-575
Number of pages20
JournalJournal of the ACM
Issue number4
StatePublished - 1999


  • Attribute grammar
  • Circularity problem
  • Computational complexity


Dive into the research topics of 'Finding circular attributes in attribute grammars'. Together they form a unique fingerprint.

Cite this