Postfix to infix conversion using stacks











up vote
-1
down vote

favorite












Can someone fix the error?



typedef struct stack
{
int top;
char arr[MAX][MAX];
} stack;

void push(stack *s, char ele)
{
if (s->top == MAX - 1)
{
printf("OVERFLOW");
}
else
{
s->arr[++s->top][MAX] = ele;
}
}

char pop(stack *s)
{
if (s->top == -1)
{
printf("UNDERFLOW");
}
else
{
return s->arr[s->top--][MAX];
}
}

int isOperand(char c)
{
if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
return 1;
else
return 0;
}

char conversion(stack *s, char expr)
{
int i, op1, op2, op, l;
char j[20];
l = strlen(expr);
for (i = 0; i < l; i++)
{
if ((isOperand(expr[i])) == 1)
{
push(s, expr[i]);
printf("%cn", s->arr[s->top][MAX]);
}
else
{
op2 = pop(s);
op1 = pop(s);
printf("%cn", op2);
printf("%cn", op1);
snprintf(j, 20, "%s: %s: %s: %s: %s:", '(', op1, expr[i], op2, ')');
push(s, j);
printf("%cn", s->arr[s->top][MAX]);
}
}
return pop(s);
}

int main(void)
{
stack ps;
ps.top = -1;
char expr = "ab*c+";
printf("%cn", conversion(&ps, expr));
return 0;
}


There's an error here. I'm unable to concatenate expression (a*b); it's actually not entering the stack. It pushes and pops single characters but with multiple characters it isn't happening. The problem is in the line of snprintf after concatenating; it's not getting pushed in stack.










share|improve this question
























  • What does this have to do with pointers?
    – Scott Hunter
    Nov 11 at 21:17










  • Welcome to Stack Overflow. Please read the About and How to Ask pages now. You also need to read about how to create an MCVE (Minimal, Complete, and Verifiable example). Amongst other details, that means you'll provide compilable code (or you'll detail the errors you get that prevent it compiling), and you'll describe the input etc. Your code isn't indented which makes it hard to read — in future, please indent your code using spaces (not tabs). Copy'n'paste the code, then select it, then use the {} button above the edit box to indent it as code.
    – Jonathan Leffler
    Nov 11 at 23:07










  • s->arr[++s->top][MAX] = ele; is a single assigment and is also undefiend behaviour if s->top == MAX. You should use strcpy to copy strings, you are only copying the pointers to strings, and all point to the variable j inside conversion function.
    – Kamil Cuk
    Nov 12 at 1:38










  • when im using strcpy im getting a segmentation falt
    – user10598529
    Nov 12 at 9:41










  • @jonathanLeffler okay thanks will do so ..can u help me fix my error?
    – user10598529
    Nov 12 at 10:44















up vote
-1
down vote

favorite












Can someone fix the error?



typedef struct stack
{
int top;
char arr[MAX][MAX];
} stack;

void push(stack *s, char ele)
{
if (s->top == MAX - 1)
{
printf("OVERFLOW");
}
else
{
s->arr[++s->top][MAX] = ele;
}
}

char pop(stack *s)
{
if (s->top == -1)
{
printf("UNDERFLOW");
}
else
{
return s->arr[s->top--][MAX];
}
}

int isOperand(char c)
{
if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
return 1;
else
return 0;
}

char conversion(stack *s, char expr)
{
int i, op1, op2, op, l;
char j[20];
l = strlen(expr);
for (i = 0; i < l; i++)
{
if ((isOperand(expr[i])) == 1)
{
push(s, expr[i]);
printf("%cn", s->arr[s->top][MAX]);
}
else
{
op2 = pop(s);
op1 = pop(s);
printf("%cn", op2);
printf("%cn", op1);
snprintf(j, 20, "%s: %s: %s: %s: %s:", '(', op1, expr[i], op2, ')');
push(s, j);
printf("%cn", s->arr[s->top][MAX]);
}
}
return pop(s);
}

int main(void)
{
stack ps;
ps.top = -1;
char expr = "ab*c+";
printf("%cn", conversion(&ps, expr));
return 0;
}


There's an error here. I'm unable to concatenate expression (a*b); it's actually not entering the stack. It pushes and pops single characters but with multiple characters it isn't happening. The problem is in the line of snprintf after concatenating; it's not getting pushed in stack.










