Create a PDA that recognizes the following context free language with terminals {a,b,c} L= {wck | wE {a, b}* and k = |w|} (Hint: It is only asking for the # of c's = total number of a's + b's) (i) Describe your algorithm (ii) Give the description as a complete 7-tuple with a transition diagram (iii) Show configuration sequences on babbcccc leading to acceptance.

(Practice) For the following correct algebraic expressions and corresponding incorrect C++ expressions, find the errors and write corrected C++ expressions: Algebra C++ Expression a.(2)(3)+(4)(5)(2)(3)+(4)(5) b. 6+1826+18/2 c. 4.512.23.1S4.5/12.23.1 d. 4.6(3.0+14.9)4.6(3.0+14.9) e. (12.1+18.9)(15.33.8)(12.1+18.9)(15.33.8)

(For thought) a. A token of a computer language is any sequence of characters, with no intervening characters or white space, that taken as a unit has a unique meaning. Using this definition of a token, determine whether escape sequences, function names, and the keywords listed in Table 2.1 are tokens of the C++ language. b. Discuss whether adding white space to a message alters the message and whether messages can be considered tokens of C++. c. Using the definition of a token in Exercise 4a, determine whether the following statement is true: “Except for tokens of the language, C++ ignores all white space.”