C++ Programming Exercises

Assignment 7.1 (10 points] Do the chapter 6 end-of-chapter exercises (not Programming Problems!) 8a, c, e; 11a, c; 12a, c, e, g For each of the following strings, trace the execution of the language-recognition algorithm described in Section 6.2.2, and show the contents of the stack at each step. a. xysxy b. y$yx c. xy$y d. xy$x e. xx$xx Write a pseudocode function that uses a stack to determine whether a string is in the language L, where a. L= {s: s contains equal numbers of A's and B's) b. L = {s:sis of the form A' B' for some n 20} 10. Write a function that uses a stack to determine whether a string is in the language L, where L={s s' :s is a string of characters, s'=reverse (s) } Note: The following strings are not in the language: The empty string, a string with fewer than two characters, and a string with an odd number of characters. Evaluate the following postfix expressions by using the algorithm given in this chapter. Show the status of the stack after each step of the algorithm. Assume the following values for the identifiers: a = 7, b = 3, c= 12, d=-5, e=1. a. abc+- b. abc-d*+ c. ab+c-de*+ Convert the following infix expressions to postfix form by using the algorithm given in this chapter. Show the status of the stack after each step of the algorithm. a. a-b+c b. a-(b/c*d) c. a/(b*c) d. a/b/c-(d+e) *f e. (a+b) *c f. a*(b/c/d) +e g. a-(b+c) h. a-(b+c*d)/e Assignment 7.1 (10 points] Do the chapter 6 end-of-chapter exercises (not Programming Problems!) 8a, c, e; 11a, c; 12a, c, e, g For each of the following strings, trace the execution of the language-recognition algorithm described in Section 6.2.2, and show the contents of the stack at each step. a. xysxy b. y$yx c. xy$y d. xy$x e. xx$xx Write a pseudocode function that uses a stack to determine whether a string is in the language L, where a. L= {s: s contains equal numbers of A's and B's) b. L = {s:sis of the form A' B' for some n 20} 10. Write a function that uses a stack to determine whether a string is in the language L, where L={s s' :s is a string of characters, s'=reverse (s) } Note: The following strings are not in the language: The empty string, a string with fewer than two characters, and a string with an odd number of characters. Evaluate the following postfix expressions by using the algorithm given in this chapter. Show the status of the stack after each step of the algorithm. Assume the following values for the identifiers: a = 7, b = 3, c= 12, d=-5, e=1. a. abc+- b. abc-d*+ c. ab+c-de*+ Convert the following infix expressions to postfix form by using the algorithm given in this chapter. Show the status of the stack after each step of the algorithm. a. a-b+c b. a-(b/c*d) c. a/(b*c) d. a/b/c-(d+e) *f e. (a+b) *c f. a*(b/c/d) +e g. a-(b+c) h. a-(b+c*d)/e