It describes Finite State Automata and parsers from first principles, and
includes implementations of them in prolog.
This is a problem domain ideally suited to experimenting in prolog.
The link contains good examples of prolog in use (implementing parsers)
(for minimally experienced prologgers like myself - and others might
find them useful too).
Col