Arnold.L. Rosenberg
Journal of the ACM
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.
Arnold.L. Rosenberg
Journal of the ACM
Yannis Belkhiter, Dhaval Salwala, et al.
NFV-SDN 2025
Danila Seliayeu, Quinn Pham, et al.
CASCON 2024
Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A