Bison version of the LALR(1) algorithm

[Hans Aberg]

Can somebody give a reference to a description of the LALR(1) algorithm
that Bison uses?

The file state.h says that first, a non-deterministic finite state machine
that parses the specified grammar is created; it is then converted to a
deterministic finite state machine.

This seems to differ from the description in say Aho et al "Compilers",
which creates the deterministic machine directly. (The book has hints to
the effect that this corresponds to the NFA -> DFA translation, but does
not describe this explicitly in detail.)

  Hans Aberg