Post has attachment

Post has attachment
Hi Frnd!

Are you looking for Online Part-time jobs along with your regular job ?

      1. Join Spicetomail.com for Free & Get Rs.100 as Instant Bonus!!

      2. Earn Rs.500/- by Just Reading their advertisement E-mails and SMS Daily.

      3. Refer your Friends & Get commission Upto Rs.300/- for your Friend's referral too.

      4. Get Your Earnings Every Week by Cheque.

its Already Over 1 Lakh Active Users Doing This .....

Join Now & START Earning immediately

http://www.spicetomail.com/index.php?ref=J13M00188512

Compiler Design – Assignment Questions

1. Construct an operator precedence parser for the grammar SàiEtS/iEtSeS/a, Eàb/
c/d, check the acceptance of the given input string “ibtaec”
2. What is shift reduce parser, explain in detail? Consider the grammar Sà(L)/a
LàL,S/S, check the acceptance of the given input string “(a,(a,a))”
3. Construct predictive parsing table for the grammar EàE+T/T, TàTF/F, FàF*/a/
b
4. Construct NFA for r=a* | b*
5. Write a short note on NFA, Regular expression, Transition diagram and Token
with examples
6. Verify whether the string “id+(id+id)” is accepted by the following grammar or
not, by the predictive parsing EàTE’, E’à+TE’/€, TàFT’, T’à*FT’/€, Fà(E)/
id
7. Construct NFA for r=(a/b)*abb
8. Construct LALR parse table for the grammar SàAa/bAc/dc/dba Aàd, check
the acceptance of the given input string “bdc”
9. What is recursive descent parser? Construct recursive descent parser for the
grammar EàE+T/T, TàTF/F, FàF*/a/b
10. Explain the different phases of a compiler, showing the output of each phase,
using the example of the statement Position := initial + rate * 60
11. Construct SLR parsing table for the grammar EàE+T/T, TàT*F/F, Fà(E)/id
12. Define regular expressions? Give some examples, State and explain the properties
of regular sets
13. Construct FA equivalent to the following regular expression
(1+01+001)*(€+0+00)
14. Construct the CLR parse table for the grammar SàL=R, SàR, Là*R, RàL
15. What is ambiguity in grammar? Rewrite the grammar to eliminate ambiguity
EàE+T/T, TàT*F/F, Fà(E)/id
16. Construct predictive parser for the grammar Sà(L)/a, LàL,S/S

Assignment
Assignment 1
Assignment 2

Question No
1–8
9 – 16

Submission date ( on (or) before)
22-02-2013
28-02-2013
Wait while more posts are being loaded