Translating programming languages for intermediate codes

Daniel I. Hunyadi and Mircea A. Musan

Informatica Economica, 2007, vol. XI, issue 2, 117-121

Abstract: 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.

Keywords: compiler; lexical analysis; abstract syntax; intermediate representation; abstract machine language (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.revistaie.ase.ro/content/42/hunyadi.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:aes:infoec:v:xi:y:2007:i:2:p:117-121

Access Statistics for this article

Informatica Economica is currently edited by Ion Ivan

More articles in Informatica Economica from Academy of Economic Studies - Bucharest, Romania Contact information at EDIRC.
Bibliographic data for series maintained by Paul Pocatilu ().