Click here to Skip to main content
13,193,048 members (85,432 online)
Rate this:
Please Sign up or sign in to vote.
See more:
Someone help me with this problem, please. I've an exam tomorrow. So please help me solve me immediately.
Posted 25-Jan-13 23:24pm

1 solution

Rate this: bad
Please Sign up or sign in to vote.

Solution 1

It would be best if you did your own homework. It is given to you so that you will learn something, think about what have been taught. Read your text books and give it a try.

Try searching on the internet, there are enough resources to get you started.
For example: A generic stack class[^].

Once you have code and run into problems you can always come back here with a more specific question and the community will do its best to help you. Don't forget to post only the relevant code bits that pose the problem as a code dump is not usually helpful at all in getting someone to help/assist you.

Good luck and happy coding.
Matthew Faithfull 26-Jan-13 7:20am
As I have no doubt your instructors have told you one of the search terms you're looking for is 'reverse polish'. Many 'recursive descent parsers' use a stack to implement reverse polish expression evaluation. Herbert Schildt even wrote a book with a complete C++ example in it that I have somewhere. I'm sure you'll do just fine in the exam.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
Top Experts
Last 24hrsThis month

Advertise | Privacy |
Web03 | 2.8.171017.2 | Last Updated 26 Jan 2013
Copyright © CodeProject, 1999-2017
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100