infix to postfix?

[Gldnbr]

Hello cplusplus members,

I have not done programming in quite awhile, so I'd like to ask a few questions on how to do things.

Is there any way to read a line character by character and store them somewhere like a linked list or even maybe a stack. And keep storing until you read a specific character?

For example (reading from a text file):

ABC+123=

What I would like to do is store ABC in one list, then store the + in another, then store 123 in the first list and then the equal sign would call an end.
I think it's something like inFix to postFix.

So, ABC translated to decimal would be 2748.
Therefore the math problem would become 2748+123=
Then it would solve it out, 2748+123=2871

The ABC would represent hexadecimals, so, A = 10, B = 11, C = 12. If I'm not mistaken, we'd have to use some table to translate the letters into numbers, then I could calculate it to decimal using a formula (I can do this).

I'm not an extreme expert or anything, so don't get too technical, if my way of doing it above is incorrect, then please point me to the right direction.

[kbw]

You're still using infix. It seems you're concerned with converting base 16 (or higher) to decimal.