LR语法分析器

stack"); out.println("Now, do shifting, \'" + chr + "\' will be moved to the symbol stack"); symbols.push(chr); states.push(action); printCurrentStatesStack(); printCurrentSymbolStack();
} else if (action < 0) //do reducing {
System.out.println("Now, do reducing according to the LR parse table when \'" + chr + "\' appears");
out.println("Now, do reducing according to the LR parse table when \'" + chr + "\' appears");
import java.io.File; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Iterator; import java.util.Scanner; import java.util.Stack; import java.util.StringTokenizer;
}
private boolean stringtoIntArray(String line, int no) { // some convert method StringTokenizer tokens = new StringTokenizer(line); int a = 0; while (tokens.hasMoreTokens()) { parseTable[no][a] = Integer.parseInt(tokens.nextToken()); a++;
tree = new ArrayList<TreeNode>();
states.push(0); symbols.push('#');
if (readLRTable(new File(filePath))) { System.out.println("Successfully load the LR-parse Table!"); System.out.println("====================================="); out.println("Successfully load the LR-parse Table!"); out.println("====================================="); tranform(); parse(); System.out.println("===========LR(1) parse FINISHED==========="); out.println("============LR(1) parse FINISHED==========="); print(); out.close();
Stack<Character> tmp = new Stack<Character>();
for (int a = 0; a < length; a++) { states.pop(); tmp.push(symbols.pop());
} StringBuffer child = new StringBuffer(); for(int b = 0; b < length; b++) {
} else {
} }
private boolean readLRTable(File file) { // read LR(1) parse table from file try { Scanner in = new Scanner(new FileInputStream(file)); int no = 0; while (in.hasNextLine()) { String line = in.nextLine(); stringtoIntArray(line, no); no++; } } catch (FileNotFoundException e) { // TODO Auto-generated catch block e.printStackTrace(); return false; } return true;
}
public Parser(String inputPath, String outputPath, String filePath) { try { out = new PrintWriter(new FileWriter(new File(outputPath))); } catch (IOException e) { // TODO Auto-generated catch block e.printStackTrace(); } this.input = getInputString(inputPath); parseTable = new int[18][7]; states = new Stack<Integer>(); symbols = new Stack<Character>(); digits = new ArrayList<Double>();
private void parse() { // the LR(1) parse method input += "#"; int length = input.length(); int index = 0; for (int a = 0; a < length; a++) { char ch = input.charAt(a); int state = states.peek(); switch (ch) { case '*': case '+':
} return true; }
private void tranform() { //do some nessery change to the orginal string using regular expression
/*save all of the digits*/ System.out.println("The input string is : " + input); System.out.println("====================================="); out.println("The input string is : " + input); out.println("====================================="); String expr = input; expr = expr.replaceAll("[*+()]", "|");
private void ACTION(int state, char chr) {//the action int action = parseTable[state][getColumnPos(chr)]; if (action > 0 && action != 99) //do shifting { System.out.println("Now, do shifting, \'" + chr + "\' will be moved to the symbol
public class Parser {
private String input; // input String
private int[][] parseTable; // LR(1) parse table
private Stack<Integer> states; // state stack
private Stack<Character> symbols; // symbol stack
private ArrayList<Double> digiteNode> tree;
private PrintWriter out;
public Parser() { //Default Construction Function this("input.txt", "output.txt", "LR-Table.txt");
String digit = tokens.nextToken(); System.out.print(digit + " "); out.print(digit + " "); digits.add(Double.parseDouble(digit)); } System.out.println("\n====================================="); out.println("\n====================================="); /*change all of the digits to i using Regxp which can solve not only integer but also negative number and double*/ input = input.replaceAll("-?[0-9]+\\.?[0-9]*", "i"); System.out.println("Convert the orginal input to :" + input); System.out.println("====================================="); out.println("Convert the orginal input to :" + input); out.println("====================================="); }