473,416 Members | 1,559 Online
Bytes | Software Development & Data Engineering Community
Post Job

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 473,416 software developers and data experts.

Infix to postfix conversion

Hi guys,

I'm a newbie here, I just want to seek for help regarding my program. I want to implement an infix to postfix conversion only accepting numbers. Right now, I already debugged the errors and encountering loop everytime I execute it.

Here's my sample code:

************************************************** ******************
Expand|Select|Wrap|Line Numbers
  1. #include<stdio.h>
  2. #include<conio.h>
  3. #include<ctype.h>
  4.  
  5.  
  6. struct stack_elem
  7. {
  8.  char elem[10];
  9.  int topelem;
  10. } stckmain;
  11.  
  12. void intoposconvert(char *infix, char *postfix, struct stack_elem *st)
  13. {
  14.  char *inf, *pos;
  15.  struct stack_elem *s;
  16.  char temp;
  17.  int tctr;
  18.  inf = &infix[0];
  19.  pos = &postfix[0];
  20.  s = st;
  21.  
  22. while(*inf){
  23.  if ( *inf == '(' )
  24.   {
  25.    tctr=++s->topelem; /* increment the topelem */
  26.    s->elem[tctr]=*inf; /*push*/
  27.    temp=s->elem[tctr]; /*assign value pushed in stack in temp*/
  28.    inf++;
  29.   }
  30.  else if ( *inf == ')' )
  31.   {
  32.    while ( temp != '(' )
  33.     {
  34.      tctr=s->topelem; /*assign top in tmp*/
  35.      temp=s->elem[tctr]; /*assign value to be popped in temp*/
  36.      --s->topelem; /*pop*/
  37.      *pos=temp;
  38.      pos++;
  39.      inf++;
  40.     }
  41.   }
  42.  else if (*inf == '*' || *inf == '/') /*data coming from ICP*/
  43.   {
  44.    if( s->topelem == -1 || s->elem[tctr] == '(' ) /*if stack is empty or entity in stack is '('*/
  45.     {
  46.      tctr=++s->topelem;
  47.      s->elem[tctr]=*inf;
  48.      temp=s->elem[tctr];
  49.      inf++;
  50.     }
  51.    else /*else stack is not empty*/
  52.     {
  53.      temp=s->elem[tctr];
  54.       if(temp == '+' || temp == '-')
  55.        {
  56.         tctr=++s->topelem;
  57.     s->elem[tctr]=*inf;
  58.     inf++;
  59.        }
  60.       else if (temp == '^')
  61.        {
  62.         tctr=s->topelem;
  63.     temp=s->elem[tctr];
  64.         --s->topelem;
  65.         *pos=temp;
  66.     pos++;
  67.     inf++;
  68.        }
  69.       else if (temp == '*' || temp == '/')
  70.       {
  71.        tctr=s->topelem;
  72.        temp=s->elem[tctr];
  73.        --s->topelem;
  74.        *pos=temp;
  75.        pos++;
  76.        inf++;
  77.        tctr=++s->topelem;
  78.        s->elem[tctr]=*inf;
  79.       }
  80.      }
  81.    }
  82.  else if (*inf == '+' || *inf == '-')
  83.   {
  84.    if( s->topelem == -1 || s->elem[tctr] == '(' ) /*if stack is empty or entity in stack is '('*/
  85.     {
  86.       tctr=++s->topelem;
  87.       s->elem[tctr]=*inf;
  88.       temp=s->elem[tctr];
  89.       inf++;
  90.     }
  91.    else
  92.     {
  93.       temp=s->elem[tctr];
  94.        if(temp == '*' || temp == '/' || temp == '^')
  95.         {
  96.           tctr=s->topelem;
  97.       temp=s->elem[tctr];
  98.           --s->topelem;
  99.       *pos=temp;
  100.       pos++;
  101.       inf++;
  102.         }
  103.        else if(temp == '+' || temp == '-')
  104.        {
  105.      tctr=s->topelem;
  106.      temp=s->elem[tctr];
  107.      --s->topelem;
  108.      *pos=temp;
  109.      pos++;
  110.      inf++;
  111.      tctr=++s->topelem;
  112.      s->elem[tctr]=*inf;
  113.        }
  114.      }
  115.    }
  116.  else if( isdigit(*inf) != 0)
  117.   {
  118.      temp=*inf;
  119.      *pos=temp;
  120.      pos++;
  121.      inf++;
  122.   }
  123.  else
  124.    printf("\n Not a valid input.");
  125.  }
  126. }
  127.  
  128. main()
  129. {
  130.  
  131. char infix[50], postfix[50];
  132. struct stack_elem *st;
  133.  
  134. clrscr();
  135. st = &stckmain;
  136. strcpy(stckmain.topelem, -1);
  137. strcpy(stckmain.elem[0], "");
  138.  
  139. printf("Enter infix statement: ");
  140. /*scanf("%d",&infix[0]);*/
  141. fflush(stdin);
  142. gets(infix);
  143. intoposconvert(&infix[0], &postfix[0], st);
  144. printf("\n Result in postfix statement: ");
  145. printf("%s", postfix);
  146. getch();
  147.  
  148. }
  149.  
