Assignment No. 3 Semester: Spring 2020 CS606 – Compiler Construction

[Mirha Malik]

Instructions Please read the following instructions carefully before submitting assignment: It should be clear that your assignment will not get any credit if:   o        Assignment is submitted after due date. o        Submitted assignment does not open or file is corrupt. o        Assignment is copied (From internet/ to from students).   Software (s) Used to develop Assignment -          MS Word -          MS Paint   Assignment Submission Instructions Microsoft Word file is required to submit on LMS.
Assignment	Marks 20
Question:   S ® A S | y S | e A ® B | C w | v B B ®  x C C ® z   The symbols S, A, B and C are non-terminals with S as the start symbol while v, w, x, y, z are terminal symbols.   Use the context-free grammar given above to answer the following questions.       a)      Give the FOLLOW and FIRST sets for each non-terminal symbol in above grammar b)     Construct the parsing table for a non-recursive predictive parser for above grammar.
Deadline: Your assignment must be uploaded on or before the due date. We shall not accept your solution through email after the due date.

 kindly share solution

[+ Faisal +]

[Hamza]

Fist Sets:

S = {v, x, y, z, ε}

A = {v, x, z}

B = {x}

C = {z}

 

Follow Sets:

S = {$}

A = {v, x, y, z, $}

B = {v, x, y, z, $}

C = {w, v, x, y, z, $}