Program this C$++$ assignment, it focuses on reading and parsing the SIC$/$XE object code and printing out the details of each instruction in the text records of the object code in the order of how they appear in the object code. Each instruction has its opcode $($mnemonic$),$ operand$/$s$,$ and addressing mode$/$s$.$ The composition of the object code structure includes the header record, the text records where each text record contains a series of instructions, modification records $($if there are any$),$ and the end record. In this assignment, you would ONLY need to focus on the text records.

Input and Output Files

Input File:

Object Code file: test.obj

This file name would be passed as a command line argument to your project.

Output File:

Object code structure in text form: obj$\_$struct.txt$.$

Note:

Your program should produce the output file with the exact name obj$\_$struct.txt to work.

The obj$\_$struct.txt file should follow exactly what appears in the sample example$\_$obj$\_$struct.txt using the exact format.

The output file will have the following $5$ columns in that order: Instruction, Format, Operand Addressing Type, Target Address Addressing Mode, and Object Code.

Instruction $$ print the mnemonic $($big case$)$ of the instruction: LDA, ADD, $...$

Format $$ print the format number: $2,3,$ or $4.$ Do NOT need to consider format $1$ in this assignment.

Operand Addressing Type $$ print the addressing mode for computing the operand: simple, immediate, indirect

Target Address Addressing Mode $$ print the addressing mode for computing the target address: pc$,$ base, or absolute $($equivalent to direct$)$

If indexed addressing mode is used, then print pc$\_$indexed, base$\_$indexed, or direct$\_$indexed.

Object Code $$ print Object code for each instruction

The output file should print the first line with the column header acronyms $($exactly as below$)$:

INSTR FORMAT OAT TAAM OBJ

There need to be some spaces separating columns in the obj$\_$struct.txt$.$ The number of spaces for the separation is flexible. It is recommended to set the columns with a consistent width of $16$ characters so the output format looks consistent with autograder output.

Some columns might be blank, such as format $2$ addressing modes, if that is the case, leave the addressing mode columns blank. $($It would be good to still add spaces to keep columns lined up for easier reading.$)$

Required Features

Your program MUST support format $2,3,4$ instructions and does NOT need to support format $1$ instructions.

Your program shall support the parsing of all $59$ instructions $($except format $1$ instructions$)$ and their corresponding mnemonics in the SIC$/$XE architecture, for example, the mapping between the following two arrays. Note: you do NOT have to use the following data structures in your assignment implementation.

const static string ops$[]=\{$

$"18","58","90","40","$B$4","28",$

$"88","$A$0","24","64","9$C$","$C$4",$

$"$C$0","$F$4","3$C$","30","34","38",$

$"48","00","68","50","70","08",$

$"6$C$","74","04","$D$0","20","60",$

$"98","$C$8","44","$D$8","$AC$","4$C$",$

$"$A$4","$A$8","$F$0","$EC$","0$C$","78",$

$"54","80","$D$4","14","7$C$","$E$8",$

$"84","10","1$C$","5$C$","94","$B$0",$

$"$E$0","$F$8","2$C$","$B$8","$DC$"$

$\}$;

const static string mnemonics$[]=\{$

"ADD", "ADDF", "ADDR", "AND", "CLEAR", "COMP",

"COMPF", "COMPR", "DIV", "DIVF", "DIVR", "FIX",

"FLOAT", "HIO", $"$J$",$ "JEQ", $"$JGT$","$JLT$",$

"JSUB", "LDA", $"$LDB$","$LDCH$","$LDF$","$LDL$",$

$"$LDS$","$LDT$","$LDX$","$LPS$",$ "MUL", "MULF",

"MULR", "NORM", $"$OR$","$RD$",$ "RMO", "RSUB",

"SHIFTL", "SHIFTR", "SIO", $"$SSK$",$ "STA", $"$STB$",$

$"$STCH$","$STF$",$ "STI", $"$STL$","$STS$","$STSW$",$

$"$STT$","$STX$",$ "SUB", "SUBF", "SUBR", $"$SVC$",$

$"$TD$",$ "TIO", "TIX", "TIXR", $"$WD$"$

$\}$;

const static bool format$2[]=\{$

false,false,true,false,true,false,

false,true,false,false,true,false,

false,false,false,false,false,false,

false,false,false,false,false,false,

false,false,false,false,false,false,

true,false,false,false,true,false,

true,true,false,false,false,false,

false,false,false,false,false,false,

false,false,false,false,true,true,

false,false,false,true,false

$\}$;