编译原理小型C语言词法分析器

#include<iostream>

#include<string>

#include<map>

using namespace std;

map<int, string>Key_words, Symbols;//存储关键字,存储算符和界符

string S[1000], Ans[1000];//存储输入,输出

int cnt = 0, wrong_cnt = 0, wrong_line[1000];//存储有效行数量,错误行数量,错误行记录

bool f = 1;//注释标记

void Initialize_Key_words() {//初始化关键字

 Key_words[3] = "void", Key_words[4] = "int", Key_words[5] = "float", Key_words[6] = "char", Key_words[7] = "if", Key_words[8] = "else",

  Key_words[9] = "while", Key_words[10] = "do", Key_words[11] = "for", Key_words[12] = "return", Key_words[13] = "main";

}

void Initialize_Symbols() {//初始化算符和界符

 Symbols[14] = "+", Symbols[15] = "-", Symbols[16] = "*", Symbols[17] = "/", Symbols[18] = "%", Symbols[19] = "<",

  Symbols[20] = "<=", Symbols[21] = ">", Symbols[22] = ">=", Symbols[23] = "==", Symbols[24] = "!=", Symbols[25] = "&&",

  Symbols[26] = "||", Symbols[27] = "=", Symbols[28] = "(", Symbols[29] = ")", Symbols[30] = "[", Symbols[31] = "]",

  Symbols[32] = "{", Symbols[33] = "}", Symbols[34] = ";", Symbols[35] = ",";

}

int isKey_words(string s) {//判断是否为关键字

 for (int i = 3; i <= 13; i++)if (Key_words[i] == s)return i;

 return -1;

}

int isSymbol(string s) {//判断是否为算符和界符

 for (int i = 14; i <= 35; i++)if (Symbols[i] == s)return i;

 return -1;

}

string isNum(string s) {//判断是否为数字

 for (int i = 0; i < s.size(); i++)

  if (s[i] >= '0' && s[i] <= '9');

  else return "-1";

 return s;

}

string isLetter(string s) {//判断是否为字母

 for (int i = 0; i < s.size(); i++)

  if ((s[i] >= 'a' && s[i] <= 'z') || (s[i] >= 'A' && s[i] <= 'Z'));

  else return "-1";

 return s;

}

string isIdentifier(string s) {//判断是否是标识符

 if ((s[0] >= 'a' && s[0] <= 'z') || (s[0] >= 'A' && s[0] <= 'Z') || s[0] == '_')return s;

 else return "-1";

}

void check(string temp, int cnt) {//检测每个单词并存储答案

 string print;

 if (isKey_words(temp) != -1)print += "<", print += to_string(isKey_words(temp)), print += ",->,";

 else if (isSymbol(temp) != -1)print += "<", print += to_string(isSymbol(temp)), print += ",->,";

 else if (isNum(temp) != "-1")print += "<2,", print += temp, print += ">,";

 else if (isLetter(temp) != "-1")print += "<1,", print += temp, print += ">,";

 else {

  if (isIdentifier(temp) != "-1")print += "<1,", print += temp, print += ">,";

  else print += "LexicalError,", wrong_line[wrong_cnt++] = cnt + 1;

 } 

 Ans[cnt] += print;

}

bool fun(int cnt) {//词法分析处理

 //预处理单词

 string temp;

 for (int i = 0; i < S[cnt].size(); i++) {

  string ch;

  ch += S[cnt][i];//提取每个字符

  if (isSymbol(ch) != -1) {//将界符和算符分成单独的单词

   if (ch == "<" || ch == ">" || ch == "=") {//特判字符长度为二的界符和算符

    if (i + 1 < S[cnt].size() && S[cnt][i + 1] == '=' && f)temp += ' ', temp += ch, temp += '=', temp += ' ', i++;

    else if (f)temp += ' ', temp += ch, temp += ' ';

   }

   else if (ch == "/") {//特判注释

    if (i + 1 < S[cnt].size() && S[cnt][i + 1] == '/')goto loop;//遇到"//"就跳过后面单词的识别

    else if (i + 1 < S[cnt].size() && S[cnt][i + 1] == '*')f = 0;//遇到"/*"就封锁输入

   }

   else if (ch == "*" && i + 1 < S[cnt].size() && S[cnt][i + 1] == '/')f = 1;//直到遇到"*/"正常输入

   else if (f)temp += ' ', temp += ch, temp += ' ';

  }

  else if (ch == "!" && i + 1 < S[cnt].size() && S[cnt][i + 1] == '=' && f)temp += ' ', temp += ch, temp += '=', temp += ' ', i++;//特判!=

  else if (ch == "&" && i + 1 < S[cnt].size() && S[cnt][i + 1] == '&' && f)temp += ' ', temp += ch, temp += '&', temp += ' ', i++;//特判&&

  else if (ch == "|" && i + 1 < S[cnt].size() && S[cnt][i + 1] == '|' && f)temp += ' ', temp += ch, temp += '|', temp += ' ', i++;//特判||

  else if (f)temp += S[cnt][i];

 }

loop:

 temp += ' '; if (temp == " ")return 0;

 //拆单词

 string slice;

 for (int i = 0; i < temp.size(); i++) {

  if (temp[i] != ' ')slice += temp[i];//遇到连续非空字符就提取成一个单词

  else if (slice.size() != 0) {

   check(slice, cnt);//检测该单词

   slice = "";

  }

 }

 return 1;

}

