A self-written interpreter developed as part of the Compilation Theory course in the 5th semester of Computer Science at AGH University of Krakow, using SLY.
The implementation meets the requirements presented during the course.
A clear explanation of the individual steps.
A scanner that processes input text into a list of tokens. If an unrecognized token is encountered, an error is displayed.
A parser that builds the language grammar.
A module for constructing the Abstract Syntax Tree (AST).
A module that uses symbol table to verify the correctness of type definitions and scopes in the program.
A module for keeping track of all values of initialized variables and their scopes.
Main part of the project, module that translates custom programming language into python code.