I need help with this one. I\'m studying for my final andtrying to figure this p

Question

I need help with this one. I'm studying for my final andtrying to figure this problem out but don't understand how to.

Balanced Multiple Delimiters
A string may use more than one type of delimiter to bracketinformation into "blocks." For example, a string may usebraces { }, parentheses ( ), and brackets [ ] as delimiters. A string is properly delimited if each right delimiter is matchedwith a preceding left delimiter of the same type in such a way thateither the resulting blocks of information are disjoint, or one ofthem is completely nested within the other. Write a programthat uses a single stack to check whether a string containingbraces, parentheses, and brackets is properly delimted.

Explanation / Answer

please rate - thanks #include using namespace std; char pop(char[], int& ); void push(char[],int&,int, char) ; int main() { int n=0,i=0,j,maxsize=20; char stack[maxsize],m=' '; char delimin[3]={'{','(','['}; char delimout[3]={'}',')',']'}; string input; coutinput; while(input[i]!=''&&m!='z') {//cout

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---