Overview

Overview

Syntax analysis - Top-Down parsing

For a syntax analysis we decided to use Top-Down parsing, which seemed optimal for our case, with recursive descent parsing. The top-down parsing performs construction of BST from root and then proceeds towards it's leaves.

Recursive Descent Parsing

This parsing technique consists of few function, one for each non-terminal in the grammar, and recursively parses the input to make a BST tree.

Compiling

We have decided to write our own makefile, which we used for compiling our source code, because none of us had experience with using CMake and also it was specified in assignment to be able to compiler our program with make command in terminal. We also added some other parts as make debug used when debugging code, make tests which make tests for symtable and make clean that deletes everything that other make * commands created.

About project

This project seemed at first as too big bite to swallow, but as we progressed through it with blindly writing code, finding research materials online and watching IFJ/IAL lectures, we were able to slowly make some parts work. The main problem in our group was probably that we missed a lot of deadlines that we prepared for ourselves throughout time we had until final deadline, so in the end we found ourselves with little to no time and a few broken things either not working correctly or not working at all.