Advertisement

Erzeugung optimalen Codes für Series — Parallel Graphs

  • Reiner Güttler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 104)

Keywords

Phen 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturhinweise

  1. [A&J]
    A.V. Aho and S.C. Johnson “Optimal code generation for expression trees”, JACM 23, 3 (July 1976)CrossRefGoogle Scholar
  2. [A&J&U]
    A.V. Aho, S.C. Johnson and J.D. Ullman “Code generation for expressions with common subexpressions”, JACM 24, 1 (Jan. 1977)CrossRefGoogle Scholar
  3. [A&S]
    A.V. Aho and R. Sethi “How hard is compiler code generation”, Lecture Notes in Computer Science 52 (1977)Google Scholar
  4. [B&S]
    J. Bruno and R. Sethi “Code generation for a one-register machine”, JACM 23, 3 (July 1976)CrossRefGoogle Scholar
  5. [P&S]
    B. Prabhala and R. Sethi “Efficient computation of expressions with common subexpressions”, V. ACM Symp. on POPL (Jan. 1978)Google Scholar
  6. [S&U]
    R. Sethi and J.D. Ullman “The generation of optimal code for arithmetic expressions”, JACM 17, 4 (Oct. 1970)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Reiner Güttler
    • 1
  1. 1.Universität des SaarlandesGermany

Personalised recommendations