Skip to main content
Link
Menu
Expand
(external link)
Document
Search
Copy
Copied
PL&C
Prerequisites
Sets
Functions
Syntax
Strings
Reading Grammars
Writing Grammars
Lexical Analysis
LL(1) Grammars
Predictive Recognition
ASTs and Parsing
Obtaining LL(1)
Limitations
Semantics
Denotational Semantics
Induction for Expressions
Operational Semantics
Reasoning with Derivations
Functionality
Hoare Logic (Bonus Content)
Computability
Computable functions
Decidable predicates
Bijections etc.
Encoding data
Reflections
Gödel numbering
The universal function
The Church-Turing thesis
The Halting Problem
Reductions
Rice's theorem
-------------------------
Slides
0. Attendance
1. Program 1
2. Program 2
3. Key Info
4. Strings
5. String Ops
6. BExp Grammar
7. BExp Example
8. Linguistics
9. Wild Grammars
10. C Assignment
11. Hask Appl
12. CFG Defn
13. While Lang
15. Derivations
16. Grammar Designs
17. While Lexemes
18. Token Grammar
19. Lexer State
20. BExp Tokens
21. BExpId Grammar
22. BExp Alt Grammar
23. Grammar Structure
24. Parse Table
25. NFF for BExpLL
26. PT for BExpLL
27. BExp Tree
28. While Tree
29. While Loops
30. Associativity
-------------------------
1. Denotational Semantics
2. Proof by Induction
3. Operational Semantics
4. Reasoning with Derivations
5. Functionality
6. Semantic Equivalence and Hoare logic
Unit Webpage
Semantics
Table of contents
Denotational Semantics
Induction for Expressions
Operational Semantics
Reasoning with Derivations
Functionality
Hoare Logic (Bonus Content)