How div and sub works on a stack based processor 0 address machine

Question

1.00/5 (2 votes)

See more:

Hello !
Let's suppose that we have a stack based processor , 0-address machine.
We want to calculate A/B or A-B.

So which is the order that arguments should be pushed on stack ?

What I have tried:

1.
PUSH B
PUSH A
DIV

PUSH A
PUSH B
DIV

2.
PUSH B
PUSH A
SUB

PUSH A
PUSH B
SUB

Posted 6-Jan-24 12:39pm

desanti

Add a Solution

Comments

Dave Kreskowiak 6-Jan-24 19:34pm

Got any documentation on this theoretical processor you're "using"? What each instruction expects is going to be covered and will cover the information like what you're asking.

desanti 6-Jan-24 20:48pm

I have no documentation. I have an comlicated expression to calculate on a stack based cpu with 0 address instruction, but the only problem that i have is the order of arguments for DIV and SUB. But i think if Stack work as LIFO , to get A/B we should do PUSH B , PUSH A , DIV . Because in this order A is on the top of stack and is used as first value.???? But i'm not sure if this is true.

Dave Kreskowiak 7-Jan-24 1:13am

First, you replied to yourself, not me. That means I never got a notice that said you replied.

Next, this is an exercise to set you up for solving the more complex math problems. The idea is for you to think about what would make more sense for the order of operands pushed onto the stack. You've got 2 options. Either A or B gets pushed, then the other operand gets pushed. What would make more sense and where does the answer end up?

You might want to find some resources on virtual stack machines and do a little reading.

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Answer 1 · 2024-01-06T19:35:00

We can't tell you: there is no generic law that states that an imaginary stack-based machine must use operands in any specific order: either order is possible, and it will depend on the way the stack machine was defined: though generally speaking the dividend would be pushed onto the stack first and then the divisor because most expressions are evaluated left-to-right: X op Y would evaluate X first, so it would be pushed first, then Y would be evaluated second and be at the top of the stack as a result.

But it is at the whim of the state machine designer.

Richard MacCutchan · Answer 2 · 2024-01-06T22:15:00

Solution 2

See Computer Organization | Instruction Formats (Zero, One, Two and Three Address Instruction) - GeeksforGeeks[^]

Posted 6-Jan-24 22:15pm

Richard MacCutchan

Comments

desanti 7-Jan-24 13:25pm

Yes , i've already read that article. But the sample that he's using is about + and * where the order of operand is not important. I've not found any aticle that has a sample with / and -.

Richard MacCutchan 8-Jan-24 3:34am

Since these are theoretical machines, it is up to you to decide the order. The article is just about the basic priciples of how such a machine deals with different operations.