This repository contains a Python implementation of a recursive descent parser for the following grammar rules:
The grammar rules for the recursive descent 2.py
file are as follows:
Grammar Rule:
- S -> aSB
- S -> b
- B -> a/@
- B -> bBa
The grammar rules for the recursive_descent_1.py
file are as follows:
- E -> TE'
- E' -> +TE'/@
- T -> FT'
- T' -> *FT'/@
- F -> (E)/I
Feel free to customize the content to better suit your needs. You can also include additional sections or information that you think is relevant.