Mathematical Foundation of Computer Science

(Chris Devlin) #1

NON-REGULAR GRAMMARS


11.1 Introduction.....................................................................................................................


11.2 Definition of the Grammar.............................................................................................


11.3 Classification of Grammars - Chomesky’s heirarchy
11.4 Sentential form
11.5 Context Free Grammars (CFG) & Context Free Languages (CFL)
11.6 Derivation Tree (Parse Tree)
11.6.1 Parse tree Construction
11.7 Ambiguous Grammar
11.7.1 Definition
11.7.2 Ambiguous Context Free Language
11.8 Pushdown Automaton
11.9 Simplification of Grammars
11.10 Chomsky Normal form
11.11 Greibach Normal form
11.12 Pumping Lemma for CFLs
11.13 Properties of Context Free Languages
11.14 Decision Problems of Context Free Languages
11.15 Undecided Problems of Context Free Languages
Exercises

Free download pdf