Sample problem regular grammars

344 views

Published on

jntu qualitative visual algorthms

Published in: Entertainment & Humor
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
344
On SlideShare
0
From Embeds
0
Number of Embeds
104
Actions
Shares
0
Downloads
0
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Sample problem regular grammars

  1. 1. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  2. 2. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  3. 3. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  4. 4. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  5. 5. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  6. 6. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  7. 7. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  8. 8. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  9. 9. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  10. 10. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  11. 11. Obtain a regular grammar to obtain the set ofall strings not containing three consecutive 0’ s.
  12. 12.  εεε
  13. 13.  εεε
  14. 14.  εεε
  15. 15.  εεε
  16. 16.  εεε
  17. 17.  εεε
  18. 18.  εεε
  19. 19.  εεε
  20. 20.  εεε
  21. 21.  εεε
  22. 22.  εεε
  23. 23.  εεε
  24. 24.  εεε
  25. 25.  εεε
  26. 26.  εεε
  27. 27.  Find an unambiguous CFG equivalent to the grammar with productions S → aaaaS │aaaaaaaaS│Λ
  28. 28.  Find an unambiguous CFG equivalent to the grammar with productions S → aaaaS │aaaaaaaaS│Λ
  29. 29.  Find an unambiguous CFG equivalent to the grammar with productions S → aaaaS │aaaaaaaaS│Λ
  30. 30. •Find the language generated by thegrammar. S→0A │ 1S │ 0 │ 1, A→1A │ 1S│1
  31. 31. •Find the language generated by thegrammar. S→0A │ 1S │ 0 │ 1, A→1A │ 1S│1
  32. 32. •Find the language generated by thegrammar. S→0A │ 1S │ 0 │ 1, A→1A │ 1S│1
  33. 33. •Find the language generated by thegrammar. S→0A │ 1S │ 0 │ 1, A→1A │ 1S│1
  34. 34. •Find the language generated by thegrammar. S→0A │ 1S │ 0 │ 1, A→1A │ 1S│1
  35. 35. •Find the language generated by thegrammar. S→0A │ 1S │ 0 │ 1, A→1A │ 1S│1
  36. 36. •Find the language generated by thegrammar. S→0A │ 1S │ 0 │ 1, A→1A │ 1S│1
  37. 37. •Find the language generated by thegrammar. S→0A │ 1S │ 0 │ 1, A→1A │ 1S│1
  38. 38. •Find the language generated by thegrammar. S→0A │ 1S │ 0 │ 1, A→1A │ 1S│1
  39. 39. •WE WILL CONSTRUCT THE REGULAR•EXPRESSION EQUATIONS
  40. 40. •WE WILL CONSTRUCT THE REGULAR•EXPRESSION EQUATIONS
  41. 41. •WE WILL CONSTRUCT THE REGULAR•EXPRESSION EQUATIONS
  42. 42. •WE WILL CONSTRUCT THE REGULAR•EXPRESSION EQUATIONS
  43. 43. •F=S(0+1) + S01*1=S[0+1+ 01+]
  44. 44. •F=S(0+1) + S01*1=S[0+1+ 01+] = [1+01+]*[0+1+ 01+]

×