Monday 29 November 2010

Theory Of Computation | Assignment –Context Free Grammars

MCA Semester – II
Subject: 620007 – Theory of Computation
Assignment – 11
Context Free Grammars

1
Context Free Grammar ( CFG)
2
Context Free Language (CFL)
3
List out Applications of  Context Free Grammar ( CFG)
4
What is Meaning of Context Free?
5
Regular Grammar
6
Linear Grammar
7
Leftmost Derivation
8
Rightmost Derivation
9
What is Derivation Tree or Parse Tree?
10
An Ambiguous Grammar
11
Balanced Strings of Parentheses
12
Nullable Variables
13
Unit Production
14
Chomsky Normal Form (CNF)
15
Inherently Ambiguous
16
List out Steps to Convert CFG into CNF

0 comments:

Post a Comment

Twitter Delicious Facebook Digg Stumbleupon Favorites More

 
Design by Free WordPress Themes | Bloggerized by Lasantha - Premium Blogger Themes | Grants For Single Moms