CS606 - Compiler Construction

• 

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

  2
  0
  Votes
  2
  Posts
  3
  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
  solution discussion fall 2019 assignment 3 cs606 • • zareen  

  48
  0
  Votes
  48
  Posts
  57
  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
  1
  Views

  No one has replied

• 

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

  2
  0
  Votes
  2
  Posts
  4
  Views

  

  Ideas Solution Q No 01 Solution: NP -> Adj NP The draw parse trees for above given grammar: 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: 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: 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: 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: 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: 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: 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: The above grammar has two different parse trees therefore the given grammar is ambiguous. THE END!
• 

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

  3
  0
  Votes
  3
  Posts
  3
  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