logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

In this assignment you are going to learn two things: how to process text (the first step in understanding language) and how to write code in small, bite-size portions: functions

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Assignment 2: Text Processing

Introduction

Text is a very important part of the data that computers deal with. In this assignment you are going to learn two things: how to process text (the first step in understanding language) and how to write code in small, bite-size portions: functions!

Functionality

Once again you will write your programs in increasingly more powerful pieces. But unlike the first assignment you will only produce two main programs and a number of functions. The number of functions that you write correctly will determine your grade.


Remember the wcount.c program in the textbook and in class. You will find a related program in the file textRW.c. In the original program, the text was read in a character at a time. The program textRW.c reads in text, one line at a time. The program assumes that no line contains more than 500 characters. Your code will not be tested on text that violates this constraint.

To test out textRW do the following:

$ make textRW

$ cat verneTest.txt | ./textRW

Produce the following functions that will work on a single line of text:

int chop ( char *line )

  • Remove the ‘\n’ from the end of the line.

  • Returns 0 if successful and -1 on


int convertLowerCase ( char *line )

  • Convert all alphabetic characters to lower case (do not use the tolower()

function in the string library for C or your grade will be zero for this function).

  • Returns the number of characters converted from upper case to lower


int replaceDigits ( char *line )

  • Replace the all numbers/digits (0-9) with

  • Returns the number of digits replaced with


int replacePunc ( char *line )

  • Replace all punctuation and symbols with blanks. A list of all punctuation and symbols appears in the Information section of this

  • Returns the number of punctuation and symbols replaced with


int reduceSpace ( char *line )

  • Reduce all white space (blank characters and tabs to a single blank space).

  • Returns the number of white spaces


int trim ( char *line )

  • Trim all white space from the beginning and from the end of each

  • Returns 0 on success and -1 on


Now compile the program findWords.c with your functions using Makefile and run this against the test file called verneTest.txt.


$ make findWords

$ cat verneTest.txt | ./findWords


Your output should look like the output in file resultsVerne.txt.


The findWords program has found all the words in the file that are greater than 5 characters in length.


Now run the following pipeline:


$ cat verneTest.txt | ./findWords | sort


The output should look like the output in file sortedResultsVerne.txt.

Your last task is to write a program called wordBag.c that prints out all the unique words produced by the previous pipeline with their counts (number of times that they occur). The output will look like the output in file countsResultsVerne.txt.


Now run the following pipelines:

$ cat verneTest.txt | ./findWords | sort | ./wordBag

$ cat verneTest.txt | ./findWords | sort | ./wordBag | sort - gk1,1r -gk2,2

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

736 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

911 Answers

Hire Me
expert
Husnain SaeedComputer science

708 Answers

Hire Me
expert
Atharva PatilComputer science

994 Answers

Hire Me
November
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
26
27
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
6
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30