Yannis Belkhiter, Dhaval Salwala, et al.
NFV-SDN 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.
Yannis Belkhiter, Dhaval Salwala, et al.
NFV-SDN 2025
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Giuseppe Romano, Aakrati Jain, et al.
ECTC 2025