Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
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.
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Ira Pohl
Artificial Intelligence
P.C. Yue, C.K. Wong
Journal of the ACM
Zhikun Yuen, Paula Branco, et al.
DSAA 2023