__grammar.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314
  1. #include "__grammar.h"
  2. /**
  3. * 二元匹配器
  4. * twoOperation:
  5. * | callBack
  6. * | twoOperation getSymbol callBack
  7. * @param callBack 符号左、右值匹配函数
  8. * @param getSymbol 符号处理函数
  9. * @param call_type 左、右值类型
  10. * @param self_type 输出token的类型
  11. * @param call_name 左、右值名称(log)
  12. * @param self_name 输出值名称(log)
  13. * @param is_right 表达式是否从右运算到左
  14. */
  15. inline void twoOperation(P_FUNC, PasersFunction callBack, GetSymbolFunction getSymbol, ChecktLeftToken checkleft,
  16. int call_type, int self_type, char *call_name, char *self_name, bool is_right) {
  17. bool is_right_ = false;
  18. while(true){
  19. Token *left_token = NULL;
  20. Token *right_token = NULL;
  21. Statement *st = NULL;
  22. long int line;
  23. if (readBackToken(pm) != self_type) {
  24. if (!callChildStatement(CP_FUNC, callBack, call_type, &st, NULL))
  25. goto return_;
  26. addStatementToken(self_type, st, pm);
  27. continue;
  28. }
  29. left_token = popNewToken(pm->tm);
  30. line = left_token->line;
  31. if (getSymbol(CP_FUNC, readBackToken(pm), &st))
  32. delToken(pm);
  33. else{
  34. backToken_(pm, left_token);
  35. goto return_;
  36. }
  37. if (checkleft != NULL && !checkleft(CP_FUNC, left_token->data.st)) {
  38. freeToken(left_token, true);
  39. goto return_;
  40. }
  41. callBack(CP_FUNC); // 获得右值
  42. if (!call_success(pm) || readBackToken(pm) != call_type){ // 若非正确数值
  43. syntaxError(pm, syntax_error, line, 5, "ERROR from ", self_name, "(get right ", call_name, ")");
  44. freeToken(left_token, true);
  45. freeStatement(st);
  46. goto return_;
  47. }
  48. right_token = popNewToken(pm->tm);
  49. addToken_(pm, setOperationFromToken(&st, left_token, right_token, self_type, is_right_));
  50. is_right_ = is_right; // 第一次is_right不生效
  51. }
  52. return_: return;
  53. }
  54. /**
  55. * syntax错误处理器
  56. * @param pm
  57. * @param message 错误信息
  58. * @param status 错误类型
  59. */
  60. void syntaxError(ParserMessage *pm, int status, long int line, int num, ...) {
  61. char *message = NULL;
  62. if (pm->status != success)
  63. return;
  64. if (status <= 0){
  65. message = memStrcpy("Not Message");
  66. goto not_message;
  67. }
  68. va_list message_args;
  69. va_start(message_args, num);
  70. for (int i=0; i < num; i++)
  71. message = memStrcat(message, va_arg(message_args, char *), true, false);
  72. va_end(message_args);
  73. char info[100];
  74. snprintf(info, 100, "\non line %ld\nin file ", line);
  75. message = memStrcat(message, info, true, false);
  76. message = memStrcat(message, pm->file, true, false);
  77. not_message:
  78. pm->status = status;
  79. pm->status_message = message;
  80. }
  81. int readBackToken(ParserMessage *pm){
  82. Token *tmp = popNewToken(pm->tm);
  83. int type = tmp->token_type;
  84. if (type == -2)
  85. syntaxError(pm, lexical_error, tmp->line, 1, "lexical make some error");
  86. else if (type == -3)
  87. syntaxError(pm, int_error, tmp->line, 1, "KeyInterrupt");
  88. addBackToken(pm->tm->ts, tmp);
  89. return type;
  90. }
  91. bool checkToken(ParserMessage *pm, int type){
  92. if (readBackToken(pm) != type)
  93. return false;
  94. delToken(pm);
  95. return true;
  96. }
  97. bool commandCallControl_(P_FUNC, MakeControlFunction callBack, int type, Statement **st, bool must_operation, char *error_message) {
  98. Token *tmp_token = NULL;
  99. *st = NULL;
  100. parserControl(CP_FUNC, callBack, type, must_operation, error_message);
  101. if (!call_success(pm) || readBackToken(pm) != type)
  102. return false;
  103. tmp_token = popNewToken(pm->tm);
  104. *st = tmp_token->data.st;
  105. freeToken(tmp_token, false);
  106. return true;
  107. }
  108. bool callParserCode(P_FUNC, Statement **st, char *message, long int line) {
  109. Token *tmp;
  110. *st = NULL;
  111. parserCode(CP_FUNC);
  112. if (!call_success(pm) || readBackToken(pm) != T_CODE) {
  113. if (message != NULL)
  114. syntaxError(pm, syntax_error, line, 1, message);
  115. return false;
  116. }
  117. tmp = popNewToken(pm->tm);
  118. *st = tmp->data.st;
  119. freeToken(tmp, false);
  120. return true;
  121. }
  122. bool callParserAs(P_FUNC, Statement **st, char *message){
  123. *st = NULL;
  124. if (readBackToken(pm) == MATHER_AS) {
  125. delToken(pm);
  126. return callChildStatement(CP_FUNC, parserOperation, T_OPERATION, st, message);
  127. }
  128. return true;
  129. }
  130. bool callChildToken(P_FUNC, PasersFunction callBack, int type, Token **tmp, char *message, int error_type) {
  131. *tmp = NULL;
  132. callBack(CP_FUNC);
  133. if (!call_success(pm) || readBackToken(pm) != type) {
  134. if (message != NULL) {
  135. *tmp = popNewToken(pm->tm);
  136. syntaxError(pm, error_type, (*tmp)->line, 1, message);
  137. backToken_(pm, (*tmp));
  138. }
  139. return false;
  140. }
  141. *tmp = popNewToken(pm->tm);
  142. return true;
  143. }
  144. bool callChildStatement(P_FUNC, PasersFunction callBack, int type, Statement **st, char *message){
  145. Token *tmp = NULL;
  146. *st = NULL;
  147. bool status = callChildToken(CP_FUNC, callBack, type, &tmp, message, syntax_error);
  148. if (!status)
  149. return false;
  150. *st = tmp->data.st;
  151. freeToken(tmp, false);
  152. return true;
  153. }
  154. /**
  155. * is_dict的默认模式为 s_2 ,一般情况默认模式为 s_1
  156. * 若获得MUL则进入模式 s_3, 若获得POW则进入模式 s_4
  157. * get operation [1]
  158. * 若模式为 s_1
  159. * - 检查是否为sep符号
  160. * - 若不是sep符号则检查是否为ass符号
  161. * - 若是ass符号则进入 s_2 模式
  162. * - 若不是ass符号则标注该参数为最后匹配参数
  163. * - 若是sep符号则保持 s_1 模式
  164. * 若模式为 s_2
  165. * - 检查是否为ass符号
  166. * - 若不是ass符号则报错
  167. * - 若是ass符号则保持 s_2 模式
  168. * 若模式为 s_3 / s_4
  169. * - 检查是否为sep符号
  170. * - 若不是sep符号则标注该参数为最后匹配参数
  171. * - 若是sep则保持 s_3 / s_4 模式
  172. * ... 合成 Parameter 并且链接 ...
  173. * 重复操作
  174. *
  175. * @param is_formal 是否为形式参数, 若为true,则限定*args为only_value的结尾, **kwargs为name_value结尾
  176. * @param is_list 若为true则关闭对name_value和**kwargs的支持
  177. * @param is_dict 若为true则关闭对only_value和*args的支持 (is_list和is_dict同时为true表示纯 a,b,c 匹配)
  178. * @param sep 设定分割符号
  179. * @param ass 设定赋值符号
  180. * @return
  181. */
  182. bool parserParameter(P_FUNC, Parameter **pt, bool enter, bool is_formal, bool is_list, bool is_dict,
  183. int sep, int ass, int n_sep) {
  184. Parameter *new_pt = NULL;
  185. Token *tmp;
  186. bool last_pt = false;
  187. int is_sep = 0; // 0: 不需要处理 1: 是is_sep 2: 处理过is_sep
  188. enum {
  189. s_1, // only_value模式
  190. s_2, // name_value模式
  191. s_3, // only_args模式
  192. s_4, // name_args模式
  193. } status;
  194. if (enter)
  195. lexEnter(pm, true);
  196. if (is_dict && !is_list)
  197. status = s_2; // is_formal关闭对only_value的支持
  198. else
  199. status = s_1;
  200. for (int count = 0; !last_pt; count++){ // 计算匹配到parameter的个数
  201. tmp = NULL;
  202. if (is_sep == 1 || !is_formal && count > 1) // 限制实参的;分隔符前最多只有两个参数
  203. is_sep = 2;
  204. if (!is_dict && status != s_2 && checkToken(pm, MATHER_MUL)) // is_formal关闭对*args的支持
  205. status = s_3;
  206. else if (!is_list && checkToken(pm, MATHER_POW)) // is_formal关闭对*args的支持
  207. status = s_4;
  208. parserOr(CP_FUNC);
  209. if (!call_success(pm))
  210. goto error_;
  211. if (readBackToken(pm) != T_OR) {
  212. if (status == s_3) {
  213. long int line = pm->tm->ts->token_list->line;
  214. syntaxError(pm, syntax_error, line, 1, "Don't get a parameter after *");
  215. goto error_;
  216. }
  217. break;
  218. }
  219. tmp = popNewToken(pm->tm);
  220. int pt_type = value_par;
  221. if (status == s_1){
  222. if (!checkToken(pm, sep)){
  223. if (is_sep == 0 && n_sep != -1 && checkToken(pm, n_sep))
  224. is_sep = 1;
  225. else if (is_list || !checkToken(pm, ass)) // // is_list关闭对name_value的支持
  226. last_pt = true;
  227. else {
  228. pt_type = name_par;
  229. status = s_2;
  230. }
  231. }
  232. }
  233. else if (status == s_2){
  234. pt_type = name_par;
  235. if (!checkToken(pm, ass))
  236. goto error_;
  237. }
  238. else if (status == s_3){
  239. pt_type = args_par;
  240. if (!checkToken(pm, sep))
  241. last_pt = true;
  242. }
  243. else {
  244. pt_type = kwargs_par;
  245. if (!checkToken(pm, sep))
  246. last_pt = true;
  247. }
  248. if (pt_type == value_par)
  249. new_pt = connectValueParameter(tmp->data.st, new_pt, is_sep == 1);
  250. else if (pt_type == name_par){
  251. Statement *tmp_value;
  252. if (!callChildStatement(CP_FUNC, parserOr, T_OR, &tmp_value, "Don't get a parameter value"))
  253. goto error_;
  254. new_pt = connectNameParameter(tmp_value, tmp->data.st, new_pt);
  255. if (!checkToken(pm, sep))
  256. last_pt = true;
  257. }
  258. else if (pt_type == args_par){
  259. new_pt = connectArgsParameter(tmp->data.st, new_pt, is_sep == 1);
  260. if (is_formal)
  261. status = s_2; // 是否规定*args只出现一次
  262. else
  263. status = s_1;
  264. }
  265. else {
  266. new_pt = connectKwargsParameter(tmp->data.st, new_pt);
  267. if (is_formal)
  268. last_pt = true; // 是否规定**kwargs只出现一次
  269. else
  270. status = s_2;
  271. }
  272. freeToken(tmp, false);
  273. }
  274. *pt = new_pt;
  275. if (enter)
  276. lexEnter(pm, false);
  277. return true;
  278. error_:
  279. freeToken(tmp, true);
  280. freeParameter(new_pt, true);
  281. *pt = NULL;
  282. if (enter)
  283. lexEnter(pm, false);
  284. return false;
  285. }
  286. void lexEnter(ParserMessage *pm, bool lock){
  287. if (lock)
  288. pm->tm->file->filter_data.enter ++;
  289. else
  290. pm->tm->file->filter_data.enter --;
  291. }