a two-pass assembler for an abstract stack machine

Your first assignment is to use ad-hoc methods (partially described in the assignment document) to write a two-pass assembler for an abstract stack machine.
Attached also are four files:

  • a source file, lab1.asm, and
  • a binary file, lab1.bin, which is the output of the assembler when given the previous source.
  • a screen grab of a hexdump of the output file
  • a very much simplified version of the assembler written in Java.  It also lacks the symbol table and symbol table entry class definitions.

If you were to print the opcode and operand portion of each instruction, one per line, it would look like:
2       0
24      13
3       1
2       2
1       2
2       3
9       0
2       4
2       5
8       0
10      0
7       0
5       0
22      0
2       1
26      0
0       0

find the cost of your paper