Question: i need help implementing the logic for this program void lmsm _ cap _ value ( int * val ) { / / TODO -

i need help implementing the logic for this program
void lmsm_cap_value(int * val){//TODO - implement capping the value pointed to by this pointer between 999 and -999 if (*val >999){*val =999; // Cap the value at 999} else if (*val <-999){*val =-999; // Cap the value at -999}} int lmsm_has_two_values_on_stack(lmsm *our_little_machine){//TODO - return 0
}
//======================================================
// Instruction Implementation
//======================================================
void lmsm_i_jal(lmsm *our_little_machine){
}
void lmsm_i_ret(lmsm *our_little_machine){
}
void lmsm_i_push(lmsm *our_little_machine){
}
void lmsm_i_pop(lmsm *our_little_machine){
}
void lmsm_i_dup(lmsm *our_little_machine){
}
void lmsm_i_drop(lmsm *our_little_machine){
}
void lmsm_i_swap(lmsm *our_little_machine){
}
void lmsm_i_sadd(lmsm *our_little_machine){
}
void lmsm_i_ssub(lmsm *our_little_machine){
}
void lmsm_i_smax(lmsm *our_little_machine){
}
void lmsm_i_smin(lmsm *our_little_machine){
}
void lmsm_i_smul(lmsm *our_little_machine){
}
void lmsm_i_sdiv(lmsm *our_little_machine){
}
void lmsm_i_out(lmsm *our_little_machine){
// TODO, append the current accumulator to the output_buffer in the LMSM
}
void lmsm_i_inp(lmsm *our_little_machine){
// TODO read a value from the command line and store it as an int in the accumulator
}
void lmsm_i_load(lmsm *our_little_machine, int location){
}
void lmsm_i_add(lmsm *our_little_machine, int location){
our_little_machine->accumulator += our_little_machine->memory[location];
}
void lmsm_i_sub(lmsm *our_little_machine, int location){
our_little_machine->accumulator -= our_little_machine->memory[location];
}
void lmsm_i_load_immediate(lmsm *our_little_machine, int value){
}
void lmsm_i_store(lmsm *our_little_machine, int location){
}
void lmsm_i_halt(lmsm *our_little_machine){
}
void lmsm_i_branch_unconditional(lmsm *our_little_machine, int location){
}
void lmsm_i_branch_if_zero(lmsm *our_little_machine, int location){
}
void lmsm_i_branch_if_positive(lmsm *our_little_machine, int location){
}
void lmsm_step(lmsm *our_little_machine){
// TODO : if the machine is not halted, we need to read the instruction in the memory slot
// pointed to by the program counter, bump the program counter then execute
// the instruction
if (our_little_machine->status != STATUS_HALTED){
int next_instruction = our_little_machine->memory[our_little_machine->program_counter];
our_little_machine->program_counter++;
our_little_machine->current_instruction = next_instruction;
int instruction = our_little_machine->current_instruction;
lmsm_exec_instruction(our_little_machine, instruction);
}
}
//======================================================
// LMSM Implementation
//======================================================
void lmsm_exec_instruction(lmsm *our_little_machine, int instruction){
// TODO - dispatch the rest of the instruction set and implement
// the instructions above
if (instruction ==0){
lmsm_i_halt(our_little_machine);
} else if (100<= instruction && instruction <=199){
lmsm_i_add(our_little_machine, instruction -100);
} else if (200<= instruction && instruction <=299){
lmsm_i_sub(our_little_machine, instruction -200);
} else if (600<= instruction && instruction <=699){
lmsm_i_branch_unconditional(our_little_machine, instruction -600);
} else if (instruction ==920){
lmsm_i_push(our_little_machine);
} else if (instruction ==930){
lmsm_i_sadd(our_little_machine);
} else {
our_little_machine->error_code = ERROR_UNKNOWN_INSTRUCTION;
our_little_machine->status = STATUS_HALTED;
}
lmsm_cap_value(&our_little_machine->accumulator);
}
void lmsm_load(lmsm *our_little_machine, int *program, int length){
for (int i =0; i < length; ++i){
our_little_machine->memory[i]= program[i];
}
}
void lmsm_init(lmsm *the_machine){
the_machine->accumulator =0;
the_machine->status = STATUS_READY;
the_machine->error_code = ERROR_NONE;
the_machine->program_counter =0;
the_machine->current_instruction =0;
the_machine->stack_pointer = TOP_OF

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Q:

Create a sparse matrix vector with a linked list then creat a sparese matrix using linked list. I have done problem 1 and tested it , which is to create LLsparseVector class, now I'm stuck on problem...

Q:

Program must be done in C! In this assignment you will modify the binary search tree code studied in class to: Support several new features (some with runtime requirements) and Enforce a balancing...

Q:

Language is C Please read and follow instructions carefully. This is the existing code where the above functions need to be implemented. I have already implemented the functions mentioned in this...

Q:

Implementing Linked List Utility Functions. PROGRAM MUST BE IN C PROGRAMMING AND PLEASE COMPLETE ALL AS WELL AS SEND SCREENSHOT OF OUTPUT FOR THE THUMBS UP!! Examine the files list.h and llist.c in...

Q:

Write a Java Program - Binary and Integer Conversions: Note: No break or switch statements. The program will ask the user to enter a choice of conversion they want to make and then either convert a...

Q:

please, finish this program, by using C language. there are three files, two used to structure and one used to test. The goal of this assignment is to have you start working with the dynamic array...

Q:

In this assignment you will modify the binary search tree code studied in class to: Support several new features (some with runtime requirements) and Enforce a balancing property ("size-balancing")...

Q:

Java Program Specification You will add three sorting methods to the MovieCollection class. The methods will be: public void sortByName() Sort the movies in your collection from a z. Use selection...

Q:

Java Program Specification You will add three sorting methods to the MovieCollection class. The methods will be: public void sortByName() Sort the movies in your collection from a z. Use selection...

Q:

Java Program Specification You will add three sorting methods to the MovieCollection class. The methods will be: public void sortByName() Sort the movies in your collection from a z. Use selection...

Q:

In addition to not undergoing substitution reactions, the alkyl bromide shown in Problem 11 .45 also fails to undergo an elimination reaction when treated with base. Explain.

Q:

Birch Company normally produces and sells 30,000 units of RG-6 each month. RG-6 is a small electrical relay used as a component part in the automotive industry. The selling price is $22 per unit,...

Q:

I wanna go solve the following questions One calculate the yield for coupon paying us treasuries given in these case 2 . Bootsraps zero Coupon ( spot ) yeld cruve from the giving coupon baying bond ....

Q:

2.On December 31, 2014, Track Record Inc.'s sales people have firm outstanding orders totaling $1.66 million, which, it has guaranteed its customers, will be fulfilled during the month of January...