编译器设计和实现.ppt

编译器设计与实现;一、概述;2、编译器各阶段的分组;二、符号表;1、符号的表示;1、符号的表示;2、符号表的表示;;*;4、符号表的相关操作;三、代码生成接口;1、类型度量;2、接口记录;3、dag操作;3、dag操作;*;*;3、dag操作;4、接口标志;5、函数;6、上行调用;四、词法分析;1、输入;2、单词识别;emun{ #define xx(a,b,c,d,e,f,g) a=b, #define yy(a,b,c,d,e,f,g) #include “token.h” LAST } token.h文件： yy(0, 0, 0, 0, 0, 0, 0) xx(FLOAT, 1, 0, 0, 0, CHAR, float) xx(DOUBLE, 2, 0, 0, 0, CHAR, double) xx(CHAR, 3, 0, 0, 0, CHAR, char) xx(SHORT, 4, 0, 0, 0, CHAR, short) xx(INT, 5, 0, 0, 0, CHAR, int) xx(UNSIGNED, 6, 0, 0, 0, CHAR, unsigned) xx(POINTER, 7, 0, 0, 0, 0, pointer) xx(VOID, 8, 0, 0, 0, CHAR, void) xx(STRUCT, 9, 0, 0, 0, CHAR, struct) … …;3、关键字的识别;4、标识符识别;5、其他;五、语法分析;1、表达式;表达式的分析： c语言的小部分表达式语法: expr: term{+term} term: factor {*factor} factor: ID| ‘(’ expr ‘)’ T(expr) T(term{+term}) T(term)T({+term}) term();T({+term}) term();while(t == ‘+’) {T(+term)} term();while(t == ‘+’) {T(+)T(term)} term();while(t == ‘+’) {t = gettok();T(term)} term();while(t == ‘+’) {t = gettok(); term()} 同理得分析函数term是：factor();while(t == ‘*’) {t = gettok(); factor()} ;c语言表达式分析 赋值表达式： assignment-expression: conditional-expression unary-expression assign-operator assignment-expression Tree expr1(int tok) { static char stop[] = { IF, ID, 0 }; Tree p = expr2(); if (t == =‘ || (prec[t] = 6 prec[t] = 8) || (prec[t] = 11 prec[t] = 13)) { int op = t; t = gettok(); if (oper[op] == ASGN) p = asgntree(ASGN, p, value(expr1(0))); else augmented assignment return p };条件表达式： conditonal-expression: binary-expression[? expression : conditional-expression] static Tree expr2(void) { Tree p = expr3(4); if (t == ?) { Tree l, r; Coordinate pts[2]; if (Aflag 1 isfunc(p-type)) warning(%s used in a conditional expression\n, funcname(p)); p = pointer(p); t = gettok(); pts[0] = src; l = pointer(expr(:)); pts[1]