Danila Seliayeu, Quinn Pham, et al.
CASCON 2024
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.
Danila Seliayeu, Quinn Pham, et al.
CASCON 2024
Ira Pohl
Artificial Intelligence
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022
Shyam Marjit, Harshit Singh, et al.
WACV 2025