Re: CS606 GDB 1 Solution and Discussion
Total Marks 5
Starting Date Monday, February 15, 2021
Closing Date Tuesday, February 16, 2021
Status Open
Question Title Intermediate Code Generation
Question Description
CS606 GDB Fall 2020
Compilers are used to translate the source code in to machine code but there is an intermediate code is generated before the target machine code. Compilers can be developed to translate directly without generating machine code.
Do you think intermediate code generation is extra and time consuming step while translating or it is necessary or beneficial in some way?
Give your comments in favor or against it with proper reasons.
Instructions:
Read the following instructions carefully before sending your comments:
GDB will have weightage of 5% of your total subject marks.
Your discussion must be based on logical facts.
You should post your comments on the Graded Discussion Board & not on the Regular MDB.
Your comments should be relevant and to-the-point i.e. clear and concise (Maximum 4-5 lines answer using font style Times New Roman and Font Size 12).
Books, websites and other reading material can be consulted but must be changed into your own wording before posting your comments. (Do not copy the material as it is.)
No extra time will be given for discussion.
Re: CS606 Assignment 3 Solution and Discussion
Assignment No. 3
Semester: Spring 2020
CS606 – Compiler Construction
Total Marks: 20
Due Date:
July 27, 2020
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.
Re: CS606 Assignment 2 Solution and Discussion
Assignment No. 2
Semester: Spring 2020
CS606 – Compiler Construction
Total Marks: 20
Due Date:
June 15, 2020
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:
X -> aZ
X -> c
Y -> bX
Z -> Ya
Z -> XbY
a) Find First sets for above grammar. (10 Marks)
b) Find Follow sets for above grammar. (10 Marks)
Deadline:
Your assignment must be uploaded on or before the due date. We shall not accept your solution through email after the due date.
Re: CS606 Assignment 1 Solution and Discussion
Assignment No. 1
Semester: Spring 2020
CS606 – Compiler Construction
Total Marks: 20
Due Date:
June 01, 2020
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
Task 1:
For regular expression below, construct an NFA using Thompson’s construction. (10 Marks)
R.E. = (y* xy* x)* y*
Task 2:
Use Subset Construction algorithm to find DFA for the NFA constructed in Task 1. (10 Marks)
Deadline:
Your assignment must be uploaded on or before the due date. We shall not accept your solution through email after the due date.
CS606 – Compiler Construction
Assignment # 03
Fall 2019
Total marks = 20
Deadline Date
22nd January, 2020
Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.
You should consult the recommended books to clarify your concepts as handouts are not enough.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.
OBJECTIVE
Objective of this assignment is to increase the learning capabilities of the students about
• Context-Free Grammars
• LL(1) Table constructions
• Follow Sets
NOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
cs606@vu.edu.pk
Questions No 01 12+8=20 Marks
Consider the grammar given below:
S → XaXb
S → Yb
X → €
Y → €
Where € (epsilon) is empty string.
a) Find First and Follow sets for above grammar. [12]
b) Construct LL (1) parsing table. [8]
Good Luck!
CS606 – Compiler Construction
Assignment # 02
Fall 2019
Total marks = 20
Deadline Date
2nd December, 2019
Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.
You should consult the recommended books to clarify your concepts as handouts are not enough.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.
OBJECTIVE
Objective of this assignment is to increase the learning capabilities of the students about
• Context-Free Grammars
• Ambiguous Grammars
• Unambiguous Grammars
NOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
cs606@vu.edu.pk
Questions No 01 10 marks
Consider the grammar given below:
NP -> Adj NP
NP -> NP Conj NP
NP -> Adj N
NP -> N
Adj -> Young
Conj -> and
N -> Boys | Girls
Where “Young, and, boys, Girls “ are terminals and “NP, N, Adj, Conj” are non-terminals.
Prove or disprove that the grammar given above is ambiguous.
Questions No 02 10 marks
Consider the grammar given below:
S -> S + S | S / S | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19
Prove that above given grammar is ambiguous.
Good Luck!
CS606 – Compiler Construction
Assignment # 01
Fall 2019
Total marks = 20
Deadline Date
14th Nov 2019
Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.
You should consult the recommended books to clarify your concepts as handouts are not enough.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.
Objective:
Objective of this assignment is to increase the learning capabilities of the students about
• Deterministic Finite Automaton (DFA)
• Nondeterministic Finite Automaton (NFA)
• Thompson’s Construction Algorithm
NOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
cs606@vu.edu.pk
Questions No 01 10 marks
For regular expression below, construct an NFA using Thompson’s construction.
R.E. = ((v + x)*y) + z
Questions No 02 10 marks
Use Subset Construction algorithm to find DFA for the NFA constructed in Task 1.
Good Luck!
CS606 Assignment 3 Solution and Discussion
CS606 - Compiler Construction
2
Posts
1
Posters
864
Views
1
Watching
-
Re: CS606 Assignment 3 Solution and Discussion
Assignment No. 3Semester: Spring 2020
CS606 – Compiler Construction
Total Marks: 20Due Date:
July 27, 2020
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 -> zThe 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. -
Discussion is right way to get Solution of the every assignment, Quiz and GDB.
We are always here to discuss and Guideline, Please Don’t visit Cyberian only for Solution.
Cyberian Team always happy to facilitate to provide the idea solution. Please don’t hesitate to contact us!
NOTE: Don’t copy or replicating idea solutions.
PAK VS BAN Live
File Sharing
