Java实现的算符优先分析程序

package indi.huangzi;

import java.io.IOException;
import java.io.InputStream;

public class suanfayouxian {
static int SIZE = 128;
static char[] lexbuf = new char[SIZE];// 存放输入的要进行分析的句子
static char[] lex = new char[SIZE];// 存放剩余串
static char[] fenxizhan = new char[SIZE];// 分析栈
static char[][] youxian = {
// + - * / id ( ) #
{ '>', '>', '<', '<', '<', '<', '>', '>' }, // +
{ '>', '>', '<', '<', '<', '<', '>', '>' }, // -
{ '>', '>', '>', '>', '<', '<', '>', '>' }, // *
{ '>', '>', '>', '>', '<', '<', '>', '>' }, // /
{ '>', '>', '>', '>', '$', '$', '>', '>' }, // id
{ '<', '<', '<', '<', '<', '<', '=', '$' }, // (
{ '>', '>', '>', '>', '$', '$', '>', '>' }, // )
{ '<', '<', '<', '<', '<', '<', '$', '%' }// #
};// 优先级数组
static int k = 0;

public static void fenxi() {
int i, j, f, h, h1, lie, lie1;
int flag = 0;// 操作的步骤数
char a;// 存放正在输入的字符
char yx, gy, yx1;
f = String.valueOf(lexbuf).trim().length();// f存放的是正要进行分析的句子的长度
for (i = 0; i < f; i++) {

a = lexbuf[i];
if (fenxizhan[k] == '+' || fenxizhan[k] == '-' || fenxizhan[k] == '*' || fenxizhan[k] == '/'
|| fenxizhan[k] == 'i' || fenxizhan[k] == '(' || fenxizhan[k] == ')' || fenxizhan[k] == '#') 
{
j = k; 
} 
else {
j = k - 1;
}
h = panduan(fenxizhan[j]);
if (a == '+' || a == '-' || a == '*' || a == '/' || a == 'i' || a == '(' || a == ')' || a == '#')
{lie = panduan(a);}
else {
System.out.println("error!!!!不合法的句子呀！！！");
break;
}
yx = youxian[h][lie];
if (yx == '>') {
if (fenxizhan[k] == '+' || fenxizhan[k] == '-' || fenxizhan[k] == '*' || fenxizhan[k] == '/'
|| fenxizhan[k] == 'i' || fenxizhan[k] == '(' || fenxizhan[k] == ')' || fenxizhan[k] == '#')
{shengyuchuan();}
else {;}

lable1: for (int o=0;o<1;o++ ) {
gy = fenxizhan[j];
if (fenxizhan[j-1] == '+' || fenxizhan[j-1] == '-' || fenxizhan[j-1] == '*' || fenxizhan[j-1] == '/'
|| fenxizhan[j-1] == 'i' || fenxizhan[j-1] == '(' || fenxizhan[j-1] == ')'
|| fenxizhan[j-1] == '#') {
{ j = j - 1;}
} else {