Worklist algorithms
A small amount of background information (best read in the context of the first sets)
The page collects posts in connection with the lecture compiler construction (INF5110). I am planning for information about the material and content of the lecture. Important organizational messages will not appear here, but as “beskjeder” on the official IFI page (and email). The posts are mostly NOT pensum. For example, in an oral exam, there won’t be questions specifically targeting information posted only here. The intention is to shed additional light on the material covered in the lecture, with the hope of being useful.
Links
| official webpage 2024 | semester page |
| source code repos | compila |
| oblig info | documentation 2024 |
| some discussion platform | https://astro-discourse.uio.no/ (section INF5110-24v) |
Posts
How to write a parser for the first time, e.g. for the oblig
or maybe also not the first time.
Regular expressions, context-free grammars, and recursion
Recursion on the tail or otherwise
Did Fortran kill a Mars Mission?
(White-)space exploration, FORTRAN, lexing, antiquity & fetishism
How to prepare for an oral exam
like for instance the compiler construction course.
Type systems: the strong, the strict and the safe.
Or the weak, the loose, and the unsafe. But does it mean anything?
How to implement regular expression matching
Or maybe how not to implement it?