************************************************** *********************

Thanks!
-AR
Oct 29 '09 #1
2 5543
newb16
687 512MB
I already debugged the errors and encountering loop everytime I execute it.
How can you execute it if it doesn't even compile? ( no, i'm not talking about conio.h includes that are not everywhere, I'm talking about strcpy)
Oct 29 '09 #2
newb16
687 512MB
if you change that line to
stckmain.topelem = -1;
it runs, but inserts open parenthesis where it shouldn't be.
Oct 29 '09 #3

Sign in to post your reply or Sign up for a free account.

Similar topics

5
by: KidLogik | last post by:
Hello! I am converting an infix expression string into a postfix so that I will be able to evaluate it easier -> (5*(((9+8)*(4*6))+7)) == 598+46**7+* I believe the rule is "Replace all...
22
by: Tony Johansson | last post by:
Hello Experts! I'm reading i a book about C++ and they mention infix with telling what it is. I hope you out there can do so. Many thanks! //Tony
19
by: caramel | last post by:
i've been working on this program forever! now i'm stuck and going insane because i keep getting a syntax error msg and i just can't see what the compiler is signaling to! #include <stdio.h>...
11
by: Nhd | last post by:
Hi... I need a program to convert an infix arithmetic expression to postfix with the use of stacks... Can anyone tell me how do i go about implementing this? thanks
5
by: Thumbski | last post by:
Alright basically I just have one simple question. I can code perfectly fine and don't have any problems with the .cpp of the infix class but with my header I can't get anything to work really, any...
30
by: Xah Lee | last post by:
The Concepts and Confusions of Prefix, Infix, Postfix and Fully Functional Notations Xah Lee, 2006-03-15 In LISP languages, they use a notation like “(+ 1 2)” to mean “1+2”....
0
by: coolguyjas07 | last post by:
plzzzzzz help me out to run my source code ......... i hav written dis code to convert infix expression to postfix but not getting desired output.... plzzz help me to get correct output.. d source...
4
by: madhumitha29 | last post by:
Does anyone know a simple C program to covert an infix to a postfix expression?plz kindly help!
1
by: aitia | last post by:
this the code. i used ECLIPSE to run this.. it has some codes smells that i can't seem to figure out.. can any one help? import java.io.*; import java.util.*; public class Postfix { private...
0
by: emmanuelkatto | last post by:
Hi All, I am Emmanuel katto from Uganda. I want to ask what challenges you've faced while migrating a website to cloud. Please let me know. Thanks! Emmanuel
0
BarryA
by: BarryA | last post by:
What are the essential steps and strategies outlined in the Data Structures and Algorithms (DSA) roadmap for aspiring data scientists? How can individuals effectively utilize this roadmap to progress...
1
by: Sonnysonu | last post by:
This is the data of csv file 1 2 3 1 2 3 1 2 3 1 2 3 2 3 2 3 3 the lengths should be different i have to store the data by column-wise with in the specific length. suppose the i have to...
0
by: Hystou | last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can...
0
Oralloy
by: Oralloy | last post by:
Hello folks, I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>". The problem is that using the GNU compilers,...
0
by: Hystou | last post by:
Overview: Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows...
0
tracyyun
by: tracyyun | last post by:
Dear forum friends, With the development of smart home technology, a variety of wireless communication protocols have appeared on the market, such as Zigbee, Z-Wave, Wi-Fi, Bluetooth, etc. Each...
0
agi2029
by: agi2029 | last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development projectplanning, coding, testing,...
0
by: conductexam | last post by:
I have .net C# application in which I am extracting data from word file and save it in database particularly. To store word all data as it is I am converting the whole word file firstly in HTML and...

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.