@@ -270,7 +270,7 @@ long long calculation(std::vector<std::string> post_exp)
270
270
long long first_exp (stacked.top ());
271
271
stacked.pop ();
272
272
273
- if (post_exp[i] == " +" ){
273
+ if (post_exp[i] == " +" ){
274
274
stacked.push (first_exp + second_exp);
275
275
276
276
}else if (post_exp[i] == " -" ){
@@ -287,7 +287,7 @@ long long calculation(std::vector<std::string> post_exp)
287
287
stacked.push (second_exp);
288
288
stacked.push (std::strtoll (post_exp[i].c_str (),NULL ,10 ));
289
289
}
290
- }
290
+ }
291
291
return stacked.top ();
292
292
}
293
293
@@ -306,8 +306,8 @@ void translate_expression(std::vector<std::string> infix_exp, std::vector<std::s
306
306
( stacked.top () == " *" || stacked.top () == " /" ) )
307
307
{
308
308
while (!stacked.empty ()){
309
- postfix_exp.push_back (stacked.top ());
310
- stacked.pop ();
309
+ postfix_exp.push_back (stacked.top ());
310
+ stacked.pop ();
311
311
}
312
312
}
313
313
stacked.push (infix_exp[i]);
@@ -316,8 +316,8 @@ void translate_expression(std::vector<std::string> infix_exp, std::vector<std::s
316
316
}
317
317
}
318
318
while (!stacked.empty ()){
319
- postfix_exp.push_back (stacked.top ());
320
- stacked.pop ();
319
+ postfix_exp.push_back (stacked.top ());
320
+ stacked.pop ();
321
321
}
322
322
}
323
323
@@ -356,8 +356,8 @@ void mark_node_write(ast_node_t *node, std::vector<std::string> list)
356
356
list.push_back (node->children [0 ]->types .identifier );
357
357
}
358
358
359
- for (size_t i = 0 ; node && i < node->num_children ; i++)
360
- mark_node_write (node->children [i], list);
359
+ for (size_t i = 0 ; node && i < node->num_children ; i++)
360
+ mark_node_write (node->children [i], list);
361
361
362
362
}
363
363
@@ -740,9 +740,9 @@ bool adjoin_constant()
740
740
mark = 1 ;
741
741
}
742
742
break ;
743
- default :
744
- // pass
745
- break ;
743
+ default :
744
+ // pass
745
+ break ;
746
746
}
747
747
}
748
748
if (mark == 0 )
@@ -1065,9 +1065,9 @@ void create_op_node(ast_node_t *node, enode *temp, int line_num, int file_num)
1065
1065
case ' /' :
1066
1066
node->types .operation .op = DIVIDE;
1067
1067
break ;
1068
- default :
1069
- oassert (FALSE );
1070
- break ;
1068
+ default :
1069
+ oassert (FALSE );
1070
+ break ;
1071
1071
}
1072
1072
1073
1073
}
@@ -1207,7 +1207,7 @@ void delete_bracket(int begin, int end)
1207
1207
void delete_bracket_head (enode *begin, enode *end)
1208
1208
{
1209
1209
enode *temp;
1210
- enode *s = NULL ;
1210
+ enode *s = NULL ;
1211
1211
for (temp = end; temp != NULL ; temp = temp->next )
1212
1212
{
1213
1213
if ((temp->flag == 2 ) && (temp->priority == 2 ))
@@ -1308,8 +1308,8 @@ void change_exp_list(enode *begin, enode *end, enode *s, int flag)
1308
1308
}
1309
1309
break ;
1310
1310
}
1311
- default :
1312
- break ;
1311
+ default :
1312
+ break ;
1313
1313
1314
1314
}
1315
1315
}
0 commit comments