Back to DFS's Pascal Page

Needle in a File Haystack Problem I

Earlier you wrote a program which found all occurrences of a needle in a haystack that the user typed in.

Here you will read in a file and list the line and character positions where the user-specified needle is found.

To aid the user, you will print the whole text, numbering the lines. Beneath the last line, you will print character numbers which will go up to the length of the longest line.

Below the text, you will tell the user the purpose of the program and request the string to be searched for.

Finally, you will list the line and character positions where the needle was found.

You will use the text of O Canada to develop your program. It should produce output such as the following.

Pseudocode

The structure of your program should be very simple.

1. Setup
2. Load file
3. Find longest line and print numbered lines
4. Number the character positions of the line
5. Get the needle substring from the user
6. Introduce results
7. Find and print positions of substring