6372번 - Microprocessor Simulation 다국어

Consider a small microprocessor that has the following properties:

• Each word is four bits.
• Addresses are two words. The high word always comes first. That is, the high word of a two-word address will always occupy the lower word of memory.
• Memory is 256 words.
• There are two accumulators, A and B, each storing one word.
• There are nine instruction codes. Each instruction requires at least one word to store the code that specifies the instruction. Four instructions have arguments and require an additional two words.

Each 4 bit number can have the values from 0 to 15, inclusive, in base 10. We will write these using hexadecimal in the usual way, i.e. A means 10, B means 11, etc.

These are the nine instructions:

The microprocessor always begins by executing the command at location 00. It executes the commands in sequence until it reaches the Stop command.

The examples below show partial programs and describe their affect.

The input will consist of several lines of exactly 256 hex characters. Each line is the contents of memory, beginning with address 00 and ending with address FF. The end of the input is indicated by a memory state that has a stop instruction (an “8”) at address 00. The input programs will never “fall of the end of memory”, that is, you will never execute an instruction that is located between addresses F0 and FF, inclusive.

For each memory state, you should simulate execution beginning with address 00. When the stop instruction is reached, you will dump the contents of memory to the output as a single string of 256 hex characters followed by a newline character.