Moving from LR(0) to LALR(1)

Hi,

I'm working on a parser generator for D (http://www.digitalmars.com/
d). I've never dealt with parsing before, so I've been learning about
various methods from "Parsing Techniques- A Practical Guide" and
Wikipedia.

I've been able to implement a program that generates action and GOTO
tables for a given grammar using LR(0). However, I haven't been able
to find any good documentation (read: something simple enough I can
understand) on switching over to LALR(1). Since my main goal for
writing this is parsing Java, getting it to use LALR(1) is a necesity
(or at least some equivalently powered algorithm).

Are there any good online resources to describe this transition?

Thanks,
Michael

.