Now, modify the wc program so that it accepts the following command line switches. • -c print the character count -1 print the line count • -w print the word count With no switches, it prints all three, just as in the previous exercise. we.cpp 1 sanclude ciostream 2 Include efstrean 3 FInclude sstrean 4 using nanespace std 6 int in(int arge, char arpvlII bool printNords false bool printchars false bool printLines false bool hasSadtches- false; 18 11 12 int 1(1): while (1 argc 13 string arg- arpv11: int vordsi(e), isnesl(), ctarsl(e): strang linel if (argle) string comand - arg.sutstril); at Icammand - "1") while igetline(in, Llinei) tanes for (int i 1;ie argt; i) string arg arplal: if (arg.at(8) ) continue; I Process non-svitches ifstrean injarglall: cout e argvli): it (an 37 int warts(8), lines(8), chars(): string Line; ile (petlinejin, Line)) Lines: chars line.sizell 1: istringstrean strinline: strang word: while istran vord) ( words; } at thasteitches) it (printiines) cout e « lines: it (printvords) cout e Nords if (printchars) cout e chars; cout e endl: else cout e « lines e « warts e" e chars e endl: else Caut e" does not exist" entl;
Now, modify the wc program so that it accepts the following command line switches. • -c print the character count -1 print the line count • -w print the word count With no switches, it prints all three, just as in the previous exercise. we.cpp 1 sanclude ciostream 2 Include efstrean 3 FInclude sstrean 4 using nanespace std 6 int in(int arge, char arpvlII bool printNords false bool printchars false bool printLines false bool hasSadtches- false; 18 11 12 int 1(1): while (1 argc 13 string arg- arpv11: int vordsi(e), isnesl(), ctarsl(e): strang linel if (argle) string comand - arg.sutstril); at Icammand - "1") while igetline(in, Llinei) tanes for (int i 1;ie argt; i) string arg arplal: if (arg.at(8) ) continue; I Process non-svitches ifstrean injarglall: cout e argvli): it (an 37 int warts(8), lines(8), chars(): string Line; ile (petlinejin, Line)) Lines: chars line.sizell 1: istringstrean strinline: strang word: while istran vord) ( words; } at thasteitches) it (printiines) cout e « lines: it (printvords) cout e Nords if (printchars) cout e chars; cout e endl: else cout e « lines e « warts e" e chars e endl: else Caut e" does not exist" entl;
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...
Related questions
Question
I'm not sure how to continue this. The 2nd picture is supposed to be the output/result.

Transcribed Image Text:-l a3. txt a6. txt
Actual
Expected
a3. txt 3 40 210 a3.txt 3
a6. txt 4 49 264 a6.txt 4
fail
Command line arguments:
-c a4. txt
Actual
Expected
a4. txt 3 28 155 a4.txt 155
fail
Command line arguments:
-l -w a5.txt al.txt a2.txt
Actual
Еxpected
a5. txt 3 42 212 a5.txt 3 42
al.txt 3 42 218 al.txt 3 42
a2.txt 4 52 285 a2.txt 4 52
fail
Command line arguments:
a4. txt ml.txt a3. txt a5.txt
a4. txt 3 28 155
ml.txt does not exist
a3. txt 3 40 210
a5.txt 3 42 212
pass
![Now, modify the wc program so that it accepts the following command line switches.
-c print the character count
-1 print the line count
• -w print the word count
With no switches, it prints all three, just as in the previous exercise.
wc.epp
1 sinclude dostream
2 include dstrean
3 Finclude sstrean
4 using nanespace std;
int main(int argc, char argvlll
bool printNards false;
tool printChars false;
tool printLines false;
tool has Switches false;
int 1(1):
whi le (i < arpc
18
11
12
13
14
string arg - argvl11:
int vords1(0), isnes1(8), charsi(a);
string Linel;
it (argla] .)
16
18
19
string comand - arg.substri1):
it (cannand "L")
while Igetline(in, Line))
tines:
for (int i- 1; i< arge; i+t)
33
34
string arg - argvl1:
it (arg.at(8) ) continue;
/ Frocess non-svitches
ifstream injargu(i|l:
cout « argvli);
if (in
int wards (8), lines(0), chars(E);
string tine;
vtile (petlinelin, line))
41
42
45
Linest;
chars t tine.sizell + 1;
istringstrean strin(Line);
string ward;
while (strin » vord) ( words+t; }
46
47
if Ihasswitches)
it (printlines) cout ee" Lines;
it (printverds) cout ee e wards:
it (printchars) cout ee e chars;
cout ee endl;:
else
cout ee
« tines e "« wards « « chars endl;
else
65
Cout e" does not exist" « endl;
66
67
a1.txt](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F45a9ec70-4831-4f65-a272-c2b5558c4300%2F6d789135-8dfa-457f-9fc1-913e73209823%2Fjjyg12o_processed.png&w=3840&q=75)
Transcribed Image Text:Now, modify the wc program so that it accepts the following command line switches.
-c print the character count
-1 print the line count
• -w print the word count
With no switches, it prints all three, just as in the previous exercise.
wc.epp
1 sinclude dostream
2 include dstrean
3 Finclude sstrean
4 using nanespace std;
int main(int argc, char argvlll
bool printNards false;
tool printChars false;
tool printLines false;
tool has Switches false;
int 1(1):
whi le (i < arpc
18
11
12
13
14
string arg - argvl11:
int vords1(0), isnes1(8), charsi(a);
string Linel;
it (argla] .)
16
18
19
string comand - arg.substri1):
it (cannand "L")
while Igetline(in, Line))
tines:
for (int i- 1; i< arge; i+t)
33
34
string arg - argvl1:
it (arg.at(8) ) continue;
/ Frocess non-svitches
ifstream injargu(i|l:
cout « argvli);
if (in
int wards (8), lines(0), chars(E);
string tine;
vtile (petlinelin, line))
41
42
45
Linest;
chars t tine.sizell + 1;
istringstrean strin(Line);
string ward;
while (strin » vord) ( words+t; }
46
47
if Ihasswitches)
it (printlines) cout ee" Lines;
it (printverds) cout ee e wards:
it (printchars) cout ee e chars;
cout ee endl;:
else
cout ee
« tines e "« wards « « chars endl;
else
65
Cout e" does not exist" « endl;
66
67
a1.txt
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images

Recommended textbooks for you

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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education

Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY