Write a class that would match a string. The class has method match with String as a return type. It accepts two inputs: the phrase/sentence string (text) and the pattern string (word). This method finds the first (or all) instances of the pattern in the text and changes that word in all uppercase and return the new phrase. Method countOccurence accepts a phrase/sentence and a pattern string and returns its number of occurrences. Add a main method that will allow the user to input the phrase/sentence and pattern. Call method match and countOccurence. See test case below. Sample Input: Text string: You will always have my love, my love, for the love I love is as lovely as love itself. Pattern string: love Output: New text: You will always have my LOVE, my LOVE, for the LOVE I LOVE is as lovely as LOVE itself. Number of occurrence: 5 For example:
Write a class that would match a string. The class has method match with String as a return type. It accepts two inputs: the phrase/sentence string (text) and the pattern string (word). This method finds the first (or all) instances of the pattern in the text and changes that word in all uppercase and return the new phrase. Method countOccurence accepts a phrase/sentence and a pattern string and returns its number of occurrences. Add a main method that will allow the user to input the phrase/sentence and pattern. Call method match and countOccurence. See test case below. Sample Input: Text string: You will always have my love, my love, for the love I love is as lovely as love itself. Pattern string: love Output: New text: You will always have my LOVE, my LOVE, for the LOVE I LOVE is as lovely as LOVE itself. Number of occurrence: 5 For example:
Chapter16: Graphics
Section: Chapter Questions
Problem 14RQ
Related questions
Question
JAVA PROGRAM
SEE ATTACHED PHOTO FOR THE PROBLEM
![Write a class that would match a string. The class has method match with String as a return type. It accepts two inputs: the
phrase/sentence string (text) and the pattern string (word). This method finds the first (or all) instances of the pattern in the text and
changes that word in all uppercase and return the new phrase. Method countOccurence accepts a phrase/sentence and a pattern string
and returns its number of occurrences.
Add a main method that will allow the user to input the phrase/sentence and pattern. Call method match and countOccurence. See test
case below.
Sample Input:
Text string: You will always have my love, my love, for the love I love is as lovely as love itself.
Pattern string: love
Output:
New text: You will always have my LOVE, my LOVE, for the LOVE I LOVE is as lovely as LOVE itself.
Number of occurrence: 5
For example:
Input
Result
You will always have my love, my love, for the love I love is as lovely as love itself. New text: You will always have my 1
love
Number of occurrence: 5](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc82f8d1f-3e63-48dd-96cb-aeacf62c356a%2F7aa550eb-33d4-4ff2-b61d-9bfc7fbb8d55%2F72hoozc_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Write a class that would match a string. The class has method match with String as a return type. It accepts two inputs: the
phrase/sentence string (text) and the pattern string (word). This method finds the first (or all) instances of the pattern in the text and
changes that word in all uppercase and return the new phrase. Method countOccurence accepts a phrase/sentence and a pattern string
and returns its number of occurrences.
Add a main method that will allow the user to input the phrase/sentence and pattern. Call method match and countOccurence. See test
case below.
Sample Input:
Text string: You will always have my love, my love, for the love I love is as lovely as love itself.
Pattern string: love
Output:
New text: You will always have my LOVE, my LOVE, for the LOVE I LOVE is as lovely as LOVE itself.
Number of occurrence: 5
For example:
Input
Result
You will always have my love, my love, for the love I love is as lovely as love itself. New text: You will always have my 1
love
Number of occurrence: 5
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 3 steps with 1 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
![EBK JAVA PROGRAMMING](https://www.bartleby.com/isbn_cover_images/9781305480537/9781305480537_smallCoverImage.jpg)
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781305480537
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
![EBK JAVA PROGRAMMING](https://www.bartleby.com/isbn_cover_images/9781305480537/9781305480537_smallCoverImage.jpg)
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781305480537
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT