Nicolae Dobra, Jakiw Pidstrigach, et al.
NeurIPS 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.
Nicolae Dobra, Jakiw Pidstrigach, et al.
NeurIPS 2025
Erik Altman, Jovan Blanusa, et al.
NeurIPS 2023
Paul G. Comba
Journal of the ACM
Giuseppe Romano, Aakrati Jain, et al.
ECTC 2025