scarlett/compiler-the-translators
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Merge branch 'Sprint2-BlockHandlingGrammar-FE-t#34' of github.com:UB-CSE443/compiler-the-translators into Sprint2-BlockHandlingGrammar-FE-t#34

Browse Source
This commit is contained in:
Partho Bhattacharya
2025-02-28 18:19:49 -05:00
parent 63212a3d63 5147d9d41c
commit d34a4d3a55
2 changed files with 157 additions and 159 deletions
Download Patch File Download Diff File Expand all files Collapse all files

149
symbol_table.c
View File

@ -1,156 +1,143 @@
#include "symbol_table.h"
#include <stdbool.h> #include <stdbool.h>
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>
#include "symbol_table.h" SymbolTable* CreateScope(SymbolTable* ParentScope, int Line, int Column) {
SymbolTable* CreateScope(SymbolTable* ParentScope, int Line, int Column){
SymbolTable* table = (SymbolTable*)malloc(sizeof(SymbolTable)); SymbolTable* table = (SymbolTable*)malloc(sizeof(SymbolTable));
table->Line_Number = Line; table->Line_Number = Line;
table->Column_Number = Column; table->Column_Number = Column;
table->Parent_Scope = ParentScope; table->Parent_Scope = ParentScope;
table->Children_Scope = NULL; table->Children_Scope = NULL;
table->entries = NULL; table->entries = NULL;
if(ParentScope != NULL){ if (ParentScope != NULL) {
if(ParentScope->Children_Scope == NULL){ if (ParentScope->Children_Scope == NULL) {
ListOfTable* newEntry = (ListOfTable*)malloc(sizeof(ListOfTable)); ListOfTable* newEntry = (ListOfTable*)malloc(sizeof(ListOfTable));
newEntry->next = NULL; newEntry->next = NULL;
//newEntry->prev = NULL; // newEntry->prev = NULL;
newEntry->table = table; newEntry->table = table;
ParentScope->Children_Scope = newEntry; ParentScope->Children_Scope = newEntry;
} else{ } else {
ListOfTable* newEntry = (ListOfTable*)malloc(sizeof(ListOfTable)); ListOfTable* newEntry = (ListOfTable*)malloc(sizeof(ListOfTable));
//newEntry->prev = NULL; // newEntry->prev = NULL;
newEntry->table= table; newEntry->table = table;
ListOfTable* oldEntry = ParentScope->Children_Scope; ListOfTable* oldEntry = ParentScope->Children_Scope;
ParentScope->Children_Scope = newEntry; ParentScope->Children_Scope = newEntry;
newEntry->next = oldEntry; newEntry->next = oldEntry;
} }
} }
return table; return table;
} }
TableNode* CreateEntry(SymbolTable* table, char* typeOf, char* id) {
TableNode* CreateEntry(SymbolTable* table, char* typeOf, char* id){
TableNode* newEntry = (TableNode*)malloc(sizeof(TableNode)); TableNode* newEntry = (TableNode*)malloc(sizeof(TableNode));
newEntry->theType = typeOf; newEntry->theType = typeOf;
newEntry->theName = id; newEntry->theName = id;
if(table->entries == NULL){ if (table->entries == NULL) {
table->entries = newEntry; table->entries = newEntry;
return newEntry; return newEntry;
} else{ } else {
TableNode* oldEntry = table->entries; TableNode* oldEntry = table->entries;
table->entries = newEntry; table->entries = newEntry;
newEntry->next = oldEntry; newEntry->next = oldEntry;
return newEntry; return newEntry;
} }
} }
TableNode * table_lookup(SymbolTable * table, char * x){ TableNode* table_lookup(SymbolTable* table, char* x) {
TableNode * entrie = table->entries; TableNode* entrie = table->entries;
for(; entrie != NULL; entrie = entrie->next){ for (; entrie != NULL; entrie = entrie->next) {
if (!strcmp(entrie->theName, x)){ if (!strcmp(entrie->theName, x)) {
return entrie; return entrie;
} }
} }
return NULL; return NULL;
} }
TableNode * look_up(SymbolTable * table, char * x){ TableNode* look_up(SymbolTable* table, char* x) {
if(table == NULL){ if (table == NULL) {
return NULL; return NULL;
} }
TableNode * ret = table_lookup(table, x); TableNode* ret = table_lookup(table, x);
if (ret != NULL){ if (ret != NULL) {
return ret; return ret;
} }
return look_up(table->Parent_Scope, x); return look_up(table->Parent_Scope, x);
} }
SymbolTable * getAncestor(SymbolTable * table){ void print_symbol_table(SymbolTable* table, FILE* file_ptr) {
if(table->Parent_Scope == NULL){ if (table->Parent_Scope == NULL) {
//if table has no parent, return itself fprintf(file_ptr, "%-17s: %-6s : %-6s : %-21s: %-28s\n", "NAME", "SCOPE",
return table; "PARENT", "TYPE", "Extra annotation");
} else {
//call function recursively to grab ancestor
return getAncestor(table->Parent_Scope);
} }
} TableNode* entrie = table->entries;
void print_symbol_table(SymbolTable *table, FILE *file_ptr){ fprintf(file_ptr,
if(table->Parent_Scope == NULL){ "-----------------:--------:--------:----------------------:---------"
fprintf(file_ptr, "%-17s: %-6s : %-6s : %-21s: %-28s\n", "NAME", "SCOPE", "PARENT", "TYPE", "Extra annotation"); "--------------------\n");
}
TableNode * entrie = table->entries;
fprintf(file_ptr, "-----------------:--------:--------:----------------------:-----------------------------\n");
int parant_scope = 0; int parant_scope = 0;
int current_scope = 0; int current_scope = 0;
if(table->Parent_Scope != NULL){ if (table->Parent_Scope != NULL) {
parant_scope = table->Parent_Scope->Line_Number*1000 + table->Parent_Scope->Column_Number; parant_scope = table->Parent_Scope->Line_Number * 1000 +
current_scope = table->Line_Number*1000 + table->Column_Number; table->Parent_Scope->Column_Number;
current_scope = table->Line_Number * 1000 + table->Column_Number;
} else { } else {
current_scope = 1001; current_scope = 1001;
} }
for(; entrie != NULL; entrie = entrie->next){ for (; entrie != NULL; entrie = entrie->next) {
if (parant_scope == 0){ if (parant_scope == 0) {
fprintf(file_ptr, "%-17s: %06d : : %-21s: %-28s\n", fprintf(file_ptr, "%-17s: %06d : : %-21s: %-28s\n",
entrie->theName, current_scope, entrie->theName, current_scope, entrie->theType,
entrie->theType, "Extra annotation"); "Extra annotation");
} else { } else {
fprintf(file_ptr, "%-17s: %06d : %06d : %-21s: %-28s\n", fprintf(file_ptr, "%-17s: %06d : %06d : %-21s: %-28s\n", entrie->theName,
entrie->theName, current_scope, parant_scope, current_scope, parant_scope, entrie->theType, "Extra annotation");
entrie->theType, "Extra annotation");
} }
} }
if (table->Children_Scope != NULL){ if (table->Children_Scope != NULL) {
ListOfTable* node = table->Children_Scope; ListOfTable* node = table->Children_Scope;
for(; node != NULL; node = node->next){ for (; node != NULL; node = node->next) {
print_symbol_table(node->table, file_ptr); print_symbol_table(node->table, file_ptr);
} }
} }
if (table->Parent_Scope == NULL) { if (table->Parent_Scope == NULL) {
fprintf(file_ptr, "-----------------:--------:--------:----------------------:-----------------------------\n"); fprintf(file_ptr,
"-----------------:--------:--------:----------------------:-------"
"----------------------\n");
} }
} }
SymbolTable * getParent(SymbolTable* st){ SymbolTable* getAncestor(SymbolTable* table) {
return st->Parent_Scope; if (table->Parent_Scope == NULL) {
// if table has no parent, return itself
return table;
} else {
// call function recursively to grab ancestor
return getAncestor(table->Parent_Scope);
} }
}
ListOfTable * getChildren(SymbolTable* st){ SymbolTable* getParent(SymbolTable* st) { return st->Parent_Scope; }
return st->Children_Scope;
} ListOfTable* getChildren(SymbolTable* st) { return st->Children_Scope; }
SymbolTable * getFirstChild(ListOfTable * lt){ SymbolTable* getFirstChild(ListOfTable* lt) { return lt->table; }
return lt->table; ListOfTable* getRestOfChildren(ListOfTable* lt) { return lt->next; }
} TableNode* getFirstEntry(SymbolTable* st) { return st->entries; }
ListOfTable * getRestOfChildren(ListOfTable * lt){ TableNode* getNextEntry(TableNode* tn) { return tn->next; }
return lt->next; char* getType(TableNode* tn) { return tn->theType; }
} char* getName(TableNode* tn) { return tn->theName; }
TableNode * getFirstEntry(SymbolTable * st){ int getLine(SymbolTable* st) { return st->Line_Number; }
return st->entries; int getColumn(SymbolTable* st) { return st->Column_Number; }
} // uncomment the below main function along with the headers above for a simple
TableNode * getNextEntry(TableNode * tn){ // standalone test of table and entry creation
return tn->next;
}
char * getType(TableNode * tn){
return tn->theType;
}
char * getName(TableNode * tn){
return tn->theName;
}
int getLine(SymbolTable * st){
return st->Line_Number;
}
int getColumn(SymbolTable *st){
return st->Column_Number;
}
//uncomment the below main function along with the headers above for a simple standalone test of table and entry creation
/* /*
int main(){ int main(){
char* String = "STRING"; char* String = "STRING";
char* X = "X"; char* X = "X";
SymbolTable* Second = CreateScope(NULL, 2,2); SymbolTable* Second = CreateScope(NULL, 2,2);
printf("Line number is %d, Column number of scope is %d\n",Second->Line_Number,Second->Column_Number); printf("Line number is %d, Column number of scope is
TableNode* First_Entry = CreateEntry(Second,String,X); %d\n",Second->Line_Number,Second->Column_Number); TableNode* First_Entry =
CreateEntry(Second,String,X);
printf("The type of the first entry is %s\n",First_Entry->theType); printf("The type of the first entry is %s\n",First_Entry->theType);
return 0; return 0;

35
symbol_table.h
View File

@ -3,30 +3,41 @@
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
typedef struct ListOfTable{ typedef struct ListOfTable {
struct SymbolTable* table; struct SymbolTable* table;
//struct ListOfTable* prev; // struct ListOfTable* prev;
struct ListOfTable* next; struct ListOfTable* next;
}ListOfTable; } ListOfTable;
typedef struct TableNode{ typedef struct TableNode {
char* theType; char* theType;
char* theName; char* theName;
struct TableNode* next; struct TableNode* next;
}TableNode; } TableNode;
typedef struct SymbolTable{ typedef struct SymbolTable {
TableNode* entries; TableNode* entries;
struct SymbolTable* Parent_Scope; struct SymbolTable* Parent_Scope;
struct ListOfTable* Children_Scope; struct ListOfTable* Children_Scope;
int Line_Number; int Line_Number;
int Column_Number; int Column_Number;
}SymbolTable; } SymbolTable;
TableNode* CreateEntry(SymbolTable* table, char* typeOf, char* id);
SymbolTable* CreateScope(SymbolTable* ParentScope, int Line, int Column); SymbolTable* CreateScope(SymbolTable* ParentScope, int Line, int Column);
TableNode * table_lookup(SymbolTable * table, char * x); TableNode* CreateEntry(SymbolTable* table, char* typeOf, char* id);
TableNode * look_up(SymbolTable * table, char * x); TableNode* table_lookup(SymbolTable* table, char* x);
void print_symbol_table(SymbolTable *table, FILE *file_ptr); TableNode* look_up(SymbolTable* table, char* x);
void print_symbol_table(SymbolTable* table, FILE* file_ptr);
SymbolTable* getAncestor(SymbolTable* table);
SymbolTable* getParent(SymbolTable* st);
ListOfTable* getChildren(SymbolTable* st);
SymbolTable* getFirstChild(ListOfTable* lt);
ListOfTable* getRestOfChildren(ListOfTable* lt);
TableNode* getFirstEntry(SymbolTable* st);
TableNode* getNextEntry(TableNode* tn);
char* getType(TableNode* tn);
char* getName(TableNode* tn);
int getLine(SymbolTable* st);
int getColumn(SymbolTable* st);