合肥生活安徽新聞合肥交通合肥房產(chǎn)生活服務(wù)合肥教育合肥招聘合肥旅游文化藝術(shù)合肥美食合肥地圖合肥社保合肥醫(yī)院企業(yè)服務(wù)合肥法律

        代做COP 3402、代寫Python/c++語言程序
        代做COP 3402、代寫Python/c++語言程序

        時間:2025-02-14  來源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯



        University of Central Florida
        School of Electrical Engineering & Computer Science
        COP 3402: System Software
        Spring 2025

        Homework #2 (Lexical Analyzer)
         
        Due Sunday, February 16th, 2025 by 11:59 p.m. 
        Goal:
        In this assignment your team have to implement a lexical analyzer for the programming language PL/0. Your program must be capable to read in a source program written in PL/0, identify some errors, and produce, as output, the source program, the source program lexeme table, and the token list. For an example of input and output refer to Appendix A. In the next page we show you the grammar for the programming language PL/0 using the extended Backus-Naur Form (EBNF).

        You will use the given Context Free Grammar (see next page) to identify all symbols the programming language provides you with.  These symbols are shown below:

        Reserved Words: const, var, procedure, call, begin, end, if, fi, then, else, while, do, read, write.        
        Special Symbols: ‘+’, ‘-‘, ‘*’, ‘/’, ‘(‘, ‘)’, ‘=’, ’,’ , ‘.’, ‘ <’, ‘>’,  ‘;’ , ’:’ .
        Identifiers: identsym = letter (letter | digit)* 
        Numbers: numbersym = (digit)+
        Invisible Characters: tab, white spaces, newline
        Comments denoted by: /* . . .   */

        Refer to Appendix B for a declaration of the token symbols that may be useful.


        In this assignment, you will not check syntax.


        Example1: program written in PL/0:

        var x, y;
        x := y * 2.

        Use these rules to read PL/0 grammar expressed in EBNF.

        1.- [ ] means an optional item, 
        2.- { } means repeat 0 or more times.
        3.- Terminal symbols are enclosed in quote marks.
        4.- Symbols without quotes are called no-terminals or a syntactic class.
        5.-A period is used to indicate the end of the definition of a syntactic class.
        6.-The symbol ‘::=’ is read as ‘is defined as’; for example, the following syntactic class:

        program ::= block ".".  

        must be read as follows: 
        a program    is defined as    a block followed by a   dot.
           program             ::=                   block                                ".".  

        Context Free Grammar for PL/0 expressed in EBNF.

        program ::= block "." . 
        block ::= const-declaration  var-declaration  proc-declaration statement.    
        const-declaration ::= [ “const” ident "=" number {"," ident "=" number} “;"].    
        var-declaration  ::= [ "var" ident {"," ident} “;"].
        proc-declaration::= {"procedure" ident ";" block ";" } .
        statement   ::= [ ident ":=" expression
        | "call" ident
                      | "begin" statement { ";" statement } "end" 
                      | "if" condition "then" statement "fi"
                | "if" condition "then" statement “else" statement fi"
                     | "while" condition "do" statement
                | “read” ident
        | “write” ident
                      | empty ] . 
         
        condition ::=  expression  rel-op  expression.
          
        rel-op ::= "="|“<>"|"<"|"<="|">"|">=“.
        expression ::= term { ("+"|"-") term}.
        term ::= factor {("*"|"/") factor}. 
        factor ::= ident | number | "(" expression ")“.

        In this assignment, you will identify valid PL/0 symbols and then translate them into an internal representation called “Tokens”.

        Lexical Grammar for PL/0 expressed in EBNF.

        ident ::= letter {letter | digit}.
        letter ::= "a" | "b" | … | "y" | "z" | "A" | "B" | ... | "Y" | "Z".
        number ::= digit {digit}.
        digit ::= "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9“.
        Lexical Conventions for PL/0:
        A numerical value is assigned to each token (internal representation) as follows: 
        skipsym = 1, identsym = 2, numbersym = 3, plussym = 4, minussym = 5, 
        multsym = 6,  slashsym = 7, fisym = 8,  eqlsym = 9, neqsym = 10, lessym = 11, leqsym = 12, gtrsym = 13, geqsym = 14, lparentsym = 15, rparentsym = 16, commasym = 17, semicolonsym = 18, periodsym = 19, becomessym = 20, 
        beginsym = 21, endsym = 22, ifsym = 23, thensym = 24, whilesym = 25, dosym = 26, callsym = 27, constsym = 28, varsym = 29, procsym = 30, writesym = 31, 
        readsym = 32, elsesym = 33.


        Example2: program written in PL/0:

        var w, x;
        read w;
        begin
           x:= 4;
           if w > x then
            w:= w + 1
           else
            w:= x;
           fi
        end
        write w. 


        Remember, in this assignment, you will not check syntax.

        For the scanner 
        x := y + 7;          and          + 7 ; x y :=   are valid inputs
        Constraints:
        Input:
        1.Identifiers can be a maximum of 11 characters in length.
        2.Numbers can be a maximum of 5 digits in length.
        3.Comments should be ignored and not tokenized.
        4.Invisible Characters should be ignored and not tokenized.

        Output:
        1.The token separator in the output's Lexeme List (Refer to Appendix A) can be either a space or a bar ('|').
        2.In your output's Lexeme List, identifiers must show the token and the variable name separated by a space or bar.
        3.In your output's Token list, numbers must show the token and the value separated by a space or bar. The value must be transformed into ASCII Representation.
        4.Be consistent in output. Choose either bars or spaces and stick with them.
        5.The token representation of the Token list will be used in the Parser (HW3). So, PLAN FOR IT!

        Detect the Following Lexical Errors:

        1.Number too long.
        2.Name too long.
        3.Invalid symbols.

        Hint: You could create a transition diagram (DFS) to recognize each lexeme on the source program and once accepted generate the token, otherwise emit an error message.
         
        Submission Instructions:
        Submit to Webcourse:
        1. Source code. (lex.c) 
        2. Instructions to use the program in a readme document.
        3. One run containing the input file (Source Program), and output file. The output file must show:  
         (Source,  Lexeme Table(lexeme-token), Token List)

        Appendix A:

        If the input is:
        var x, y;
        begin
            y := 3;
            x := y + 56;
        end.

        The output will be:
        Source Program:
        var x, y;
        begin
            y := 3;
            x := y + 56;
        end.

        Lexeme Table:

        lexeme    token type     
        var        29        
        x        2
        ,        17        
        y        2
        ;        18
        begin        21
        y        2
        :=        20
        3        3
        ;        18
        x        2
        :=          20        
        y        2
        +        4
        56        3
        ;        18
        end         22
        .        19

        Token List:
        29 2 x 17 2 y 18 21 2 y 20 3 3 18 2 x 20 2 y 4 3 56 18 22 19
         
        Appendix B:

        Declaration of Token Types:
        typedef enum { 
        skipsym = 1, identsym, numbersym, plussym, minussym,
        multsym,  slashsym, fisym, eqsym, neqsym, lessym, leqsym,
        gtrsym, geqsym, lparentsym, rparentsym, commasym, semicolonsym,
        periodsym, becomessym, beginsym, endsym, ifsym, thensym, 
        whilesym, dosym, callsym, constsym, varsym, procsym, writesym,
        readsym , elsesym} token_type;


        Example of Token Representation:
        “29  2 x  17  2 y 18  21  2 x 21  2 y 4  3 56 18  22  19”

        Is Equivalent:
        varsym identsym  x  commasym  identsym  y  semicolonsym  beginsym  identsym  x
        becomessym identsym y plussym numbersym 56 semicolonsym endsym periodsym

         
        Appendix C:

        Example of a PL/0 program: 
        const m = 7, n = 85;  
        var  i,x,y,z,q,r;  
        procedure mult; 
           var a, b;  
          begin 
             a := x;  b := y; z := 0;   
             while b > 0 do    
             begin 
                if x =1 then z := z+a fi;       
                a := 2*a; 
                b := b/2;     
             end   
          end;

        begin
          x := m;
          y := n;
          call mult;
        end.


        Find out the output for this example!


        Rubric:

        Integrity:
        Plagiarism or Resubmission of Old Programs: -100 points
        Compilation & Execution:
        Programs That Don't Compile: -100 points
        Program Cannot Reproduce any output in the terminal: -10 points
        Program is white-space dependent: -10 points
        For example, a+b should be properly tokenized.
        For example, 4hello is two tokens: a number and an identifier.
        Submission Files:
        Missing lex.c: -100 points
        Missing readme File: -5 points
        Missing Input or Output File: -5 points
        Partial Missing: -2.5 points for either input or output file
        Lexical Error Detection:
        Not Detecting All Three Lexical Errors: -15 points
        Each lexical error detection is worth 5 points.
        Output Formatting:
        Output Significantly Unaligned with Appendix A: -5 points
        Late Submissions:
        One Day Late: -10 points
        Two Days Late: -20 points

        No email submission will be accepted. 

        請加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp




         

        掃一掃在手機打開當前頁
      1. 上一篇:CP414編程代寫、代做Java/Python程序
      2. 下一篇:代做Operating Systems 、代寫C++程序語言
      3. 無相關(guān)信息
        合肥生活資訊

        合肥圖文信息
        急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計優(yōu)化
        急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計優(yōu)化
        出評 開團工具
        出評 開團工具
        挖掘機濾芯提升發(fā)動機性能
        挖掘機濾芯提升發(fā)動機性能
        海信羅馬假日洗衣機亮相AWE  復古美學與現(xiàn)代科技完美結(jié)合
        海信羅馬假日洗衣機亮相AWE 復古美學與現(xiàn)代
        合肥機場巴士4號線
        合肥機場巴士4號線
        合肥機場巴士3號線
        合肥機場巴士3號線
        合肥機場巴士2號線
        合肥機場巴士2號線
        合肥機場巴士1號線
        合肥機場巴士1號線
      4. 短信驗證碼 酒店vi設(shè)計 NBA直播 幣安下載

        關(guān)于我們 | 打賞支持 | 廣告服務(wù) | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

        Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網(wǎng) 版權(quán)所有
        ICP備06013414號-3 公安備 42010502001045

        99RE久久精品国产| 亚洲精品国产美女久久久| 精品国产三级a∨在线观看| 麻豆文化传媒精品一区二区| 久久精品人人爽人人爽快| 波多野结衣精品一区二区三区| 久久精品人人槡人妻人人玩| 久久精品国产亚洲5555| 老司机午夜精品视频播放| 亚州日韩精品专区久久久| 国产麻豆精品在线观看| 成人精品视频一区二区三区尤物 | 国产精品成在线观看| 欧美黑人欧美精品刺激 | 亚洲AV日韩AV高潮无码专区| 亚洲?V无码成人精品区日韩| 无码精品A∨在线观看十八禁| 亚洲精品在线免费观看| 久久久久99精品成人片直播| 国产精品成熟老女人视频| 777午夜精品久久av蜜臀| 久久亚洲国产成人精品无码区| 国产精品秘入口福利姬网站| 亚洲综合精品网站| 国产精品成人免费观看| 亚欧无码精品无码有性视频| 午夜精品久久久久久| 日韩精品视频在线观看免费| 精品一区二区三区影院在线午夜 | 亚洲精品无码永久在线观看男男| 国产精品入口在线看麻豆| 99久久精品日本一区二区免费| 四虎精品视频在线永久免费观看| 91精品国产高清久久久久久91| 中文精品久久久久国产网址 | 小呦精品导航网站| 香蕉久久国产精品免| 精品久久久久久中文字幕一区| 精品国产区一区二区三区在线观看| 国产成人精品一区二区A片带套| 韩国精品福利一区二区三区|