利用java实现语法分析器

最新推荐文章于 2023-06-05 08:05:10 发布

年轻的战场321

最新推荐文章于 2023-06-05 08:05:10 发布

阅读量7.1k

点赞数 5

分类专栏： java 文章标签： java

本文链接：https://blog.csdn.net/happy_every_day1992/article/details/17505253

版权

java 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

package GrammarAnalsys;

import java.awt.*;

import java.awt.event.*;

import javax.swing.*;

import javax.swing.border.TitledBorder;

importjavax.swing.table.DefaultTableModel;

import java.sql.*;

import java.util.Vector;

publicclass GramerAnasys extends JFrame implements ActionListener {

intfirstComplete[] = null;//存储已判断过first的数据

charfirst[][] = null;//存储最后first结果

intfollowComplete[] = null;//存储已判断过follow的数据

charfollow[][] = null;//存储最后follow结果

charselect[][] = null;//存储最后select结果

intLL = 0;//标记是否为LL（1）

String vt_tou[] = null;//储存Vt

Object shuju[][] = null;//存储表达式数据

charyn_null[] = null;//存储能否推出空

JTextFieldtf1;

JTextField tf2;

JPanel p1, p2, p3, p4, p5;

JTextArea t1, t2, t3, t4;

JButton b0;

JButton b1, b2, b3;

JLabel l;

JLabel inputString, inputGramer, l2, outputFF, outputTable;

JTable table;

Statement sta;

Connection conn;

ResultSet rs;

DefaultTableModel dtm;

String Vn[] = null;

Vector<String> P = null;

GramerAnasys() {

setTitle("语法分析器----冯甲军，张锦文");

setLocation(100, 100);

setSize(1200, 500);

tf1 = new JTextField(10);

tf2 = new JTextField(10);

l = new JLabel("→");

l2 = new JLabel(" ");

p1 = new JPanel();

p2 = new JPanel();

p3 = new JPanel();

p4 = new JPanel();

p5 = new JPanel();

p5.setLayout(new GridLayout(2, 2));

t1 = new JTextArea(8, 50);

t2 = new JTextArea(1, 25);

t3 = new JTextArea(10, 50);

t4 = new JTextArea(7, 50);

t4.setText("说明：在左边输入文法如下，输入字符串如：i+i*i" +

"\nA→#" + "\nT→F B "+ "\nB→#" + "\nA→+TA" + "\nS→TA" +

"\nF→(E)" + "\nB→*FB" + "\nF→i");

t4.setEditable(false);

t3.setEditable(false);

b0 = new JButton("确认");

b1 = new JButton(" 语法判断 ");

b2 = new JButton("输入");

b3 = new JButton("清屏");

table = new JTable();

JScrollPane jp1 = new JScrollPane(t1);//文法输入区域

JScrollPane jp2 = new JScrollPane(t2);

JScrollPane jp3 = new JScrollPane(t3);

p1.add(jp1);

p1.setBorder(new TitledBorder("输入文法"));

p1.add(b1);

p2.add(jp2);

p2.add(b2);

p2.add(b3);

p2.add(t4);

p2.setBorder(new TitledBorder("输入字符串"));

p3.add(jp3);

p3.setBorder(new TitledBorder("First、Folow、分析结果"));

p4.add(new JScrollPane(table));

p4.setBorder(new TitledBorder("预测分析表"));

p5.add(p1);

p5.add(p2);

p5.add(p3);

p5.add(p4);

add(p5);

b0.addActionListener(this);

b1.addActionListener(this);

b2.addActionListener(this);

b3.addActionListener(this);

setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);

table.setPreferredScrollableViewportSize(new Dimension(570, 180));

setVisible(true);

}

public void paint(Graphics g) {

Color c = g.getColor();

this.getContentPane().setBackground(Color.BLACK);

g.setColor(Color.YELLOW);

g.fillRect(0, 0, 1200, 500);

g.setColor(c);

//this.pack();

}

