Scribd Logo
Upload

Welcome to Scribd!

  • Regno: Name: Computer Science Department: Includes Working Independently On The Quiz. No Group Efforts

    Uploaded by

    Noman
    16 views4 pages
    This document is a quiz for a Compiler Construction course covering shift-reduce parsing and SLR(1) parsing. The quiz contains two questions: the first asks the student to perform shift-reduce parsing on the input string "abcba" using a palindrome grammar; the second asks the student to draw the states of an SLR(1) parser that would be used to parse the input "232" using a given augmented grammar, without constructing the full SLR(1) states table. The student is expected to work independently without group efforts.

    Original Description:

    Original Title

    CC_Quiz2 B (1)

    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 is a quiz for a Compiler Construction course covering shift-reduce parsing and SLR(1) parsing. The quiz contains two questions: the first asks the student to perform shift-reduce parsing on the input string "abcba" using a palindrome grammar; the second asks the student to draw the states of an SLR(1) parser that would be used to parse the input "232" using a given augmented grammar, without constructing the full SLR(1) states table. The student is expected to work independently without group efforts.

    Copyright:

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

    Regno: Name: Computer Science Department: Includes Working Independently On The Quiz. No Group Efforts

    Uploaded by

    Noman
    This document is a quiz for a Compiler Construction course covering shift-reduce parsing and SLR(1) parsing. The quiz contains two questions: the first asks the student to perform shift-reduce parsing on the input string "abcba" using a palindrome grammar; the second asks the student to draw the states of an SLR(1) parser that would be used to parse the input "232" using a given augmented grammar, without constructing the full SLR(1) states table. The student is expected to work independently without group efforts.

    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 4

    Shaheed Zulfikar Ali Bhutto Institute of Science & Technology

    COMPUTER SCIENCE DEPARTMENT

    RegNo: Quiz2
    Name: Date:14thDec,20
    20 Nov,2020
    Program : BS(CS) Class & : BS(CS)-
    Section 6A
    Course Name : Compiler Construction Duration : 30 min
    Instructor’s : Ms. Mehr un Nisa Marks : 15
    Name

    Note: You are expected to take this quiz according to course and University honor codes; this
    includes working independently on the quiz. No group efforts.
    Q1: Consider the palindrome grammar
            S –>aSa
            S –>bSb
            S –>c
    Perform Shift Reduce parsing for input string “abcba”
    Q2: Consider the following augmented grammar
    S→ 1A1| 2A2| 1B2| 1B2
    A→ 3
    B→ 3
    Draw the states of the SLR(1) used during a parse of the input 232. Do not construct the entire SLR(1)
    states instead, just show the states that are actually used during the parse.

    You might also like