Two-Pass Compiler & Front-End Back-End Partitioning

Lecture 2 of CS606 Compiler Construction introduces the structural architecture of the modern two-pass compiler. The lecture establishes the critical engineering partition between the compiler Front End and the Back End, mediated by a formal Intermediate Representation (IR). The front end performs language-dependent analysis, verifying source program legality, enforcing grammatical rules, and translating valid source statements into the IR. The back end performs machine-dependent synthesis, translating the intermediate representation into optimized target machine assembly or binary object code. Students analyze the profound economic and architectural advantages of this decoupled structure: supporting M source languages and N target hardware architectures requires only M front ends and N back ends (M + N components) rather than M * N independent monolithic compilers. The lecture details the classical multi-phase compilation pipeline: lexical analysis (scanning), syntactic analysis (parsing), semantic type checking, intermediate code generation, machine-independent optimization, instruction selection, register allocation, and machine-dependent assembly emission. Key concepts such as viable prefixes, handle pruning, and parser stack configurations are analyzed to understand deterministic bottom-up parsing. The lecture details algorithmic subset construction and Hopcroft state minimization to produce space-efficient deterministic finite automata. Control flow graph analysis is demonstrated to partition linear three-address instruction sequences into maximal basic blocks. Directed acyclic graph representations provide deterministic frameworks for common subexpression elimination and local code optimization. Data flow equations and backward liveness analysis are formulated to determine the exact variable live ranges required for optimal register allocation. Automated compiler generation utilities such as Lex and YACC are presented as indispensable instruments for industrial language processing. Top-down and bottom-up parsing techniques are contrasted regarding grammatical expressive power, lookahead requirements, and implementation complexity. Shift-reduce and reduce-reduce grammatical conflicts are analyzed alongside operator precedence declarations to eliminate parsing ambiguities. The curriculum traces the progressive transformation of source text through tokens, parse trees, abstract syntax trees, and linear three-address tuples. Practical considerations for short-circuit boolean evaluation and label backpatching provide rigorous quantitative decision support for control flow compilation.