Speeding up circularity tests for attribute grammars
暂无分享,去创建一个
[1] Isu Fang,et al. FOLDS, a declarative formal language definition system , 1972 .
[2] Donald E. Knuth,et al. Semantics of context-free languages , 1968, Mathematical systems theory.
[3] Kari-Jouko Räihä,et al. Testing attribute grammars for circularity , 1982, Acta Informatica.
[4] Bruno Courcelle,et al. Attribute Grammars and Recursive Program Schemes I , 1982, Theoretical Computer Science.
[5] Martin Jourdan. Strongly non-circular attribute grammars and their recursive evaluation , 1984, SIGPLAN '84.
[6] Bruno Courcelle,et al. Attribute Grammars and Recursive Program Schemes II , 1982, Theor. Comput. Sci..
[7] Joost Engelfriet,et al. Attribute Grammars: Attribute Evaluation Methods , 1984, Method and tools for compiler construction.
[8] Donald E. Knuth. Semantics of context-free languages: Correction , 2005, Mathematical systems theory.
[9] Mehdi Jazayeri,et al. A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars , 1981, JACM.
[10] Ken Kennedy,et al. Automatic generation of efficient evaluators for attribute grammars , 1976, POPL.