Guest_imported
New member
- Jan 1, 1970
- 0
Hi there,
Just wondering if anyone has any help with the following problem. I have to write a program in C that converts an infix expression to a postfix expression using Dijkstra’s shunting algorithm for a college assignment. This has to be done using a stack.
the infix expression contains no more than 50 characters
the operands are single charaters
the operands are letters
there is a single stack
the input is of the form a+b+c and does not contain spaces
Any help would be appreciated as i have little c understanding.
Thanks
Just wondering if anyone has any help with the following problem. I have to write a program in C that converts an infix expression to a postfix expression using Dijkstra’s shunting algorithm for a college assignment. This has to be done using a stack.
the infix expression contains no more than 50 characters
the operands are single charaters
the operands are letters
there is a single stack
the input is of the form a+b+c and does not contain spaces
Any help would be appreciated as i have little c understanding.
Thanks