合肥生活安徽新聞合肥交通合肥房產生活服務合肥教育合肥招聘合肥旅游文化藝術合肥美食合肥地圖合肥社保合肥醫院企業服務合肥法律

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

        時間:2025-02-14  來源:合肥網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. 無相關信息
        合肥生活資訊

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

        關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

        Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網 版權所有
        ICP備06013414號-3 公安備 42010502001045

        中文字幕无码日韩专区| 国产精品亚洲一区二区麻豆| 国产伦精品一区二区免费| 日韩精品免费一线在线观看| 精品日产卡一卡二卡三入口| 国产精品久久久天天影视| 99re5在线精品视频热线| 久久久久成人精品| 久久99精品综合国产首页| 成人国内精品久久久久一区| 亚洲精品第一国产综合境外资源| 日韩成人在线网站| 国产一区二区三区国产精品| 国产精品美女网站在线看| 日韩成人精品日本亚洲| 青草久久精品亚洲综合专区| 亚洲国产成人精品无码区花野真一| 久久久这里有精品| 无码精品尤物一区二区三区| 2021最新久久久视精品爱| 国产精品国产三级国产专播 | 精品久久久久久亚洲| 91精品最新国内在线播放| 精品国精品国产自在久国产应用男| 狼人无码精华AV午夜精品| 亚洲国产欧美日韩精品一区二区三区| 国产91精品新入口| 日韩美女18网站久久精品| 国产最新精品视频| 国产成人综合精品| 国产乱人伦真实精品视频| 国产日产精品_国产精品毛片| 国产成人综合久久精品| 中文字幕日韩理论在线| 亚洲国产日韩女人aaaaaa毛片在线| 亚洲日韩乱码中文无码蜜桃臀 | 一色屋精品视频在线观看| 亚洲精品美女久久777777| 久久99国产精品久久99| 久久久久青草大香线综合精品| 日韩国产成人精品视频|