Implementing Semantic Actions & Ad-Hoc Schemes

Lecture 34 of CS606 Compiler Construction demonstrates how Syntax-Directed Translation (SDT) is implemented practically using YACC's ad-hoc translation scheme. In YACC, semantic actions are embedded directly into production rules using C++ code enclosed in curly braces { ... }. Students study the pseudo-variable notation: $$ denotes the synthesized attribute value of the left-hand side non-terminal, while $1, $2, ..., $n denote the attribute values of the respective grammar symbols on the right-hand side. The lecture explains how YACC maintains an internal semantic value stack parallel to the state stack. When a reduction occurs, YACC executes the action code block, computes $$, pops the child semantic values, and pushes $$ onto the semantic stack. Students practice constructing AST node pointers and desk calculator evaluators using YACC semantic actions. 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. Scholars examine how type checking systems enforce static semantic consistency across arithmetic expressions, assignments, and function signatures. Memory management techniques spanning static allocation, stack-based activation records, and heap allocation are evaluated in detail.