notes07 - Unix Shell Programming [This topic may be in week...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 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 to glue together existing programs that solve the problem. As an example, well construct a spelling-checker program. It will take a text file as input, and will generate a list of words that are in the file but not in the online dictionary. For this demonstration Ill use the file named summary as the text I want to spell-check. We are given a file that contains several words per line, including things we dont want to compare against the dictionary, such as spaces and punctuation. Our job will be easier if we transform the input into a file with exactly one word per line, with no spaces or punctuation (except that well keep apostrophes, which are part of words contractions such as well rather than word delimiters)....
View Full Document

This note was uploaded on 02/17/2010 for the course COMPUTER S 26275 taught by Professor Harvey,b during the Spring '10 term at University of California, Berkeley.

Ask a homework question - tutors are online