Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 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.
Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing