20.22: LAB Program: Text message decoder 20.22 LAB*: Program: Text message decoder LAB ACTIVITY 20.22.1: LAB*: Program: Text message decoder Full screen 0/6 Program Specifications Write a program that reads a line of text message and identifies any supported abbreviations in the text. Note: This program is designed for incremental development. Complete each step and submit for grading before starting the next step. Only a portion of tests pass after each step but confirm progress. Step 1 (3 pts): Read and verify user input. Use getline () to read a line of user input into a string. Output the string. Submit for grading to confirm 2 tests pass. Ex: If the input is: Enter text: IDK if I'11 go. It's my BFF's birthday. the output is: You entered: IDK if I'11 go. It's my BFF's birthday. Step 2 (3 pts): Identify abbreviations. Search the string (by using Eind ()) for any supported abbreviations and print a list of found abbreviations along with the decoded meaning. Assume each unique abbreviation appears only once in the message. Print each abbreviation in the same order as shown in the supported abbreviations list: BFF-best friend forever IDK-I don't know JK-just kidding TMI-too much information . TTYL-talk to you later Submit for grading to confirm all tests pass. Ex: If the input is: Enter text: IDK if I'll go. It's my BFF's birthday. the output is: You entered: IDK if I'll go. It's my BFF's birthday. BFF: best friend forever IDK: I don't know. Open new tab ENG Dock 04 10:46 PM Ņ
20.22: LAB Program: Text message decoder 20.22 LAB*: Program: Text message decoder LAB ACTIVITY 20.22.1: LAB*: Program: Text message decoder Full screen 0/6 Program Specifications Write a program that reads a line of text message and identifies any supported abbreviations in the text. Note: This program is designed for incremental development. Complete each step and submit for grading before starting the next step. Only a portion of tests pass after each step but confirm progress. Step 1 (3 pts): Read and verify user input. Use getline () to read a line of user input into a string. Output the string. Submit for grading to confirm 2 tests pass. Ex: If the input is: Enter text: IDK if I'11 go. It's my BFF's birthday. the output is: You entered: IDK if I'11 go. It's my BFF's birthday. Step 2 (3 pts): Identify abbreviations. Search the string (by using Eind ()) for any supported abbreviations and print a list of found abbreviations along with the decoded meaning. Assume each unique abbreviation appears only once in the message. Print each abbreviation in the same order as shown in the supported abbreviations list: BFF-best friend forever IDK-I don't know JK-just kidding TMI-too much information . TTYL-talk to you later Submit for grading to confirm all tests pass. Ex: If the input is: Enter text: IDK if I'll go. It's my BFF's birthday. the output is: You entered: IDK if I'll go. It's my BFF's birthday. BFF: best friend forever IDK: I don't know. Open new tab ENG Dock 04 10:46 PM Ņ
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 5PE
Related questions
Question
Transcribed Image Text:20.22: LAB Program: Text message decoder
20.22 LAB*: Program: Text message decoder
LAB
ACTIVITY
20.22.1: LAB*: Program: Text message decoder
Full screen
0/6
Program Specifications Write a program that reads a line of text message and identifies any supported
abbreviations in the text.
Note: This program is designed for incremental development. Complete each step and submit for grading before
starting the next step. Only a portion of tests pass after each step but confirm progress.
Step 1 (3 pts): Read and verify user input.
Use getline () to read a line of user input into a string. Output the string. Submit for grading to confirm 2 tests
pass.
Ex: If the input is:
Enter text:
IDK if I'11 go. It's my BFF's birthday.
the output is:
You entered: IDK if I'11 go. It's my BFF's birthday.
Step 2 (3 pts): Identify abbreviations.
Search the string (by using Eind ()) for any supported abbreviations and print a list of found abbreviations along
with the decoded meaning. Assume each unique abbreviation appears only once in the message. Print each
abbreviation in the same order as shown in the supported abbreviations list:
BFF-best friend forever
IDK-I don't know
JK-just kidding
TMI-too much information
.
TTYL-talk to you later
Submit for grading to confirm all tests pass.
Ex: If the input is:
Enter text:
IDK if I'll go. It's my BFF's birthday.
the output is:
You entered: IDK if I'll go. It's my BFF's birthday.
BFF: best friend forever
IDK: I don't know.
Open new tab
ENG
Dock
04
10:46 PM
Ņ
Expert Solution
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 5 images
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:
9781337102124
Author:
Diane Zak
Publisher:
Cengage Learning