share|improve this question
























  • What does this have to do with pointers?
    – Scott Hunter
    Nov 11 at 21:17










  • Welcome to Stack Overflow. Please read the About and How to Ask pages now. You also need to read about how to create an MCVE (Minimal, Complete, and Verifiable example). Amongst other details, that means you'll provide compilable code (or you'll detail the errors you get that prevent it compiling), and you'll describe the input etc. Your code isn't indented which makes it hard to read — in future, please indent your code using spaces (not tabs). Copy'n'paste the code, then select it, then use the {} button above the edit box to indent it as code.
    – Jonathan Leffler
    Nov 11 at 23:07










  • s->arr[++s->top][MAX] = ele; is a single assigment and is also undefiend behaviour if s->top == MAX. You should use strcpy to copy strings, you are only copying the pointers to strings, and all point to the variable j inside conversion function.
    – Kamil Cuk
    Nov 12 at 1:38










  • when im using strcpy im getting a segmentation falt
    – user10598529
    Nov 12 at 9:41










  • @jonathanLeffler okay thanks will do so ..can u help me fix my error?
    – user10598529
    Nov 12 at 10:44













up vote
-1
down vote

favorite









up vote
-1
down vote

favorite











Can someone fix the error?



typedef struct stack
{
int top;
char arr[MAX][MAX];
} stack;

void push(stack *s, char ele)
{
if (s->top == MAX - 1)
{
printf("OVERFLOW");
}
else
{
s->arr[++s->top][MAX] = ele;
}
}

char pop(stack *s)
{
if (s->top == -1)
{
printf("UNDERFLOW");
}
else
{
return s->arr[s->top--][MAX];
}
}

int isOperand(char c)
{
if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
return 1;
else
return 0;
}

char conversion(stack *s, char expr)
{
int i, op1, op2, op, l;
char j[20];
l = strlen(expr);
for (i = 0; i < l; i++)
{
if ((isOperand(expr[i])) == 1)
{
push(s, expr[i]);
printf("%cn", s->arr[s->top][MAX]);
}
else
{
op2 = pop(s);
op1 = pop(s);
printf("%cn", op2);
printf("%cn", op1);
snprintf(j, 20, "%s: %s: %s: %s: %s:", '(', op1, expr[i], op2, ')');
push(s, j);
printf("%cn", s->arr[s->top][MAX]);
}
}
return pop(s);
}

int main(void)
{
stack ps;
ps.top = -1;
char expr = "ab*c+";
printf("%cn", conversion(&ps, expr));
return 0;
}


There's an error here. I'm unable to concatenate expression (a*b); it's actually not entering the stack. It pushes and pops single characters but with multiple characters it isn't happening. The problem is in the line of snprintf after concatenating; it's not getting pushed in stack.










share|improve this question















Can someone fix the error?



typedef struct stack
{
int top;
char arr[MAX][MAX];
} stack;

void push(stack *s, char ele)
{
if (s->top == MAX - 1)
{
printf("OVERFLOW");
}
else
{
s->arr[++s->top][MAX] = ele;
}
}

char pop(stack *s)
{
if (s->top == -1)
{
printf("UNDERFLOW");
}
else
{
return s->arr[s->top--][MAX];
}
}

int isOperand(char c)
{
if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
return 1;
else
return 0;
}

char conversion(stack *s, char expr)
{
int i, op1, op2, op, l;
char j[20];
l = strlen(expr);
for (i = 0; i < l; i++)
{
if ((isOperand(expr[i])) == 1)
{
push(s, expr[i]);
printf("%cn", s->arr[s->top][MAX]);
}
else
{
op2 = pop(s);
op1 = pop(s);
printf("%cn", op2);
printf("%cn", op1);
snprintf(j, 20, "%s: %s: %s: %s: %s:", '(', op1, expr[i], op2, ')');
push(s, j);
printf("%cn", s->arr[s->top][MAX]);
}
}
return pop(s);
}

int main(void)
{
stack ps;
ps.top = -1;
char expr = "ab*c+";
printf("%cn", conversion(&ps, expr));
return 0;
}


There's an error here. I'm unable to concatenate expression (a*b); it's actually not entering the stack. It pushes and pops single characters but with multiple characters it isn't happening. The problem is in the line of snprintf after concatenating; it's not getting pushed in stack.







c char






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Nov 11 at 23:09









Jonathan Leffler

557k896641016




557k896641016










asked Nov 11 at 21:11









user10598529

1




