Context free languages 1. Equivalence of context free grammars 2. Normal forms.
1 Check syntax and construct abstract syntax tree Error reporting and recovery Model using context free grammars Recognize using Push down automata/Table.
Syntax Analysis
