編譯原理—小型(簡化)高級語言分析器前端(Java)

實現一個一遍掃描的編譯前端,將簡化高級語言的部分語法成分(含賦值語句、分支語句、循環語句等)翻譯成四元式(或三地址代碼),還要求有合理的語法出錯報錯和錯誤恢復功能。

測試樣例

beginwhile a<b doif c<5beginwhile x>ybeginz:=x+1;enda:=2; b:=4;c:=c-1;area:=3.14*a*a;s:=2*3.1416*r*(h+r);end
endend
#

測試結果
詞法分析程序
從文件中讀取程序

(1, begin)
(4, while)
(10, a)
(20, <)
(10, b)
(5, do)
(2, if)
(10, c)
(20, <)
(11, 5)
(1, begin)
(4, while)
(10, x)
(23, >)
(10, y)
(1, begin)
(10, z)
(18, :=)
(10, x)
(13, +)
(11, 1)
(26, ; )
(6, end)
(10, a)
(18, :=)
(11, 2)
(26, ; )
(10, b)
(18, :=)
(11, 4)
(26, ; )
(10, c)
(18, :=)
(10, c)
(14, -)
(11, 1)
(26, ; )
(10, area)
(18, :=)
(11, 3.14)
(15, *)
(10, a)
(15, *)
(10, a)
(26, ; )
(10, s)
(18, :=)
(11, 2)
(15, *)
(11, 3.1416)
(15, *)
(10, r)
(15, *)
(27, ()
(10, h)
(13, +)
(10, r)
(28, ))
(26, ; )
(6, end)
(6, end)
(6, end)
(0, #)
=詞法分析完成=
語法分析中…,請稍候
error!--------缺少開頭符號begin,程序第4行出現語法錯誤
error!--------不是符號then,程序第5行出現語法錯誤
error!--------不是符號do,程序第7行出現語法錯誤
=詞法分析完成=
語法分析完成,共檢查出3個語法錯誤

=中間代碼生成結果=
0:if a < b goto 2
1:goto 22
2:if c < 5 goto 4
3:goto 21
4:if x > y goto 6
5:goto 9
6:t1 = x + 1
7:z = t1
8:goto 4
9:a = 2
10:b = 4
11:t2 = c - 1
12:c = t2
13:t3 = 3.14 * a
14:t4 = t3 * a
15:area = t4
16:t5 = 2 * 3.1416
17:t6 = t5 * r
18:t7 = h + r
19:t8 = t6 * t7
20:s = t8
21:goto 0

語義分析

public class Element {String times;String data1;String op;String data2;String type;public void setInteger(Integer integer) {this.integer = integer;}Integer integer;Element(String times,String data1,String op,String data2) {//=this.times = times;this.data1 = data1;this.op = op;this.data2 = data2;}Element(String times,String data1,String op,String data2,Integer integer) {//if gotothis.times = times;this.data1 = data1;this.op = op;this.data2 = data2;this.integer=integer;}Element(Integer integer) {//if gotothis.integer=integer;}Element() {//if goto}
}

public class SemanticAnalysis {static  int j=0,t=1;static List<Element> elements = new ArrayList<Element>();static void memset(String times,String data1,String op,String data2) {Element e = new Element(times,data1,op,data2);elements.add(e);}public static String expression() { // 表達式String times,data1,op,data2;data1 = term();while(analyzer.llist.get(j).equals("+") || analyzer.llist.get(j).equals("-")) {// 當前單詞為+、-if(analyzer.llist.get(j).equals("+")) // +op = "+";else // -op = "-";j++;data2 = term();times = "t" + (t++);memset(times,data1,op,data2);data1 = times;}return data1;}private static String term() { // 項String times,data1,op,data2;data1 = factor();while(analyzer.llist.get(j).equals("*") || analyzer.llist.get(j).equals("/") ) { // 當前單詞為*、/if(analyzer.llist.get(j).equals("*")) // *op = "*";else // /op = "/";j++;data2 = factor();times = "t" + (t++);memset(times,data1,op,data2);data1 = times;}return data1;}private static String factor() { // 因子String data = "";if(analyzer.map2.get(analyzer.llist.get(j)) == 10) { // IDdata = analyzer.llist.get(j);j++;} else if(analyzer.map2.get(analyzer.llist.get(j)) == 11) { // NUMdata = analyzer.llist.get(j);j++;}else if(analyzer.llist.get(j).equals("(")) { // 左括號j++;data = expression();if(analyzer.llist.get(j).equals(")"))j++;} else {System.out.println("Error,表達式錯誤");}return data;}}

語法分析


public class GrammarAnalysis {static char[] s = new char[100];static int sing;static int i; //用來記錄數組s中的下標;static int error = 0;static void P() {if (Objects.equals(analyzer.llist.get(i), "begin")) {++i;int cur = analyzer.map.get(i);S();
//處理if (Objects.equals(analyzer.llist.get(i), "end")) {++i;} else {System.out.println("error!--------不是結尾符號end," + "程序第" + analyzer.map.get(i) + "行出現語法錯誤");error++;++i;}} else {System.out.println("error!--------缺少開頭符號begin," + "程序第" + analyzer.map.get(i) + "行出現語法錯誤");error++;S();
//處理if (Objects.equals(analyzer.llist.get(i), "end")) {++i;} else {System.out.println("error!--------不是結尾符號end," + "程序第" + analyzer.map.get(i) + "行出現語法錯誤");error++;++i;}}}static void B() {i++;D();int cur = SemanticAnalysis.elements.size();SemanticAnalysis.elements.add(new Element());//thenif (!analyzer.llist.get(i).equals("then")) {System.out.println("error!--------不是符號then," + "程序第" + analyzer.map.get(i) + "行出現語法錯誤");error++;} elsei++;P();SemanticAnalysis.elements.get(cur).setInteger(SemanticAnalysis.elements.size());//elsei--;}static void C() {i++;D();int cur = SemanticAnalysis.elements.size();SemanticAnalysis.elements.add(new Element());//doif (!analyzer.llist.get(i).equals("do")) {System.out.println("error!--------不是符號do," + "程序第" + analyzer.map.get(i) + "行出現語法錯誤");error++;} elsei++;P();SemanticAnalysis.elements.add(new Element(cur - 1));SemanticAnalysis.elements.get(cur).setInteger(SemanticAnalysis.elements.size());i--;}static void D() {String data1, data2, op;SemanticAnalysis.j = i;;data1 = SemanticAnalysis.expression();//表達式E();op = analyzer.llist.get(i);//<|<=....i++;SemanticAnalysis.j = i;data2 = SemanticAnalysis.expression();//表達式SemanticAnalysis.elements.add(new Element("if", data1, op, data2, SemanticAnalysis.elements.size() + 2));E();}static void S() {if (analyzer.map2.get(analyzer.llist.get(i)) == 10)A();else if (analyzer.llist.get(i).equals("while"))C();else if (analyzer.llist.get(i).equals("if")) {B();}i++;S1();// if(s[i]!='e') {// }
/*                if(Objects.equals(analyzer.llist.get(i), ";")) {}else {System.out.println("error!-----------缺少結尾符號;"+",程序第"+analyzer.map.get(i)+"行出現語法錯誤");error++;++i;S1();}*/}static void S1() {if (i < analyzer.llist.size() && !Objects.equals(analyzer.llist.get(i), "end")) {// ++i;S();}}static void A() {if (i + 1 < analyzer.llist.size() && Objects.equals(analyzer.llist.get(i + 1), ":=")) {String times = analyzer.llist.get(i), data1;SemanticAnalysis.j = i;SemanticAnalysis.j += 2;data1 = SemanticAnalysis.expression();//表達式SemanticAnalysis.memset(times, data1, "", "");++i;++i;E();if (Objects.equals(analyzer.llist.get(i), ")") || Objects.equals(analyzer.llist.get(i), ";")) {if (Objects.equals(analyzer.llist.get(i), ")")) {++i;}} else {System.out.println("error!--------不是結尾符號;或者)" + ",程序第" + analyzer.map.get(i) + analyzer.llist.get(i) + "行出現語法錯誤");error++;++i;}} else {System.out.println("error!---------不是賦值語句" + ",程序第" + analyzer.map.get(i) + "行出現語法錯誤");error++;++i;++i;E();if (Objects.equals(analyzer.llist.get(i), ")") || Objects.equals(analyzer.llist.get(i), ";")) {if (Objects.equals(analyzer.llist.get(i), ")")) {++i;}} else {System.out.println("error!--------不是結尾符號;或者)" + ",程序第" + analyzer.map.get(i) + "行出現語法錯誤");error++;++i;}}}static void E() {T();/*  if(Objects.equals(analyzer.llist.get(i), "+") || Objects.equals(analyzer.llist.get(i), "-") || Objects.equals(analyzer.llist.get(i), ";") || Objects.equals(analyzer.llist.get(i), ")")) {*/E1();/*            }else {System.out.println("error!-----------不是結尾符號+或者-或者;或者)"+",程序第"+analyzer.map.get(i)+"行出現語法錯誤"); error++;E1();}*/}static void T() {F();if (Objects.equals(analyzer.llist.get(i), "+") || Objects.equals(analyzer.llist.get(i), "-") || Objects.equals(analyzer.llist.get(i), ";") || Objects.equals(analyzer.llist.get(i), ")") || Objects.equals(analyzer.llist.get(i), "*") || Objects.equals(analyzer.llist.get(i), "/")) {T1();}}static void F() {if (Objects.equals(analyzer.llist.get(i), "(")) {++i;E();} else {++i;}}static void T1() {if (Objects.equals(analyzer.llist.get(i), "*")) {++i;F();T1();} else if (Objects.equals(analyzer.llist.get(i), "/")) {++i;F();T1();}}static void E1() {if (Objects.equals(analyzer.llist.get(i), "+")) {++i;T();E1();} else if (Objects.equals(analyzer.llist.get(i), "-")) {++i;T();E1();}}public static void main(String[] args) {Scanner sc = new Scanner(System.in);System.out.println("==詞法分析程序==");System.out.println("從文件中讀取程序");System.out.println("==============");analyzer.initToken();analyzer.ReadFile1();System.out.println("語法分析中....,請稍候");i = 0;sing = 0;if (Objects.equals(analyzer.llist.get(0), "#")) System.exit(-1);P();if (Objects.equals(analyzer.llist.get(i), "#")) {} else {System.out.println("error!-------不是結尾符號#" + analyzer.llist.get(i) + i);error++;}System.out.println("===詞法分析完成===");System.out.println("語法分析完成,共檢查出" + error + "個語法錯誤");System.out.println("\n===中間代碼生成結果===");for (int i = 0; i < SemanticAnalysis.elements.size(); i++) {Element e = SemanticAnalysis.elements.get(i);if (e.times == null)System.out.println(i + ":" + "goto  " + e.integer);else if (e.times.equals("if"))System.out.println(i + ":" + e.times + " " + e.data1 + " " + e.op + " " + e.data2 + "  goto  " + e.integer);elseSystem.out.println(i + ":" + e.times + " = " + e.data1 + " " + e.op + " " + e.data2);}}}

詞法分析

public class analyzer {public static List<String> llist=new ArrayList<>();static  Map<Integer,Integer> map=new HashMap<>();static  Map<String,Integer> map2=new HashMap<>();final static String ID = "\\p{Alpha}(\\p{Alpha}|\\d)*";static  int countLine=1;/** 整形常數 NUM >> 正則表達式*/final static String NUM = "\\d\\d*";final static  String regex = "^-?([1-9]\\d*\\.\\d*|0\\.\\d*[1-9]\\d*|0?\\.0+|0)$";/** token 詞法單元* <詞符號, 種別碼> *//** 關鍵字 token*/static Map<String, Integer> TOKEN_KEYWORDS;/** 運算符/界符 token */static Map<String, Integer> TOKEN_OPERATOR_BOUNDARY;/** 其他單詞 token*/static Map<String, Integer> TOKEN_ID_SUM;/** 文件根目錄*/static final String ROOT_DIRECTORY = "program.txt";/*** 初始化 token 單元*/public static void initToken(){//種別碼創建TOKEN_KEYWORDS = new HashMap<String, Integer>(){//關鍵字{put("begin", 1);put("if", 2);put("then", 3);put("while", 4);put("do", 5);put("end", 6);}};TOKEN_OPERATOR_BOUNDARY= new HashMap<String, Integer>(){//運算符和界符{put("+", 13);put("-", 14);put("*", 15);put("/", 16);put(":", 17);put(":=", 18);put("<", 20);put("<>", 21);put("<=", 22);put(">", 23);put(">=", 24);put("=", 25);put(";", 26);put("(", 27);put(")", 28);put("#", 0);}};TOKEN_ID_SUM= new HashMap<String, Integer>(){//標識符和整型常數{put(ID, 10);put(NUM, 11);}};}/*** 讀 源程序 文件*/public static void ReadFile1() {FileInputStream fis = null;InputStreamReader isr = null;BufferedReader br = null;try {fis = new FileInputStream(ROOT_DIRECTORY);isr = new InputStreamReader(fis, "UTF-8"); // 轉化類br = new BufferedReader(isr); // 裝飾類String line;/** 記錄 程序 行數 */while ((line = br.readLine()) != null) {  // 每次讀取一行,分析一行boolean answer = lexicalAnalysis(line);if(answer == false){System.out.printf("ERROR 編譯錯誤=== 第 %d 行出現 詞法錯誤 \n", countLine);break;}countLine++;}System.out.printf("===詞法分析完成===\n");} catch (Exception ex) {ex.printStackTrace();} finally {try {br.close(); // 關閉最后一個類,會將所有的底層流都關閉} catch (Exception ex) {ex.printStackTrace();}}}/** 判斷key是否是其他單詞*/private static boolean isIDOrSUM(String key){if (key.matches(ID) ) {llist.add(key);map.put(llist.size()-1,countLine);map2.put(key,TOKEN_ID_SUM.get(ID));System.out.printf("(%d, %s)\n", TOKEN_ID_SUM.get(ID), key);}else if (key.matches(NUM)||key.matches(regex)) {llist.add(key);map.put(llist.size()-1,countLine);map2.put(key,TOKEN_ID_SUM.get(NUM));System.out.printf("(%d, %s)\n", TOKEN_ID_SUM.get(NUM), key);}else {return false;}return true;}/*** 進行 詞法分析* @param word 要分析的字符串* @return 結果*/public static boolean  lexicalAnalysis(String word){word = word.trim(); // 去首尾空格String[] strings = word.split("\\p{Space}+"); // 分割字符串,保證處理的字符串沒有空格for (String string : strings) {/** 3種情況:*      1. 關鍵字 == end (關鍵字的后面一定是空格 )*      2. 運算符/ 分界符 == continue*      3. 其他單詞 == continue*/String key = "";for (int i = 0; i < string.length(); i++){String indexChar = String.valueOf(string.charAt(i)) ;if(i+1<string.length()){if((indexChar+string.charAt(i+1)).equals("//"))return true;}/** 是 運算符 或者 關鍵字*/if (TOKEN_OPERATOR_BOUNDARY.containsKey(indexChar) ||TOKEN_KEYWORDS.containsKey(string.substring(i, string.length()))){if (key.length() > 0) {if (isIDOrSUM(key) == false) {/** 詞法錯誤 */return false;}key = "";}if(TOKEN_OPERATOR_BOUNDARY.containsKey(indexChar)) {/**  1. 是 運算符/分界符 */key += indexChar;if(i + 1 < string.length() && TOKEN_OPERATOR_BOUNDARY.containsKey(indexChar + string.charAt(i+1))){ // 運算分界符key += string.charAt(++i);}llist.add(key);map.put(llist.size()-1,countLine);map2.put(key,TOKEN_OPERATOR_BOUNDARY.get(key));System.out.printf("(%d, %s)\n",TOKEN_OPERATOR_BOUNDARY.get(key),key);key = "";}else if(TOKEN_KEYWORDS.containsKey(key = string.substring(i, string.length()))) {/** 2. 是關鍵字*/llist.add(key);map.put(llist.size()-1,countLine);map2.put(key,TOKEN_KEYWORDS.get(key));System.out.printf("(%d, %s)\n",TOKEN_KEYWORDS.get(key),key);key = "";break;}}else {/** 是其他單詞*/key += indexChar;/** 其他單詞后面是 1. 換行,2. 運算符/界符 3. 其他單詞*/if(i+1 >= string.length()){if (isIDOrSUM(key) == false) {/** 詞法錯誤 */return false;}}}}}return true;}public analyzer() {}public static void main(String[] args) {initToken();System.out.println("==詞法分析程序==");System.out.println("從文件中讀取程序");System.out.println("==============");ReadFile1(); for(String s:llist) System.out.println(s);System.out.println();}}

本文來自互聯網用戶投稿,該文觀點僅代表作者本人,不代表本站立場。本站僅提供信息存儲空間服務,不擁有所有權,不承擔相關法律責任。
如若轉載,請注明出處:http://www.pswp.cn/news/392125.shtml
繁體地址,請注明出處:http://hk.pswp.cn/news/392125.shtml
英文地址,請注明出處:http://en.pswp.cn/news/392125.shtml

如若內容造成侵權/違法違規/事實不符,請聯系多彩編程網進行投訴反饋email:809451989@qq.com,一經查實,立即刪除!

相關文章

linux boot菜單列表,Bootstrap 下拉菜單(Dropdowns)簡介

Bootstrap 下拉菜單是可切換的&#xff0c;是以列表格式顯示鏈接的上下文菜單。這可以通過與 下拉菜單(Dropdown) JavaScript 插件 的互動來實現。如需使用下拉菜單&#xff0c;只需要在 class .dropdown 內加上下拉菜單即可。下面的實例演示了基本的下拉菜單&#xff1a;實例主…

dynamodb管理ttl_如何使用DynamoDB TTL和Lambda安排臨時任務

dynamodb管理ttlby Yan Cui崔燕 如何使用DynamoDB TTL和Lambda安排臨時任務 (How to schedule ad-hoc tasks with DynamoDB TTL and Lambda) CloudWatch Events let you easily create cron jobs with Lambda. However, it’s not designed for running lots of ad-hoc tasks,…

5g創業的構想_數據科學項目的五個具體構想

5g創業的構想Do you want to enter the data science world? Congratulations! That’s (still) the right choice.您想進入數據科學世界嗎&#xff1f; 恭喜你&#xff01; 那(仍然)是正確的選擇。 The market currently gets tougher. So, you must be mentally prepared f…

Microsoft Windows Phone 7 Toolkit Silverlight SDK XNA Game Studio 4.0 開發工具套件正式版下載...

Windows Phone 7開發工具套件包括Visual Studio 2010 Express for Windows Phone、Windows Phone模擬器、Expression Blend 4 for Windows Phone、XNA Game Studio 4.0和新增加的必應地圖SDK。 英文版的光盤鏡像&#xff1a;點擊下載 文檔中心&#xff1a;Windows Phone develo…

數據挖掘—Apriori算法(Java實現)

算法描述 &#xff08;1&#xff09;掃描全部數據&#xff0c;產生候選1-項集的集合C1&#xff1b; &#xff08;2&#xff09;根據最小支持度&#xff0c;由候選1-項集的集合C1產生頻繁1-項集的集合L1&#xff1b; &#xff08;3&#xff09;對k>1&#xff0c;重復執行步驟…

怎么匯報一周開發工作情況_如何在沒有經驗的情況下獲得第一份開發人員工作

怎么匯報一周開發工作情況Whether you’ve done a coding bootcamp or taught yourself, getting your first developer job with only a few months of coding under your belt is hard.無論您是完成了編碼訓練營還是自學了&#xff0c;僅靠幾個月的編碼就很難拿到第一份開發人…

vue.js的認知

Vue.js&#xff08;讀音 /vju?/, 類似于 view&#xff09; 是一套構建用戶界面的漸進式框架。 Vue 只關注視圖層&#xff0c; 采用自底向上增量開發的設計。 Vue 的目標是通過盡可能簡單的 API 實現響應的數據綁定和組合的視圖組件。 Vue 學習起來非常簡單&#xff0c;。轉載于…

c語言中的無符號字節,C語言之有符號數和無符號數

我們知道&#xff0c;在C語言中存在無符號數和有符號數(一些高級語言如Java里面是沒有無符號數的)&#xff0c;但是對于計算機而言&#xff0c;其本身并不區別有符號數和無符號數&#xff0c;因為在計算機里面都是0或者1&#xff0c;但是在我們的實際使用中有時候需要使用有符號…

8種排序算法比較

8種排序算法&#xff0c;各算法名稱見下表或見源碼。運行程序時&#xff0c;將需要你輸入一數值&#xff0c;以確定對多少隨機數進行排序。然后將會顯示各排序算法的耗時。并且你可選擇時否進行正序和反序測試。 由于水平有限&#xff0c;可能存在一些錯誤&#xff0c;還請各位…

兩個問題,關于XP進程優化及SVSP虛擬存儲平臺

這兩個問題讓我有點頭痛&#xff0c;是Boss這陣子布置給我的&#xff0c;都一段時間了&#xff0c;我還是沒找出合適的解決方案來答復Boss.第一個問題是&#xff1a;查查X200或X61中的進程&#xff0c;看哪些是可以不要的&#xff0c;停掉&#xff0c;但又不影響用戶使用。&…

數據挖掘—樸素貝葉斯分類算法(Java實現)

算法描述 &#xff08;1&#xff09;掃描訓練樣本數據集&#xff0c;分別統計訓練集中類別 Ci 的個數 Di 和屬于類別Ci 的樣本中屬性Ak取值Xk為 Dik 的實例樣本個數&#xff0c;構成統計表&#xff1b; &#xff08;2&#xff09;計算先驗概率和條件概率&#xff0c;構成概率表…

net core 獲取網站目錄

AppContext.BaseDirectory 獲取項目的根目錄轉載于:https://www.cnblogs.com/zxs-onestar/p/7147265.html

泰晤士報下載_《泰晤士報》和《星期日泰晤士報》新聞編輯室中具有指標的冒險活動-第1部分:問題

泰晤士報下載TLDR: Designing metrics that help you make better decisions is hard. In The Times and The Sunday Times newsrooms, we have spent a lot of time trying to tackle three particular problems.TLDR &#xff1a;設計度量標準以幫助您做出更好的決策非常困難…

速度一半永遠追不上_您將永遠不會知道自己應該怎么做的一半-沒關系。

速度一半永遠追不上by Ken Gilb肯吉爾伯(Ken Gilb) 您將永遠不會知道自己應該怎么做的一半-沒關系。 (You will never know half of what you think you should — and that’s ok.) Impostor syndrome is a real thing in software development. After 20 years in the indus…

c語言自學門檻,初學C語言的人最常問的幾個問題

初學C語言的人最常問的幾個問題C語言是一門通用計算機編程語言&#xff0c;應用廣泛。對于新手來說學習C語言并不是那么容易&#xff0c;下面是C語言初學者最常問的幾個問題&#xff0c;歡迎閱讀!1.多久能學會編程?這是一個沒有答案的問題。每個人投入的時間、學習效率和基礎都…

背景消除的魔力

圖片的功能非常強大&#xff0c;有一圖勝千言的效果&#xff0c;所以在文檔或演示文稿中使用圖片來增加趣味性是一種很棒的想法。但問題是&#xff0c;圖片通常會變為文字中間的獨立矩形&#xff0c;而不是真正與內容融合在一起。您可以在圖片中放置邊框或效果&#xff0c;使其…

Puppet 之 模板和模塊

1 概述模板文件是在puppet模塊下面templates目錄中以”.erb”結尾的文件&#xff0c;puppet模板主要用于文件&#xff0c;例如各種服務的配置文件&#xff0c;相同的服務&#xff0c;不同的配置就可以考慮使用模板文件。模塊是Puppet自包含的代碼和數據集合。絕大多數的清單都…

java異步io_Java中的異步IO與異步請求處理

java異步ioIn this article, I am trying to explain the difference between Async-IO and Async-Request processing in the HTTP request in the Java world.在本文中&#xff0c;我試圖解釋Java世界中HTTP請求中Async-IO和Async-Request處理之間的區別。 In the pre-Java …

異常檢測機器學習_使用機器學習檢測異常

異常檢測機器學習什么是異常檢測&#xff1f; (What is Anomaly Detection?) The anomaly detection problem has been a problem that has been frequently explored in the field of machine learning and has become a classic problem. Anomalies are any unusual sequenc…

數據挖掘—BP神經網絡(Java實現)

public class Test {public static void main(String args[]) throws Exception {ArrayList<ArrayList<Double>> alllist new ArrayList<ArrayList<Double>>(); // 存放所有數據ArrayList<String> outlist new ArrayList<String>(); // …