Aditya Saxena, Shambhavi Shanker, et al.
AGU 2025
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.
Aditya Saxena, Shambhavi Shanker, et al.
AGU 2025
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
Paul G. Comba
Journal of the ACM