Vicki L Hanson, Edward H Lichtenstein
Cognitive Psychology
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.
Vicki L Hanson, Edward H Lichtenstein
Cognitive Psychology
Erik Altman, Jovan Blanusa, et al.
NeurIPS 2023
Arnold.L. Rosenberg
Journal of the ACM
R. Sebastian, M. Weise, et al.
ECPPM 2022