This is a continuation of Program #1 (Infix to Postfix). In this assignment, we evaluate the postfix expressions. I have provided a driver, include file, and data files.

This program is important in helping you understand

• Using a stack to evaluate postfix
• Integrating your code with someone elses code (mine) Techniques for error handling
• The use of unions.

Input:

There are two input files: course data and queries. See cs2123p2Driver.c for more information.

Process: (green highlighting indicates work you previously did and yellow highlighting indicates your new work):

• Read the course data (as in Program #0) and print the course data (as in program #0).
• Read the infix expressions as was done in Program #1. For each expression:
  1. Convert the infix to postfix (as in Program #1).
  2. Evaluate the postfix expression, producing an array of booleans (one entry for each course).
  3. Print the infix expression, the postfix form of the expression, and evaluated result. The driver does this.

Approaches for Evaluating Operators Approach #1:

• The operator result (i.e., a boolean) must be stacked.

Approach #2: When evaluating an operator, iterate over the courses to determine if each course satisfies the operator. The operator evaluation result is an array corresponding to the course array with a boolean indicating whether the course satisfies the result.

• A query is evaluated once.
• Each operator will iterate over the list of N courses.
• The operator result (i.e., the array of booleans) must be stacked.

We will use approach #1.

Additional functions provided by Larry:

void printQueryResult(Course courseM[], int iNumCourse, QueryResult resultM[]) Prints the courses which have a corresponding element in the resultM array turned on.

int never(Course *pCourse, Attr attr)

Determines whether a course has a particular attribute (type and value). If it doesnt, never returns TRUE; otherwise, it returns FALSE.

int getCourseData(Course courseM[])

Gets course data and their corresponding attributes (type and values).

Use of union

Since the evaluation needs two types of elements, we will use union as shown in the include file.

Some Files for your use:

p2Query.txt data file containing infix expressions which are evaluated as queries p2Course.txt course data file similar to program #0. cs2123p2.h include file for Program #2

cs2123p2Driver.c driver program that I provided. It has several useful routines to help reduce your effort. Please review this code

Your coding:

• Create your code in cs2123p2.c (not cs2123p2Driver.c). Based on what the driver calls, you need to create (at least) these functions:

int convertToPostFix(char *pszInfix, Out out)

// you did this in program #1

It returns 0 if it converted successfully. Otherwise, it returns a value which indicates an error in

the infix data (e.g., missing left paren, missing right paren) It populates the out array using the addOut function (provided in the driver).

void printCourseData(Course courseM[], int iNumCourse)

This was done in program #0. void evaluatePostfix(PostfixOut out, Course courseM[], int iNumCourse

, QueryResult resultM[])

This evaluates a postfix expression (which is in out) using the courseM array. For each course satisfying the posftfix query, it sets its corresponding position in resultM to TRUE.

int atLeastOne(Course *pCourse, Attr attr)

Determines whether a course has a particular attribute (type and value). If it does, atLeastOne returns TRUE; otherwise, it returns

FALSE.

int only(Course *pCourse, Attr attr)

This looks at EACH attribute in the courses attrM array for the specified course. If the attributes szAttrType matches the specified szAttrType, then its corresponding szAttrValue must match the specfied attribute value. If it doesnt match the attribute value, FALSE is returned. only examines each of the attributes for the specified course.

You will also have to provide code for AND and OR.

• Modify the Makefile from program #1 to reference p2 for each of the files.

Requirements:

1. Your code must be written according to my programming standards.
2. You should not have to modify cs2123p2Driver.c. If you want to modify it, please see me before you do that.
3. Turn in your C code, include files, and output generated using the specified input file.
4. Make certain you free up allocated memory (e.g., stack).
5. Modularity matters.