write this code on java
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 16PE:
The implementation of a queue in an array, as given in this chapter, uses the variable count to...
Related questions
Topic Video
Question
write this code on java
![Creates a Stack object and initalizes the
Stack using constructor.
• The size of the stack is determined by
expression's length.
• Whenever an opening bracket is found, it is
put onto the stack.
• Whenever a closing bracket is found, an
item is popped from the top of the Stack to
match that with the closing bracket.
• That means if an opening bracket is found
for that type from the Stack, then it goes on
checking the next one in a similar way until
the string ends and stack is empty.
DelimiterMatching
+ isDelimiterMatching(imputExpr: String) : bolean
Now write the main class named TestDelimiter in which you will have the main method.
// Create an object of DelimiterMatching class
I/ Initialize a String variable with your expression
// Call the isDelimiterMatching() method using the object of DelimiterMatching class
and see the result for that expression.
Sample Output:
Output:
{(a+b)*(c+d)} == true
{(a+b)+[x*(c+d)]} == true
Mismatch found: } at 15
{(a+b)+[x*(c+d}} == false](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe8dd1655-9fc7-411a-a861-fd85f7094503%2F08f3dba3-95e3-4197-99ee-0018659a4939%2Fs4q4756_processed.png&w=3840&q=75)
Transcribed Image Text:Creates a Stack object and initalizes the
Stack using constructor.
• The size of the stack is determined by
expression's length.
• Whenever an opening bracket is found, it is
put onto the stack.
• Whenever a closing bracket is found, an
item is popped from the top of the Stack to
match that with the closing bracket.
• That means if an opening bracket is found
for that type from the Stack, then it goes on
checking the next one in a similar way until
the string ends and stack is empty.
DelimiterMatching
+ isDelimiterMatching(imputExpr: String) : bolean
Now write the main class named TestDelimiter in which you will have the main method.
// Create an object of DelimiterMatching class
I/ Initialize a String variable with your expression
// Call the isDelimiterMatching() method using the object of DelimiterMatching class
and see the result for that expression.
Sample Output:
Output:
{(a+b)*(c+d)} == true
{(a+b)+[x*(c+d)]} == true
Mismatch found: } at 15
{(a+b)+[x*(c+d}} == false
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 4 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning