Re: LEX behaviour when given "large" automata.

sargas.usc.edu!tli@oberon.usc.edu (Tony Li)
20 Mar 88 11:19:19 GMT

          From comp.compilers
Related articles
LEX behaviour when given "large" automata. phs@lifia.imag.fr (1988-03-03)
Re: LEX behaviour when given "large" automata. rsalz@BBN.COM (Rich Salz) (1988-03-18)
Re: LEX behaviour when given "large" automata. chris@mimsy.UUCP (1988-03-20)
Re: LEX behaviour when given "large" automata. lbl-helios!vern@lbl-rtsg.arpa (Vern Paxson) (1988-03-18)
Re: LEX behaviour when given "large" automata. sargas.usc.edu!tli@oberon.usc.edu (1988-03-20)
| List of all articles for this month |
From: sargas.usc.edu!tli@oberon.usc.edu (Tony Li)
Newsgroups: comp.compilers,comp.lang.c,comp.unix.questions
Date: 20 Mar 88 11:19:19 GMT
References: <911@ima.ISC.COM> <914@ima.ISC.COM>
Organization: University of Southern California, Los Angeles, CA

In fact, another cute trick is to toss in a simple hashing function.
Unless you've got lots of keywords, you usually can get away with
doing only one strcmp.


Tony
Tony Li - USC University Computing Services "Fene mele kiki bobo"
Uucp: oberon!tli -- Joe Isuzu
Bitnet: tli@uscvaxq, tli@ramoth Internet: tli@sargas.usc.edu
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.