Question

1. Read an unsorted keywords file once to determine how many words are in the file.
2. Allocate memory dynamically to store the unsorted keywords in an array of strings or an array of c-strings. (Hint: be sure to clear your input file stream before re-reading the file)
3. Reread the keywords file a second time and store the words in the dynamically allocated array of strings or c-strings
4. Sort the array of key words. (Hint: be sure to check your sorted array of key words - there should be 84)
5. Search a C++ program input file for occurrences of the keywords:
   • Read one line at a time from the C++ program file into a cstring. (Hint: use the istream::getline function - see example below)
   • Parse each line into separate words. Ignore any words that are inside a C++-style comment. (Hint: use strtok)
   • Search the keyword array to determine if each word is a keyword (Hint: use a binary search or a sequential search)
   • For keywords, print the line number, the keyword, and the position of the keyword in the line. (Hint: use the difference of two pointers)
   • Keep a count of the number of keywords found

Program Requirements

• This zipped file(http://voyager.deanza.edu/~bentley/cis22b/ass4files.zip) contains the keywords file and the C++ program file for searching.
• Use a char array to hold each line from the C++ program file. “Parse” each line into individual words for searching. Note, you may not use the stringstream classes for this assignment.
• Make sure you check the input file for successful opens.
• Your output should match the format show below with the correct line number and position of each word in the line. The line character positions start at zero. Note, there are more than 50 lines of output.

Program Output

Your output should look like this:

Line 8: using(0) namespace(6)   <== using occurs at position 0 on line 8, namespace occurs at position 6 on line 8 Line 10: const(0) int(6) Line 12: void(0) const(19) Line 13: void(0) char(20) int(32) const(48) Line 14: bool(0) const(24) char(30) const(42) Line 15: void(0) char(17) Line 16: void(0) Line 17: void(0) Line 19: int(0) Line 21: const(4) ... Number of keywords found = ??   <== Add this line at the end of your output, replace ?? with the correct number

Program Hints

• Follow the program steps. Write only one part of the program at a time. Test each part before you proceed to the next step. Do not continue if one part has a problem. Ask for help with a step, if you can't get it to work. Remember to allow plenty of time for this assignment.
• Use a small keyword file and a small test C++ program file initially as you are developing your code.
• Use strstr() to find the // of a C++-style comment.
• Use strtok() for the parsing of each line. You should "parse out" much of the program "punctuation".
• You might want to make a copy of each line (maybe as a string) to determine the position of the keyword in the line. This is because strtok() destroys the original line.
• Xcode users: There is a \r at the end of each line in the test file. You can suppress it by adding "\r" as a delimiter for strtok().
• Your program should produce more than 50 lines of output and you should find more than 70 keywords (many are repeats).

The keyword file looks like this:

for if nullptr break int long sizeof return short else friend const static_cast ...

The C++ program file looks like this:

#include <cstdlib> #include <cstring> #include <cctype> #include <cmath> #include <fstream> #include <iostream> #include <string> using namespace std; const int DictionarySize = 23907; void getDictionary(const string& filename,string*); void spellCheckLine(char* line, int lineNumber, const string* dictionary); bool wordIsInDictionary(const char* word, const string* dictionary); void toLowerCase(char* text); ...

istream::getline example

ifstream fin("oldass3.cpp"); ... char buffer[132]; ... fin.getline(buffer,sizeof(buffer)); // store a line from the input file into buffer

Answer 1

Code:

#include <iostream>

#include <fstream>

#include <string>

#include <sstream>

#include <algorithm>

#include <vector>

using namespace std;

int main()

{

     string testline;

     string codeline;

     vector<string> word;

     vector<string> app;

//opening keywords text file

     ifstream Test("keywords.txt");

     if (!Test)

     {

          cout << "There was a problem opening the file. Press any key to close.\n";

          return 0;

     }

    

     while (Test)

     {

          Test >> testline;

          //cout << testline << endl;

          word.push_back(testline);

     }

    

     //Dynamically allocating keyords to array

     for (int i = 0;i < word.size() - 1;i++)

      //cout << word[i] << "(" << i << ")" << endl;

     //sorting the keywords

     sort(word.begin(), word.end());

     //for (string &s : word)

          //cout << s << "\n ";

     cout << "output" << endl;

     //opening the input file

     ifstream code("input.txt");

     if (!code)

     {

          cout << "There was a problem opening the file. Press any key to close.\n";

          return 0;

     }

     int n = 0;

     int count = 1;

     int map = 0;

     int g = 0;

     bool c = true;

     while (code)

     {

         

     code >> codeline;

         

          for (int j = 0;j < word.size();j++)

          {

              if (code.peek() == '\n')

              {

                   count = count + 1;

                   n = 0;

                   if (word[j] == codeline)

                   {

                        c = true;

                        cout << "line[" << count << "]";

                        cout << codeline << "[" << n << "]";

                        cout << endl;

                        //   n = n+sizeof (codeline);

                        n = n + codeline.length();

                        map = map + 1;

                        break;

                   }

                   else

                        c = false;

                   break;

              }

              else

              {

                   if (word[j] == codeline)

                   {

                        c = true;

                        cout << "line[" << count << "]";

                        cout << codeline << "[" << n << "]";

                        cout << endl;

                  

                        n = n + codeline.length();

                        map = map + 1;

                        break;

                   }

                   else

                        c = false;

              }

          }

          if (c == false && n != 0)

              n = n + codeline.length();

    

     }

     cout << "Total no of keywords found" << map << endl;

     system("pause");

     return 0;

}

Output

keywords.txt:

**Fell free to ask any queries in the comment section. I am happy to help you. if you like our work, please give Thumbs up**

Thank you