Formal Languages and Compilers
Automata, regular expressions, context-free grammars, parsing, code optimization. From UniTO LFT (88 hours of audio).
Prerequisites
- Mathematical Logic
What you'll learn
- Build DFA/NFA from regex
- Implement a Left-to-Right (LL(1)) Parser
- Understand LR(1) and bottom-up parsing
- Understanding compiler phases