Project, Phase 4: Translation to PAL

Assigned: Wednesday, November 20, 2002
Due: Friday, December 13, 2002

Summary: In this stage of the project, you will translate your parse trees into a simple intermediate code, PAL.

Group Work:

• Group Zebra: Emily, Mark, Aaron, Daren
• Group Stripe: Jonathan, Yaw, Erik, Nathan, Adam

Core Assignment

Write a translator that traverses parse trees for a selected subset of Pascal programs and translates them to PAL. You should then print out the corresoponding PAL program (preferably to a file) and run it.

Your translator need only deal with integer and Boolean types (and you can treat Booleans as integers). You need to handle conditionals, assignment (with all types of expressions except record and arrays), procedure calls, function calls, while loops, repeat loops, and for loops.

You need not handle case statement, array indexing, records, labels and gotos, pointers, variable parameters, or nested function or procedure definitions.

You can assume that the program is type correct and that all variables are declared.

You can use my implementation of symbol tables, which is available in /home/rebelsky/Web/Courses/CS362/2002F/Examples/rebelsky/compiler/misc/SymbolTable.java.

You can find information on PAL in the lab on PAL.

Extra Credit

For extra credit, do more than the minimum.