book chapter · 2009

Intermediate Representation

Cited by 1Abstract and details only

Abstract

This chapter details the intermediate representation (IR) and related concepts. The IR encapsulates both the statements and the control-flow contained by a program. The chapter provides an overview of the reference-counting mechanism used by Sh and explains the way basic blocks are stored. Basic blocks are represented in Sh by the ShBasicBlock class. Most Sh operations are arithmetic or logic in nature. Sh programs can include more than just basic blocks: they can contain arbitrary data-dependent control flow. Many types in Sh are actually reference-counted. This means that for each object declared of such a type, a count is kept of how many pointer variables refer to it.

Cite this paper

APA 7

McCool, M., & Du Toit, S. (2009). Intermediate Representation. https://doi.org/10.1201/9781568816692-14

MLA 9

McCool, Michael, and Stefanus Du Toit. “Intermediate Representation.” 2009, pp. 229–40, https://doi.org/10.1201/9781568816692-14.

Chicago

McCool, Michael, and Stefanus Du Toit. 2009. “Intermediate Representation.” https://doi.org/10.1201/9781568816692-14.

Harvard

McCool, M. and Du Toit, S. (2009) ‘Intermediate Representation’. Available at: https://doi.org/10.1201/9781568816692-14.

BibTeX

@incollection{mccool2009intermediate,
  title = {{Intermediate Representation}},
  author = {McCool, Michael and Du Toit, Stefanus},
  pages = {229--240},
  year = {2009},
  doi = {10.1201/9781568816692-14}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.