lexical.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154
  1. #include "__virtualmath.h"
  2. /**
  3. * 从文件中读取一个字节,并处理is_back
  4. * 每次从文件中读取字符时,则会保存字符到back.p中,调用backChar回退一个字符的时候则不需要传入字符了
  5. * @param file
  6. * @return 返回一个字符,若为EOF则返回-1
  7. */
  8. int readChar(LexFile *file){
  9. if (file->back.is_back)
  10. file->back.is_back = false;
  11. else
  12. file->back.p = fgetc(file->file);
  13. if (file->back.p == '\n')
  14. file->line++;
  15. return file->back.p;
  16. }
  17. /**
  18. * 设置字符回退
  19. * @param file
  20. */
  21. void backChar(LexFile *file){
  22. file->back.is_back = true;
  23. if (file->back.p == '\n')
  24. file->line --;
  25. }
  26. LexFile *makeLexFile(char *dir){
  27. LexFile *tmp = memCalloc(1, sizeof(LexFile));
  28. tmp->is_std = (bool)(dir == NULL);
  29. if (tmp->is_std)
  30. tmp->file = stdin;
  31. else
  32. tmp->file = fopen(dir, "r");
  33. tmp->back.is_back = false;
  34. tmp->back.p = EOF;
  35. tmp->line = 1;
  36. tmp->filter_data.enter = 0;
  37. return tmp;
  38. }
  39. void freeLexFile(LexFile *file) {
  40. FREE_BASE(file, return_);
  41. if (!file->is_std)
  42. fclose(file->file);
  43. memFree(file);
  44. return_:
  45. return;
  46. }
  47. /**
  48. * 初始化mather,代码被复用
  49. * @param mather
  50. */
  51. void setupMather(LexMather *mather){
  52. mather->len = 0;
  53. mather->str = NULL;
  54. mather->second_str = NULL;
  55. mather->string_type = '"';
  56. mather->status = LEXMATHER_START;
  57. }
  58. LexMather *makeMather(){
  59. LexMather *tmp = memCalloc(1, sizeof(LexMather));
  60. setupMather(tmp);
  61. return tmp;
  62. }
  63. void freeMather(LexMather *mather) {
  64. memFree(mather->str);
  65. memFree(mather->second_str);
  66. mather->len = 0;
  67. memFree(mather);
  68. }
  69. LexMathers *makeMathers(int size){
  70. LexMathers *tmp = memCalloc(1, sizeof(LexMathers));
  71. tmp->size = size;
  72. tmp->mathers = (struct LexMather**)memCalloc(size, sizeof(LexMather*));
  73. for(int i=0;i < size; i++)
  74. tmp->mathers[i] = makeMather();
  75. return tmp;
  76. }
  77. void freeMathers(LexMathers *mathers) {
  78. FREE_BASE(mathers, return_);
  79. for(int i=0;i < mathers->size; i++)
  80. freeMather(mathers->mathers[i]);
  81. memFree(mathers->mathers);
  82. mathers->size = 0;
  83. memFree(mathers);
  84. return_:
  85. return;
  86. }
  87. /**
  88. * 初始化mathers,本质是初始化mathers.mathers内所有的mather
  89. * @param mathers
  90. */
  91. void setupMathers(LexMathers *mathers){
  92. for (int i=0;i < mathers->size;i++){
  93. if(mathers->mathers[i]->str != NULL){
  94. memFree(mathers->mathers[i]->str);
  95. memFree(mathers->mathers[i]->second_str);
  96. }
  97. setupMather(mathers->mathers[i]);
  98. }
  99. }
  100. /**
  101. * 检查mathers中mather的匹配情况。
  102. * 情况1:只出现一个匹配器处于END状态,其他均处于MISTAKE或者END_SECOND状态,则视为匹配成功,返回END状态的匹配器
  103. * 情况2:只出现一个匹配器处于END_SECOND状态,其他均处于MISTAKE状态无END状态,则视为匹配成功,返回END_SECOND状态的匹配器
  104. * 情况3:全部都在MISTAKE,返回-2,匹配失败
  105. * 其他情况:匹配还未完成,返回-1
  106. * @param mathers
  107. * @param max
  108. * @return
  109. */
  110. int checkoutMather(LexMathers *mathers, int max) {
  111. bool return_1 = false;
  112. int mistake_count = 0;
  113. int end_count = 0, end_index = -1;
  114. int end_second_count = 0, end_second_index = -1;
  115. for (int i=0;i < mathers->size;i++){
  116. if(mathers->mathers[i]->status == LEXMATHER_END_1){
  117. end_count ++;
  118. end_index = i;
  119. }
  120. else if(mathers->mathers[i]->status == LEXMATHER_END_2){
  121. end_second_count ++;
  122. end_second_index = i;
  123. }
  124. else if(mathers->mathers[i]->status == LEXMATHER_MISTAKE){
  125. mistake_count ++;
  126. }
  127. else{
  128. return_1 = true;
  129. }
  130. }
  131. if (return_1)
  132. goto return_;
  133. if (mistake_count == max)
  134. return -2;
  135. else if(end_count == 1)
  136. return end_index;
  137. else if(end_second_count == 1)
  138. return end_second_index;
  139. return_:
  140. return -1;
  141. }