CPSC 355 Chapter : Assignment5.wiz

• School: University of Calgary
• Department: Computer Science
• Course: CPSC 355
• Professor: Leonard Manzara

Document Summary

Part a: recursion, global variables and separate compilation. Arithmetic expressions can be translated into postfix form using recursion given the following rules: Translation is done by creating an individual conversion function for each of the syntactic constructs expression, term, and factor. As these syntactic constructs are defined recursively, their corresponding procedures are also structured recursively. Given the expressions: (note: the period terminates output) (a + c d the program should translate this input to a postfix output: Translate the functions find(), expression(), term(), and factor() into assembly language, and put these into a separate . m file. These functions will be called from the main() function given above, which will be in its own . c file. Your functions will call the library routines scanf(), exit(), and printf(). Input will be redirected from standard input; capture the program output using script. Your ta will give you input expressions to translate. Part b: external pointer arrays and command-line arguments.