CS606 Compiler Construction Assignment#01 Solution & Discussion Due Date:01-11-2011

[+ M.Tariq Malik]

Assignment Statements:

 

Question 1:

Suppose that you are working as a programmer in Microsoft. They assigned you a task to draw a finite acceptor which can be useful for lexical analyses of language L expressed as L = {w  (a, b)* / n_b(w) mod 3 > 1.}. You are requested to analyze this language and construct a deterministic finite acceptor of this language.

 

Question 2:

We can follow two approaches during the construction of lexical analyzer. We can construct it as a separate module or it can be a part of scanner. If scanner is the part of parse then in this approach parser usually generates syntax tree of the source program as defined by a grammar. The leaves of the tree are the terminal symbols of the grammar. These terminal symbols or tokens pass to the parser. But generally we choose to handle analysis separately for the better modularity and portability, and to allow make syntax analysis easier, so what are the reasons for decoupling the scanner from parser?

 

[+ M.Tariq Malik]

Please Discuss here about this assignment.Thanks

See the attached file for complete assignment

 

[ms]

koi bandah complet solution upload kar de ALLAH PAK us ka bhla kare ga INSHALLAH

[ms]

both muskil lag rahi ha  please help

[Sajidsd]

is ka 1st question main jo ye L = {w  (a, b)* / n_b(w) mod 3 > 1.}

 

term use hui hai its too complecated other wise it can be solved ... I mails to subject site and i am replied that its a part of assignment...try to solve it by yourself...

 

[Adnan Zahid]

yr koi to solution share kr dai...ab to expire hone ka time bhi qareeb hai.......

[RAZA ALI RIZVI]

kisi ny koi question kia hy to share kary ya idea he dy dy plz plz plz

[ms]

bhai koi senior he help kar day