These are my labs from MEPHI automato theory course.
This was just to become familiar with flex framework, SMC tool and regular expressions.
Self-written regex library that allows not only constructing automatos from regexes, but also add them, subtract them and ofcourse match against string.
My own programming language. It has quite limited syntax, but that was enough to make a mini game about robot escaping labirint in this language. Grammar and parser were written using flex and bison libraries.
Firstly, build target test with Makefile presented in lab3 directory.
Then, in order to run interpreter in console mode simply run
$ ./testIn order to interpret code from file call the following command:
$ ./test cool_code_file.boba.boba extension is actually optional, you can load there any file
There are several example programs provided in this repository such as:
binary_number.boba
fibonnachi.boba
geometric_progression.boba
number_reverse.boba
power_of_ten.boba
and many more...
This is a little extension of a language that allows to interact with robot and labirint.
As an example, there is a program that implements A-star path-finding algorithm for robot to find exit from labirint.
⭐ a_star.boba
If you want to set your own labirint you just need to change name of file given to Map class in compile_vars.h file:
automata_theory/lab3/compile_vars.h
Line 3 in c0430b6



