MIMOSA INTERMEDIATE CODE Mimosa Intermediate Code Russ Atkinson c Copyright 1987 Xerox Corporation. All rights reserved. Abstract: This document describes the Mimosa intermediate code, which is a machine-independent means of describing a program produced by the Mimosa compiler. Created by: Russ Atkinson Maintained by: Russ Keywords: Mimosa, Cedar, Mesa, intermediate code, Dragon XEROX Xerox Corporation Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, California 94304 Introduction Mimosa is the name of the retargetable Cedar compiler. A separate document describes the internals of Mimosa [MimosaInternalDoc.tioga]. Mimosa intermediate code Mimosa intermediate code takes the form of a graph. Except for label nodes, the graph is acyclic. Mimosa intermediate code is meant to be machine-independent, at least for conventional machines. Mimosa intermediate code is meant to serve for a variety of languages, although extensions are anticipated to handle a large range of languages. Mimosa intermediate code Mimosa intermediate code takes the form of a graph. Except for label nodes, the graph is acyclic. Mimosa intermediate code is meant to be machine-independent, at least for conventional machines. Mimosa intermediate code is meant to serve for a variety of languages, although extensions are anticipated to handle a large range of languages. N MimosaIntCodeDoc.tioga Russ Atkinson (RRA) May 4, 1987 4:24:01 pm PDT jNewlineDelimiter (cedardoc) styleMark LastEditedIcode LastEdited.J LastEditedIunleaded centerHeaderl L centerFooterItitleIauthors Iabstractmss89Ob O O!O /8OI boilerplate qo shead Iblock RbR`R RbR`Rv.