Hi Students

This is handmade notes of Context Free Language & Push Down Automata in Theory of Computation

Content:

• Properties of CNF & GNF
  
• Conversion of Grammer to Machine
  
• Properties of My bill Nerode Class
  
• Right Quotient & Left Quotient
  
• Unknown initial state
  

• Griesbach Normal Form
  
• Properties of LL(K) & LR(K)
  
• Algorithm in CFG
  
• Removal of Null Productions
  
• Removal of Useless Production
  
• Removal of Left Recursion
  
• Removal of Left Factoring
  
• Conversion of CFG to CNE
  
• Properties of CNF & GNF
  

         (with Example)

NOTE: If this is helpful for you then don't forget to post some more useful stuff here.

Thanks
Dipesh