CS606 - Compiler Construction | Cyberian Learn Smartly

Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

CS606 GDB 1 Solution and Discussion

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.

CS606 - Compiler Construction
COMPILER CONSTRUCTION

Assignment # 2
COMPILER CONSTRUCTION

a: Give the Syntax Directed Translation Scheme to translate the WHILE statement: choose either JAVA or C++ syntax for building grammar

b: Now create THREE ADDRESS translation for the given piece of code:
while (a > b)
{
if (c > d)
c = c - d;
else
c = c + d;
}

CS606 - Compiler Construction
CS606 Assignment 3 Solution and 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.

CS606 - Compiler Construction
CS606 Assignment 2 Solution and Discussion

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.

CS606 - Compiler Construction
CS606 Assignment 1 Solution and Discussion

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
CS606 GDB 1 Solution and Discussion

Please share idea solution

CS606 - Compiler Construction
CS606 Assignment 3 Solution and Discussion

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:
[email protected]

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
Umeed he kya? i mean count kar sakty kya app pa? kitna time lagy ga?

Re: CS606 Assignment 3 Solution and Discussion

CS606 - Compiler Construction
CS606 Assignment 2 Solution and Discussion

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:
[email protected]

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
CS606 Assignment 1 Solution and Discussion

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:
[email protected]

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 - Compiler Construction

CS606 GDB 1 Solution and Discussion
compilers cs606 fall 2020 gdb 1 generating machine code solution • • laiba javed

3

0
Votes

3
Posts

111
Views

@laiba-javed said in CS606 GDB 1 Solution and Discussion:

Do you think intermediate code generation is extra and time consuming step while translating or it is necessary or beneficial in some way?

Stack Allocation
We now need to access the ARs from the stack. The key distinction is that the location of the current AR is not known at compile time. Instead a pointer to the stack must be maintained dynamically.

We dedicate a register, call it SP, for this purpose. In this chapter we let SP point to the bottom of the current AR, that is the entire AR is above the SP. Since we are not supporting varargs, there is no advantage to having SP point to the middle of the AR as in the previous chapter.

The main procedure (or the run-time library code called before any user-written procedure) must initialize SP with
LD SP, #stackStart
where stackStart is a known-at-compile-time constant.

The caller increments SP (which now points to the beginning of its AR) to point to the beginning of the callee’s AR. This requires an increment by the size of the caller’s AR, which of course the caller knows.

Is this size a compile-time constant?

The book treats it as a constant. The only part that is not known at compile time is the size of the dynamic arrays. Strictly speaking this is not part of the AR, but it must be skipped over since the callee’s AR starts after the caller’s dynamic arrays.

Perhaps for simplicity we are assuming that there are no dynamic arrays being stored on the stack. If there are arrays, their size must be included in some way.
COMPILER CONSTRUCTION
• usman ahmed 0

2

0
Votes

2
Posts

21
Views

last date?
CS606 Assignment 3 Solution and Discussion
assignment 3 cs606 discussion solution spring 2020 • • zareen

2

0
Votes

2
Posts

35
Views

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.
CS606 Assignment 2 Solution and Discussion
assignment 2 cs606 discussion solution spring 2020 • • zareen

3

0
Votes

3
Posts

19
Views

@zareen said in CS606 Assignment 2 Solution and Discussion:

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)

Solution:

a) Find First sets for above grammar. (10 Marks)

First (X)= a, c
First (Y)= b
First (Z)= a, b, c

b) Find Follow sets for above grammar. (10 Marks)

Follow (X)= a, b, $
Follow (Y)= a, b, $
Follow(Z)= a, b, $
CS606 Assignment 1 Solution and Discussion
assignment 1 cs606 discussion solution spring 2020 • • zaasmi

2

0
Votes

2
Posts

12
Views

@zaasmi said in CS606 Assignment 1 Solution and Discussion:

Task 1:
For regular expression below, construct an NFA using Thompson’s construction. (10 Marks)
R.E. = (y* xy* x)* y*

43407e94-3b07-4a76-ad67-3af3f378f29b-image.png
CS606 GDB 1 Solution and Discussion
cs606 discussion fall 2019 gdb 1 solution • • zareen

2

0
Votes

2
Posts

181
Views

Solution Idea:

Yes its useful idea to develop online compiler for C. Cloud computing is a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort. The paper aims to describe an online compiler which helps to reduce the problems of portability and storage space by making use of the concept of cloud computing. The ability to use different compilers allows a programmer to pick up the fastest or the most convenient tool to compile the code and remove the errors.
CS606 Assignment 3 Solution and Discussion
assignment 3 cs606 discussion fall 2019 solution • • zareen

48

0
Votes

48
Posts

341
Views

The FIRST of a sentential form is the set of terminal symbols that lead any sentential from derived from the very first sentential form. In this particular case X and Y only derive the empty string and as a result the empty string is the FIRST set of both non-terminal symbols X and Y. The FIRST of S, however, includes “a” as in the first production once can derive a sentential form that starts with an “a” given that X can be replaced by the empty string. X similar reasoning allows you to include “b” in the FIRST(S).
summary: FIRST(X) = {e}, FIRST(Y) = {e}, FIRST(S) = {a, b}

The FOLLOW set of a non-terminal symbol is the set of terminals that can appear after that non-terminal symbol in any sentential form derived from the grammar’s start symbol. By definition the follow of the start symbol will automatically include the $ sign which represents the end of the input string. In this particular case by looking at the productions of S one can determine right away that the follow of X includes the terminal “a” and “b” and that the FOLLOW of Y includes the terminal “b”. Given that the non-terminal S does not appear in any productions, not even in its own productions, the FOLLOW of S is only $.
summary: FOLLOW(S) = {$}, FOLLOW(X) = {a, b}, FOLLOW(Y) = {b}.

