Path: utzoo!utgpu!water!watmath!clyde!att!pacbell!ames!mailrus!tut.cis.ohio-state.edu!bloom-beacon!bu-cs!dartvax!eleazar.dartmouth.edu!tobeye From: tobeye@eleazar.dartmouth.edu (Anthony V. Edwards) Newsgroups: comp.lang.forth Subject: Re: FORTH for unix? Message-ID: <9428@dartvax.Dartmouth.EDU> Date: 21 Jul 88 22:15:08 GMT References: <8807211846.AA27919@jade.berkeley.edu> Sender: news@dartvax.Dartmouth.EDU Reply-To: tobeye@eleazar.dartmouth.edu Organization: Dartmouth College, Hanover, NH Lines: 12 > A few (MANY?) C compilers can support pointers to functions which would > seem to work if you had an array of pointers to functions, but just using a > large switch statement would seem to be quite slow. Actually, function pointers are part of the original K&R C, so all compilers *should* have them (whether a programmer uses them or not is another matter). As for case statements being slow, good compilers should automatically set up a jump table when a large case statement is found. So a large case state- ment is not necessarily slow at all. Anthony