Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
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.
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023
Joxan Jaffar
Journal of the ACM