Introduction - If you have any usage issues, please Google them yourself
(1) The analysis procedure grammar analysis as follows:
G[E]:
E→eBaA
A→a|bAcB
B→dEd|aC
C→e|dC
(2) for the above grammar write a recursive routine analysis program, enter the program is arbitrary string of symbols, this output is a string of symbols whether the input is the grammar of the sentence conclusion.