-
Notifications
You must be signed in to change notification settings - Fork 0
/
AttributeParser.cpp
144 lines (128 loc) · 3.83 KB
/
AttributeParser.cpp
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
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
enum node_type { tag, label, value };
struct parse_tree_node {
node_type nt;
string name;
vector<struct parse_tree_node*> children;
struct parse_tree_node* parent;
};
void utility_free(struct parse_tree_node* ptn) {
for(auto const& value: ptn->children)
utility_free(value);
delete ptn;
}
int main(void) {
struct parse_tree_node* root = new struct parse_tree_node;
struct parse_tree_node* current_level = root;
current_level->name = "ROOT";
current_level->nt = tag;
int n, q;
cin >> n >> q;
// parse lines into tree
for(int i = 0; i < n; i++) {
while(cin.get() != '<') ;
if(cin.peek() != '/') {
char next_char;
bool expecting_space = true;
bool need_next = false;
bool done = false;
bool quoted_mode = false;
struct parse_tree_node* new_node = new struct parse_tree_node;
new_node->nt = tag;
current_level->children.push_back(new_node);
new_node->parent = current_level;
current_level = new_node;
while(!done) {
next_char = std::cin.get();
if(!quoted_mode)
switch(next_char) {
case '"': quoted_mode = true; need_next = true; break;
case '>': done = true; break;
case ' ':
if(!expecting_space) need_next = true;
break;
case '=': {
struct parse_tree_node* parent_node = new_node;
new_node = new struct parse_tree_node;
new_node->nt = value;
parent_node->children.push_back(new_node);
expecting_space = true;
need_next = false;
break;
}
default:
if(need_next) {
struct parse_tree_node* parent_node = current_level;;
new_node = new struct parse_tree_node;
new_node->nt = label;
parent_node->children.push_back(new_node);
need_next = false;
}
new_node->name.append(1, next_char);
expecting_space = false;
break;
}
else {
if(next_char != '"')
new_node->name.append(1, next_char);
else
quoted_mode = false;
}
}
} else {
current_level = current_level->parent;
while(cin.get() != '>') ;
}
}
for(int i = 0; i < q; i++) {
struct parse_tree_node* current_level = root;
string qstr_part;
char peek_char;
bool tilde_mode = false;
while((peek_char = cin.peek()) == ' ' ||
peek_char == '\n')
cin.get();
while(true) {
char next_char = cin.get();
if(next_char == '.' || next_char == '~') {
bool found = false;
tilde_mode = next_char == '~';
for(auto const& value: current_level->children)
if(value->nt == tag && value->name == qstr_part) {
current_level = value;
qstr_part = "";
found = true;
break;
}
if(!found) {
char drop_char;
cout << "Not Found!" << endl;
while((drop_char =cin.get()) != '\n' && drop_char != EOF) ;
break;
}
} else if(next_char == '\n' || next_char == EOF) {
bool found = false;
if(tilde_mode)
for(auto const& value: current_level->children)
if(value->nt == label && value->name == qstr_part) {
// This next line is a little sketchy.
cout << value->children[0]->name << endl;
found = true;
break;
}
if(!found)
cout << "Not Found!" << endl;
break;
} else {
qstr_part.append(1, next_char);
}
}
}
utility_free(root);
return 0;
}