|Question: Table Compression Methods in Dragon Book SCHMIDTG@iccgcc.cs.hh.ab.com (1994-10-09)|
|Re: Question: Table Compression Methods in Dragon Book firstname.lastname@example.org (Jan Peter de Ruiter) (1994-10-10)|
|Re: Table Compression Methods in Dragon Book email@example.com (1994-10-17)|
|From:||Jan Peter de Ruiter <firstname.lastname@example.org>|
|Date:||Mon, 10 Oct 1994 19:34:00 GMT|
Greg Schmidt wrote:
> There is a section titled "Table-Compression Methods" at the end of the
> chapter discussing lexical analysis in the newer dragon book. The intent
> is to implement efficient transition tables by leveraging off of the
> similarities among states, but the example is unclear to me. I don't
> understand what is meant by "default" transitions or "special" states.
> I would be grateful if some kind soul could provide a simple example
> showing the appropriate structures.
I too have problems understanding this mechanism from the dragon book.
Even my compiler guru admits he doesn't understand it. I'd like to see an
algorithm (in pseudocode or something equivalent) that describes how one
*builds up* this table. Once you have the table it's easy to apply the
pseudocode from the dragon book, but how the h*ll do you create it is my
Anyone to rescue?
Thanks in advance,
Return to the
Search the comp.compilers archives again.