Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
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.
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Yannis Belkhiter, Dhaval Salwala, et al.
NFV-SDN 2025
Zhikun Yuen, Paula Branco, et al.
DSAA 2023
S. Winograd
Journal of the ACM