Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Chebotar, K.S.: Some modifications of Knuth's algorithm for verifying cyclicity of attribute grammars. Programming and Computer Software
7, (1981), pp. 58–61.
2. Deransart, P., Jourdan, M. and Lorho, B.: Speeding up circularity tests for attribute grammars. Acta Informatica
21 (1984), pp. 375–391.
3. Deransart, P., Jourdan, M. and Lorho, B.: Attribute grammars, Definitions, Systems and Bibliography. Lecture Notes in Computer Science 323, Springer (1988).
4. Engelfriet, J. and Filè, G.: The formal power of one-visit attribute grammars. Acta Informatica
16 (1981), pp. 275–302.
5. Jazayeri, M.: A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars. Journ. ACM
28, (1981), pp. 715–720.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献