ICS 142 Homework 4 Due 5/10

(50 points) Construct symbol tables for Tiny-Ada programs this time assign and store variable offsets. Assume program offsets start at zero. Booleans take one byte. Integers take four bytes and must start on an even address. Also change the representation of the symbol table to a hash table of linked-lists (as discussed in lecture).
(30 points) When possible, overlay the storage of declare blocks appearing in the same scope to achieve activation records of minimal size.

(20 points) Whenever you leave a declare block, print out the defined identifiers with their types and their offsets. Print out the size of the activation record required for the program. Here is a sample program.

DECLARE
  i : integer; -- offset is 0
  m : boolean; -- offset is 4
BEGIN
  DECLARE
    i: boolean; -- offset is 5
    k: boolean; -- offset is 6
  BEGIN
    i := true;
    DECLARE
      q: integer; -- offset is 8
      j: boolean; -- offset is 12
      m: integer; -- offset is 14
    BEGIN
      j := i and k;
      put(j);
    END;
  END;
  i := 2;
  DECLARE
    i: integer; -- offset is 6
    q: boolean; -- offset is 10
    p: boolean; -- offset is 11
  BEGIN
    i := 3;
    put(i);
  END;
END;
-- 18 bytes is the minimal storage required for this activation record

Submit your program source and a sample run on an interesting test program.