The following repo contains a C code which takes a regular grammar as input and generates the FirstPos , and FollowPos of the non - Terminals and Displays its corresponding LL(1) Parsing Table. Then using that table and an input string it simulates the LL(1) parsing action.
S=(S)
S=#
For the above grammar, the code gives the exit code -11 and halts in between. It doesn't even ask for an input string to check its acceptance.
Some of the input in the parsing table is not filled correctly so it does not correctly parse the input string. In the $ column of non-terminal Y, the production Y=# is missing and in the * column of non-terminal T, there should not be any production.