The first lecture notes are available, either as greyscale (6 to a page) or color (one to a page).

The second set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page).

An example of converting a Non-deterministic finite state automata to a deterministic finite state automata is here

The third set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page).

The fourth set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page). A detailed example of LR(0) parsing using a simple CFSM is available. An of an LR(1), LALR(1) and SLR(1) machine available.

The fifth set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page).

The sixth set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page).

The seventh set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page).

The eighth set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page).

The ninth set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page).
The regalloc.pdf handout mentioned in the books is also available.

The tenth set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page).

The eleventh set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page).

The twelth set of lecture notes are available, either as greyscale (6 to a page) or color (one to a page).