forked from chaira19/Hindi-DateTime-Parser
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstack.py
298 lines (236 loc) · 7.5 KB
/
stack.py
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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
import data
from data import *
def stack_algo(words):
## four stacks
Stack_Date = []
Stack_Time = []
Stack_Next = []
Stack_Prev = []
temp = []
check = 0
## list of lists
Stack_of_Stacks = []
Stack_Index = []
Final = {'Date':[], 'Time':[]}
## Algorithm to fill all the words in stack
for word in words:
if word in Separators:
#prev_word = words[words.index(word)-1]
if check == 7:
copy = Stack_Date[:]
Stack_of_Stacks.append(copy)
#print (Stack_Date, "Date Stack goes in Full Stack \n")
#print (Stack_of_Stacks, "\n")
Stack_Date.clear()
Stack_Date = [x for x in Stack_Date if x]
#print (Stack_Date, "Date Stack Cleared \n")
#print (Stack_of_Stacks, "\n")
Stack_Index.append("Date")
Final['Date'].append(copy)
if check == 8:
copy = Stack_Time[:]
Stack_of_Stacks.append(copy)
#print (Stack_Time, "Time Stack goes in Full Stack \n")
#print (Stack_of_Stacks, "\n")
Stack_Time.clear()
Stack_Time = [x for x in Stack_Time if x]
#print (Stack_Time, "Time Stack Cleared \n")
#print (Stack_of_Stacks, "\n")
Stack_Index.append("Time")
Final['Time'].append(copy)
Stack_of_Stacks.append(word)
#print(word, "goes in Full Stack \n")
#print (Stack_of_Stacks, "\n")
check = 0
Stack_Index.append(word)
## if next and prev stack is empty then fill accordingly
if len(Stack_Next)==0 and len(Stack_Prev)==0:
if (word in Date) or ((word.isdigit()) and (len(word)==4)):
if(check == 8):
copy = Stack_Time[:]
Stack_of_Stacks.append(copy)
#print (Stack_Time, "Time Stack goes in Full Stack \n")
#print (Stack_of_Stacks, "\n")
Stack_Time.clear()
Stack_Time = [x for x in Stack_Time if x]
#print (Stack_Time, "Time Stack Cleared \n")
#print (Stack_of_Stacks, "\n")
Stack_Index.append("Time")
Final['Time'].append(copy)
Stack_Date.append(word)
check = 7
#print (word, "goes in Date \n")
if word in Time:
if(check == 7):
copy = Stack_Date[:]
Stack_of_Stacks.append(copy)
#print (Stack_Date, "Date Stack goes in Full Stack \n")
#print (Stack_of_Stacks, "\n")
Stack_Date.clear()
Stack_Date = [x for x in Stack_Date if x]
#print (Stack_Date, "Date Stack Cleared \n")
#print (Stack_of_Stacks, "\n")
Stack_Index.append("Date")
Final['Date'].append(copy)
Stack_Time.append(word)
check = 8
#print (word, "goes in Time \n")
if word in DateTime:
if DateTime[word][1]==1:
Stack_Next.append(word)
#print (word, "goes in Next \n")
else :
Stack_Prev.append(word)
#print (word, "goes in Prev \n")
elif word in Numbers:
if Numbers[word][1]==1:
Stack_Next.append(word)
#print (word, "goes in Next \n")
else :
Stack_Prev.append(word)
#print (word, "goes in Prev \n")
## if not empty then word in datetime(stack 3) is filled first in either of two stacks
elif len(Stack_Prev)!=0:
temporary = Stack_Prev.pop()
if check==7:
Stack_Date.append(temporary)
#print (temporary, "goes in Date from Prev\n")
elif check==8:
Stack_Time.append(temporary)
#print (temporary, "goes in Time from Prev\n")
if (word in Date) or ((word.isdigit()) and (len(word)==4)):
if(check == 8):
copy = Stack_Time[:]
Stack_of_Stacks.append(copy)
#print (Stack_Time, "Time Stack goes in Full Stack \n")
#print (Stack_of_Stacks, "\n")
Stack_Time.clear()
Stack_Time = [x for x in Stack_Time if x]
#print (Stack_Time, "Time Stack Cleared \n")
#print (Stack_of_Stacks, "\n")
Stack_Index.append("Time")
Final['Time'].append(copy)
Stack_Date.append(word)
#print (word, "goes in Date \n")
check = 7
if word in Time:
if(check == 7):
copy = Stack_Date[:]
Stack_of_Stacks.append(copy)
#print (Stack_Date, "Date Stack goes in Full Stack \n")
#print (Stack_of_Stacks, "\n")
Stack_Date.clear()
Stack_Date = [x for x in Stack_Date if x]
#print (Stack_Date, "Date Stack Cleared \n")
#print (Stack_of_Stacks, "\n")
Stack_Index.append("Date")
Final['Date'].append(copy)
Stack_Time.append(word)
#print (word, "goes in Time \n")
check = 8
if word in DateTime:
Stack_Prev.append(temporary)
if DateTime[word][1]==1:
Stack_Next.append(word)
#print (word, "goes in Next \n")
else :
Stack_Prev.append(word)
#print (word, "goes in Prev \n")
elif word in Numbers:
Stack_Prev.append(temporary)
if Numbers[word][1]==1:
Stack_Next.append(word)
#print (word, "goes in Next \n")
else :
Stack_Prev.append(word)
#print (word, "goes in Prev \n")
elif len(Stack_Next)!=0:
#temp = []
temp.append(Stack_Next.pop())
#next_word = words[words.index(word)+1]
if (word in Date) or ((word.isdigit()) and (len(word)==4)):
Stack_Date.extend(temp)
#print (temp, "goes in Date from Next\n")
temp.clear()
if(check == 8):
copy = Stack_Time[:]
Stack_of_Stacks.append(copy)
#print (Stack_Time, "Time Stack goes in Full Stack \n")
#print (Stack_of_Stacks, "\n")
Stack_Time.clear()
Stack_Time = [x for x in Stack_Time if x]
#print (Stack_Time, "Time Stack Cleared \n")
#print (Stack_of_Stacks, "\n")
Stack_Index.append("Time")
Final['Time'].append(copy)
Stack_Date.append(word)
#print (Stack_Date)
#print (word, "goes in Date \n")
check = 7
elif word in Time:
Stack_Time.extend(temp)
#print (temp, "goes in Time from Next\n")
temp.clear()
if(check == 7):
copy = Stack_Date[:]
Stack_of_Stacks.append(copy)
#print (Stack_Date, "Date Stack goes in Full Stack \n")
#print (Stack_of_Stacks, "\n")
Stack_Date.clear()
Stack_Date = [x for x in Stack_Date if x]
#print (Stack_Date, "Date Stack Cleared \n")
#print (Stack_of_Stacks, "\n")
Stack_Index.append("Date")
Final['Date'].append(copy)
Stack_Time.append(word)
#print (word, "goes in Time \n")
check = 8
if word in DateTime:
if DateTime[word][1]==1:
Stack_Next.append(word)
#print (word, "goes in Next \n")
else :
Stack_Prev.append(word)
#print (word, "goes in Prev \n")
elif word in Numbers:
if Numbers[word][1]==1:
Stack_Next.append(word)
#print (word, "goes in Next \n")
else :
Stack_Prev.append(word)
#print (word, "goes in Prev \n")
if words.index(word) == len(words)-1:
if len(Stack_Prev)!=0:
temporary = Stack_Prev.pop()
if check==7:
Stack_Date.append(temporary)
#print (temporary, "goes in Date from Prev\n")
elif check==8:
Stack_Time.append(temporary)
#print (temporary, "goes in Time from Prev\n")
if len(Stack_Next)!=0:
temporary = Stack_Next.pop()
if check==7:
Stack_Date.append(temporary)
#print (temporary, "goes in Date from Next\n")
elif check==8:
Stack_Time.append(temporary)
#print (temporary, "goes in Time from Next\n")
if len(Stack_Date)!=0:
copy = Stack_Date[:]
Stack_of_Stacks.append(copy)
#print (Stack_Date, "Last Stack(Date) goes in Full Stack")
#print (Stack_of_Stacks, "\n")
Stack_Index.append("Date")
Final['Date'].append(copy)
elif len(Stack_Time)!=0:
copy = Stack_Time[:]
Stack_of_Stacks.append(copy)
#print (Stack_Time, "Last Stack(Time) goes in Full Stack")
#print (Stack_of_Stacks, "\n")
Stack_Index.append("Time")
Final['Time'].append(copy)
print (Stack_of_Stacks, "\n")
print (Stack_Index, "\n")
print (Final)
return Final