Suppose we wish to read a word and then write it backwards, from right to left. This problem can be solved in a trivial way if the length of the word is known in advance. For example, if the length of the word is known to be six, the program in Fig. 9.1 will suffice. For example, if the word MODULA is read, the program will write ALUDOM.
Unable to display preview. Download preview PDF.