On one code generation algorithm

MaRDI QIDQ2563372zbMATH OpenFDO

Authors T. I. Daniyarkhodzhaev, I. V. Mashechkin, G. V. Nishanov

Publication date 11 December 1996

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

code generationoptimal code

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Review text

This paper considers the generalization and extension of the \textit{A. V. Aho} and \textit{S. C. Johnson} [J. Assoc. Comput. Machin. 23, No. 3, 488-501 (1976; Zbl 0334.68022)] code generation algorithm. The practical implementation of the obtained results allows the user to do code generation automatically on different types of computers.

Recommendations

• scientific article; zbMATH DE number 3862412
• Towards an algebraic specification of code generation
• scientific article; zbMATH DE number 107856
• scientific article; zbMATH DE number 3926277

Cited in

(6)

• Integrating code generation and peephole optimization
• scientific article; zbMATH DE number 3862412 (Why is no real title available?)
• scientific article; zbMATH DE number 3926277 (Why is no real title available?)
• scientific article; zbMATH DE number 107856 (Why is no real title available?)
• scientific article; zbMATH DE number 2087556 (Why is no real title available?)
• An Algorithm for Optimal Procedural Nesting

This page was built for publication: On one code generation algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563372)