Merge pull request TheAlgorithms#611 from harshcut/infix_to_postfix

feat: add infix_to_postfix.c

DIRECTORY.md

@@ -18,6 +18,7 @@
   * [Decimal To Octal Recursion](https://github.com/TheAlgorithms/C/blob/master/conversions/decimal_to_octal_recursion.c)
   * [Hexadecimal To Octal](https://github.com/TheAlgorithms/C/blob/master/conversions/hexadecimal_to_octal.c)
   * [Hexadecimal To Octal2](https://github.com/TheAlgorithms/C/blob/master/conversions/hexadecimal_to_octal2.c)
+  * [Infix To Postfix](https://github.com/TheAlgorithms/C/blob/master/conversions/infix_to_postfix.c)
   * [Int To String](https://github.com/TheAlgorithms/C/blob/master/conversions/int_to_string.c)
   * [Octal To Binary](https://github.com/TheAlgorithms/C/blob/master/conversions/octal_to_binary.c)
   * [Octal To Decimal](https://github.com/TheAlgorithms/C/blob/master/conversions/octal_to_decimal.c)

conversions/infix_to_postfix.c

@@ -0,0 +1,227 @@
+/**
+ * @file
+ * @brief [Infix to
+ * Postfix](https://condor.depaul.edu/ichu/csc415/notes/notes9/Infix.htm)
+ * Expression Conversion
+ * @details Convert Infixed expressions to Postfix expression.
+ * @author [Harsh Karande](https://github.com/harshcut)
+ */
+
+// include header files
+#include <stdio.h>  /// for printf() and scanf()
+
+/**
+ * @brief a globally declared structure with an array and an variable that
+ * points to the topmost index of the array
+ */
+struct Stack
+{
+    char arr[10];  ///> static array of integers
+    int tos;       ///> stores index on topmost element in stack
+};
+
+// function headers
+void push(struct Stack *p, char ch);  // pust element in stack
+char pop(struct Stack *p);            // pop topmost element from the stack
+int isOprnd(char ch);                 // check if element is operand or not
+int isEmpty(struct Stack s);          // check if stack is empty
+int getPrecedence (char op1, char op2);        // check operator precedence
+void convert(char infix[],
+             char postfix[]);  // convert infix to postfix expression
+
+/**
+ * @brief main function
+ * @returns 0 on exit
+ */
+int main()
+{
+    char infix[20], postfix[20];  // initialize empty infix and postfix array
+
+    printf("Enter infix expression: ");  // example : A+B-C*D/E$F
+    scanf("%s", infix);                  // get values for infix array
+
+    convert(infix, postfix);
+    printf("Postfix expression is %s", postfix);  // output : AB+CD*EF$/-
+
+    return 0;
+}
+
+/**
+ * @brief push function
+ * @param *p : used as a pointer variable of stack
+ * @param x : char to be pushed in stack
+ * @returns void
+ */
+void push(struct Stack *p, char x)
+{
+    if (p->tos == 9)  // check if stack has reached its max limit
+    {
+        printf("Stack Overflow!");
+        return;
+    }
+
+    p->tos += 1;         // increment tos
+    p->arr[p->tos] = x;  // assign char x to index of stack pointed by tos
+}
+
+/**
+ * @brief pop function
+ * @param *p : used as a pointer variable of stack
+ * @returns x or \0 on exit
+ */
+char pop(struct Stack *p)
+{
+    char x;
+
+    if (p->tos == -1)
+    {
+        printf("Stack Underflow!");
+        return '\0';
+    }
+
+    x = p->arr[p->tos];  // assign the value of stack at index tos to x
+    p->tos -= 1;         // decrement tos
+
+    return x;
+}
+
+/**
+ * @brief isOprnd function
+ * @param ch : this is the element from the infix array
+ * @returns 1 or 0 on exit
+ */
+int isOprnd(char ch)
+{
+    if ((ch >= 65 && ch <= 90) ||
+        (ch >= 97 && ch <= 122) ||  // check if ch is an operator or
+        (ch >= 48 && ch <= 57))     // operand using ASCII values
+    {
+        return 1;  // return for true result
+    }
+    else
+    {
+        return 0;  // return for false result
+    }
+}
+
+/**
+ * @brief isEmpty function
+ * @param s : it is the object reference of stack
+ * @returns 1 or 0 on exit
+ */
+int isEmpty(struct Stack s)
+{
+    if (s.tos == -1)  // check if stack is empty
+    {
+        return 1;  // return for true result
+    }
+    else
+    {
+        return 0;  // return for false result
+    }
+}
+
+/**
+ * @brief convert function
+ * @param infix[] : infix array provided by user
+ * @param postfix[] : empty array to be given to convert()
+ * @returns postfixed expresion or \0 on exit
+ */
+void convert(char infix[], char postfix[])
+{
+    struct Stack s;  // initialze object reference of stack
+    s.tos = -1;      // initalize the tos
+
+    int i, j = 0, pr;
+    char ch, temp;
+
+    for (i = 0; infix[i] != '\0'; i++)
+    {
+        ch = infix[i];
+
+        if (isOprnd(ch) == 1)  // check if char is operand or operator
+        {
+            postfix[j] = ch;  // assign ch to postfix array with index j
+            j++;              // incement j
+        }
+        else
+        {
+            if (ch == '(')
+            {
+                push(&s, ch);
+            }
+            else
+            {
+                if (ch == ')')
+                {
+                    while ((temp = pop(&s)) != '(')
+                    {
+                        postfix[j] = temp;
+                        j++;
+                    }
+                }
+                else
+                {
+                    while (isEmpty(s) == 0)  // check if stack is empty
+                    {
+                        pr = getPrecedence (ch,
+                                   s.arr[s.tos]);  // check operator precedence
+
+                        if (pr == 1)
+                        {
+                            break;  // if ch has a greater precedence than
+                                    // s.arr[s.top]
+                        }
+
+                        postfix[j] = pop(&s);
+                        j++;
+                    }
+
+                    push(&s, ch);  // push ch to stack
+                }
+            }
+        }
+    }
+
+    while (isEmpty(s) == 0)  // check if stack is empty
+    {
+        postfix[j] = pop(&s);
+        j++;
+    }
+
+    postfix[j] = '\0';
+}
+
+/**
+ * @brief getPrecedence function returns the precedence after comparing two operators passed as parameter.
+ * @param op1 : first operator
+ * @param op2 : second operator
+ * @returns 1 or 0 on exit
+ */
+int getPrecedence (char op1, char op2)
+{
+    if (op2 == '$')
+    {
+        return 0;
+    }
+    else if (op1 == '$')
+    {
+        return 1;
+    }
+    else if (op2 == '*' || op2 == '/' || op2 == '%')
+    {
+        return 0;
+    }
+    else if (op1 == '*' || op1 == '/' || op1 == '%')
+    {
+        return 1;
+    }
+    else if (op2 == '+' || op2 == '-')
+    {
+        return 0;
+    }
+    else
+    {
+        return 1;
+    }
+}