Tux, the Linux Penguin Spooky Wall Guy

CSC 231, Programming Languages Overview of Translators for Programming Languages Lexical Analysis and Deterministic Finite Automata (DFA) Regular Expressions Context-Free Grammars and Parsing Example Derivation Example Grammar, First and Follow Sets Left Recursive Grammars Left Factoring a Grammar Minimizing States in a DFA Example Grammar and Predictive Parsing Table for Expressions Example of Recursive Descent Parsing for Expressions Buddy System Memory Management Theory: Turing Machines Language A_{TM} is Turing Undecidable The Halting Problem is Turing Undecidable Attributes and Semantic Actions for Expressions Semantic Actions (with diagrams) for Simplified Expressions C++ Example (with semantic actions) for Simplified Expressions Semantic Actions (with diagrams) for Exponentiation

Overview of Translators for Programming Languages Lexical Analysis and Deterministic Finite Automata (DFA) Regular Expressions Context-Free Grammars and Parsing Example Derivation Example Grammar, First and Follow Sets Left Recursive Grammars Left Factoring a Grammar Minimizing States in a DFA Example Grammar and Predictive Parsing Table for Expressions Example of Recursive Descent Parsing for Expressions Buddy System Memory Management Theory: Turing Machines Language A_{TM} is Turing Undecidable The Halting Problem is Turing Undecidable Attributes and Semantic Actions for Expressions Semantic Actions (with diagrams) for Simplified Expressions C++ Example (with semantic actions) for Simplified Expressions Semantic Actions (with diagrams) for Exponentiation