interpreter.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. // #include "interprete.h"
  4. #include "../paser/y.tab.c"
  5. // running code
  6. GWARF_result operation_func(statement *, var_list *);
  7. GWARF_result add_func(GWARF_result, GWARF_result, var_list *);
  8. GWARF_result sub_func(GWARF_result, GWARF_result, var_list *);
  9. GWARF_result mul_func(GWARF_result, GWARF_result, var_list *);
  10. GWARF_result div_func(GWARF_result, GWARF_result, var_list *);
  11. GWARF_result assigment_func(char *, GWARF_result, var_list *);
  12. GWARF_result equal_func(GWARF_result, GWARF_result, var_list *, int type);
  13. // ------------------------- var func
  14. var *make_var(){ // make var with base
  15. var *tmp;
  16. tmp = malloc(sizeof(var)); // get an address for base var
  17. tmp->name = ""; // can't get the name for the real var
  18. tmp->next = NULL;
  19. return tmp;
  20. }
  21. void append_var(char *name, GWARF_value value, var *base_var){
  22. int break_ = 1; // get var[2] or not[1]
  23. var *tmp = base_var; // iter var
  24. while(1){
  25. if (tmp->name == name){
  26. break_ = 2;
  27. break;
  28. }
  29. if (tmp->next == NULL){ // not var name *name
  30. break_ = 1;
  31. break;
  32. }
  33. tmp = tmp->next; // get the next to iter
  34. }
  35. if(break_ == 2){
  36. tmp->value = value;
  37. return;
  38. }
  39. var *new_tmp = make_var();
  40. tmp->next = new_tmp;
  41. new_tmp->name = malloc(sizeof(name));
  42. strcpy(new_tmp->name, name);
  43. new_tmp->value = value;
  44. }
  45. void free_var(var *base_var){ // free the address
  46. var *tmp = base_var; // iter var
  47. while(1){
  48. if (tmp->next == NULL){ // the last
  49. free(tmp);
  50. break;
  51. }
  52. var *tmp_2 = tmp;
  53. tmp = tmp->next;
  54. free(tmp_2);
  55. }
  56. }
  57. var *get_var(char *name, var *base_var){ // get the address
  58. var *tmp = base_var; // iter var
  59. while(1){
  60. if (!strcmp(tmp->name, name)){ // if tmp->name == name , strcmp will return 0, if not strcmp return not 0
  61. return tmp;
  62. }
  63. if (tmp->next == NULL){ // not var name *name
  64. return NULL;
  65. }
  66. tmp = tmp->next; // get the next to iter
  67. }
  68. }
  69. void del_var(char *name, var *base_var){ // free an address
  70. var *tmp = base_var, *last_tmp=NULL; // iter var
  71. while(1){
  72. if (tmp->name == name){
  73. if(last_tmp != NULL){
  74. last_tmp->next = tmp->next; // if tmp->next is NULL last_tmp->next is NULL too
  75. }
  76. free(tmp);
  77. return;
  78. }
  79. if (tmp->next == NULL){ // not var name *name
  80. return;
  81. }
  82. tmp = tmp->next; // get the next to iter
  83. last_tmp = tmp;
  84. }
  85. }
  86. // ------------------------- statement list
  87. statement *make_statement(){ // make statement
  88. statement *tmp;
  89. tmp = malloc(sizeof(statement)); // get an address for base var
  90. tmp->next = NULL;
  91. tmp->type = start;
  92. return tmp;
  93. }
  94. statement *append_statement(statement *base_statement, statement *new_tmp){ // make statement next
  95. statement *tmp = base_statement; // iter var
  96. while(1){
  97. if (tmp->next == NULL){ // not var name *name
  98. break;
  99. }
  100. tmp = tmp->next; // get the next to iter
  101. }
  102. tmp->next = new_tmp;
  103. return new_tmp;
  104. }
  105. // ------------------------- var_list
  106. var_list *make_var_list(){ // make a empty var_list node
  107. var_list *tmp;
  108. tmp = malloc(sizeof(var_list)); // get an address for base var
  109. tmp->next = NULL;
  110. tmp->var_base = NULL;
  111. return tmp;
  112. }
  113. var_list *make_var_base(var *gloabl_var){
  114. var_list *tmp = make_var_list();
  115. tmp->var_base = gloabl_var;
  116. return tmp;
  117. }
  118. var_list *append_var_list(var *var_base, var_list *var_list_base){ // make var_list[FILO]
  119. var_list *tmp = make_var_list();
  120. tmp->var_base = var_base;
  121. tmp->next = var_list_base;
  122. return tmp;
  123. }
  124. var *find_var(var_list *var_base,int from, char *name){ // find var by func get_var in var_list[iter to find]
  125. var_list *start = var_base;
  126. var *return_var;
  127. for(int i = 0;i < from;i+= 1){
  128. if(start->next = NULL){
  129. break;
  130. }
  131. start = start->next;
  132. }
  133. while (1)
  134. {
  135. return_var = get_var(name, start->var_base);
  136. if((return_var == NULL) && (start->next == NULL)){ // don't get the var and not next
  137. return NULL;
  138. }
  139. else if((return_var == NULL) && (start->next != NULL)){ // don't get the var but can next
  140. start = start->next;
  141. continue;
  142. }
  143. return return_var; //get var success can or can't next
  144. }
  145. }
  146. void add_var(var_list *var_base,int from, char *name, GWARF_value value){ // add var by func append_var in var_list[iter to find]
  147. var_list *start = var_base;
  148. var *return_var;
  149. for(int i = 0;i < from;i+= 1){
  150. if(start->next = NULL){
  151. break;
  152. }
  153. start = start->next;
  154. }
  155. append_var(name, value, start->var_base);
  156. }
  157. // ------------------------- statement_list
  158. statement_list *make_statement_list(){ // make a empty var_list node
  159. statement_list *tmp;
  160. tmp = malloc(sizeof(statement_list)); // get an address for base var
  161. tmp->next = NULL;
  162. tmp->statement_base = NULL;
  163. return tmp;
  164. }
  165. statement_list *make_statement_base(statement *gloabl_code){
  166. statement_list *tmp = make_statement_list();
  167. tmp->statement_base = gloabl_code;
  168. return tmp;
  169. }
  170. statement_list *append_statement_list(statement *statement_base, statement_list *statment_list_base){ // make var_list[FILO]
  171. statement_list *tmp = make_statement_list();
  172. tmp->statement_base = statement_base;
  173. tmp->next = statment_list_base;
  174. return tmp;
  175. }
  176. statement *find_statement_list(int from, statement_list *statment_list_base){ // find var by func get_var in var_list[iter to find]
  177. statement_list *start = statment_list_base;
  178. for(int i = 0;i < from;i+= 1){
  179. if(start->next = NULL){
  180. break;
  181. }
  182. start = start->next;
  183. }
  184. return start->statement_base;
  185. }
  186. statement_list *free_statement_list(statement_list *statment_list_base){ // make var_list[FILO]
  187. statement_list *tmp = statment_list_base->next;
  188. if(tmp != NULL){
  189. free(statment_list_base);
  190. return tmp;
  191. }
  192. return statment_list_base;
  193. }
  194. // ------------------------- run code
  195. GWARF_result read_statement_list(statement *the_statement, var_list *the_var){ // read the statement list with case to run by func
  196. GWARF_result return_value;
  197. switch (the_statement->type)
  198. {
  199. case operation: // 表达式运算
  200. return_value = operation_func(the_statement, the_var);
  201. printf("operation value = %f\n", return_value.value.value.double_value);
  202. break;
  203. case base_value:
  204. return_value.value = (the_statement->code).base_value.value; // code
  205. printf("get value = %f\n", return_value.value.value.double_value);
  206. break;
  207. case base_var:{ // because the var tmp, we should ues a {} to make a block[name space] for the tmp var;
  208. var *tmp = find_var(the_var, 0, (the_statement->code).base_var.var_name);
  209. if(tmp == NULL){
  210. return_value.u = wrong; // not var
  211. }
  212. else
  213. {
  214. return_value.value = tmp->value; // get_var
  215. printf("var value = %f\n", return_value.value.value.double_value);
  216. }
  217. break;
  218. }
  219. default:
  220. puts("default");
  221. break;
  222. }
  223. return return_value;
  224. }
  225. // -----------------operation func
  226. GWARF_result operation_func(statement *the_statement, var_list *the_var){ // read the statement list with case to run by func
  227. GWARF_result value, left_result, right_result;
  228. left_result = traverse((*the_statement).code.operation.left_exp, the_var, false);
  229. right_result = traverse((*the_statement).code.operation.right_exp, the_var, false);
  230. switch (the_statement->code.operation.type) // 获取运算类型
  231. {
  232. case ADD_func:
  233. value = add_func(left_result, right_result, the_var);
  234. break;
  235. case SUB_func:
  236. value = sub_func(left_result, right_result, the_var);
  237. break;
  238. case MUL_func:
  239. value = mul_func(left_result, right_result, the_var);
  240. break;
  241. case DIV_func:
  242. value = div_func(left_result, right_result, the_var);
  243. break;
  244. case ASSIGMENT_func:{ // because the var char, we should ues a {} to make a block[name space] for the tmp var;
  245. char *left = (the_statement->code.operation.left_exp)->code.base_var.var_name; // get var name but not value
  246. value = assigment_func(left, right_result, the_var);
  247. break;
  248. }
  249. case EQUAL_func:
  250. value = equal_func(left_result, right_result, the_var, 0);
  251. break;
  252. case MORE_func:
  253. value = equal_func(left_result, right_result, the_var, 1);
  254. break;
  255. case LESS_func:
  256. value = equal_func(left_result, right_result, the_var, 2);
  257. break;
  258. case MOREEQ_func:
  259. value = equal_func(left_result, right_result, the_var, 3);
  260. break;
  261. case LESSEQ_func:
  262. value = equal_func(left_result, right_result, the_var, 4);
  263. break;
  264. case NOTEQ_func:
  265. value = equal_func(left_result, right_result, the_var, 5);
  266. break;
  267. default:
  268. break;
  269. }
  270. return value;
  271. }
  272. // --------- ADD
  273. GWARF_result add_func(GWARF_result left_result, GWARF_result right_result, var_list *the_var){ // the func for add and call from read_statement_list
  274. GWARF_result return_value; // the result by call read_statement_list with left and right; value is the result for add
  275. if((left_result.value.type == NUMBER_value) && (right_result.value.type == NUMBER_value)){ // all is NUMBER
  276. return_value.u = return_def;
  277. return_value.value.type = NUMBER_value;
  278. return_value.value.value.double_value = left_result.value.value.double_value + right_result.value.value.double_value; // 数值相加运算
  279. }
  280. return return_value;
  281. }
  282. // --------- SUB
  283. GWARF_result sub_func(GWARF_result left_result, GWARF_result right_result, var_list *the_var){ // the func for sub and call from read_statement_list
  284. GWARF_result return_value; // the result by call read_statement_list with left and right; value is the result for sub
  285. if((left_result.value.type == NUMBER_value) && (right_result.value.type == NUMBER_value)){ // all is NUMBER
  286. return_value.u = return_def;
  287. return_value.value.type = NUMBER_value;
  288. return_value.value.value.double_value = left_result.value.value.double_value - right_result.value.value.double_value; // 数值相减运算
  289. }
  290. return return_value;
  291. }
  292. // --------- MUL
  293. GWARF_result mul_func(GWARF_result left_result, GWARF_result right_result, var_list *the_var){ // the func for mul and call from read_statement_list
  294. GWARF_result return_value; // the result by call read_statement_list with left and right; value is the result for mul
  295. if((left_result.value.type == NUMBER_value) && (right_result.value.type == NUMBER_value)){ // all is NUMBER
  296. return_value.u = return_def;
  297. return_value.value.type = NUMBER_value;
  298. return_value.value.value.double_value = left_result.value.value.double_value * right_result.value.value.double_value; // 数值相乘运算
  299. }
  300. return return_value;
  301. }
  302. // --------- DIV
  303. GWARF_result div_func(GWARF_result left_result, GWARF_result right_result, var_list *the_var){ // the func for div and call from read_statement_list
  304. GWARF_result return_value; // the result by call read_statement_list with left and right; value is the result for div
  305. if((left_result.value.type == NUMBER_value) && (right_result.value.type == NUMBER_value)){ // all is NUMBER
  306. return_value.u = return_def;
  307. return_value.value.type = NUMBER_value;
  308. return_value.value.value.double_value = left_result.value.value.double_value / right_result.value.value.double_value; // 数值相除运算
  309. }
  310. return return_value;
  311. }
  312. // --------- ASSIGMENT
  313. GWARF_result assigment_func(char *left, GWARF_result right_result, var_list *the_var){ // the func for assigment and call from read_statement_list
  314. add_var(the_var, 0, left, right_result.value);
  315. return right_result;
  316. }
  317. // --------- EQUAL
  318. GWARF_result equal_func(GWARF_result left_result, GWARF_result right_result, var_list *the_var, int type){ // the func for equal and call from read_statement_list
  319. GWARF_result return_value;
  320. double return_bool = 0;
  321. return_value.u = return_def;
  322. if((left_result.value.type == NUMBER_value) && (right_result.value.type == NUMBER_value)){ // all is NUMBER
  323. return_value.value.type = NUMBER_value;
  324. if ((left_result.value.value.double_value == right_result.value.value.double_value) && (type == 0)){ // 如果相等
  325. return_bool = 1; // 返回1 否则(默认)为0
  326. }
  327. if ((left_result.value.value.double_value > right_result.value.value.double_value) && (type == 1)){ // 如果大于
  328. return_bool = 1; // 返回1 否则(默认)为0
  329. }
  330. if ((left_result.value.value.double_value < right_result.value.value.double_value) && (type == 2)){ // 如果小于
  331. return_bool = 1; // 返回1 否则(默认)为0
  332. }
  333. if ((left_result.value.value.double_value >= right_result.value.value.double_value) && (type == 3)){ // 如果大于等于
  334. return_bool = 1; // 返回1 否则(默认)为0
  335. }
  336. if ((left_result.value.value.double_value <= right_result.value.value.double_value) && (type == 4)){ // 如果小于等于
  337. return_bool = 1; // 返回1 否则(默认)为0
  338. }
  339. if ((left_result.value.value.double_value != right_result.value.value.double_value) && (type == 5)){ // 如果不相等
  340. return_bool = 1; // 返回1 否则(默认)为0
  341. }
  342. return_value.value.value.double_value = return_bool; // 数值相加运算
  343. }
  344. return return_value;
  345. }
  346. // --------- traverse[iter]
  347. GWARF_result traverse(statement *the_statement, var_list *the_var, bool new){ // traverse the statement
  348. statement *tmp = the_statement;
  349. GWARF_result result;
  350. while(1){
  351. if(tmp == NULL){
  352. break; // off
  353. }
  354. result = read_statement_list(tmp, the_var);
  355. tmp = tmp->next;
  356. }
  357. return result;
  358. }
  359. // -------inter func
  360. inter *get_inter(){
  361. inter *tmp;
  362. tmp = malloc(sizeof(inter)); // get an address for base var
  363. tmp->global_var = make_var();
  364. tmp->global_code = make_statement();
  365. return tmp;
  366. }