Scribd Logo
Upload

Welcome to Scribd!

  • Assignment 1 CSE313 Compiler Design

    Uploaded by

    shubham
    31 views1 page
    This document outlines four questions related to a Compiler Design course. The first question asks to apply all phases of a compiler to generate assembly code for a given source program. The second asks to create a cross compiler using a C compiler that produces code for two different languages and machines. The third provides a context-free grammar and asks for leftmost, rightmost derivations and a parse tree. The fourth asks to draw a DFA for a given regular expression.

    Original Description:

    fgbdfjg

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines four questions related to a Compiler Design course. The first question asks to apply all phases of a compiler to generate assembly code for a given source program. The second asks to create a cross compiler using a C compiler that produces code for two different languages and machines. The third provides a context-free grammar and asks for leftmost, rightmost derivations and a parse tree. The fourth asks to draw a DFA for a given regular expression.

    Copyright:

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

    Assignment 1 CSE313 Compiler Design

    Uploaded by

    shubham
    This document outlines four questions related to a Compiler Design course. The first question asks to apply all phases of a compiler to generate assembly code for a given source program. The second asks to create a cross compiler using a C compiler that produces code for two different languages and machines. The third provides a context-free grammar and asks for leftmost, rightmost derivations and a parse tree. The fourth asks to draw a DFA for a given regular expression.

    Copyright:

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

    GALGOTIAS UNIVERSITY

    Greater Noida, Uttar Pradesh

    School of Computing Science & Engineering


    B.Tech. III Year/ V Semester/Fall-2017-18.
    Course Name : Compiler Design
    Course Code : CSE-313

    1. Apply all the phases of compiler to generate the assembly code for the following code of a source program
    P:=i*r*t. where P,i,r,t all are real value.

    2. Create a cross compiler for EQN using C compiler ,written in PDP-11,producing code inP:DP-11and a EQN
    language producing code for text formatter ,TROFF written in C.
    3. Let G be CFG
    S  bB/aA
    A b/bS/aAA
    B a/aS/bBB.
    For String bbaababa find (i) Left most Derivation (ii) right most derivation (iii) Parse tree
    4. Find DFA from the given R.E. a.(a+b)*.b.b,where . represent concatenation.

    Page 1 of 1

    You might also like