GitHub - Uniquedex100/Expression_Evaluator_COL106: Utilized several data structures like AVL trees for implementing a Symbol Table to keep track of all the variables and memory allocations, Binary Search Trees to generate Expression Trees in which expressions are parsed and Binary Heaps to ensure that freed memory is used with topmost priority.

Uniquedex100 / Expression_Evaluator_COL106 Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Utilized several data structures like AVL trees for implementing a Symbol Table to keep track of all the variables and memory allocations, Binary Search Trees to generate Expression Trees in which expressions are parsed and Binary Heaps to ensure that freed memory is used with topmost priority.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
.vscode		.vscode
test_cases		test_cases
COL106_Assignment_4_v0.pdf		COL106_Assignment_4_v0.pdf
Final.zip		Final.zip
Makefile		Makefile
a.exe		a.exe
drive-download-20230922T185221Z-001.zip		drive-download-20230922T185221Z-001.zip
drivercode.cpp		drivercode.cpp
entry.cpp		entry.cpp
entry.h		entry.h
evaluator.cpp		evaluator.cpp
evaluator.h		evaluator.h
exprtreenode.cpp		exprtreenode.cpp
exprtreenode.h		exprtreenode.h
output.exe		output.exe
symtable.cpp		symtable.cpp
symtable.h		symtable.h
tempCodeRunnerFile.cpp		tempCodeRunnerFile.cpp
ulimitedint.cpp		ulimitedint.cpp
ulimitedint.exe		ulimitedint.exe
ulimitedint.h		ulimitedint.h
ulimitedrational.cpp		ulimitedrational.cpp
ulimitedrational.h		ulimitedrational.h