Repository navigation
Expand file tree
/
Copy pathmd_parser.cpp
More file actions
179 lines (154 loc) · 4.97 KB
/
Copy pathmd_parser.cpp
File metadata and controls
179 lines (154 loc) · 4.97 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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
#include <iostream>
#include <fstream>
#include <sstream>
#include <stdexcept>
#include <cctype>
#include "md_parser.h"
#include "util.h"
using namespace std;
typedef enum { NORMALTEXT, LINKTEXT, ISLINK, LINKURL } PARSE_STATE_T;
static std::string normalize_term(const std::string &s) {
std::string out;
out.reserve(s.size());
for (unsigned char c : s) out.push_back(std::tolower(c));
return out;
}
static void flush_term_to_set(std::set<std::string> &dest, std::string &term) {
if (!term.empty()) {
dest.insert(normalize_term(term));
term.clear();
}
}
// To be completed
void MDParser::parse(std::istream& istr, std::set<std::string>& allSearchableTerms, std::set<std::string>& allOutgoingLinks)
{
// Remove any contents of the sets before starting to parse.
allSearchableTerms.clear();
allOutgoingLinks.clear();
// Complete your code below
std::ostringstream buf;
buf << istr.rdbuf();
std::string content = buf.str();
const size_t n = content.size();
PARSE_STATE_T state = NORMALTEXT;
std::string term;
std::string link;
bool just_closed_bracket = false;
for( size_t i = 0; i < n; ++i)
{
char c = content[i];
bool is_alnum = std::isalnum(static_cast<unsigned char>(c));
switch(state)
{
case NORMALTEXT:
if(c == '[')
{
flush_term_to_set(allSearchableTerms, term);
state = LINKTEXT;
} else if (is_alnum) {
term.push_back(c);
} else {
flush_term_to_set(allSearchableTerms, term);
}
break;
case LINKTEXT:
if (c == ']') {
size_t next_i = i + 1;
flush_term_to_set(allSearchableTerms, term);
if (next_i < n && content[next_i] == '(') {
state = ISLINK;
just_closed_bracket = true;
} else {
state = NORMALTEXT;
just_closed_bracket = false;
}
} else {
if (is_alnum) term.push_back(c);
else flush_term_to_set(allSearchableTerms, term);
}
break;
case ISLINK:
if (c == '(' && just_closed_bracket) {
link.clear();
state = LINKURL;
} else {
just_closed_bracket = false;
}
break;
case LINKURL:
if(c==')')
{
size_t start = 0;
while(start < link.size() && std::isspace(static_cast<unsigned char>(link[start]))) ++start;
size_t end = link.size();
while (end > start && std::isspace(static_cast<unsigned char>(link[end-1]))) --end;
if (end > start) {
std::string trimmed = link.substr(start, end - start);
allOutgoingLinks.insert(trimmed);
}
flush_term_to_set(allSearchableTerms, term);
state = NORMALTEXT;
}
else
{
link.push_back(c);
}
break;
}
}
flush_term_to_set(allSearchableTerms, term);
}
// To be completed
std::string MDParser::display_text(std::istream& istr)
{
std::ostringstream buf;
buf << istr.rdbuf();
std::string content = buf.str();
const size_t n = content.size();
PARSE_STATE_T state = NORMALTEXT;
std::string out;
out.reserve(n);
for (size_t i = 0; i < n; ++i) {
char c = content[i];
switch (state) {
case NORMALTEXT:
if (c == '[') {
out.push_back(c);
state = LINKTEXT;
} else {
out.push_back(c);
}
break;
case LINKTEXT:
if (c == ']') {
size_t next_i = i + 1;
out.push_back(c);
if (next_i < n && content[next_i] == '(') {
state = ISLINK;
} else {
state = NORMALTEXT;
}
} else {
out.push_back(c);
}
break;
case ISLINK:
if (c == '(') {
state = LINKURL;
} else {
state = NORMALTEXT;
}
break;
case LINKURL:
if(c == ')')
{
state = NORMALTEXT;
}
else
{
}
break;
}
}
return out;
}