COMBINATIONAL THEORY OF COMPILERS
Tao Zhang · Chinese Journal of Computers · 1980
In this paper a combinational theory of compilers is described and a formal deductive system is given. We have obtained two basic theorems. One is an algorithm which can combine all new compilers as some compilers are given. The other is also an algorithm which can combine those compilers which are just expected when some compilers are given. Finally, concepts such as ordinary compiling, self-compiling, bootstrap structure, macro structure and hierarchical structure are discussed with the formal deductive system given in this paper.