CS606 - Compiler Construction

• 

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

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