CS606 GDB No 01 Fall 2020 Solution / Discussion

[+ M.Tariq Malik]

CS606 GDB No 01 Fall 2020 Solution / Discussion

[+ M.Tariq Malik]

Share the GDB Question & Discuss Here....         

[+ M.Tariq Malik]

CS606_Assignment_No_01_Solution_Fall_2020

Click on the below link 

CS606_Assignment_No_01_Solution_Fall_2020

[+ M.Tariq Malik]

Let Context- free syntax is specified with a grammar G=(S,N,T,P),
Where

• S is the start symbol
• N is a set of non-terminal symbols
• T is set of terminal symbols or words
• P is a set of productions or rewrite rules

Consider the following Context-Free Grammar
1. goal? expression
2. expression? expression op term
3. | term
4. Term? number
5. | id
6. Op? +
7. |-
8. |*
9. |^
For the above CFG,
S = goal
T = { number, id, +, -,*, ^}
N = { goal, expr, term, op}
P = { 1, 2, 3, 4, 5, 6, 7, 8, 9}
Derive the expression X *2-Y^3+Z [10 Marks]
Construct a parse tree for expression X *2-Y^3+Z [10 Marks]

[+ M.Tariq Malik]

CS606 Assignment No.1 Solution Fall 2020

CS606 (Compiler Constrution) Assignment No.1 Solution Fall 2020
Rare Academy of Science

Problem Statement: Marks 20
Let Context- free syntax is specified with a grammar G=(S,N,T,P),
Where
•S is the start symbol
• N is a set of non-terminal symbols
• T is set of terminal symbols or words
• P is a set of productions or rewrite rules
Consider the following Context-Free Grammar
1. goal? expression
2. expression? expression op term
3. | term
4. Term? number
5. | id
6. Op? +
7. |-
8. |*
9. |^
For the above CFG,
S = goal
T = { number, id, +, -,*, ^}
N = { goal, expr, term, op}
P = { 1, 2, 3, 4, 5, 6, 7, 8, 9}
Derive the expression X *2-Y^3+Z [10 Marks]
Construct a parse tree for expression X *2-Y^3+Z [10 Marks]

[+ M.Tariq Malik]

CS606_Assignment_No_01_Solution_Fall_2020

Click on the below link 

CS606_Assignment_No_01_Solution_Fall_2020