编译原理实验四 代码生成.docVIP

编译原理实验四 代码生成 输入：语法树。 输出：生成P代码存入codestr[codeindex]。 样例程序已经能生成P代码。 文法： 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[]={ID,ASSIGN,NUM,PLUS,NUM,TIMES,ID,SEMI,ID,ASSIGN,NUM,DOLLAR}; char tokenstring[][30]={ab,:=,12,+,5,*,x,;,xy,:=,34,$}; int wordindex=0; /*以上两个数组的索引*/ char codestr[30][30]; int codeindex=0; treenode * t; treenode * decl(); treenode * factor(); treenode * term(); treenode * exp(); treenode * assign_stmt(); treenode * stmt_seq(); pretraverse(treenode *); expcode(treenode *); gencode(treenode *); main() {int i; t=stmt_seq(); pretraverse(t); gencode(t); for(i=0; icodeindex;i++) printf(%s\n,codestr[i]); } treenode * stmt_seq() {treenode * t; treenode * p; if(( token[wordindex]==INT)||(token[wordindex]==FLOAT)) {t=decl(); } if(token[wordindex]==ID) t=assign_stmt(); p=t; while( (token[wordindex]==SEMI) (token[wordindex]!=DOLLAR)) {treenode * q; wordindex++; q=assign_stmt(); p-sibling=q; p=q; } return t; } treenode * assign_stmt() {treenode * t=(treenode *)malloc(sizeof(treenode)); if(