b) YES, because the intersection of the FIRST for every non-terminal symbol in empty. This leads to the parsing table for this LL method as indicated below. As there is no conflict in entry then grammar is clearly LL (1).
[23/01, 21:33] Waqas Ahmad: a b $
S S→XaXb S → Yb
A X→ε X→ε
B Y→ε
Umeed he kya? i mean count kar sakty kya app pa? kitna time lagy ga?
• Na VVeed Wajid

1

0
Votes

1
Posts

5
Views

No one has replied
SOLVED CS606 Assignment 2 Solution and Discussion
assignment 2 cs606 discussion fall 2019 solution • • zareen

2

0
Votes

2
Posts

63
Views

Ideas Solution
Q No 01
Solution:
NP -> Adj NP
The draw parse trees for above given grammar:
3ed24217-a089-4cd3-85e7-56389d10ccf9-image.png
The above given grammar have only one parse tree so it is non-ambiguous grammar.
NP -> NP Conj NP
The draw parse trees for above given grammar:
1c473269-1c88-4ba5-84d6-ab5169f94657-image.png
The above grammar has two different parse trees therefore the given grammar is ambiguous.

NP -> Adj N
The draw parse trees for above given grammar:
ee704f9a-b021-483a-864b-b72abc0a1c4a-image.png
The above given grammar have only one parse tree so it is non-ambiguous grammar.
NP ->N
The draw parse trees for above given grammar:
fe99c1ab-1959-4c17-b112-e347d177268b-image.png
The above given grammar have only one parse tree so it is non-ambiguous grammar.
Adj -> Young
The draw parse trees for above given grammar:
3bfc0b07-1dc1-4f40-ace6-49718f09b14f-image.png
The above given grammar have only one parse tree so it is non-ambiguous grammar.

Conj -> and
The draw parse trees for above given grammar:
bb56b34a-9ec9-4499-bd8e-d0b877b19b93-image.png
The above given grammar have only one parse tree so it is non-ambiguous grammar.

N -> Boys | Girls
The draw parse trees for above given grammar:
68e9888e-bc35-4ba4-9f60-2c46a8fa81f5-image.png
The above given grammar have only one parse tree so it is non-ambiguous grammar.
Q No 02
Solution:
The given grammar is
S -> S + S | S / S | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19
The draw parse trees for above given grammar:
Parse Trees:
a4b787fc-27a6-401d-ab7a-5b97e4399d99-image.png

The above grammar has two different parse trees therefore the given grammar is ambiguous.

THE END!
SOLVED CS606 Assignment 1 Solution and Discussion
assignment 1 cs606 discussion fall 2019 solution • • zareen

3

0
Votes

3
Posts

63
Views

@zareen said in CS606 Assignment 1 Solution and Discussion:

Use Subset Construction algorithm to find DFA for the NFA constructed in Task 1.

The resulting DFA is
5e73f087-480c-4f02-a861-cdcd3f44b9b3-image.png

50% Off on Your FEE Join US!

If you want to know how you can join us and get 50% Discout on your FEE ask Cyberian in Chat Room!

cs6067 discussion7 solution7 fall 20194 spring 20203 assignment 12 assignment 22 assignment 32 gdb 11

| |

Live Chat

1 / 1

CS606 GDB 1 Solution and Discussion compilers cs606 fall 2020 gdb 1 generating machine code solution • • laiba javed

COMPILER CONSTRUCTION • usman ahmed 0

CS606 Assignment 3 Solution and Discussion assignment 3 cs606 discussion solution spring 2020 • • zareen

CS606 Assignment 2 Solution and Discussion assignment 2 cs606 discussion solution spring 2020 • • zareen

CS606 Assignment 1 Solution and Discussion assignment 1 cs606 discussion solution spring 2020 • • zaasmi

CS606 GDB 1 Solution and Discussion cs606 discussion fall 2019 gdb 1 solution • • zareen

CS606 Assignment 3 Solution and Discussion assignment 3 cs606 discussion fall 2019 solution • • zareen

Umeed he kya? i mean count kar sakty kya app pa? kitna time lagy ga? • Na VVeed Wajid

SOLVED CS606 Assignment 2 Solution and Discussion assignment 2 cs606 discussion fall 2019 solution • • zareen

SOLVED CS606 Assignment 1 Solution and Discussion assignment 1 cs606 discussion fall 2019 solution • • zareen

50% Off on Your FEE Join US!

CS606 GDB 1 Solution and Discussion
compilers cs606 fall 2020 gdb 1 generating machine code solution • • laiba javed

COMPILER CONSTRUCTION
• usman ahmed 0

CS606 Assignment 3 Solution and Discussion
assignment 3 cs606 discussion solution spring 2020 • • zareen

CS606 Assignment 2 Solution and Discussion
assignment 2 cs606 discussion solution spring 2020 • • zareen

CS606 Assignment 1 Solution and Discussion
assignment 1 cs606 discussion solution spring 2020 • • zaasmi

CS606 GDB 1 Solution and Discussion
cs606 discussion fall 2019 gdb 1 solution • • zareen

CS606 Assignment 3 Solution and Discussion
assignment 3 cs606 discussion fall 2019 solution • • zareen

Umeed he kya? i mean count kar sakty kya app pa? kitna time lagy ga?
• Na VVeed Wajid

SOLVED CS606 Assignment 2 Solution and Discussion
assignment 2 cs606 discussion fall 2019 solution • • zareen

SOLVED CS606 Assignment 1 Solution and Discussion
assignment 1 cs606 discussion fall 2019 solution • • zareen