Untitled
unknown
c_cpp
3 years ago
19 kB
5
Indexable
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
// for lex
#define MAXLEN 256
// Token types
typedef enum {
UNKNOWN, END, ENDFILE,
INT, ID,
ADDSUB, MULDIV,
ASSIGN,
LPAREN, RPAREN,
INCDEC, AND, OR, XOR, ADDSUB_ASSIGN
} TokenSet;
TokenSet getToken(void);
TokenSet curToken = UNKNOWN;
char lexeme[MAXLEN];
// Test if a token matches the current token
int match(TokenSet token);
// Get the next token
void advance(void);
// Get the lexeme of the current token
char *getLexeme(void);
// for parser
#define TBLSIZE 64
// Set PRINTERR to 1 to print error message while calling error()
// Make sure you set PRINTERR to 0 before you submit your code
#define PRINTERR 0
// Call this macro to print error message and exit the program
// This will also print where you called it in your program
#define error(errorNum) { \
if (PRINTERR) \
fprintf(stderr, "error() called at %s:%d: ", __FILE__, __LINE__); \
err(errorNum); \
}
// Error types
typedef enum {
UNDEFINED, MISPAREN, NOTNUMID, NOTFOUND, RUNOUT, NOTLVAL, DIVZERO, SYNTAXERR
} ErrorType;
// Structure of the symbol table
typedef struct {
int val;
char name[MAXLEN];
} Symbol;
// Structure of a tree node
typedef struct _Node {
TokenSet data;
int val;
char lexeme[MAXLEN];
struct _Node *left;
struct _Node *right;
} BTNode;
int sbcount = 0;
int cnt = 0;
Symbol table[TBLSIZE];
// Initialize the symbol table with builtin variables
void initTable(void);
// Get the value of a variable
int getval(char *str);
// Set the value of a variable
int setval(char *str, int val);
int getpos(char *str);
// Make a new node according to token type and lexeme
BTNode *makeNode(TokenSet tok, const char *lexe);
// Free the syntax tree
void freeTree(BTNode *root);
void find (BTNode* root);
BTNode *assign_expr(void);
BTNode *factor(void);
BTNode *or_expr(void);
BTNode *or_expr_tail(BTNode *left);
BTNode *xor_expr(void);
BTNode *xor_expr_tail(BTNode *left);
BTNode *and_expr(void);
BTNode *and_expr_tail(BTNode *left);
BTNode *addsub_expr(void);
BTNode *addsub_expr_tail(BTNode *left);
BTNode *muldiv_expr(void);
BTNode *muldiv_expr_tail(BTNode *left);
BTNode *unary_expr(void);
void statement(void);
// Print error message and exit the program
void err(ErrorType errorNum);
// for codeGen
// Evaluate the syntax tree
int evaluateTree(BTNode *root);
// Print the syntax tree in prefix
void printPrefix(BTNode *root);
/*============================================================================================
lex implementation
============================================================================================*/
TokenSet getToken(void)
{
int i = 0;
char c = '\0';
while ((c = fgetc(stdin)) == ' ' || c == '\t');
//printf("c = %c\n", c);
if (isdigit(c)) {
lexeme[0] = c;
c = fgetc(stdin);
i = 1;
while (isdigit(c) && i < MAXLEN) {
lexeme[i] = c;
++i;
c = fgetc(stdin);
}
ungetc(c, stdin);
lexeme[i] = '\0';
return INT;
} else if (c == '+' || c == '-') {
lexeme[0] = c;
c = fgetc(stdin);
if(c == lexeme[0]){
lexeme[1] = c;
lexeme[2] = '\0';
return INCDEC;
}
else if(c == '='){
lexeme[1] = c;
lexeme[2] = '\0';
return ADDSUB_ASSIGN;
}
ungetc(c, stdin);
lexeme[1] = '\0';
return ADDSUB;
} else if (c == '*' || c == '/') {
lexeme[0] = c;
lexeme[1] = '\0';
return MULDIV;
} else if (c == '\n') {
lexeme[0] = '\0';
return END;
} else if (c == '=') {
strcpy(lexeme, "=");
return ASSIGN;
} else if (c == '(') {
strcpy(lexeme, "(");
return LPAREN;
} else if (c == ')') {
strcpy(lexeme, ")");
return RPAREN;
} else if (isalpha(c) || c == '_') {
lexeme[0] = c;
c = fgetc(stdin);
i = 1;
while ((isalpha(c) || c == '_' || isdigit(c)) && i < MAXLEN) {
lexeme[i] = c;
++i;
c = fgetc(stdin);
}
ungetc(c, stdin);
lexeme[i] = '\0';
return ID;
} else if (c == EOF) {
return ENDFILE;
}else if (c == '&') {
strcpy(lexeme, "&");
return AND;
}else if (c == '|') {
strcpy(lexeme, "|");
return OR;
}else if (c == '^') {
strcpy(lexeme, "^");
return XOR;
} else {
return UNKNOWN;
}
}
void advance(void) {
curToken = getToken();
}
int match(TokenSet token) {
if (curToken == UNKNOWN)
advance();
return token == curToken;
}
char *getLexeme(void) {
return lexeme;
}
/*============================================================================================
parser implementation
============================================================================================*/
void initTable(void) {
strcpy(table[0].name, "x");
table[0].val = 0;
strcpy(table[1].name, "y");
table[1].val = 0;
strcpy(table[2].name, "z");
table[2].val = 0;
sbcount = 3;
}
int getval(char *str) {
int i = 0, found = 0;
for (i = 0; i < sbcount; i++)
if (strcmp(str, table[i].name) == 0){
found = 1;
return table[i].val;
}
if(found == 0){
error(NOTFOUND);
}
if (sbcount >= TBLSIZE)
error(RUNOUT);
strcpy(table[sbcount].name, str);
table[sbcount].val = 0;
sbcount++;
return 0;
}
int getpos(char *str){
for (int i = 0; i < sbcount; i++) {
if (strcmp(str, table[i].name) == 0) {
return i;
}
}
}
int setval(char *str, int val) {
int i = 0;
for (i = 0; i < sbcount; i++) {
if (strcmp(str, table[i].name) == 0) {
table[i].val = val;
return val;
}
}
if (sbcount >= TBLSIZE)
error(RUNOUT);
strcpy(table[sbcount].name, str);
table[sbcount].val = val;
sbcount++;
return val;
}
BTNode *makeNode(TokenSet tok, const char *lexe) {
BTNode *node = (BTNode*)malloc(sizeof(BTNode));
strcpy(node->lexeme, lexe);
node->data = tok;
node->val = 0;
node->left = NULL;
node->right = NULL;
return node;
}
void freeTree(BTNode *root) {
if (root != NULL) {
freeTree(root->left);
freeTree(root->right);
free(root);
}
}
BTNode *assign_expr(void){
BTNode *rept = NULL, *left = NULL;
left = or_expr();
//advance(); 不用加！！
if(match(ASSIGN) && left->data == ID){
rept = makeNode(ASSIGN, getLexeme());
advance();
rept->left = left;
rept->right = assign_expr();
return rept;
}
else if(match(ADDSUB_ASSIGN) && left->data == ID){
rept = makeNode(ADDSUB_ASSIGN, getLexeme());
advance();
rept->left = left;
rept->right = assign_expr();
return rept; //記得return
}
else return left;
}
BTNode *factor(void){
BTNode *retp = NULL, *left = NULL;
if (match(INT)) {
retp = makeNode(INT, getLexeme());
advance();
} else if (match(ID)) {
retp = makeNode(ID, getLexeme());
advance();
} else if(match(INCDEC)){
retp = makeNode(INCDEC, getLexeme());
advance();
if (match(ID)) {
retp->left = makeNode(INT, "1");
retp->right = makeNode(ID, getLexeme());
advance();
}
else {
error(NOTNUMID);
}
}
else if (match(LPAREN)) {
advance();
retp = assign_expr();
if (match(RPAREN))
advance();
else
error(MISPAREN);
} else {
error(NOTNUMID);
}
return retp;
}
BTNode *or_expr(void){
BTNode *node = xor_expr();
return or_expr_tail(node);
}
BTNode *or_expr_tail(BTNode *left){
BTNode *node = NULL;
if (match(OR)) {
node = makeNode(OR, getLexeme());
advance();
node->left = left;
node->right = xor_expr();
return or_expr_tail(node);
} else {
return left;
}
}
BTNode *xor_expr(void){
BTNode *node = and_expr();
return xor_expr_tail(node);
}
BTNode *xor_expr_tail(BTNode *left){
BTNode *node = NULL;
if (match(XOR)) {
node = makeNode(XOR, getLexeme());
advance();
node->left = left;
node->right = and_expr();
return xor_expr_tail(node);
} else {
return left;
}
}
BTNode *and_expr(void){
BTNode *node = addsub_expr();
return and_expr_tail(node);
}
BTNode *and_expr_tail(BTNode *left){
BTNode *node = NULL;
if (match(AND)) {
node = makeNode(AND, getLexeme());
advance();
node->left = left;
node->right = addsub_expr();
return and_expr_tail(node);
} else {
return left;
}
}
BTNode *addsub_expr(void){
BTNode *node = muldiv_expr();
return addsub_expr_tail(node);
}
BTNode *addsub_expr_tail(BTNode *left){
BTNode *node = NULL;
if (match(ADDSUB)) {
node = makeNode(ADDSUB, getLexeme());
advance();
node->left = left;
node->right = muldiv_expr();
return addsub_expr_tail(node);
} else {
return left;
}
}
BTNode *muldiv_expr(void){
BTNode *node = unary_expr();
return muldiv_expr_tail(node);
}
BTNode *muldiv_expr_tail(BTNode *left){
BTNode *node = NULL;
if (match(MULDIV)) {
node = makeNode(MULDIV, getLexeme());
advance();
node->left = left;
node->right = unary_expr();
return muldiv_expr_tail(node);
} else {
return left;
}
}
BTNode *unary_expr(void){
BTNode *retp = NULL;
if (match(ADDSUB)) {
retp = makeNode(ADDSUB, getLexeme());
retp->left = makeNode(INT, "0");
advance();
retp->right = unary_expr();
}
else{
return retp = factor();
}
return retp;
}
// statement := ENDFILE | END | expr END
void statement(void) {
BTNode *retp = NULL;
if (match(ENDFILE)) {
printf("MOV r0 [0]\n");
printf("MOV r1 [4]\n");
printf("MOV r2 [8]\n");
printf("EXIT 0\n");
exit(0);
} else if (match(END)) {
//printf(">> ");
advance();
} else {
retp = assign_expr();
if (match(END)) {
cnt = 0;
//int result = evaluateTree(retp);
printf("%d\n", evaluateTree(retp));
printf("Prefix traversal: ");
printPrefix(retp);
printf("\n");
freeTree(retp);
//printf(">> ");
advance();
} else {
error(SYNTAXERR);
}
}
}
void err(ErrorType errorNum) {
printf("EXIT 1\n");
if (PRINTERR) {
fprintf(stderr, "error: ");
switch (errorNum) {
case MISPAREN:
fprintf(stderr, "mismatched parenthesis\n");
break;
case NOTNUMID:
fprintf(stderr, "number or identifier expected\n");
break;
case NOTFOUND:
fprintf(stderr, "variable not defined\n");
break;
case RUNOUT:
fprintf(stderr, "out of memory\n");
break;
case NOTLVAL:
fprintf(stderr, "lvalue required as an operand\n");
break;
case DIVZERO:
fprintf(stderr, "divide by constant zero\n");
break;
case SYNTAXERR:
fprintf(stderr, "syntax error\n");
break;
default:
fprintf(stderr, "undefined error\n");
break;
}
}
exit(0);
}
/*============================================================================================
codeGen implementation
============================================================================================*/
int found = 0;
/*
cnt--在lv和rv運算過後打
*/
int evaluateTree(BTNode *root) {
int retval = 0, lv = 0, rv = 0;
found = 0;
if (root != NULL) {
switch (root->data) {
case ID:
printf("MOV r%d [%d]\n", cnt, getpos(root->lexeme) * 4);
retval = getval(root->lexeme);
cnt++;
break;
case INT:
retval = atoi(root->lexeme);
printf("MOV r%d %d\n", cnt, retval);
cnt++;
break;
case ASSIGN:
rv = evaluateTree(root->right);
retval = setval(root->left->lexeme, rv);
printf("MOV [%d] r%d\n", getpos(root->left->lexeme) * 4, cnt-1);
//cnt--;
break;
case ADDSUB:
if(strcmp(root->left->lexeme, "0") == 0 && strcmp(root->lexeme, "+") == 0){ //加速用，讀取+5時不需先MOV r0 0
rv = evaluateTree(root->right);
break;
}
lv = evaluateTree(root->left);
rv = evaluateTree(root->right);
cnt--;
if (strcmp(root->lexeme, "+") == 0) {
retval = lv + rv;
printf("ADD r%d r%d\n", cnt-1, cnt);
} else if (strcmp(root->lexeme, "-") == 0) {
retval = lv - rv;
printf("SUB r%d r%d\n", cnt-1, cnt);
}
break;
case MULDIV:
lv = evaluateTree(root->left);
rv = evaluateTree(root->right);
cnt--;
if (strcmp(root->lexeme, "*") == 0) {
retval = lv * rv;
printf("MUL r%d r%d\n", cnt-1, cnt);
} else if (strcmp(root->lexeme, "/") == 0) {
if (rv == 0){
find(root->right);
if(found == 0){
error(DIVZERO);
}
else{
rv = 1;
}
}
printf("DIV r%d r%d\n", cnt-1, cnt);
retval = lv / rv;
}
break;
case INCDEC:
rv = evaluateTree(root->right); //注意先rv再lv！！！
lv = evaluateTree(root->left);
//printf("MOV [%d] r%d\n", getpos(root->right->lexeme) * 4, cnt);
//cnt++;
//printf("MOV r%d 1\n", cnt);
cnt--;
if (strcmp(root->lexeme, "++") == 0) {
retval = setval(root->right->lexeme, rv+1);
printf("ADD r%d r%d\n", cnt-1, cnt);
} else if (strcmp(root->lexeme, "--") == 0) {
retval = setval(root->right->lexeme, rv-1);
printf("SUB r%d r%d\n", cnt-1, cnt);
}
printf("MOV [%d] r%d\n", getpos(root->right->lexeme)*4, cnt-1);
//cnt--;
break;
case AND:
lv = evaluateTree(root->left);
rv = evaluateTree(root->right);
cnt--;
retval = lv & rv;
printf("AND r%d r%d\n", cnt-1, cnt);
break;
case OR:
lv = evaluateTree(root->left);
rv = evaluateTree(root->right);
cnt--;
retval = lv | rv;
printf("OR r%d r%d\n", cnt-1, cnt);
break;
case XOR:
lv = evaluateTree(root->left);
rv = evaluateTree(root->right);
cnt--;
retval = lv ^ rv;
printf("XOR r%d r%d\n", cnt-1, cnt);
break;
case ADDSUB_ASSIGN:
lv = evaluateTree(root->left);
rv = evaluateTree(root->right);
cnt--;
if (strcmp(root->lexeme, "+=") == 0) {
printf("ADD r%d r%d\n", cnt-1, cnt);
retval = setval(root->left->lexeme, lv + rv);
} else if (strcmp(root->lexeme, "-=") == 0) {
printf("SUB r%d r%d\n", cnt-1, cnt);
retval = setval(root->left->lexeme, lv - rv);
}
printf("MOV [%d] r%d\n", getpos(root->left->lexeme)*4, cnt-1);
break;
default:
retval = 0;
}
}
return retval;
}
void printPrefix(BTNode *root) {
if (root != NULL) {
printf("%s ", root->lexeme);
printPrefix(root->left);
printPrefix(root->right);
}
}
void find(BTNode* root){
if(root != NULL){
if(root->data == ID) found = 1;
find(root->left);
find(root->right);
}
return;
}
/*============================================================================================
main
============================================================================================*/
// This package is a calculator
// It works like a Python interpretor
// Example:
// >> y = 2
// >> z = 2
// >> x = 3 * y + 4 / (2 * z)
// It will print the answer of every line
// You should turn it into an expression compiler
// And print the assembly code according to the input
// This is the grammar used in this package
// You can modify it according to the spec and the slide
// statement := ENDFILE | END | expr END
// expr := term expr_tail
// expr_tail := ADDSUB term expr_tail | NiL
// term := factor term_tail
// term_tail := MULDIV factor term_tail| NiL
// factor := INT | ADDSUB INT |
// ID | ADDSUB ID |
// ID ASSIGN expr |
// LPAREN expr RPAREN |
// ADDSUB LPAREN expr RPAREN
int main() {
initTable();
//printf(">> ");
while (1) {
statement();
}
return 0;
}Editor is loading...