Semantic analysis in a concurrent compiler

  • Authors:
  • V. Seshadri;S. Weber;D. B. Wortman;C. P. Yu;I. Small

  • Affiliations:
  • Univ. of Toronto, Ontario, Canada;Univ. of Toronto, Ontario, Canada;Univ. of Toronto, Ontario, Canada;Univ. of Toronto, Ontario, Canada;Univ. of Toronto, Ontario, Canada

  • Venue:
  • PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traditional compilers are usually sequential programs that serially process source programs through lexical analysis, syntax analysis, semantic analysis and code generation. The availability of multiprocessor computers has made it feasible to consider alternatives to this serial compilation process. The authors are currently engaged in a project to devise ways of structuring compilers so that they can take advantage of modern multiprocessor hardware. This paper is about the most difficult aspect of concurrent compilation: concurrent semantic analysis.