An assignment in Theory of Computation subject
Do a parser for a languange generated by grammars
a-z, A-Z, 0-9, +-*/.()=$
- S -> ZS | ε
- Z -> id = E;
- E -> TE’
- E’ -> +TE’ | -TE’ | ε
- T -> FT’
- T’ -> *FT’ | /FT’ | ε
- F -> idA | int | real | (E)
- A -> (E) | ε