Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
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. © 1999 ACM.
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Paul G. Comba
Journal of the ACM
Victor Akinwande, Megan Macgregor, et al.
IJCAI 2024
Zijian Ding, Michelle Brachman, et al.
C&C 2025