Create a Java program that determines if two (2) words rhyme.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Create a Java program that determines if two (2) words rhyme. 

Create a Java program that determines if two (2) words rhyme.
1. Write the import statements to be able to use Scanner, Pattern, and Matcher.
2. Enable user input.
3. Create three (3) String variables.
word1 shall store the first word.
• word2 shall store the second word.
• sub shall store the last two (2) letters of word1.
4. Initialize a Pattern as defined by the regular expression "L _____}" + sub +*" For the first blank, allow uppercase and lowercase letters. For the second blank, allow either 1 or 2 letters before
sub (contains the last two (2) letters of word 1).
5. Initialize a Matcher to store a possible match between your pattern and word2.
6. Use the matches() method to check if the two (2) words rhyme.
Sample Output:
Enter the first word: glam
Enter the second word: slam
slam rhymes with glam
//word2 has 2 letters before 'am'
Enter the first word: glam
Enter the second word: ham
ham rhymes with glam
//word2 only has 1 letter before 'am'
Enter the first word: beat
Enter the second word: treat
I'm not sure! Sorry!
//word2 has more than 2 letters before 'at'
Transcribed Image Text:Create a Java program that determines if two (2) words rhyme. 1. Write the import statements to be able to use Scanner, Pattern, and Matcher. 2. Enable user input. 3. Create three (3) String variables. word1 shall store the first word. • word2 shall store the second word. • sub shall store the last two (2) letters of word1. 4. Initialize a Pattern as defined by the regular expression "L _____}" + sub +*" For the first blank, allow uppercase and lowercase letters. For the second blank, allow either 1 or 2 letters before sub (contains the last two (2) letters of word 1). 5. Initialize a Matcher to store a possible match between your pattern and word2. 6. Use the matches() method to check if the two (2) words rhyme. Sample Output: Enter the first word: glam Enter the second word: slam slam rhymes with glam //word2 has 2 letters before 'am' Enter the first word: glam Enter the second word: ham ham rhymes with glam //word2 only has 1 letter before 'am' Enter the first word: beat Enter the second word: treat I'm not sure! Sorry! //word2 has more than 2 letters before 'at'
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Files and Directory
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
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education