Correspondingly, we can also extend parsing algorithm of proposition to recognize a formula in a direct approach. We first introduce a parsing subroutine for a general term and a atomic formula in the same way. And we then extend proposition's parsing algorithm to recognize a general formula which is left as an exercise Exercises 1. Given formulas in Ex 2(c),(e), (f)on page 88. Which occurrences of variables are free? Which are bound? 2. Ex 5(b, c)/ page 88 3. Ex 2(d, e)/ page 94 4. Ex 13/ page 95 5. Augment parsing algorithm for proposition logic to recognize a formula of predicate lo Here, we assume that predicates, functions, variables, and constants are represented by a sInCorrespondingly, we can also extend parsing algorithm of proposition to recognize a formula in a direct approach. We first introduce a parsing subroutine for a general term and a atomic formula in the same way. And we then extend proposition’s parsing algorithm to recognize a general formula, which is left as an exercise. Exercises 1. Given formulas in Ex 2 (c),(e),(f) on page 88. Which occurrences of variables are free? Which are bound? 2. Ex 5(b, c)/ page 88. 3. Ex 2(d, e)/ page 94. 4. Ex 13/ page 95. 5. Augment parsing algorithm for proposition logic to recognize a formula of predicate logic. Here, we assume that predicates, functions, variables, and constants are represented by a single symbol. 6