Programming Languages are defined, syntactically by a formal grammar, called a Context Free Grammar. The Grammar is what allows us to generate a parse tree from a program. First we convert the program ...

Introduction to Compiler: Phases and passes, Bootstrapping, Finite state machines and regular expressions and their applications to lexical analysis, Optimization of DFA-Based Pattern Matchers ...

Examination of the nature of programming languages and programs which implement them. Compiler and interpreter design and implementation techniques. Review of grammars and languages (context free, ...