Posted: August 1st, 2022

The P-Machine Assignments

The P-machine:

In this assignment, you will implement a virtual machine (VM) known as the P-machine (PM/0). The P-machine is a stack machine with two memory stores: the “stack,” which is organized as a stack and contains the data to be used by the PM/0 CPU, and the “text”, which contains the instructions for the VM. The PM/0 CPU has four registers to handle the stack and text segments: The registers are named base pointer (BP), stack pointer (SP), program counter (PC) and instruction register (IR). They will be explained in detail later on in this document. The machine also has a register file (RF) with eight (8) registers (0-7).

Which Citation Styles Can You Handle?

We get a lot of “Can you do MLA or APA?”—and yes, we can! Our writers ace every style—APA, MLA, Turabian, you name it. Tell us your preference, and we’ll format it flawlessly.

The Instruction Set Architecture (ISA) of the PM/0 has 24 instructions and the instruction format is as follows: “OP R L M”

Each instruction contains four components (OP R L M) that are separated by one space.

OP is the operation code.
R refers to a register
L indicates the lexicographical level or a register in arithmetic and relational instructions.
M depending of the operators it indicates:
- A number (instructions: LIT, INC).
- A program address (instructions: JMP, JPC, CAL).
- A data address (instructions: LOD, STO)
- A register in arithmetic and logic instructions.
(e.g. ADD R[1], R[2], R[3] )

The list of instructions for the ISA can be found in Appendix A and B.

Are Writing Services Legal?

Totally! They’re a legit resource for sample papers to guide your work. Use them to learn structure, boost skills, and ace your grades—ethical and within the rules.

P-Machine Cycles
The PM/0 instruction cycle is carried out in two steps. This means that it executes two steps for each instruction. The first step is the Fetch Cycle, where the actual instruction is fetched from the “text” memory store and place in the instruction register. The second step is the Execute Cycle, where the instruction that was fetched is executed using the “stack” memory store and the register file (RF). This does not mean the instruction is stored in the “stack.”

Fetch Cycle:
In the Fetch Cycle, an instruction is fetched from the “text” store and placed in the IR register (IR  code[PC]). Afterwards, the program counter is incremented by 1 to point to the next instruction to be executed (PC PC + 1).

Execute Cycle:
In the Execute Cycle, the instruction that was fetched is executed by the VM. The OP component that is stored in the IR register (IR.OP) indicates the operation to be executed. For example, if IR.OP is the instruction ADD (IR.OP = 12), then R, L, M components of the instruction in IR (IR.R, IR.L, IR.M) are used as registers numbers to execute the instruction ADD (IR.R  IR.L + IR.M)

What’s the Price for a Paper?

Starts at $10/page for undergrad, up to $21 for pro-level. Deadlines (3 hours to 14 days) and add-ons like VIP support adjust the cost. Discounts kick in at $500+—save more with big orders!

PM/0 Initial/Default Values:
Initial values for PM/0 CPU registers:
SP = 0; BP = 1; PC = 0; IR = 0;

Initial “stack” store values are all zero:
stack[1] =0, stack[2] =0, stack[3] =0…..stack[39] = 0.

All registers in the register file have initial value zero (R0 = 0, R1= 0, R3 = 0….R7 = 0.
Constant Values:
MAX_STACK_HEIGHT is 40
MAX_CODE_LENGTH is 200
MAX_LEXI_LEVELS is 3

Assignment Instructions and Guidelines:
1. The VM must be written in C and must run on Eustis.
2. Submit to Webcourses:
a) A readme document indicating how to compile and run the VM.

Is My Privacy Protected?

100%! We encrypt everything—your details stay secret. Papers are custom, original, and yours alone, so no one will ever know you used us.

b) The source code of your PM/0 VM.

c) The output of a test program running in the virtual machine. Please provide a copy of the initial state of the stack and the state of stack after the execution of each instruction. Please see the example in Appendix C.

Appendix A

Instruction Set Architecture (ISA)

Is AI Involved in Writing?

Nope—all human, all the time. Our writers are pros with real degrees, crafting unique papers with expertise AI can’t replicate, checked for originality.

There are 13 arithmetic/logical operations that manipulate the data within the register file. These operations will be explain after the 11 basic instructions of PM/0.

ISA:
01 – LIT R, 0, M Loads a constant value (literal) M into Register R

02 – RTN 0, 0, 0 Returns from a subroutine and restore the caller environment
03 – LOD R, L, M Load value into a selected register from the stack location at offset M from L lexicographical levels down

04 – STO R, L, M Store value from a selected register in the stack location at offset M from L lexicographical levels down

Why Are You the Best for Research?

Our writers are degree-holding pros who tackle any topic with skill. We ensure quality with top tools and offer revisions—perfect papers, even under pressure.

05 – CAL 0, L, M Call procedure at code index M (generates new
Activation Record and pc  M)

06 – INC 0, 0, M Allocate M locals (increment sp by M). First four are Functional Value, Static Link (SL), Dynamic Link (DL), and Return Address (RA)

