util.c

6个不同的词法语法分析程序源代码

#include "globals.h"
#include "util.h"

/* Procedure printToken prints a token 
 * and its lexeme to the listing file
 */
void printToken( TokenType token, const char* tokenString )
{ switch (token)
  { case IF:
    case ELSE:
    case WHILE:
    case DO:
    case GOTO:
    case BREAK:
    case CONTINUE:
	case MAIN:
	case RINT:
	case RFLOAT:
	case RCHAR:
      fprintf(listing,
         "reserved word: %s\n",tokenString);
      break;
    case ASSIGN: fprintf(listing,"=\n"); break;
    case LT: fprintf(listing,"<\n"); break;
	case MT: fprintf(listing,">\n"); break;
    case LE: fprintf(listing,"<=\n"); break;
	case ME: fprintf(listing,">=\n"); break;
	case EQ: fprintf(listing,"==\n"); break;
    case NE: fprintf(listing,"<\n"); break;
	case LP: fprintf(listing,"(\n"); break;
    case RP: fprintf(listing,")\n"); break;
    case LS: fprintf(listing,"[\n"); break;
	case RS: fprintf(listing,"]\n"); break;
	case LB: fprintf(listing,"{\n"); break;
	case RB: fprintf(listing,"}\n"); break;
	case SEMI: fprintf(listing,";\n"); break;
    case COMMA: fprintf(listing,",\n"); break;
	case PLUS: fprintf(listing,"+\n"); break;
    case MINUS: fprintf(listing,"-\n"); break;
    case TIMES: fprintf(listing,"*\n"); break;
    case OVER: fprintf(listing,"/\n"); break;
	case AND: fprintf(listing,"&&\n"); break;
	case OR: fprintf(listing,"||\n"); break;
	case NOT: fprintf(listing,"!\n"); break;
    case ENDFILE: fprintf(listing,"EOF\n"); break;
    case INT:
      fprintf(listing,
          "INT, val= %s\n",tokenString);
      break;
	case FLOAT:
      fprintf(listing,
          "FLOAT, val= %s\n",tokenString);
      break;
	case CHAR:
      fprintf(listing,
          "CHAR, val= %s\n",tokenString);
      break;
    case ID:
      fprintf(listing,
          "ID, name= %s\n",tokenString);
      break;
    case ERROR:
      fprintf(listing,
          "ERROR: %s\n",tokenString);
      break;
    default: /* should never happen */
      fprintf(listing,"Unknown token: %d\n",token);
  }
}

/* Function newStmtNode creates a new statement
 * node for syntax tree construction
 */
TreeNode * newStmtNode(StmtKind kind)
{ TreeNode * t = (TreeNode *) malloc(sizeof(TreeNode));
  int i;
  if (t==NULL)
    fprintf(listing,"Out of memory error at line %d\n",lineno);
  else {
    for (i=0;i<MAXCHILDREN;i++) t->child[i] = NULL;
    t->sibling = NULL;
    t->nodekind = StmtK;
    t->kind.stmt = kind;
    t->lineno = lineno;
	t->attr.isDecl = FALSE;
  }
  return t;
}

/* Function newExpNode creates a new expression 
 * node for syntax tree construction
 */
TreeNode * newExpNode(ExpKind kind)
{ TreeNode * t = (TreeNode *) malloc(sizeof(TreeNode));
  int i;
  if (t==NULL)
    fprintf(listing,"Out of memory error at line %d\n",lineno);
  else {
    for (i=0;i<MAXCHILDREN;i++) t->child[i] = NULL;
    t->sibling = NULL;
    t->nodekind = ExpK;
    t->kind.exp = kind;
    t->lineno = lineno;
	t->attr.isDecl = FALSE;
  }
  return t;
}

TreeNode * newTypeNode(TypeKind kind)
{ TreeNode * t = (TreeNode *) malloc(sizeof(TreeNode));
  int i;
  if (t==NULL)
    fprintf(listing,"Out of memory error at line %d\n",lineno);
  else {
    for (i=0;i<MAXCHILDREN;i++) t->child[i] = NULL;
    t->sibling = NULL;
    t->nodekind = TypeK;
    t->kind.type = kind;
    t->lineno = lineno;
    t->type = Void;
  }
  return t;
}
/* Function copyString allocates and makes a new
 * copy of an existing string
 */
char * copyString(char * s)
{ int n;
  char * t;
  if (s==NULL) return NULL;
  n = strlen(s)+1;
  t = malloc(n);
  if (t==NULL)
    fprintf(listing,"Out of memory error at line %d\n",lineno);
  else strcpy(t,s);
  return t;
}

/* Variable indentno is used by printTree to
 * store current number of spaces to indent
 */
static indentno = 0;

/* macros to increase/decrease indentation */
#define INDENT indentno+=2
#define UNINDENT indentno-=2

/* printSpaces indents by printing spaces */
static void printSpaces(void)
{ int i;
  for (i=0;i<indentno;i++)
    fprintf(listing," ");
}

/* procedure printTree prints a syntax tree to the 
 * listing file using indentation to indicate subtrees
 */
void printTree( TreeNode * tree )
{ int i;
  INDENT;
  while (tree != NULL) {
    printSpaces();
    if (tree->nodekind==StmtK)
    { switch (tree->kind.stmt) {
        case IfK:
          fprintf(listing,"If\n");
          break;
        case WhileK:
          fprintf(listing,"While\n");
          break;
        case ExK:
          fprintf(listing,"Exp\n");
          break;
        case DeclK:
          fprintf(listing,"Declare\n");
		  break;
		case BreakK:
		  fprintf(listing,"Break\n");
          break;
        default:
          fprintf(listing,"Unknown ExpNode kind\n");
          break;
      }
    }
    else if (tree->nodekind==ExpK)
    { switch (tree->kind.exp) {
        case OpK:
          fprintf(listing,"Op: ");
          printToken(tree->attr.op,"\0");
          break;
        case IK:
          fprintf(listing,"Integer: %d\n",tree->attr.val.i);
          break;
		case FK:
          fprintf(listing,"Float: %f\n",tree->attr.val.f);
          break;
		case CK:
          fprintf(listing,"Char: %c\n",tree->attr.val.c);
          break;
        case IdK:
          fprintf(listing,"Id: %s\n",tree->attr.name);
          break;
		case ArrK:
		  fprintf(listing,"Array: %s[]\n",tree->attr.name);
		  break;
		case AssignK:
		  fprintf(listing,"Assign:\n");
		  break;
        default:
          fprintf(listing,"Unknown ExpNode kind\n");
          break;
      }
    }
	else if (tree->nodekind==TypeK)
	{	
		switch (tree->kind.type) {
			case IntK:
				fprintf(listing, "int\n");
				break;
			case FloatK:
				fprintf(listing, "float\n");
				break;
			case CharK:
				fprintf(listing, "char\n");
				break;
			default:
				fprintf(listing, "Unknown type\n");
		}
	}
    else fprintf(listing,"Unknown node kind\n");
    for (i=0;i<MAXCHILDREN;i++)
         printTree(tree->child[i]);
    tree = tree->sibling;
  }
  UNINDENT;
}