Parse Trees Derivations & Grammar Ambiguity

Lecture 12 of CS606 Compiler Construction explores the mechanics of grammatical derivations and the central problem of grammar ambiguity. A derivation is a sequence of production rule substitutions that transforms the start symbol into a string of terminals. The lecture distinguishes Leftmost Derivations (where the leftmost non-terminal is replaced at every step) from Rightmost Derivations (canonical derivations where the rightmost non-terminal is replaced first). A grammar is formally Ambiguous if there exists at least one sentence in the language that possesses two or more distinct parse trees (or two distinct leftmost derivations). Students analyze classic examples of ambiguity in arithmetic expressions without explicit operator precedence, as well as the notorious 'dangling-else' ambiguity in nested if-then-else statements. The lecture demonstrates how ambiguous grammars are methodically rewritten by introducing stratified non-terminal precedence levels (Expression, Term, Factor) to enforce unambiguous associativity and precedence. Comprehensive coverage of IEEE and ACM curricula standards ensures learners communicate with technical precision across global systems engineering teams. Detailed analysis of machine code selection highlights the imperative of generating instruction sequences that maximize hardware pipeline throughput. Intermediate representation taxonomy categorizes structural formats into graphical ASTs, linear tuples, and hybrid tree-address models. The strategic role of peephole optimization is evaluated as a final localized pass to eliminate redundant loads, stores, and jumps. In this lecture, students examine formal language translation principles and architectural compiler pipelines to understand automated code generation. Through detailed theoretical derivations and algorithmic walkthroughs, the lesson explores lexical tokenization, grammatical parse trees, and syntax trees. Special emphasis is placed on formal grammar transformations, eliminating left recursion, and establishing unambiguous predictive parsing tables. Mastering these foundational language translation frameworks empowers computer science scholars to design robust parsers, interpreters, and domain-specific languages. Analytical exercises, state transition diagrams, and solved numerical problems help students prepare thoroughly for Virtual University midterm and final term examinations. The curriculum systematically bridges abstract automata theory with concrete systems programming techniques and modern compiler construction tools.