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:
*************** *************** *************** *************** ******** -
#include<stdio.h>
-
#include<conio.h>
-
#include<ctype.h>
-
-
-
struct stack_elem
-
{
-
char elem[10];
-
int topelem;
-
} stckmain;
-
-
void intoposconvert(char *infix, char *postfix, struct stack_elem *st)
-
{
-
char *inf, *pos;
-
struct stack_elem *s;
-
char temp;
-
int tctr;
-
inf = &infix[0];
-
pos = &postfix[0];
-
s = st;
-
-
while(*inf){
-
if ( *inf == '(' )
-
{
-
tctr=++s->topelem; /* increment the topelem */
-
s->elem[tctr]=*inf; /*push*/
-
temp=s->elem[tctr]; /*assign value pushed in stack in temp*/
-
inf++;
-
}
-
else if ( *inf == ')' )
-
{
-
while ( temp != '(' )
-
{
-
tctr=s->topelem; /*assign top in tmp*/
-
temp=s->elem[tctr]; /*assign value to be popped in temp*/
-
--s->topelem; /*pop*/
-
*pos=temp;
-
pos++;
-
inf++;
-
}
-
}
-
else if (*inf == '*' || *inf == '/') /*data coming from ICP*/
-
{
-
if( s->topelem == -1 || s->elem[tctr] == '(' ) /*if stack is empty or entity in stack is '('*/
-
{
-
tctr=++s->topelem;
-
s->elem[tctr]=*inf;
-
temp=s->elem[tctr];
-
inf++;
-
}
-
else /*else stack is not empty*/
-
{
-
temp=s->elem[tctr];
-
if(temp == '+' || temp == '-')
-
{
-
tctr=++s->topelem;
-
s->elem[tctr]=*inf;
-
inf++;
-
}
-
else if (temp == '^')
-
{
-
tctr=s->topelem;
-
temp=s->elem[tctr];
-
--s->topelem;
-
*pos=temp;
-
pos++;
-
inf++;
-
}
-
else if (temp == '*' || temp == '/')
-
{
-
tctr=s->topelem;
-
temp=s->elem[tctr];
-
--s->topelem;
-
*pos=temp;
-
pos++;
-
inf++;
-
tctr=++s->topelem;
-
s->elem[tctr]=*inf;
-
}
-
}
-
}
-
else if (*inf == '+' || *inf == '-')
-
{
-
if( s->topelem == -1 || s->elem[tctr] == '(' ) /*if stack is empty or entity in stack is '('*/
-
{
-
tctr=++s->topelem;
-
s->elem[tctr]=*inf;
-
temp=s->elem[tctr];
-
inf++;
-
}
-
else
-
{
-
temp=s->elem[tctr];
-
if(temp == '*' || temp == '/' || temp == '^')
-
{
-
tctr=s->topelem;
-
temp=s->elem[tctr];
-
--s->topelem;
-
*pos=temp;
-
pos++;
-
inf++;
-
}
-
else if(temp == '+' || temp == '-')
-
{
-
tctr=s->topelem;
-
temp=s->elem[tctr];
-
--s->topelem;
-
*pos=temp;
-
pos++;
-
inf++;
-
tctr=++s->topelem;
-
s->elem[tctr]=*inf;
-
}
-
}
-
}
-
else if( isdigit(*inf) != 0)
-
{
-
temp=*inf;
-
*pos=temp;
-
pos++;
-
inf++;
-
}
-
else
-
printf("\n Not a valid input.");
-
}
-
}
-
-
main()
-
{
-
-
char infix[50], postfix[50];
-
struct stack_elem *st;
-
-
clrscr();
-
st = &stckmain;
-
strcpy(stckmain.topelem, -1);
-
strcpy(stckmain.elem[0], "");
-
-
printf("Enter infix statement: ");
-
/*scanf("%d",&infix[0]);*/
-
fflush(stdin);
-
gets(infix);
-
intoposconvert(&infix[0], &postfix[0], st);
-
printf("\n Result in postfix statement: ");
-
printf("%s", postfix);
-
getch();
-
-
}
-
*************** *************** *************** *************** ***********
Thanks!
-AR
2 5609
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)
if you change that line to
stckmain.topele m = -1;
it runs, but inserts open parenthesis where it shouldn't be.
Sign in to post your reply or Sign up for a free account.
Similar topics |
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 occurances of two operands followed
by an operator by their infix equivalent"
|
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
|
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>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
|
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
|
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 guideline as to how to start this would be great. It has to work with assign.cpp which is like this:
int main()
{
Infix infix;
while (true)
{
//cout << "Enter an infix expression like 2*(3+4): " << endl;
| |
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”.
Likewise, they write “(if test this that)” to mean “if (test) {this}
else {that}”. LISP codes are all of the form “(a b c ...)”, where the
|
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 code is given below:
#include<iostream.h>
#include<conio.h>
#include<stdio.h>
#include<ctype.h>
#include<string.h>
#include<process.h>
|
by: madhumitha29 |
last post by:
Does anyone know a simple C program to covert an infix to a postfix expression?plz kindly help!
|
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 static Stack operators = new Stack();
private static Stack operands = new Stack();
|
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, it seems that the internal comparison operator "<=>" tries to promote arguments from unsigned to signed.
This is as boiled down as I can make it.
Here is my compilation command:
g++-12 -std=c++20 -Wnarrowing bit_field.cpp
Here is the code in...
|
by: jinu1996 |
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven tapestry of website design and digital marketing. It's not merely about having a website; it's about crafting an immersive digital experience that captivates audiences and drives business growth.
The Art of Business Website Design
Your website is...
| |
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 protocol has its own unique characteristics and advantages, but as a user who is planning to build a smart home system, I am a bit confused by the choice of these technologies. I'm particularly interested in Zigbee because I've heard it does some...
|
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, and deploymentwithout human intervention. Imagine an AI that can take a project description, break it down, write the code, debug it, and then launch it, all on its own....
Now, this would greatly impact the work of software developers. The idea...
|
by: isladogs |
last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM).
In this session, we are pleased to welcome a new presenter, Adolph Dupr who will be discussing some powerful techniques for using class modules.
He will explain when you may want to use classes instead of User Defined Types (UDT). For example, to manage the data in unbound forms.
Adolph will...
|
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 then checking html paragraph one by one.
At the time of converting from word file to html my equations which are in the word document file was convert into image.
Globals.ThisAddIn.Application.ActiveDocument.Select();...
|
by: TSSRALBI |
last post by:
Hello
I'm a network technician in training and I need your help.
I am currently learning how to create and manage the different types of VPNs and I have a question about LAN-to-LAN VPNs.
The last exercise I practiced was to create a LAN-to-LAN VPN between two Pfsense firewalls, by using IPSEC protocols.
I succeeded, with both firewalls in the same network. But I'm wondering if it's possible to do the same thing, with 2 Pfsense firewalls...
|
by: muto222 |
last post by:
How can i add a mobile payment intergratation into php mysql website.
| |
by: bsmnconsultancy |
last post by:
In today's digital era, a well-designed website is crucial for businesses looking to succeed. Whether you're a small business owner or a large corporation in Toronto, having a strong online presence can significantly impact your brand's success. BSMN Consultancy, a leader in Website Development in Toronto offers valuable insights into creating effective websites that not only look great but also perform exceptionally well. In this comprehensive...
| |