Here's the problem:

I need to create a class "String" that is implemented as a linked list. This class should include the following string operations:
• String input and output
• A function which returns the string length
• A function which returns the nth character, where the first character is number 1
• Overloaded operators = (assignment), ==, !=, <, >, <= and >= (relational).

I then need to write a class "N" as a subclass of class "String". This class "N" should include an isPostfix Boolean function which determines whether or not a String is a postfix expression, where the operands of the expression are a single lowercase letter, and the operator is +, -, * or /. I will not have to evaluate any postfix expressions.

Does anyone know how do do this or has done this before? Any help would be greatly appreciated. thanks.

What you describe is simply a standard linked list structure wrapped with various C++ amenities. My recommendation is to:

• first write code to implement a linked list.
• coming up with the string's length should be obvious -- count while traversing the list.
• finding the nth character is just a variation on this same theme.
• adding operator overloading functionality is yet another variation still.

If you run into trouble, post code (with [cpp before, & [/cpp] afterwards...) & ask specific questions.

Make that [cpp] before, & [/cpp] afterwards.

ocicat,

Thank you for suggesting the correct tags (to use). You may want to use the NOPARSE tag yourself e.g.:


Make that [cpp] before, & [/cpp] afterwards.


You can review how I posted that by clicking on the "Reply With Quote" button of this post... I think