OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: recognize bracket operator

Browse Source
This commit is contained in:
Harsh Karande 2020-10-19 10:29:02 +05:30
parent 4f37a67cbd
commit c3142724fb
1 changed files with 32 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
conversions/infix_to_postfix.c
View File

@ -129,7 +129,7 @@ void convert(char infix[], char postfix[])
s.tos = -1; // initalize the tos
int i, j = 0, pr;
char ch;
char ch, temp;
for (i = 0; infix[i] != '\0'; i++)
{
@ -141,14 +141,32 @@ void convert(char infix[], char postfix[])
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 = prcnd(ch, s.arr[s.tos]); // check operator precedence
pr = prcnd(ch,
s.arr[s.tos]); // check operator precedence
if (pr == 1)
{
break; // if ch has a greater precedence than s.arr[s.tos]
break; // if ch has a greater precedence than
// s.arr[s.top]
}
postfix[j] = pop(&s);
@ -158,6 +176,8 @@ void convert(char infix[], char postfix[])
push(&s, ch); // push ch to stack
}
}
}
}
while (isEmpty(s) == 0) // check if stack is empty
{