Convert the following into Pep/9 assembly language: #include using namespace std; char ch; int main () { cin.get(ch); ch--; cout << ch << endl; return 0;

Problem 1. In C/C++ programming language, write down the lines of codes (and figure) to show -(a) assignment-by-sharing(b) dangling referenceProblem 2. Show the correspondingcodecontents in memory for themainmethod and draw thestackcontents while themainmethod starts execution and reaches at line 12. 1 #include<iostream> 2 using namespace std ; 3 int main () 4 { 5 int i ; 6 short j ; 7 char k ; 8 i = 30; 9 j = i ; 10 k = ( char ) j ; 11 i = k ; 12 13 return 0; 14 }   Problem 3. (a) In C++, write down themainmethod including aforloop. The body of theforloop includes the followings :anifconditionan array (of any type & of any size)a structure variable (with at least two variables of any type) (b) Show the correspondingcodecontents in memory for themainmethod and drawthestackcontents while themainmethod starts execution and reaches at theline prior to return from yourmainmethod of Problem 3(a). (c) Create a symbol table structure (dynamic scoping) at the line before…

Convert the following c++ code into pep9 assembly language #include <iostream> using namespace std; void times(int& prod, int mpr, int mcand) { prod = 0; while (mpr != 0) { if (mpr % 2 == 1) prod = prod + mcand; mpr /= 2; mcand *= 2; } } int main(){ int product, n, m; cout << "Enter two numbers: "; cin >> n >> m; times(product, n, m); cout << "Product: " << product << endl; return 0; }

Convert the following C++ programs into Pep/9 assembly #include <iostream> using namespace std; int minimum (int i1, int i2){if (i1 < i2)return i1;elsereturn i2;}int main (){int n, m;cin >> n >> m;cout << "Minimum: " << minimum (n, m) << endl;return 0;} Submit: Pep/9 source code along with screen capture showing it running in the Pep simulator

We can acquire the complement of a DFA by swapping accept and non-accept states. Explain whether this method succeeds to build a TM complement. If yes, describe how; if no, explain why and suggest a TM supplement strategy.

translate the following C++ program into Pep/9 Assembly. #include<iostream> using namespace std; void showNext(int age){  int nextYr;  nextYr = age + 1;  cout << "Age:" << age<< endl;  cout << "Age next year: "       << nextYr << endl;}int main() {  int myAge;  cout << "Enter age: ";  cin >> myAge;  showNext (myAge);  return 0;}

PEP/9 Translate the following C++ program into assembly language:  #include <iostream> using namespace std; int main() {   char letter;   int countA = 0,        countB = 0,        countC = 0;   cin >> letter;   do {      switch (letter) {         case 'A' : countA++; break;         case 'B' : countB++; break;         case 'C' : countC++; break;       }      cin >> letter;   } while (letter != 'X');   cout << "Number of A's " << countA << endl          << "Number of B's " << countB << endl          << "Number of C's " << countC << endl;   return 0; } Use local variables (except for messages, of course) and the branch indexed for the switch statement.

Convert the following C++ programs into Pep/9 assembly #include <iostream> using namespace std; void minimum (int i1, int i2){    if (i1 < i2)        cout << i1 << " is less than " << i2 << endl;   else if (i1 > i2)        cout << i2 << " is less than " << i1 << endl;    else        cout << i1 << " equals " << i2 << endl;}int main (){    int n, m;    cout << "Enter two integers: ";    cin >> n >> m;    minimum (n, m);    return 0;} Submit: Pep/9 source code along with screen capture showing it running in the Pep simulator

Convert the following C++ programs into Pep/9 assembly #include <iostrea> using namespace std; int minimum (int i1, int i2){  if (i1 < i2)        cout << i1 << " is less than " << i2 << endl;    else if (i2 < i1)        cout << i2 << " is less than " << i1 << endl;    else        cout << i1 << " equals " << i2 << endl;}int main (){int n, m;cin >> n >> m;cout << "Minimum: " << minimum (n, m) << endl;return 0;} Submit: Pep/9 source code along with screen capture showing it running in the Pep simulator

Complete the following C++ programs into Pep/9 assembly language: 1) int main(){int cop;    int driver;    cop = 0;    driver = 40;    while (cop <= driver) {        cop += 25;        driver += 20;    }    cout << cop;    return 0;}