Translating programming languages into executable codes

被引：0

作者：

Department of Informatics, University Lucian Blaga of Sibiu, 5-7 Dr. Ioan Ratiu Street, Sibiu, Romania ^{[1
]}

机构：

来源：

WSEAS Trans. Inf. Sci. Appl. | 2007年 / 1卷 / 145-152期

关键词：

Computational grammars - Data structures - Logic programming - Program compilers - Program translators;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Many of the important data structures used in a compiler are intermediate representations of the program being compiled. Often these representations take the form of trees, with several node types, each of which has different attributes. Tree representations can be described with grammars, just like programming languages. For each grammar rule, there is one constructor that belongs to the class for its left-hand-side symbol. I simply extend the abstract class with a concrete class for each grammar rule. Each grammar rule has right-hand-side components that must be represented in the data structures.

引用