C.A. Micchelli, W.L. Miranker
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.
C.A. Micchelli, W.L. Miranker
Journal of the ACM
Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021
Bing Zhang, Mikio Takeuchi, et al.
NAACL 2025
A. Manzalini, R. Minerva, et al.
ICIN 2013