京东商城模板全部源代码-递归下降法.docVIP

递归下降法 import java.util.Scanner; public class Javac { static Scanner cin = new Scanner(System.in); static final int MAXSIZE = 1000; static String[] left = new String[MAXSIZE]; static String[] right = new String[MAXSIZE]; static int size = 0; static String goal; static int firstPosition; static void input() { String temp; temp = cin.nextLine(); temp = temp.replaceAll( , ); while(temp.charAt(0) != #) { String tl = temp.substring(0, 1); String tr = temp.substring(3, temp.length()); String[] produce = tr.split([|]); for(int i=0; iproduce.length; i++) { left[size] = tl; right[size] = produce[i]; size ++; } temp = cin.nextLine(); temp = temp.replaceAll( , ); } } static boolean isCapital(char ch) { if(ch = A ch = Z) return true; else return false; } static char getFirstVN(String s) { for(int i=0; is.length(); i++) { if( isCapital(s.charAt(i)) ) { firstPosition = i; return s.charAt(i); } } return 0; } static boolean pruning(String s, int position) { if(position = goal.length() position 0) if(!s.substring(0, position).equals(goal.substring(0, position))) return true; int lastPosition = s.length(); for(int i = s.length() - 1; i = 0; i --) { if(isCapital(s.charAt(i))) { lastPosition = i; break; } } if(lastPosition s.length() - 1) { int len = s.length() - lastPosition - 1; if(goal.length() - len 0) return true; if( !s.substring(lastPosition + 1, s.length()).equals(goal.substring(goal.length() - len, goal.length())) ) return true; } if(s.length() goal.length() * 2) return true; return false; } static boolean search(String cur) { char ch = getFirstVN(cur); if(ch == 0) { if(cur.equals(goal)) return true; else return false; } int localposition = firstPosition; if(pruning(cur, localposition)) return false; for(int i=0; isize; i++) { if(left[i].charAt(0) ==