•Unix Shell Programming[This topic may be in week 1, week 4, or week 11 depending on the holidays each semester.]Sometimes the best way to solve a programming problem is not to write a program at all, but instead toglue together existing programs that solve the problem.As an example, we’ll construct a spelling-checker program. It will take a text file as input, and will generatea list of words that are in the file but not in the online dictionary.For this demonstration I’ll use the file namedsummaryas the text I want to spell-check.We are given a file that contains several words per line, including things we don’t want to compare againstthe dictionary, such as spaces and punctuation. Our job will be easier if we transform the input into a filewith exactly one word per line, with no spaces or punctuation (except that we’ll keep apostrophes, whichare part of words — contractions such as “we’ll” — rather than word delimiters).
This is the end of the preview.
access the rest of the document.