Implement LL1 Algorithm

1:Implement LL1 parsing for both Java and Python languages(the algorithm logic can be the same)
2:The output should have the following form :
You enter a CFG which will be transformed by:
Removing Left Factoring
Removing Left Recursion
After you determine First and Follow
Print the Table with them
After you parse the word(string)
Print the parsing steps until the parsing is finished
Print the derivation tree

All steps must be displayed in console

3:The algorithms should accept the below example of grammars and realize the parsing of the given string for each grammar.

G=(VN, VT, P, S,), VN =( S, A, B, C, D) VT =(a,b,c,d,e,f)
P=(1. S → A a 2. S → A a b B 3. B → C c 4. C → f 5. C → C d f 6. A → e 7. A → A d e ),
iLL(1) parsing and analyze of the ededeabfdfc string

G=(VN, VT, P, S,), VN =(S, A, B, C, D,) VT = (a,b,c,d,e)
P= (1. S → A 2. A → B 3. A → B e A 4. B → a b D 5. D → C d 6. C → c 7. C → C c ),
LL(1) parsing and analyze of the abcdeabcccd string