A WORST-CASE OF CIRCULARITY TEST ALGORITHMS FOR ATTRIBUTE GRAMMARS
檔案
- A1995RE61200004.pdf (228.7 KB, Adobe PDF)
日期
1995-03-01
類型
期刊名稱
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
卷期與頁次
第 17 卷第 2 期,頁 228–232
ISSN
0164-0925
語言
英文
摘要
Although the circularity test problem for attribute grammars (AGs) has been proven to be intrinsically exponential, to date, a worst case for the existing circularity test algorithms has yet to be presented. This note presents a worst-case AG in which the number of incomparable dependency graphs induced at the root is exponential. The worst case can help to clarify the complexity of the problem.
所屬典藏
期刊論文引用此條目
WU, P., & WANG, F. (1995). A WORST-CASE OF CIRCULARITY TEST ALGORITHMS FOR ATTRIBUTE GRAMMARS. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 17(2), 228–232. https://doi.org/10.1145/201059.201064
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/2038