Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010
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.
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010
Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025
Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
Ran Iwamoto, Kyoko Ohara
ICLC 2023