Scribd Logo
Upload

Welcome to Scribd!

  • CD Assignment

    Uploaded by

    Tsion Kebede
    14 views1 page
    This document outlines a compiler design assignment with two parts. The first part asks students to use JFLAP to draw a finite automaton, simulate inputs, convert it to a grammar, and then to a regular expression. The second part asks students to use JFLAP to determine the type of a grammar, build LL1 and SLR parsing tables from it, and do a parse with an input string using the SLR table. Students are instructed to complete each part individually.

    Original Description:

    Original Title

    CD Assignment (1) (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines a compiler design assignment with two parts. The first part asks students to use JFLAP to draw a finite automaton, simulate inputs, convert it to a grammar, and then to a regular expression. The second part asks students to use JFLAP to determine the type of a grammar, build LL1 and SLR parsing tables from it, and do a parse with an input string using the SLR table. Students are instructed to complete each part individually.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    14 views1 page

    CD Assignment

    Uploaded by

    Tsion Kebede
    This document outlines a compiler design assignment with two parts. The first part asks students to use JFLAP to draw a finite automaton, simulate inputs, convert it to a grammar, and then to a regular expression. The second part asks students to use JFLAP to determine the type of a grammar, build LL1 and SLR parsing tables from it, and do a parse with an input string using the SLR table. Students are instructed to complete each part individually.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    Compiler Design Assignment

    1. By using JFLAP
    a) Draw any finite automata then simulate the given input is accepted by the machine or not
    by using step by state or using fast run.
    b) Convert DFA you created on (a) to Grammar and show all grammars.
    c) Again Covert the FA you sketched on (a) to RE (regular expression) and show again your
    result.
    2. By using JFLAP again
    a) Take any grammar and test it the type of grammar
    b) From the grammar you take, build LL1 parse table (find first and follow) and write
    your result you get.
    c) From the grammar you take, build SLR parse table (find first and follow) and write
    your result you get.
    d) On Q2 (C) take any input string and stech the parse by using the result on (C).

    Note:- Do individually and do not copy from each other.

    You might also like