Algorithm for writing efficient recursive functions in assembly languages

  • Authors:
  • Salam N. Salloum

  • Affiliations:
  • California State Polytechnic University Pomona, Pomona, CA

  • Venue:
  • Journal of Computing Sciences in Colleges
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Assembly programming is required for some embedded software products and is an important component in teaching computer organization and architecture, compiler design, and programming languages. In this paper, an algorithm for writing efficient recursive functions in the MIPS assembly programming is presented. The proposed algorithm generates assembly programs with a reduced number of stack operations compared with the known algorithm. The algorithm can be easily modified for other assembly languages. Also, the proposed algorithm is suitable for students with no background in compiler techniques and code optimization.