lexical.c 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151
  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->file = fopen(dir, "r");
  29. tmp->back.is_back = false;
  30. tmp->back.p = EOF;
  31. tmp->line = 1;
  32. tmp->filter_data.enter = 0;
  33. return tmp;
  34. }
  35. void freeLexFile(LexFile *file) {
  36. freeBase(file, return_);
  37. fclose(file->file);
  38. memFree(file);
  39. return_:
  40. return;
  41. }
  42. /**
  43. * 初始化mather,代码被复用
  44. * @param mather
  45. */
  46. void setupMather(LexMather *mather){
  47. mather->len = 0;
  48. mather->str = NULL;
  49. mather->second_str = NULL;
  50. mather->string_type = '"';
  51. mather->status = LEXMATHER_START;
  52. }
  53. LexMather *makeMather(){
  54. LexMather *tmp = memCalloc(1, sizeof(LexMather));
  55. setupMather(tmp);
  56. return tmp;
  57. }
  58. void freeMather(LexMather *mather) {
  59. memFree(mather->str);
  60. memFree(mather->second_str);
  61. mather->len = 0;
  62. memFree(mather);
  63. }
  64. LexMathers *makeMathers(int size){
  65. LexMathers *tmp = memCalloc(1, sizeof(LexMathers));
  66. tmp->size = size;
  67. tmp->mathers = (struct LexMather**)memCalloc(size, sizeof(LexMather*));
  68. for(int i=0;i < size; i++){
  69. tmp->mathers[i] = makeMather();
  70. }
  71. return tmp;
  72. }
  73. void freeMathers(LexMathers *mathers) {
  74. freeBase(mathers, return_);
  75. for(int i=0;i < mathers->size; i++){
  76. freeMather(mathers->mathers[i]);
  77. }
  78. memFree(mathers->mathers);
  79. mathers->size = 0;
  80. memFree(mathers);
  81. return_:
  82. return;
  83. }
  84. /**
  85. * 初始化mathers,本质是初始化mathers.mathers内所有的mather
  86. * @param mathers
  87. */
  88. void setupMathers(LexMathers *mathers){
  89. for (int i=0;i < mathers->size;i++){
  90. if(mathers->mathers[i]->str != NULL){
  91. memFree(mathers->mathers[i]->str);
  92. memFree(mathers->mathers[i]->second_str);
  93. }
  94. setupMather(mathers->mathers[i]);
  95. }
  96. }
  97. /**
  98. * 检查mathers中mather的匹配情况。
  99. * 情况1:只出现一个匹配器处于END状态,其他均处于MISTAKE或者END_SECOND状态,则视为匹配成功,返回END状态的匹配器
  100. * 情况2:只出现一个匹配器处于END_SECOND状态,其他均处于MISTAKE状态无END状态,则视为匹配成功,返回END_SECOND状态的匹配器
  101. * 情况3:全部都在MISTAKE,返回-2,匹配失败
  102. * 其他情况:匹配还未完成,返回-1
  103. * @param mathers
  104. * @param max
  105. * @return
  106. */
  107. int checkoutMather(LexMathers *mathers, int max) {
  108. bool return_1 = false;
  109. int mistake_count = 0;
  110. int end_count = 0, end_index = -1;
  111. int end_second_count = 0, end_second_index = -1;
  112. for (int i=0;i < mathers->size;i++){
  113. if(mathers->mathers[i]->status == LEXMATHER_END_1){
  114. end_count ++;
  115. end_index = i;
  116. }
  117. else if(mathers->mathers[i]->status == LEXMATHER_END_2){
  118. end_second_count ++;
  119. end_second_index = i;
  120. }
  121. else if(mathers->mathers[i]->status == LEXMATHER_MISTAKE){
  122. mistake_count ++;
  123. }
  124. else{
  125. return_1 = true;
  126. }
  127. }
  128. if (return_1)
  129. goto return_;
  130. if (mistake_count == max)
  131. return -2;
  132. else if(end_count == 1)
  133. return end_index;
  134. else if(end_second_count == 1)
  135. return end_second_index;
  136. return_:
  137. return -1;
  138. }