BEG: a generator for efficient back ends

  • Authors:
  • H. Emmelmann;F.-W. Schröer;Rudolf Landwehr

  • Affiliations:
  • GMD Forschungsstelle an der Universitát Karlsruhe, Haid-und-Neu-Str. 7, D-7500 Karlsruhe 1, Germany;GMD Forschungsstelle an der Universitát Karlsruhe, Haid-und-Neu-Str. 7, D-7500 Karlsruhe 1, Germany;GMD Forschungsstelle an der Universitát Karlsruhe, Haid-und-Neu-Str. 7, D-7500 Karlsruhe 1, Germany

  • Venue:
  • PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a system that generates compiler back ends from a strictly declarative specification of the code generation process. The generated back ends use tree pattern matching for code selection. Two methods for register allocation supporting a wide range of target architectures are provided. A general bottom-up pattern matching method avoids problems that occurred with previous systems using LR-parsing. The performance of compilers using generated back ends is comparable to very fast production compilers. Some figures are given about the results of using the system to generate the back end of a Modula-2 compiler.