Compile and debug the recursive descent analysis program according to a certain grammar to analyze any input symbol string. The purpose of this experiment is to deepen the understanding of recursive descent analysis.
Program requirements:
Program input/output example:
For the following grammar, use recursive descent analysis to analyze arbitrary input symbol strings:
(1) E->TG
(2) G->+TG|—TG
(3) G- >ε
(4) T->FS
(5) S-> FS|/FS
(6) S->ε
(7) F->(E)
(8) F->i
output format is as follows:
(1) Recursive descent analysis program, prepared by: name, student ID, class
(2) Input a symbol string ending with # (including +— /() i#): input symbol string at this position, for example: i+i i#
( 3) Output result: i+i i# is a legal symbol string".
DEV C++ project implementation will not build a project, look at this -> how to create a project
Code link: https://pan.baidu.com/s/1sdWHfCsaZi6MTeSHeIgTLg
Extraction code: y16q