I have c++ code from the internet where you convert an infix expression to a postfix expression. I want to know how can it be edited so that it can convert numbers with decimals.

Link: https://www.geeksforgeeks.org/stack-set-2-infix-to-postfix/

void infixToPostfix(string s)

{

std::stack st;

st.push('N');

int l = s.length();

string ns;

for(int i = 0; i < l; i++)

{

// If the scanned character is an operand, add it to output string.

if((s[i] >= 'a' && s[i] <= 'z')||(s[i] >= 'A' && s[i] <= 'Z'))

ns+=s[i];

// If the scanned character is an (, push it to the stack.

else if(s[i] == '(')

st.push('(');

// If the scanned character is an ), pop and to output string from the stack

// until an ( is encountered.

else if(s[i] == ')')

{

while(st.top() != 'N' && st.top() != '(')

{

char c = st.top();

st.pop();

ns += c;

}

if(st.top() == '(')

{

char c = st.top();

st.pop();

}

}

//If an operator is scanned

else{

while(st.top() != 'N' && prec(s[i]) <= prec(st.top()))

{

char c = st.top();

st.pop();

ns += c;

}

st.push(s[i]);

}

}

//Pop all the remaining elements from the stack

while(st.top() != 'N')

{

char c = st.top();

st.pop();

ns += c;

}

cout << ns << endl;

}

//Driver program to test above functions

int main()

{

string exp = "a+b*(c^d-e)^(f+g*h)-i";

infixToPostfix(exp);

return 0;

}

// This code is contributed by Gautam Singh