메뉴 건너뛰기
ACM Transactions on Programming Languages and Systems
Volumn 26, Issue 1, 2004, Pages 186-190
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Author keywords

Alternating Turing machines; Attribute grammars; Circularity problem; EXPTIME complete
Indexed keywords

ATTRIBUTE GRAMMARS (AG); SPECIFICATION ERRORS;
EID: 1242332609     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/963778.963783     Document Type: Article
Times cited : (2)
References (10)
  • 2
    • 0021521284 scopus 로고
    • Speeding up circularity tests for attribute grammars
    • DERANSART, P., JOURDAN, M., AND LORHO, B. 1984. Speeding up circularity tests for attribute grammars. Acta Information 21, 375-391.
    • (1984) Acta Information , vol.21 , pp. 375-391
    • Deransart, P.1    Jourdan, M.2    Lorho, B.3
  • 3
    • 0024303784 scopus 로고
    • A counterexample for 'A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars'
    • DILL, J. M. 1989, A counterexample for 'A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars.' J. ACM 36, 1 (Jan.), 92-96.
    • (1989) J. ACM , vol.36 , Issue.1 JAN. , pp. 92-96
    • Dill, J.M.1
  • 4
    • 84976773526 scopus 로고
    • Eli: A complete, flexible compiler construction system
    • GRAY, R. W., HEURING, V. P., LEVI, S. P., SLOANE, A. W., AND WAITE, W. M. 1992. Eli: A complete, flexible compiler construction system. Commun. ACM 35, 2 (Feb.), 121-131.
    • (1992) Commun. ACM , vol.35 , Issue.2 FEB. , pp. 121-131
    • Gray, R.W.1    Heuring, V.P.2    Levi, S.P.3    Sloane, A.W.4    Waite, W.M.5
  • 5
    • 0016657209 scopus 로고
    • The intrinsically exponential complexity of the circularity problem for attribute grammars
    • JAZAYERI, M., OGDEN, W. F., AND ROUNDS, W. C. 1975. The intrinsically exponential complexity of the circularity problem for attribute grammars. Commun. ACM 18, 12 (Dec.), 697-706.
    • (1975) Commun. ACM , vol.18 , Issue.12 DEC. , pp. 697-706
    • Jazayeri, M.1    Ogden, W.F.2    Rounds, W.C.3
  • 6
    • 0019623905 scopus 로고
    • A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars
    • JAZAYERI, M. 1981. A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars. J. ACM 28, 4 (Oct.), 715-720.
    • (1981) J. ACM , vol.28 , Issue.4 OCT. , pp. 715-720
    • Jazayeri, M.1
  • 7
    • 1242285879 scopus 로고
    • Circularity testing of attribute grammars requires exponential time: A simpler proof
    • Computer Science Department, Aarhus University, Aarhus, Denmark
    • JONES, N. D. 1980. Circularity testing of attribute grammars requires exponential time: A simpler proof. Tech. rep. DAIMI PB-107. Computer Science Department, Aarhus University, Aarhus, Denmark.
    • (1980) Tech. Rep. , vol.DAIMI PB-107
    • Jones, N.D.1
  • 8
    • 0001538613 scopus 로고
    • Semantics of context-free languages
    • Correction: KNUTH, D. E. 1971. Math. Syst. Theory 5, 1, 95-96
    • KNUTH, D. B. 1968. Semantics of context-free languages. Math. Syst. Theory 2, 2, 127-145. Correction: KNUTH, D. E. 1971. Math. Syst, Theory 5, 1, 95-96.
    • (1968) Math. Syst. Theory , vol.2 , Issue.2 , pp. 127-145
    • Knuth, D.B.1
  • 9
    • 0020141753 scopus 로고
    • Testing attribute grammars for circularity
    • RÄIHÄ, K.-J., AND SAARINEN, M. 1982. Testing attribute grammars for circularity. Acta Informatica 17, 185-192.
    • (1982) Acta Informatica , vol.17 , pp. 185-192
    • Räihä, K.-J.1    Saarinen, M.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.