Bookmark

On exponential-time completeness of the circularity problem for attribute grammars

Wu, Pei-Chi
ACM Transactions on Programming Languages and Systems (TOPLAS) , Volume 26 (1) Association for Computing MachineryJan 1, 2004

Loading next page...

End of preview. The entire article is 5 pages. Rent for Free

 
/lp/association-for-computing-machinery/on-exponential-time-completeness-of-the-circularity-problem-for-zaaLMW5hKH
Title
On exponential-time completeness of the circularity problem for attribute grammars
Author(s)
Wu, Pei-Chi
Journal
ACM Transactions on Programming Languages and Systems (TOPLAS) , Volume 26 (1) Association for Computing Machinery – Jan 1, 2004
Publisher
Association for Computing Machinery
Copyright
Copyright © 2004 by ACM Inc.
ISSN
0164-0925
D.O.I.
10.1145/963778.963783
Publisher site
Get PDF