Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 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.
Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Miao Guo, Yong Tao Pei, et al.
WCITS 2011
Liya Fan, Fa Zhang, et al.
JPDC