Using java language please and if you can explain each step would be amazing.

Regarding the 2nd question, can you show and explain how to have the method read from a text file and outputs to another text file while having the output text file showing exactly like the 2nd picture?

Transcribed Image Text:

Consider the following method matchBrackets for brackets matching: public static boolean matchBrackets (String str) Arraystacks = new Arraystack (100) ; char ch; for (int i=0; i<str.length (); ++i) { ch=str.charAt (i); if (ch=='{' || ch==' (' l|ch=='[' ) { S.push (ch); } else if (ch=='}' || ch==')' ||ch==']' ) { if (s.isEmpty ()) return false; switch (S.pop ()) { case '{': if (ch!='}') return false; break; case '[': if(ch!=']') return false; if (ch!=')') break; break; case '(': }//End of switch return false; } // End of for loop if (s.isEmpty ()) return true; else return false; }//End of method matchBrackets 1. Rewrite the above method using recursion, keeping the same variables. You may add more arguments to matchBrackets. 2. Test the above recursive method in main() that reads several expressions from an input file "MatchExpression.txt"and writes the results in a output file "MatchResults.txt". Test your program using the following expressions stored in "MatchExpression.txt": () ()){([() 1) } ((() (()){([() 1)} ({[]}) {[]} () ) (()){([()) } Consider the following method matchBrackets for brackets matching: public static boolean matchBrackets (String str) Arraystacks = new Arraystack (100) ; char ch; for (int i=0; i<str.length (); ++i) { ch=str.charAt (i); if (ch=='{' || ch==' (' l|ch=='[' ) { S.push (ch); } else if (ch=='}' || ch==')' ||ch==']' ) { if (s.isEmpty ()) return false; switch (S.pop ()) { case '{': if (ch!='}') return false; break; case '[': if(ch!=']') return false; if (ch!=')') break; break; case '(': }//End of switch return false; } // End of for loop if (s.isEmpty ()) return true; else return false; }//End of method matchBrackets 1. Rewrite the above method using recursion, keeping the same variables. You may add more arguments to matchBrackets. 2. Test the above recursive method in main() that reads several expressions from an input file "MatchExpression.txt"and writes the results in a output file "MatchResults.txt". Test your program using the following expressions stored in "MatchExpression.txt": () ()){([() 1) } ((() (()){([() 1)} ({[]}) {[]} () ) (()){([()) }

Answer rating: 100% (QA)

PLEASE LIKE THE SOLUTION FEEL FREE TO DISCUSS IN COMMENT SECTION A java program to check balanced pa... View the full answer