xxhi008的博客

Description 设一语言的关键词、运算符、分界符的个数与单词如下：  struct { int number; string str[10]; } keywords={3,"int","main","return"} ; //关键词 struct { int number; string str[10]; } operators ={5,"+","*","=","+=","*="

Description  输入开始符号，非终结符，终结符，产生式，LL(1)分析表 输出LL(1)分析表 G[E]:E →E+T | E-T | T T →T*F | T/F | F F →(E) | D D →x | y | z   消除左递归G1[E]:  E →TA  A →+TA | -TA | e  T →FB  B →*FB |