• Corpus ID: 13623500

Destination-driven Code Generation Destination-driven Code Generation

@inproceedings{Dybvig1990DestinationdrivenCG,
  title={Destination-driven Code Generation Destination-driven Code Generation},
  author={R. Kent Dybvig and Robert Hieb and Tom Butler},
  year={1990}
}
Destination-driven code generation is a simple top-down technique that allows the code generated for a program phrase to depend upon its context in an abstract syntax tree. The context is encapsulated in a data destination and a control destination. The data destination speciies where the value computed by an expression is to be stored, while the control destination speciies where program execution is to resume after computation of the value. Together, the destinations allow a code generator to… 

References

SHOWING 1-10 OF 15 REFERENCES

A Machine Independent Algorithm for Code Generation and Its Use in Retargetable Compilers

This dissertation presents a method for the construction of efficient code generators for high-level procedural programming languages from a symbolic description of the instruction set of the target

Code generation using tree matching and dynamic programming

A tree-manipulation language called twig has been developed to help construct efficient code generators that combines a fast top-down tree-pattern matching algorithm with dynamic programming.

Affix grammar driven code generation

Affix grammars are used to describe the instruction set of a target architecture for purposes of compiler code generation and a compiler built on this model can automatically perform most popular machine-dependent optimizations, including peephole optimizations.

Retargetable Compiler Code Generation

A classlficaUon of automated retargetable code generation techniques and a survey of the work on these techmques is presented Retargetable code generation research.is classified into three

Rabbit: A Compiler for Scheme

A compiler for the lexically-scoped dialect of LISP known as SCHEME, which handles only a small basis set which reflects the semantics of lambda-calculus, and serves to produce code as good as that produced by more traditional compilers.

Optimal Code Generation for Expression Trees

A dynamic programming algorithm is presented which produces optimal code for any machine in this class of machines, which runs in time linearly proportional to the size of the input.

Revised3 report on the algorithmic language scheme

The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis

Compilers: Principles, Techniques, and Tools

  • A. AhoR. SethiJ. Ullman
  • Computer Science
    Addison-Wesley series in computer science / World student series edition
  • 1986
This book discusses the design of a Code Generator, the role of the Lexical Analyzer, and other topics related to code generation and optimization.

The C Programming Language

This ebook is the first authorized digital version of Kernighan and Ritchie's 1988 classic, The C Programming Language (2nd Ed.), and is a "must-have" reference for every serious programmer's digital library.

The Generation of Optimal Code for Arithmetic Expressions

It is shown that the algorithms presented here also minimize the number of storage references in the evaluation, and they are shown to take the shortest possible number of instructions.