
Ambiguity and Grammar Clean-up
Context-free grammar vocabulary for parsing: sentential forms, leftmost and rightmost derivations, parse trees and ambiguity, with script-counted parse trees for the classic ambiguous grammars. How precedence and associativity are built into a grammar with one non-terminal per level. Removal of immediate and indirect left recursion with the general algorithm and worked results, left factoring step by step, and why neither transformation removes ambiguity: the left-factored dangling-else grammar still has an LL(1) conflict.