1












  • What does this have to do with pointers?
    – Scott Hunter
    Nov 11 at 21:17










  • Welcome to Stack Overflow. Please read the About and How to Ask pages now. You also need to read about how to create an MCVE (Minimal, Complete, and Verifiable example). Amongst other details, that means you'll provide compilable code (or you'll detail the errors you get that prevent it compiling), and you'll describe the input etc. Your code isn't indented which makes it hard to read — in future, please indent your code using spaces (not tabs). Copy'n'paste the code, then select it, then use the {} button above the edit box to indent it as code.
    – Jonathan Leffler
    Nov 11 at 23:07










  • s->arr[++s->top][MAX] = ele; is a single assigment and is also undefiend behaviour if s->top == MAX. You should use strcpy to copy strings, you are only copying the pointers to strings, and all point to the variable j inside conversion function.
    – Kamil Cuk
    Nov 12 at 1:38










  • when im using strcpy im getting a segmentation falt
    – user10598529
    Nov 12 at 9:41










  • @jonathanLeffler okay thanks will do so ..can u help me fix my error?
    – user10598529
    Nov 12 at 10:44


















  • What does this have to do with pointers?
    – Scott Hunter
    Nov 11 at 21:17










  • Welcome to Stack Overflow. Please read the About and How to Ask pages now. You also need to read about how to create an MCVE (Minimal, Complete, and Verifiable example). Amongst other details, that means you'll provide compilable code (or you'll detail the errors you get that prevent it compiling), and you'll describe the input etc. Your code isn't indented which makes it hard to read — in future, please indent your code using spaces (not tabs). Copy'n'paste the code, then select it, then use the {} button above the edit box to indent it as code.
    – Jonathan Leffler
    Nov 11 at 23:07










  • s->arr[++s->top][MAX] = ele; is a single assigment and is also undefiend behaviour if s->top == MAX. You should use strcpy to copy strings, you are only copying the pointers to strings, and all point to the variable j inside conversion function.
    – Kamil Cuk
    Nov 12 at 1:38










  • when im using strcpy im getting a segmentation falt
    – user10598529
    Nov 12 at 9:41










  • @jonathanLeffler okay thanks will do so ..can u help me fix my error?
    – user10598529
    Nov 12 at 10:44
















What does this have to do with pointers?
– Scott Hunter
Nov 11 at 21:17




What does this have to do with pointers?
– Scott Hunter
Nov 11 at 21:17












Welcome to Stack Overflow. Please read the About and How to Ask pages now. You also need to read about how to create an MCVE (Minimal, Complete, and Verifiable example). Amongst other details, that means you'll provide compilable code (or you'll detail the errors you get that prevent it compiling), and you'll describe the input etc. Your code isn't indented which makes it hard to read — in future, please indent your code using spaces (not tabs). Copy'n'paste the code, then select it, then use the {} button above the edit box to indent it as code.
– Jonathan Leffler
Nov 11 at 23:07




Welcome to Stack Overflow. Please read the About and How to Ask pages now. You also need to read about how to create an MCVE (Minimal, Complete, and Verifiable example). Amongst other details, that means you'll provide compilable code (or you'll detail the errors you get that prevent it compiling), and you'll describe the input etc. Your code isn't indented which makes it hard to read — in future, please indent your code using spaces (not tabs). Copy'n'paste the code, then select it, then use the {} button above the edit box to indent it as code.
– Jonathan Leffler
Nov 11 at 23:07












s->arr[++s->top][MAX] = ele; is a single assigment and is also undefiend behaviour if s->top == MAX. You should use strcpy to copy strings, you are only copying the pointers to strings, and all point to the variable j inside conversion function.
– Kamil Cuk
Nov 12 at 1:38




s->arr[++s->top][MAX] = ele; is a single assigment and is also undefiend behaviour if s->top == MAX. You should use strcpy to copy strings, you are only copying the pointers to strings, and all point to the variable j inside conversion function.
– Kamil Cuk
Nov 12 at 1:38












when im using strcpy im getting a segmentation falt
– user10598529
Nov 12 at 9:41




when im using strcpy im getting a segmentation falt
– user10598529
Nov 12 at 9:41












@jonathanLeffler okay thanks will do so ..can u help me fix my error?
– user10598529
Nov 12 at 10:44




@jonathanLeffler okay thanks will do so ..can u help me fix my error?
– user10598529
Nov 12 at 10:44

















active

oldest

votes











Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53253273%2fpostfix-to-infix-conversion-using-stacks%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Stack Overflow!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53253273%2fpostfix-to-infix-conversion-using-stacks%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Guess what letter conforming each word

Port of Spain

Run scheduled task as local user group (not BUILTIN)