编译原理实验三 语义分析.doc

编译原理实验三 语法分析并进行语义分析 输入：经过词法分析后形成的token[]和tokenstring[] 输出：检查有无语法错误，形成语法树，并检查是否符合语义。 样例程序已经能对变量声明填符号表、进行类型检查。 文法： stmt_seq --statement ; stmt_seq | statement statement--decl_stmt | assign_stmt decl_stmt--type var_list type--int |float var_list--id , var_list | id assign_stmt-- id := exp exp--exp + term | exp - term |term term-- term * factor | term * factor | factor factor--id | num | ( exp ) 要求掌握理解程序设计方法。 样例程序 #includestdio.h #includectype.h typedef enum {MINUS,PLUS,TIMES,OVER,LPAREN,RPAREN,SEMI,ASSIGN,NUM,ID,INT,FLOAT,COMMA,DOLLAR} tokentype;/*记号*/ typedef enum {stmtk,expk} nodekind; typedef enum {ifk,assignk,declk} stmtkind; typedef enum {opk,constk,idk} expkind; typedef enum {integer,real} exptype; typedef struct treenode { struct treenode * child[3]; struct treenode * sibling; nodekind nodek; exptype dtype ; union { stmtkind stmt; expkind exp;} kind; union { tokentype op; int val; char * name; } attr; } treenode; typedef struct bucket {char * name; exptype dtype; struct bucket * next;} bucket; bucket * hashtable[211]; /*tokentype token[6]={ID,ASSIGN,NUM,PLUS,NUM,INT,FLOAT,COMMA,DOLLAR}; char tokenstring[6][30]={ab,:=,12,+,5,$};*/ tokentype token[]={INT,ID,COMMA,ID,SEMI, ID,ASSIGN,NUM,PLUS,NUM,TIMES,NUM,SEMI,ID,ASSIGN,NUM,DOLLAR}; char tokenstring[][30]={int,ab,,,xy,;,ab,:=,12,+,5,*,3,;,xy,:=,34,$}; int wordindex=0; /*以上两个数组的索引*/ treenode * decl(); treenode * factor(); treenode * term(); treenode * exp(); treenode * assign_stmt(); treenode * stmt_seq(); pretraverse(treenode *); int hash ( char * ); void st_insert( char * ,exptype); int st_lookup ( char * ); void buildsymtab(treenode * ); void setnodetype(treenode * ); main() {treenode * t; t=stmt_seq(); /*语法分析建语法树*/ buildsymtab(t); /*建符号表*/ pretraverse(t); /*遍历语法树*/ setnodetype(t); /*类型检查设置*/ } treenode * stmt_seq() {treenode * t; treenode * p; if(( token[wordindex]==INT)||(token[wordindex]==FLOAT)) {t=decl(); }