Include this code:public static boolean isMatched(String expression) {final String opening = "({["; // opening delimitersfinal String closing = ")}]"; // respective closing delimitersStack<Character> buffer = new LinkedStack<>( ); // Using Textbook ADT, not Java libraryfor (char c : expression.toCharArray( )) {if (opening.indexOf(c) != −1) // this is a left delimiterbuffer.push(c);else if (closing.indexOf(c) != −1) { // this is a right delimiterif (buffer.isEmpty( )) // nothing to match withreturn false;if (closing.indexOf(c) != opening.indexOf(buffer.pop( )))return false; // mismatched delimiter}}return buffer.isEmpty( ); } Create a Java program to do the following using console input/output:a. Read in a string from the userb. Output "Valid" if the string contains a valid parenthesis pattern.c. Output "Invalid" if the string contains an invalid parenthesis pattern.A stack or queue is usually the easiest way to do this.In addition to user input, please hard-code the test cases into the main program so youdon't have to input them manually each time. The program must still work on arbitraryinput strings, not just the test cases.Examples:Test case input(We like ([your name here]))Life is easyLife is (fun)(We never) (forget)Call_Me()(1 (2 (3)(We all hate ([your least favoriteband name here])This is terrible. (((((())(0)0)(OutputValidValidValidValidValidInvalidInvalidInvalidInvalid

The solution is given below for the above given question:

Answered: Create a Java program to do the…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Include this code:

public static boolean isMatched(String expression) {
final String opening = "({["; // opening delimiters
final String closing = ")}]"; // respective closing delimiters
Stack<Character> buffer = new LinkedStack<>( ); // Using Textbook ADT, not Java library
for (char c : expression.toCharArray( )) {
if (opening.indexOf(c) != −1) // this is a left delimiter
buffer.push(c);
else if (closing.indexOf(c) != −1) { // this is a right delimiter
if (buffer.isEmpty( )) // nothing to match with
return false;
if (closing.indexOf(c) != opening.indexOf(buffer.pop( )))
return false; // mismatched delimiter
}
}
return buffer.isEmpty( );
}