07 – JMP 0, 0, M Jump to instruction M

08 – JPC R, 0, M Jump to instruction M if R = 0

Who Writes My Assignments?

Experts with degrees—many rocking Master’s or higher—who’ve crushed our rigorous tests in their fields and academic writing. They’re student-savvy pros, ready to nail your essay with precision, blending teamwork with you to match your vision perfectly. Whether it’s a tricky topic or a tight deadline, they’ve got the skills to make it shine.

09 – SIO R, 0, 1 Write a register to the screen

10 – SIO R, 0, 2 Read in input from the user and store it in a register

11 – SIO 0, 0, 3 End of program (program stops running)

Appendix B

Will My Paper Be Unique?

Guaranteed—100%! We write every piece from scratch—no AI, no copying—just fresh, well-researched work with proper citations, crafted by real experts. You can grab a plagiarism report to see it’s 95%+ original, giving you total peace of mind it’s one-of-a-kind and ready to impress.

ISA Pseudo Code

01 – LIT R, 0, M R[i]  M;

02 – RTN 0, 0, 0 sp  bp - 1;
bp  stack[sp + 3];
pc  stack[sp + 4];

03 – LOD R, L, M R[i]  stack[ base(L, bp) + M];

Can You Use Any Citation Format?

Yep—APA, Chicago, Harvard, MLA, Turabian, you name it! Our writers customize every detail to fit your assignment’s needs, ensuring it meets academic standards down to the last footnote or bibliography entry. They’re pros at making your paper look sharp and compliant, no matter the style guide.

04 – STO R, L, M stack[ base(L, bp) + M]  R[i];

