- Lina Sofía Ballesteros Merchán
Development of the final project for the subject of Formal Languages and Compilers taught at EAFIT University by prof Sergio Ramírez. design algorithms to compute the First and Follow sets for the nonterminal symbols of a given context-free grammar.
- The program was executed on Windows OS.
- The chosen language was Python.
- The code editor used was Visual Studio Code.
- Output is shown after having entered all the grammars.
Follow these instructions to run the program:
-
Clone the project on your machine or download the ZIP file.
git clone https://github.com/ssramirezr/project-teamls.git
-
Go to the project directory (or wherever you stored it).
cd project
-
Make sure you have Python. Now you are ready to run the program.
python --version
-
Run the following in your command prompt:
python main.py
-
Enter the number of grammars to process, for example:
1
-
Enter the number of rules, for example:
3
-
Enter production rules, for example:
C SB
-
Check results.
First(S) = {a}