publicvoid actionPerformed(ActionEvent e) {

if(e.getSource() == b0) {

String a = tf1.getText();

String b = tf2.getText();

t1.append(a + '→'+ b + '\n');

}

if(e.getSource() == b1) {

t3.setText("");

int Vnnum = 0, k;

Vn = new String[100];

P = new Vector<String>();

String s[] = t1.getText().split("\n");

for(int i=0; i<s.length; i++) {

if(s.length < 2) {

t3.setText("输入错误，请重新输入");//判断长度是否符合

return;

}

if(s[i].charAt(0) <= 'Z' && s[i].charAt(0) >= 'A' && s[i].charAt(1) == '→') {

for(k=0; k<Vnnum; k++) {

if(Vn[k].equals(s[i].substring(0, 1))){

break;

}

if(Vnnum == 0 || k >= Vnnum) {

Vn[Vnnum] = s[i].substring(0, 1);//存入Vn数据

Vnnum ++;

}

P.add(s[i]);

}

else {

t3.setText("input wrong， inputagain");

return;

}

yn_null = newchar[100];

first = newchar[Vnnum][100];

int flag = 0;

String firstVn[] = null;

firstComplete = newint[Vnnum];

for(int i=0; Vn[i]!=null; i++) { //依次求 FIRST**

flag = 0;

firstVn = new String[20];

if((flag = add_First(first[i], Vn[i], firstVn, flag)) == -1)

return;

firstComplete[i] = 1;

}

t3.append("first集："+"\n"); //显示FIRST**

for(int i=0; Vn[i]!=null; i++) {

t3.append("first ( " + Vn[i] + " ) = { ");

for(int j=0; first[i][j]!='\0'; j++) {

t3.append(first[i][j] + " , ");

}

t3.append(" }" + "\n");

}

follow = newchar[Vnnum][100];

String followVn[] = null;

followComplete = newint[Vnnum];

for(int i=0; Vn[i]!=null; i++) { //求FOLLOW**

flag = 0;

followVn = new String[20];

if((flag = tianjiaFollow(follow[i], Vn[i], followVn, flag)) == -1)

return;

followComplete[i] = 1;

}

t3.append("follow集：" + "\n"); //显示FOLLOW**

for(int i=0; Vn[i]!=null; i++) {

t3.append("follow ( " + Vn[i] + " ) = { ");

for(int j=0; follow[i][j]!='\0'; j++) {

t3.append(follow[i][j] + " , ");

}

t3.append(" }" + "\n");

}

select = newchar[P.size()][100];

for(int i=0; i<P.size(); i++) { //求SELECT**

flag = 0;

tianjiaSelect(select[i], (String)P.elementAt(i), flag);

}

t3.append("select集：" + "\n"); //显示SELECT**

for(int i=0; i<P.size(); i++) {

t3.append("select ( " + (String)P.elementAt(i) + " ) = { ");

for(int j=0; select[i][j]!='\0'; j++) {

t3.append(select[i][j] + " , ");

}

t3.append(" }" + "\n");

}

for(int i=0; Vn[i]!=null; i++) {//判断select交集是否为空

int biaozhi = 0;

char save[] = newchar[100];

for(int j=0; j<P.size(); j++) {

String t = (String)P.elementAt(j);

if(t.substring(0,1).equals(Vn[i])) {

for(k=0; select[j][k]!='\0'; k++) {

if(puanduanChar(save, select[j][k])) {

save[biaozhi]= select[j][k];

biaozhi ++;

}

else {//当有交集时，不为LL（1）文法

t3.append("不是LL（1）文法！！" + "\n");

return;

}

char Vt[] = newchar[100];

int biaozhi = 0;

for(int i=0; i<P.size(); i++) {

String t = (String)P.elementAt(i);

for(int j=2; j<t.length(); j++) {//提取表达式右侧的终结符存入Vt

if(t.charAt(j) > 'Z' ||t.charAt(j) < 'A') {

if(puanduanChar(Vt, t.charAt(j))) {

Vt[biaozhi] =t.charAt(j);

biaozhi ++;

}

if(puanduanChar(Vt, '#')) {//若可推出空集，则将#加入Vt。

Vt[biaozhi] = '#';

biaozhi ++;

}

vt_tou = new String[biaozhi+1];//根据select和表达式生成预测分析表

shuju = new String[Vnnum][biaozhi+1];

String f = "";

vt_tou[0] = f;

for(int i=0; i<biaozhi; i++) {

vt_tou[i+1] = String.valueOf(Vt[i]);

}

for(int i=0; i<Vnnum; i++) {

shuju[i][0]= Vn[i];

}

for(int i=0; i<P.size(); i++) {

String t = (String)P.elementAt(i);

int j;

for(j=0; j<Vn.length; j++) {

if(Vn[j].equals(t.substring(0, 1))) {

break;

}

for(k=0; select[i][k]!='\0'; k++) {

int y = puanduanXulie(Vt, select[i][k]);

shuju[j][y+1] = t.substring(1);

}

dtm = new DefaultTableModel(shuju, vt_tou);//显示预测分析表

table.setModel(dtm);

LL = 1;

}

if(e.getSource() == b3) {//清空列表

tf1.setText("");

tf2.setText("");

t1.setText("");

t2.setText("");

t3.setText("");

Vn = null;

P = null;

firstComplete = null;

first = null;

followComplete = null;

follow = null;

select = null;

dtm = new DefaultTableModel();

table.setModel(dtm);

}

if(e.getSource() == b2) {//输入字符串并预测分析

t3.setText("");

if(LL == 1) {

String s = t2.getText();

for(int i=0; i<s.length(); i++) {

if(s.charAt(i)=='\0') {

t3.setText("字符串中请不要加入空格" + "\n");

return;

}

char zifu[] = newchar[100];//剩余输入串

char fenxi[] = newchar[100];//分析栈

zifu[0] = '#';

fenxi[1] = 'S';

fenxi[0] = '#';

int fzifu = 1;

int ffenxi = 2;

for(int i=s.length()-1; i>=0; i--) {

zifu[fzifu] = s.charAt(i);

fzifu ++;

}

int buzhou = 2;

char n[] = newchar[65];//存储要显示的内容

t3.append("步骤分析栈剩余输入串所用产生式或匹配" + "\n");

n[0] = '1';

n[15] = '#';

n[14] = 'S';

int u = 29;

for(int i=fzifu-1; i>=0; i--) {

n[u] = zifu[i];

u ++;

}

while(!(fenxi[ffenxi-1] == '#' && zifu[fzifu-1] == '#')) {//剩余输入串不为#则分析

int i, j;

char t = zifu[fzifu-1];

char k = fenxi[ffenxi-1];

if(t == k) {//产生式匹配

n[49] = k;

n[50] = '匹';

n[51] = '配';

t3.append(String.copyValueOf(n) + "\n");

n = newchar[65];

fzifu --;

ffenxi --;

if(buzhou < 10) {

n[0] = (char)('0' + buzhou);//显示步骤数

}

else {

n[0] = (char)('0' + buzhou / 10);

n[1] = (char)('0' + buzhou % 10);

}

u = 14;

for(int y=ffenxi-1; y>=0; y--) {//处理分析栈，出栈

n[u] = fenxi[y];

u ++;

}

u = 29;

for(int y=fzifu-1; y>=0; y--) {//处理剩余字符串，消除一个字符

n[u] = zifu[y];

u ++;

}

buzhou ++;

continue;

}

for(i=0; Vn[i]!=null; i++) {//搜寻所用产生式的左部

if(Vn[i].equals(String.valueOf(k)))

break;

}

for(j=0; j<vt_tou.length; j++) {//判断是否匹配

if(vt_tou[j].equals(String.valueOf(t)))

break;

}

if(j >= vt_tou.length) {//全部产生式都不能符合则报错

t3.append(String.copyValueOf(n));

t3.append("\n" + "该串不是该文法的句型" + "\n");

return;

}

Object result1 = shuju[i][j];

if(result1 == null) {

t3.append(String.copyValueOf(n));

t3.append("\n" + "该串不是该文法的句型" + "\n");

return;

}

else { //找到所用产生式

n[49] = Vn[i].charAt(0);

u = 50;

String result =(String)result1;

for(int y=0; y<result.length(); y++){

n[u] = result.charAt(y);

u ++;

}

t3.append(String.copyValueOf(n) + "\n");

n = newchar[65];

ffenxi --;

for(i=result.length()-1; i>0; i--) {//将分析栈内非终结符换为右边表达式

if(result.charAt(i) != '#') {

fenxi[ffenxi]= result.charAt(i);

ffenxi ++;

}

if(buzhou < 10)//显示“步骤”

n[0] = (char)('0' + buzhou);

else {

n[0] = (char)('0' + buzhou / 10);

n[1] = (char)('0' + buzhou % 10);

}

u = 14;

for(int y=ffenxi-1; y>=0; y--) {

n[u] = fenxi[y];

u ++;

}

u = 29;

for(int y=fzifu-1; y>=0; y--) {

n[u] = zifu[y];

u ++;

}

buzhou ++;

}

n = newchar[65];

n[0] = '1';

n[14] = '#';

n[29] = '#';

n[49] = '分';

n[50] = '析';

n[51] = '成';

n[52] = '功';

t3.append(String.copyValueOf(n));

t3.append("\n" + "该串是此文法的句型" + "\n");

return;

}

else {

t3.setText("请先依次输入LL（1）文法，并点击文法判断按钮"+"\n");

return;

}

privateint add_First(char a[], String b, String firstVn[], int flag) { //计算FIRST**（递归）

if(puanduanString(firstVn,b.charAt(0))) {

addString(firstVn, b);

}

else {

return flag;

}

for(int i=0; i<P.size(); i++) {

String t = (String)P.elementAt(i);

for(int k=2; k<t.length(); k++) {

if(t.substring(0, 1).equals(b)) {

if(t.charAt(k) > 'Z' ||t.charAt(k) < 'A') {//表达式右端第i个不是非终结符

if(flag == 0 || puanduanChar(a,t.charAt(k))) {

if(t.charAt(k) == '#') {//#时直接加入first

if(k + 1 == t.length()) {

a[flag] = t.charAt(k);

flag++;

}

int flag1 = 0;

for(int j=0; yn_null[j]!='\0'; j++) {//所求非终结符进入yn_null**

if(yn_null[j]==b.charAt(0)) {//判断能否推出空

flag1 = 1;

break;

}

if(flag1 == 0) {

int j;

for(j=0; yn_null[j]!='\0'; j++) {

}

yn_null[j]=b.charAt(0);

}

continue;

}

else {//终结符直接加入first**

a[flag] = t.charAt(k);

flag ++;

break;

}

break;

}

else {//非终结符

if(!puanduanString(Vn, t.charAt(k))) {

int p = firstComplete(t.charAt(k));//当该非终结符的first已经求出

if(p != -1) {

flag =addElementFirst(a, p, flag);//直接加入所求first

}

elseif((flag = add_First(a, String.valueOf(t.charAt(k)), firstVn,flag)) ==-1)

return -1;

int flag1 = 0;

for(int j=0; yn_null[j]!='\0'; j++) {//当非终结符的first有空

if(yn_null[j] == t.charAt(k)) {

flag1 = 1;

break;

}

if(flag1 == 1) {//当非终结符的first能推出空

if(k + 1 == t.length()&&puanduanChar(a, '#')) {//之后无符号，且所求first无#

a[flag] = '#';//first中加入#

flag ++;

}

continue;//判断下一个字符

}

else {

break;

}

else {//错误

t3.setText("文法输入有误" + "\n");

return -1;

}

return flag;

}

privateint tianjiaFollow(char a[], String b, String followVn[], int flag) { //计算FOLLOW**（递归）

if(puanduanString(followVn,b.charAt(0))) {

addString(followVn, b);

}

else {

return flag;

}

if(b.equals("S")) {//当为S时#存入follow

a[flag] = '#';

flag ++;

}

for(int i=0; i<P.size(); i++) {

String t = (String)P.elementAt(i);

for(int j=2; j<t.length(); j++) {

if(t.charAt(j) == b.charAt(0)&& j + 1 < t.length()) {

if(t.charAt(j+1) != '\0') {

if((t.charAt(j+1) > 'Z' || t.charAt(j+1) < 'A')) {//所求为终结符

if(flag == 0 || puanduanChar(a, t.charAt(2))) {//自身

a[flag] =t.charAt(j+1);

flag ++;

}

else {//所求为非终结符

int k;

for(k=0; Vn[k]!=null; k++) {

if(Vn[k].equals(String.valueOf(t.charAt(j+1)))) {

break;//找寻下一个非终结符的Vn位置

}

flag =addElementFirst(a, k, flag);//把下一个非终结符first加入所求follow集

for(k=j+1; k<t.length(); k++) {

if((t.charAt(j+1) > 'Z' || t.charAt(j+1) < 'A')) {

break;

}

else {

if(panduan_kong(t.charAt(k))){

}

else {

break;

}

if(k >= t.length()) {//下一个非终结符可推出空，把表达式左边非终结符的follow集加入所求follow集

int p = followComplete(t.charAt(0));

if(p != -1) {

flag =addElementFollow(a, p, flag);

}

elseif((flag = tianjiaFollow(a, String.valueOf(t.charAt(0)), followVn,flag)) ==-1) {

return -1;

}

else {//错误

t3.setText("文法输入有误,请重新输入" + "\n");

return -1;

}

if(t.charAt(j) == b.charAt(0)&& j + 1 == t.length()) {

//下一个字符为空，把表达式左边非终结符的follow集加入所求follow集

int p = followComplete(t.charAt(0));

if(p != -1) {

flag =addElementFollow(a, p, flag);

}

elseif((flag = tianjiaFollow(a, String.valueOf(t.charAt(0)), followVn, flag))== -1) {

return -1;

}

return flag;

}

privatevoid tianjiaSelect(char a[], String b, int flag) { //计算SELECT**

int i = 2;

int biaozhi = 0;

while(i < b.length()) {

if((b.charAt(i) > 'Z' || b.charAt(i) < 'A') && b.charAt(i) != '#') {//是终结符

a[flag] = b.charAt(i);//将这个字符加入到Select**，结束Select**的计算

break;

}

elseif(b.charAt(i) == '#') {//是空

int j;

for(j=0; Vn[i]!=null; j++) {//将表达式左侧的非终结符的follow加入select

if(Vn[j].equals(b.substring(0, 1))) {

break;

}

for(int k=0; follow[j][k]!='\0' ;k++) {

if(puanduanChar(a, follow[j][k])) {

a[flag] = follow[j][k];

flag ++;

}

break;

}

elseif(b.charAt(i) >= 'A' && b.charAt(i) <= 'Z' && i + 1 <b.length()){//是非终结符且有下一个字符

int j;

for(j=0; Vn[i]!=null; j++) {

if(Vn[j].equals(String.valueOf(b.charAt(i)))) {

break;

}

for(int k=0; first[j][k]!='\0'; k++) {

if(puanduanChar(a,first[j][k])){//把表达式右侧所有非终结符的first集加入。

if(first[j][k] == '#') {//first中存在空

biaozhi = 1;

}

else {

a[flag] = first[j][k];

flag ++;

}

if(biaozhi == 1) {//把右侧所有非终结符的first中的#去除

i ++;

biaozhi = 0;

continue;

}

else {

biaozhi = 0;

break;

}

elseif(b.charAt(i) >= 'A' && b.charAt(i) <= 'Z' && i + 1 >=b.length()) {//是非终结符且没有下一个字符

int j;

for(j=0; Vn[i]!=null; j++) {

if(Vn[j].equals(String.valueOf(b.charAt(i)))) {

break;

}

for(int k=0; first[j][k]!='\0'; k++) {

if(puanduanChar(a, first[j][k])){

if(first[j][k] == '#') {

biaozhi = 1;//表达式右侧能推出空，标记

}

else {

a[flag] = first[j][k];//不能推出空，直接将first集加入select集

flag ++;

}

if(biaozhi == 1) {//表达式右侧能推出空

for(j=0; Vn[i]!=null; j++) {

if(Vn[j].equals(b.substring(0, 1))) {

break;

}

for(int k=0; follow[j][k]!='\0'; k++) {

if(puanduanChar(a,follow[j][k])) {

a[flag] = follow[j][k];//将将表达式左侧的非终结符的follow加入select

flag ++;

}

break;

}

else {

biaozhi = 0;

break;

}

//返回b在Vt[]的位置

privateint puanduanXulie(char Vt[], char b) {

int i;

for(i=0; Vt[i]!='\0'; i++) {

if(Vt[i] == b)

break;

}

return i;

}

//判断b是否在a中，在返回false，不在返回true

privateboolean puanduanChar(char a[], char b) {

for(int i=0; a[i]!='\0'; i++) {

if(a[i] == b)

returnfalse;

}

returntrue;

}

//判断b是否在a中，在返回false，不在返回true

privateboolean puanduanString(String a[], char b) {

for(int i=0; a[i]!=null; i++) {

if(a[i].equals(String.valueOf(b)))

returnfalse;

}

returntrue;

}

//把b加入字符串组firstVn[]

privatevoid addString(StringfirstVn[],String b) {

int i;

for(i=0; firstVn[i]!=null; i++) {

}

firstVn[i] = b;

}

//判断b是否已完成first判断

privateint firstComplete(char b) {

int i;

for(i=0; Vn[i]!=null; i++) {

if(Vn[i].equals(String.valueOf(b))) {

if(firstComplete[i] == 1)

return i;

else

return -1;

}

return -1;

}

//判断b是否已完成follow判断

privateint followComplete(char b) {

for(int i=0; Vn[i]!=null; i++) {

if(Vn[i].equals(String.valueOf(b))) {

if(followComplete[i] == 1)

return i;

else

return -1;

}

return -1;

}

//把相应终结符添加到first**中

privateint addElementFirst(char a[], int p, int flag) {

for(int i=0; first[p][i]!='\0'; i++) {

if(puanduanChar(a, first[p][i]) && first[p][i] != '#') {

a[flag] = first[p][i];

flag ++;

}

return flag;

}

//把相应终结符添加到follow**中

privateint addElementFollow(char a[], int p, int flag) {

for(int i=0; follow[p][i]!='\0'; i++) {

if(puanduanChar(a, follow[p][i])) {

a[flag] = follow[p][i];

flag ++;

}

return flag;

}

//判断a能是否包含空

privateboolean panduan_kong(char a) {

int i;

for(i=0; Vn[i]!=null; i++) {

if(Vn[i].equals(String.valueOf(a))) {

break;

}

for(int j=0; first[i][j]!='\0'; j++) {

if(first[i][j]=='#')

returntrue;

}

returnfalse;

}

publicstaticvoid main(String[] args) {

new GramerAnasys();

}

年轻的战场321

关注

5
点赞
踩
9

收藏

觉得还不错? 一键收藏
1
评论
利用java实现语法分析器

package GrammarAnalsys; import java.awt.*;import java.awt.event.*;import javax.swing.*;import javax.swing.border.TitledBorder;importjavax.swing.table.DefaultTableModel;import java.sql.
复制链接

扫一扫