Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
The filter words counts the number of words in input as long as each word is separated from the next by one or more spaces. Modify the program so that it makes explicit tests for the space, tab and newline characters. Make sure it also counts the last word in a line which doesn't end in a newline.

The filter words counts the number of words in input as long as each word is separated from the next by one or more spaces. Modify the program so that it makes explicit tests for the space, tab and newline characters. Make sure it also counts the last word in a line which doesn't end in a newline.

Computer Networking: A Top-Down Approach (7th Edition)
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
icon
Related questions
Question

Please help in C++

The filter words counts the number of words in input as long as each word is separated from the next by one or more spaces. Modify the program so that it makes explicit tests for the space, tab and newline characters. Make sure it also counts the last word in a line which doesn't end in a newline. words.cpp 1. #include <iostrean> 2 using namespace std; 3 4 /** A state filter which counts words that are separated by spaces. */ int main() 5 6 8 // haven't read anything yet // so we have no words 10 bool inAWord(false); int words(0); 11 12 13 char ch; 14 while (cin.get(ch)) { if (ch ) 15 16 // any whitespace character 17 18 if (inAWord) // transition leaving a word 19 inAWord = false; words++; 20 21 22 23 } else 24 25 { inAWord = true; 26 27 28 29 30 cout « "There were " « words « " words." « endl; 31 } CodeCheck Reset
Transcribed Image Text:The filter words counts the number of words in input as long as each word is separated from the next by one or more spaces. Modify the program so that it makes explicit tests for the space, tab and newline characters. Make sure it also counts the last word in a line which doesn't end in a newline. words.cpp 1. #include <iostrean> 2 using namespace std; 3 4 /** A state filter which counts words that are separated by spaces. */ int main() 5 6 8 // haven't read anything yet // so we have no words 10 bool inAWord(false); int words(0); 11 12 13 char ch; 14 while (cin.get(ch)) { if (ch ) 15 16 // any whitespace character 17 18 if (inAWord) // transition leaving a word 19 inAWord = false; words++; 20 21 22 23 } else 24 25 { inAWord = true; 26 27 28 29 30 cout « "There were " « words « " words." « endl; 31 } CodeCheck Reset
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS