A Code for LL(1) parser (Recursive LL (1) or table-driven LL (1) are acceptable)

After specifying a CFG, you can enter different input token strings repeatedly

The code requirement

Input :

1.CFG: txt text file can be entered in the implementation of the file name

2.input token string: Available txt text file input, or directly enter

Output :

Resolution Table: Non-terminal and terminal symbols are listed in order of appearance in the CFG

Apply the order of the rules

Accepted or wrong

stack changes (optional)

CFG

">" representative "lamda" representative l

There are numbers

Symbols are separated by blank keys

Enter token string

token length is not limited to a single character

Input token string length is not limited

Here;s the output example

I Start E$ Prefix (E) v Tail 2 E Start 4 Prefix f 2 Prefix 4 Tail +E ai 1 Start> ES >Prefix 3 | v Tail 4 Prefix > f 5 | lamda 6 Tail>E 7 | lamda (v+f(v))S 2 5 3 6 2 43 7 v$ 1 3 7 f v +((v))S2 4 Error