ICS 142 Homework 5 Due 5/17

(30 points) Define a syntax-directed translation to build complete syntax trees for Tiny-Ada programs. You may use my definition of syntax trees in http://www.ics.uci.edu/~klefstad/s/142/src//hw5.
(30 points) Augment this program to generate postfix code for the assignment statements by a traversal of the syntax tree.

(40 points) Augment the program to generate three address code for each assignment statement by another traversal of the syntax tree. Reuse temporaries to use the minimal number.

DECLARE
  i : integer;
  m : integer;
BEGIN
  DECLARE
    j: integer;
    n: integer;
  BEGIN
    DECLARE
      b: boolean;
    BEGIN
      b := not (i+j < 10) and not (m*n < 5);
      put(b);
    END;
  END;
END;
-- Syntax trees are the obvious.
--
-- Postfix translation is:
-- b i j + 10 < not m n * 5 < not and assign
--
-- Three address translation is:
-- T1 := i + j
-- T1 := T1 < 10
-- T1 := not T1
-- T2 := m * n
-- T2 := T2 < 5
-- T2 := not T2
-- T1 := T1 and T2
-- b := T1

Submit the source to your program and a sample test run on one interestingly complex correct input program.