消除左递归:
import java.util.ArrayList;
public class method {
public static final char SINGLE_ANGLE_QUOTE = ''';
public static final char EPSILON = 'ε';
public static final String RIGHT_INFER_QUOTE = " → ";
public static int q = -1; //用于记录不能左递归的式子在数组中的位置
public static ArrayList ids = new ArrayList();
public void Eliminateleftrecursion(String[] arg1,String[] arg2) {
System.out.println("----消除左递归过程----");
//System.out.println(arg1.length);
//System.out.println(arg1[i]);
//System.out.println(arg2[i]);
for(int i = 0;i
main 部分
import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
public class main {
public static int num1 = -1; //捕捉可能存在间接左递归的非终结符
public static int num2 = -1; //捕捉需要替换掉的前部
public static Map map = new LinkedHashMap();
public static void main(String[] args) throws IOException{
ArrayList str = new ArrayList();
File file = new File("C:\Users\Administrator\Desktop\2.txt");
try(Scanner input = new Scanner(file)){
while(input.hasNextLine()) {
String s = input.nextLine();
str.add(s);
}
}
System.out.println("读入的产生式为:"+str);
judgement(str);
}
public static void judgement(ArrayList str) {
method me = new method();
ArrayList r1 = new ArrayList();
ArrayList r2 = new ArrayList();
int count = 0; //预制,0默认无左递归
//先进行预处理
prepare(str);
//对map进行遍历然后依次比较确定有无左递归,这里采用遍历key值然后得到map中value的方法
Set> entry = map.entrySet();
//先得到所有key值,value值
for(Map.Entry