Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!ncar!mephisto!prism!ce1zzes
From: ce1zzes@prism.gatech.EDU (Eric Sheppard)
Newsgroups: comp.lang.pascal
Subject: Re: CASE for Strings? (MS-Dos TP)
Message-ID: <8006@hydra.gatech.EDU>
Date: 14 Apr 90 00:02:03 GMT
References: <8001@hydra.gatech.EDU> <10010@pyr.gatech.EDU>
Reply-To: ce1zzes@prism.gatech.EDU (Eric Sheppard)
Organization: Georgia Institute of Technology
Lines: 16

In article <10010@pyr.gatech.EDU> mlw@pyr.UUCP (Michael Williams) writes:
>
>   This sounds like a scanner for a compiler, where you are checking for
>keywords.  In this case, a 'perfect' hashing function would be preferable.
>
>Hope this helps ...

Right you are. I'm working on a simple LOGO-like language interpreter/compiler,
for a programming course. Is there a better way to check for keywords/commands?

Eric, tinkerer-at-large
-- 
Eric Sheppard      Georgia Tech    |  "Of course the US Constitution isn't
Atlanta, GA                        | perfect; but it's a lot better than what
ARPA: ce1zzes@prism.gatech.edu     | we have now."
uucp: ...!{allegra,amd,hplabs,seismo,ut-ngp}!gatech!prism!ce1zzes