int main() {

 Initialize_Key_words(), Initialize_Symbols();//初始化

 while (1) {

  getline(cin, S[cnt]);//按行输入

  if (S[cnt] == "#")break;

  if (S[cnt].size() != 0 && fun(cnt))cnt++;//去掉注释后,如果该行字符长度不为零,则行数加以

 }

 for (int i = 0; i < cnt; i++)cout << Ans[i] << endl;//输出答案

 if (wrong_cnt != 0) {//如果有错误行,输出错误行序号

  cout << "LexicalError(s) on line(s) ";

  for (int i = 0; i < wrong_cnt; i++)cout << wrong_line[i] << ",";

 }

 return 0;

}

  • 4
    点赞
  • 6
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
设计思想 (1)程序主体结构部分: 说明部分 %% 规则部分 %% 辅助程序部分 (2)主体结构的说明 在这里说明部分告诉我们使用的LETTER,DIGIT, IDENT(标识符,通常定义为字母开头的字母数字串)和STR(字符串常量,通常定义为双引号括起来的一串字符)是什么意思.这部分也可以包含一些初始化代码.例如用#include来使用标准的头文件和前向说明(forward ,references).这些代码应该再标记"%{"和"%}"之间;规则部分>可以包括任何你想用来分析的代码;我们这里包括了忽略所有注释中字符的功能,传送ID名称和字符串常量内容到主调函数和main函数的功能. (3)实现原理 程序中先判断这个句语句中每个单元为关键字、常数、运算符、界符,对与不同的单词符号给出不同编码形式的编码,用以区分之。 PL/0语言的EBNF表示 <常量定义>::=<标识符>=<无符号整数>; <标识符>::=<字母>={<字母>|<数字>}; <加法运算符>::=+|- <乘法运算符>::=*|/ <关系运算符>::==|#|<|<=|>|>= <字母>::=a|b|…|X|Y|Z <数字>::=0|1|2|…|8|9 三:设计过程 1. 关键字:void,main,if,then,break,int,Char,float,include,for,while,printfscanf 并为小写。 2."+”;”-”;”*”;”/”;”:=“;”:”;”<“;”<=“;”>“;”>=“;”<>“;”=“;”(“;”)”;”;”;”#”为运算符。 3. 其他标记 如字符串,表示以字母开头的标识符。 4. 空格符跳过。 5. 各符号对应种别码 关键字分别对应1-13 运算符分别对应401-418,501-513。 字符串对应100 常量对应200 结束符# 四:举例说明 目标:实现对常量的判别 代码: digit [0-9] letter [A-Za-z] other_char [!-@\[-~] id ({letter}|[_])({letter}|{digit}|[_])* string {({letter}|{digit}|{other_char})+} int_num {digit}+ %% [ |\t|\n]+ "auto"|"double"|"int"|"struct"|"break"|"else"|"long"|"switch"|"case"|"enum"|"register"|"typedef"|"char"|"extern"|"return"|"union"|"const"|"float"|"short"|"unsigned"|"continue"|"for"|"signed"|"void"|"default"|"goto"|"sizeof"|"do"|"if"|"static"|"while"|"main" {Upper(yytext,yyleng);printf("%s,NULL\n",yytext);} \"([!-~])*\" {printf("CONST_string,%s\n",yytext);} -?{int_num}[.]{int_num}?([E][+|-]?{int_num})? {printf("CONST_real,%s\n",yytext);} "0x"?{int_num} {printf("CONST_int,%s\n",yytext);} ","|";"|"("|")"|"{"|"}"|"["|"]"|"->"|"."|"!"|"~"|"++"|"--"|"*"|"&"|"sizeof"|"/"|"%"|"+"|"-"|">"|"<"|">="|"<="|"=="|"!="|"&"|"^"|"|"|"&"|"||"|"+="|"-="|"*="|"/="|"%="|">>="|"<<="|"&="|"^="|"|="|"=" {printf("%s,NULL\n",yytext);} {id} {printf("ID,%s\n",yytext);} {digit}({letter})+ {printf("error1:%s\n",yytext);} %% #include <ctype.h> Upper(char *s,int l) { int i; for(i=0;i<l;i++) { s[i]=toupper(s[i]); } } yywrap() { return 1; } 五:DFA 六:数据测试 七:心得体会 其实匹配并不困难,主要是C++知识要求相对较高,只要把握住指针就好了。 附源程序: #include<iostream.h> #include<stdio.h> #include<stdlib.h> #include<string.h> int i,j,k,flag,number,status; /*status which is use to judge the string is keywords or not!*/ char ch; char words[10] = {" "}; char program[500]; int Scan(char program[]) { char *keywords[13] = {"void","main","if","then","break","int", "char","float","include","for","while","printf", "scanf"}; number = 0; status = 0; j = 0; ch = program[i++]; /* To handle the lettle space ands tab*/ /*handle letters*/ if ((ch >= 'a') && (ch <= 'z' )) { while ((ch >= 'a') && (ch <= 'z' )) { words[j++]=ch; ch=program[i++]; } i--; words[j++] = '\0'; for (k = 0; k < 13; k++) if (strcmp (words,keywords[k]) == 0) switch(k) { case 0:{ flag = 1; status = 1; break; } case 1:{ flag = 2; status = 1; break; } case 2:{ flag = 3; status = 1; break; } case 3:{ flag = 4; status = 1; break; } case 4:{ flag = 5; status = 1; break; } case 5:{ flag = 6; status = 1; break; } case 6:{ flag = 7; status = 1; break; } case 7:{ flag = 8; status = 1; break; } case 8:{ flag = 9; status = 1; break; } case 9:{ flag = 10; status = 1; break; } case 10:{ flag = 11; status = 1; break; } case 11:{ flag = 12; status = 1; break; } case 12:{ flag = 13; status = 1; break; } } if (status == 0) { flag = 100; } } /*handle digits*/ else if ((ch >= '0') && (ch <= '9')) { number = 0; while ((ch >= '0' ) && (ch <= '9' )) { number = number*10+(ch-'0'); ch = program[i++]; } flag = 200; i--; } /*opereation and edge handle*/ else switch (ch) { case '=':{ if (ch == '=') words[j++] = ch; words[j] = '\0'; ch = program[i++]; if (ch == '=') { words[j++] = ch; words[j] = '\0'; flag = 401; } else { i--; flag = 402; } break; } case'>':{ if (ch == '>') words[j++] = ch; words[j] = '\0'; ch = program[i++]; if (ch == '=') { words[j++] = ch; words[j] = '\0'; flag = 403; } else { i--; flag = 404; } break; } case'<':{ if (ch == '<') words[j++] = ch; words[j] = '\0'; ch = program[i++]; if (ch == '=') { words[j++] = ch; words[j] = '\0'; flag = 405; } else { i--; flag = 406; } break; } case'!':{ if (ch == '!') words[j++] = ch; words[j] = '\0'; ch = program[i++]; if (ch == '=') { words[j++] = ch; words[j] = '\0'; flag = 407; } else { i--; flag = 408; } break; } case'+':{ if (ch == '+') words[j++] = ch; words[j] = '\0'; ch = program[i++]; if (ch == '=') { words[j++] = ch; words[j] = '\0'; flag = 409; } else if (ch == '+') { words[j++] = ch; words[j] = '\0'; flag = 410; } else { i--; flag = 411; } break; } case'-':{ if (ch == '-') words[j++] = ch; words[j] = '\0'; ch = program[i++]; if (ch == '=') { words[j++] = ch; words[j] = '\0'; flag = 412; } else if( ch == '-') { words[j++] = ch; words[j] = '\0'; flag = 413; } else { i--; flag = 414; } break; } case'*':{ if (ch == '*') words[j++] = ch; words[j] = '\0'; ch = program[i++]; if (ch == '=') { words[j++] = ch; words[j] = '\0'; flag = 415; } else { i--; flag = 416; } break; } case'/':{ if (ch == '/') words[j++] = ch; words[j] = '\0'; ch = program[i++]; if (ch == '=') { words[j++] = ch; words[j] = '\0'; flag = 417; } else { i--; flag = 418; } break; } case';':{ words[j] = ch; words[j+1] = '\0'; flag = 501; break; } case'(':{ words[j] = ch; words[j+1] = '\0'; flag = 502; break; } case')':{ words[j] = ch; words[j+1] = '\0'; flag = 503; break; } case'[':{ words[j] = ch; words[j+1] = '\0'; flag = 504; break; } case']':{ words[j] = ch; words[j+1] = '\0'; flag = 505; break; } case'{':{ words[j] = ch; words[j+1] = '\0'; flag = 506; break; } case'}':{ words[j] = ch; words[j+1] = '\0'; flag = 507; break; } case':':{ words[j] = ch; words[j+1] = '\0'; flag = 508; break; } case'"':{ words[j] = ch; words[j+1] = '\0'; flag = 509; break; } case'%':{ if (ch == '%') words[j++] = ch; words[j] = '\0'; ch = program[i++]; if (ch == '=') { words[j++] = ch; words[j] = '\0'; flag = 510; } else { i--; flag = 511; } break; } case',':{ words[j] = ch; words[j+1] = '\0'; flag = 512; break; } case'#':{ words[j] = ch; words[j+1] = '\0'; flag = 513; break; } case'@':{ words[j] = '#'; flag = 0; break; } default:{ flag = -1; break; } } return flag; } main() { i=0; printf("please input a program end with @"); do { ch = getchar(); program[i++] = ch; }while(ch != '@'); i = 0; do{ flag = Scan(program); if (flag == 200) { printf("(%2d,%4d)",flag,number); } else if (flag == -1) { printf("(%d,error)",flag); } else { printf("(%2d,%4s)",flag,words); } }while (flag != 0); system("pause"); }
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值