05 - CAL 0, L, M stack[sp + 1]  0; /* space to return value
stack[sp + 2]  base(L, bp); /* static link (SL)
stack[sp + 3]  bp; /* dynamic link (DL)
stack[sp + 4]  pc; /* return address (RA)
bp  sp + 1;
pc  M;

06 – INC 0, 0, M sp  sp + M;

07 – JMP 0, 0, M pc  M;

Can I Change My Order Details?

For sure—you’re not locked in! Chat with your writer anytime through our handy system to update instructions, tweak the focus, or toss in new specifics, and they’ll adjust on the fly, even if they’re mid-draft. It’s all about keeping your paper exactly how you want it, hassle-free.

08 – JPC R, 0, M if R[i] == 0 then { pc  M; }

09 – SIO R, 0, 1 print(R[i]);

10 – SIO R, 0, 2 read(R[i]);
11 – SIO R, 0, 3 Set Halt flag to one; (End of program)

12 - NEG (R[i]  -R[i])
13 - ADD (R[i]  R[j] + R[k])
14 - SUB (R[i]  R[j] - R[k])
15 - MUL (R[i]  R[j] * R[k])
16 - DIV (R[i]  R[j] / R[k])
17 - ODD (R[i]  R[i] mod 2) or ord(odd(R[i]))
18 - MOD (R[i]  R[j] mod R[k])
19 - EQL (R[i]  R[j] = = R[k])
20 - NEQ (R[i]  R[j] != R[k])
21 - LSS (R[i]  R[j] < R[k])
22 - LEQ (R[i]  R[j] <= R[k])
23 - GTR (R[i]  R[j] > R[k])
24 - GEQ (R[i]  R[j] >= R[k])

How Do I Order a Paper?

It’s a breeze—submit your order online with a few clicks, then track progress with drafts as your writer brings it to life. Once it’s ready, download it from your account, review it, and release payment only when you’re totally satisfied—easy, affordable help whenever you need it. Plus, you can reach out to support 24/7 if you’ve got questions along the way!

NOTE: The result of a logical operation such as (A > B) is defined as 1 if
the condition was met and 0 otherwise.

NOTE: in all arithmetic or relational instructions, “i” refers to operand R, “j” refers to operand L, and “k” refers to operand M. For example, if we have the instruction ADD 7 8 9 (12 7 8 9), we have to interpret this as:
R[7]  R[8] + R[9]

Another example: if we have instruction LIT 5 0 9 (1 5 0 9), we have to interpret this as:
R[5]  9
Appendix C
Example of Execution

This example shows how to print the stack after the execution of each instruction. The following PL/0 program, once compiled, will be translated into a sequence code for the virtual machine PM/0 as shown below in the INPUT FILE.

How Quick Can You Write?

Need it fast? We can whip up a top-quality paper in 24 hours—fully researched and polished, no corners cut. Just pick your deadline when you order, and we’ll hustle to make it happen, even for those nail-biting, last-minute turnarounds you didn’t see coming.

const n = 8;
int i,h;
procedure sub;
const k = 7;
int j,h;
begin
j:=n;
i:=1;
h:=k;
end;
begin
i:=3; h:=9;
call sub;
end.

INPUT FILE
For every line, there must be 4 integers representing OP, R, L and M.

7 0 0 10
7 0 0 2
6 0 0 6 we recommend using the following structure for your instructions:
1 0 0 8
4 0 0 4 struct {
1 0 0 1 int op; /* opcode
4 0 1 4 int l; /* R
1 0 0 7 int m; /* L
4 0 0 5 int m; /* M
2 0 0 0 }instruction;
6 0 0 6
1 0 0 3
4 0 0 4
1 0 0 9
4 0 0 5
5 0 0 2
11 0 0 3

OUTPUT FILE
1) Print out the program in interpreted assembly language with line numbers:

Line OP R L M
0 jmp 0 0 10
1 jmp 0 0 2
2 inc 0 0 6
3 lit 0 0 8
4 sto 0 0 4
5 lit 0 0 1
6 sto 0 1 4
7 lit 0 0 7
8 sto 0 0 5
9 rtn 0 0 0
10 inc 0 0 6
11 lit 0 0 3
12 sto 0 0 4
13 lit 0 0 9
14 sto 0 0 5
15 cal 0 0 2
16 sio 0 0 3

Can You Handle Tough Topics?

Absolutely—bring it on! Our writers, many with advanced degrees like Master’s or PhDs, thrive on challenges and dive deep into any subject, from obscure history to cutting-edge science. They’ll craft a standout paper with thorough research and clear writing, tailored to wow your professor.

2) Print out the execution of the program in the virtual machine, showing the stack and registers pc, bp, and sp:
pc bp sp registers
Initial values 0 1 0 0 0 0 0 0 0 0 0
Stack: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

pc bp sp registers
0 jmp 0 0 10 10 0 0 0 0 0 0 0 0 0 0
Stack

10 inc 0 0 6 11 1 6 0 0 0 0 0 0 0 0
Stack: 0 0 0 0 0 0

11 lit 0 0 3 12 1 6 3 0 0 0 0 0 0 0
Stack: 0 0 0 0 0 0

12 sto 0 0 4 13 1 6 3 0 0 0 0 0 0 0
Stack: 0 0 0 0 3 0

How Do You Match Professor Expectations?

We follow your rubric to a T—structure, evidence, tone. Editors refine it, ensuring it’s polished and ready to impress your prof.

13 lit 0 0 9 14 1 6 9 0 0 0 0 0 0 0
Stack: 0 0 0 0 3 0

14 sto 0 0 5 15 1 6 9 0 0 0 0 0 0 0
Stack: 0 0 0 0 3 9

15 cal 0 0 2 2 7 6 9 0 0 0 0 0 0 0
Stack: 0 0 0 0 3 9

2 inc 0 0 6 3 7 12 9 0 0 0 0 0 0 0
Stack: 0 0 0 0 3 9 | 0 1 1 16 0 0

How Do You Edit My Work?

Send us your draft and goals—our editors enhance clarity, fix errors, and keep your style. You’ll get a pro-level paper fast.

3 lit 0 0 8 4 7 12 8 0 0 0 0 0 0 0
Stack: 0 0 0 0 3 9 | 0 1 1 16 0 0

4 sto 0 0 4 5 7 12 8 0 0 0 0 0 0 0
Stack: 0 0 0 0 3 9 | 0 1 1 16 8 0

5 lit 0 0 1 6 7 12 1 0 0 0 0 0 0 0
Stack: 0 0 0 0 3 9 | 0 1 1 16 8 0

6 sto 0 1 4 7 7 12 1 0 0 0 0 0 0 0
Stack: 0 0 0 0 1 9 | 0 1 1 16 8 0

7 lit 0 0 7 8 7 12 7 0 0 0 0 0 0 0
Stack: 0 0 0 0 1 9 | 0 1 1 16 8 0

Can You Brainstorm Topics?

Yep! We’ll suggest ideas tailored to your field—engaging and manageable. Pick one, and we’ll build it into a killer paper.

8 sto 0 0 5 9 7 12 7 0 0 0 0 0 0 0
Stack: 0 0 0 0 1 9 | 0 1 1 16 8 7

9 opr 0 0 0 16 1 6 7 0 0 0 0 0 0 0
Stack: 0 0 0 0 1 9

16 sio 0 0 3 17 1 6 7 0 0 0 0 0 0 0
Stack: 0 0 0 0 1 9

NOTE: It is necessary to separate each Activation Record with a bar “|”.
Appendix D

Helpful Tips

This function will be helpful to find a variable in a different Activation Record some L levels down:

/**********************************************/
/* Find base L levels down */
/* */
/**********************************************/

Do You Offer Fast Edits?

Yes! Need a quick fix? Our editors can polish your paper in hours—perfect for tight deadlines and top grades.

int base(l, base) // l stand for L in the instruction format
{
int b1; //find base L levels down
b1 = base;
while (l > 0)
{
b1 = stack[b1 + 1];
l- -;
}
return b1;
}

For example in the instruction:

STO R, L, M - you can do stack[base(ir.L, bp) + ir[IR.M] = RF[IR.R] to store the content of register into the stack L levels down from the current AR. RF stand for register file.

Tags: 1500 Words Assessment Task, Ace Homework Tutors, Assignment Homework Help & Answers, Bishops Writing Bureau