Lecture Theory of Automata: Lesson 34. The main topics covered in this chapter include: example of ambiguous grammar, example of unambiguous grammer (PALINDROME), total language tree with examples (finite and infinite trees), regular grammar, FA to CFG, semi word and Word, defining regular grammar, method to build TG for regular grammar, . |