LL(1)语法分析器 代码 java 编译原理,带注释,可运行

else if(c=='#') {

stack.deleteCharAt(stack.length()-1); //stack.append(\ a=\; } else{

System.err.println(\推导时错误！不能匹配！\); result=false; }

return result; }

public static boolean T(char c) {//语法分析子程序 T boolean result=true; if(c=='i') {

stack.deleteCharAt(stack.length()-1); stack.append(\); a=\; }

else if(c=='(') {

stack.deleteCharAt(stack.length()-1); stack.append(\); a=\;

} else{

result=false;

System.err.println(\推导时错误！不能匹配！\); }

return result; }

public static boolean Q(char c){//语法分析子程序 Q boolean result=true; if(c=='+') {

stack.deleteCharAt(stack.length()-1); //stack.append(\ a=\; }

else if(c=='*') {

stack.deleteCharAt(stack.length()-1); stack.append(\); a=\; }

else if(c==')') {

stack.deleteCharAt(stack.length()-1); //stack.append(\

a=\; }

else if(c=='#') {

stack.deleteCharAt(stack.length()-1); //stack.append(\ a=\; } else{

result=false;

System.err.println(\推导时错误！不能匹配！\); }

return result; }

public static boolean F(char c) {//语法分析子程序 F boolean result=true; if(c=='i') {

stack.deleteCharAt(stack.length()-1); stack.append(\); a=\; }

else if(c=='(') {

stack.deleteCharAt(stack.length()-1);

stack.append(\); a=\; } else{

result=false;

System.err.println(\推导时错误！不能匹配！\); }

return result; }

/* public static StringBuffer changeOrder(String s){//左右交换顺序

StringBuffer sb=new StringBuffer(); for(int i=0;i

sb.append(s.charAt(s.length()-1-i)); }

return sb; }*/ }

#E i*i+i# null #PT i*i+i# E->TP #PQF i*i+i# T->FQ #PQi i*i+i# F->i