This short chapter does provide some context and discusses related
approaches, but mostly focuses on the particular algorithm and code
given. Most of the code provided can be ignored, though, as long as you
understand the key concepts.
Regarding Chapter 7, there are many specific comments to be made:
- p. 103, middle, replace ``ems'' with ``em dashes''
- p. 106, Figure 7.1, study this carefully so you understand it.
- p. 107-9, Figure 7.2, look over but do not study much.
- p. 110, middle, note that the table's entries are the next
state, and that ``White'' refers to ``White space''
- p. 111, bottom, consider how this relates to LALR(1) parsing
- p. 114-5, what do you think about all these entries?
- p. 116, 3rd from bottom par., this is poorly explained and
can be ignored - but note comments in lecture
- p. 117, line 7, insert ``finite state'' before ``machine''
- p. 117, middle, study Figure 7.6 carefully
- p. 118, Figure 7.7, study carefully but ignore all of Figure 7.8
- p. 120, middle, ``Part 1'', change ``of'' to ``if''
- p. 126-8, Figure 7.9, study moderately well but do not
worry much about DEAD STATE
- p. 129, Figure 7.10, study moderately well