编译词法分析器（Compile lexical analyzer）.doc

编译词法分析器（Compile lexical analyzer） # includes stdio.h # includes stdlib.h # includes string.h char kindcode [34] [20] = {undefined, identifier, integer, +, -, *, /, %, , = , =, = =, . = , , | | , = , (, , ,, ],, (, ), ;,, , void, int, float, char. if, else, white, do, return}; / / 种别码定义 char prog [200]. int p = 0; / / 搜索指示器 void combine (char * token, char c) { int i; the = strlen (token). token [+ +] = c; } bool isletter (char c) { if (c = c = zs | | c = a c = z) return 1; else return 0; } bool isdigit (char c) { if (c = 0 c = 9) return 1; else return 0; } int checkbiao (char token []) { int i; for (i = 0; i 34; i + +) { if (strcmp (token, kindcode [i]) = = 0) return i; } return 0; } void menu () { printf (* * * * 欢迎使用c语言小子集词法分析程序 * * * \ n ); printf (* * * 0 - - undefined 1 - - 2 - - integer identifier is * * * \ n ); printf (* * *) - + 4 - - - 5 - - * * * * * \ n ); printf (* * 6 - / 7 - % 8 * * * n ); printf (* * 9 - = 10 - 11 - = * * n); printf (* * 12 - = = 13 - ! = 14 - * * n ); printf (* * 15 - | | 16 - = 17 - ( * * n); printf (* 18 - 19 - - [20] * * n ); printf (* 21 - - - - {22} 23 ; * * n ); printf (* * 24 - , 25 - void 26 - int * * n); printf (* * 27 - float 28 char 29 - - if * * n); printf (* * 30 - else 31 - while 32 - do * * n); printf (* * 33 - - return * * n); } int main () {* fp1 file * fp; int i; char token [200], filename [30]; char ch; memset (token, 0, sizeof (token)); memset (prog, 0, sizeof (prog)); menu (); printf (请输入文件名: \ n); scanf (% s, filename); if ((fp = fopen (filename, r)) = = null) { printf (此文件不存在! \ n ); return 0; } printf (读取程序成功! \ n ); Printf (the result of lexical analysis is also available in the E disk, result.Txt): \n; For (i=0; (ch=fgetc (FP)) =EOF; i++) { Prog[i]=ch; } Prog[i]=\0; Fclose (FP); Ch=prog[0]; Fp1=fopen (E:\\ results.Txt, w+); While (CH, =\0) { If (isletter (CH)) { While (isletter (CH) ==1||isdigit (CH) ==1) { Combine (token, CH); Ch=prog[++p]; } I=checkbiao (token); If (I) / /