-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathParser.cpp
More file actions
141 lines (121 loc) · 2.91 KB
/
Parser.cpp
File metadata and controls
141 lines (121 loc) · 2.91 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include <fstream>
#include <string>
#include <iostream>
#include <map>
#include "Parser.h"
using namespace std;
Parser::Parser()
{}
Parser::Parser(string path)
{
this->PopulateDictionary(path);
}
Parser::Parser(string path, string sentence)
{
this->PopulateDictionary(path);
this->setSentence(sentence);
}
map<string, int> Parser::getDictionary()
{
return Dictionary;
}
string Parser::getSentence()
{
return Sentence;
};
void Parser::setSentence(string Sentence)
{
this->Sentence = Sentence;
Words.clear();
this->splitSentence(Sentence);
this->filterWords();
};
void Parser::splitSentence(string sentence)
{
Words.clear();
string::size_type prev_pos = 0, pos = 0;
while( (pos = sentence.find(' ', pos)) != string::npos )
{
string substring( sentence.substr(prev_pos, pos-prev_pos) );
Words.push_back(substring);
prev_pos = ++pos;
}
string substring( sentence.substr(prev_pos, pos-prev_pos) ); // Last word
Words.push_back(substring) ;
}
void Parser::filterWords()
{
for(int i = 0; i < Words.size(); i++)
{
Words.at(i) = this->Filter(Words.at(i));
}
}
vector<string> Parser::getWords()
{
return Words;
}
void Parser::printDictionary()
{
int count = 0;
for(map<string, int>::iterator it=Dictionary.begin(); it!=Dictionary.end(); ++it, count++)
{
cout << it->first << " [" << it->second << "]"<< "\t";
if(count==5)
{
cout << endl;
count = 0;
}
}
}
string Parser::Filter(string word)
{
string new_word = "";
int symbol_count = 0;
// For each character in the string
for(int i=0; i<word.size(); i++)
{
int character = (int) word.at(i);
// if it is upper case, convert to lowercase
if(character>=65 && character<=90)
{
new_word = new_word + (char) (character+32);
}
// if it is lower case, add it
else if(character>=97 && character<=122)
{
new_word = new_word + (char) character;
}
else // otherwise, increase symbol count
{
symbol_count++;
}
if (symbol_count>2) return "";
}
return new_word;
}
void Parser::PopulateDictionary(string pathname)
{
ifstream dataset(pathname.c_str());
string word;
string new_word;
while(!dataset.eof())
{
dataset >> word;
new_word = this->Filter(word);
// Words which are to be rejected have been returned as empty strings
if (new_word != "")
{
// If dictionary does not contain a word, add it
if(Dictionary.find(new_word)->second == 0)
{
Dictionary[new_word] = 1;
}
// otherwise increment it
else
{
Dictionary[new_word] = Dictionary[new_word]+1;
}
}
}
dataset.close();
}