🖨️ Formal Languages and Compiler Design Uni Laboratory tasks
1. Simple scanner for the PL/0 language
2. Finite Automata
3. Automata Conversion from NFA to DFA
4. DFA minimization using the Hopcroft algorithm
5. Table driven Scanner
7. Context Free Grammar
8. Leftmost Top-Down Parser and building of an Abstract Syntax Tree
9. FIRST and FOLLOW sets for a CFG
10. Backtrack-free table driven LL(1)-Parser
11. Skeleton of the LR(1)-Parser
12. Generation tables for the LR(1)-Parser