This project implements LL(1) and LR(0) parsers to analyze grammars and strings provided by the user. It allows processing strings, verifying whether a grammar is LL(1), and performing both bottom-up and top-down syntactic analysis. The implementation is designed to be extendable and easy to use in educational or research applications in the field of programming language theory.
- String analysis using LL(1) and LR(0) parsers.
- LL(1) grammar verification.
- Generation of First and Follow sets for grammars.
- Bottom-up and top-down syntactic analysis.
The project does not require the installation of external dependencies beyond standard Python. To run it, clone the repository to your local machine:
Follow the console instructions to select between LL(1) and LR(0) analysis, enter strings for analysis, and more. There are example grammars in the tests folder, from which you can take the format to use your own.
- Run the script:
python main.py - Select the type of grammar by entering
1for LL(1) or2for LR(0). - Choose the desired operation (process string, show First and Follow, verify if the grammar is LL(1), etc.).
- If you choose to process a string, enter it when prompted.
This project is open source, and contributions are welcome. If you want to contribute improvements, fix a problem, or add functionalities, please fork the repository and send a pull request with your changes.