The problem of finding the circular attributes in an attribute grammar is c
onsidered. Two algorithms are proposed: the first is polynomial but yields
conservative results while the second is exact but is potentially exponenti
al. It is also shown that finding the circular attributes is harder than te
sting circularity.