Path: csiph.com!eternal-september.org!feeder.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Paul Rubin Newsgroups: comp.lang.forth Subject: Re: RfD Recognizer, 3rd version Date: Mon, 26 Sep 2016 22:55:11 -0700 Organization: A noiseless patient Spider Lines: 16 Message-ID: <87fuol7ups.fsf@jester.gateway.pace.com> References: <87oa3a6jn2.fsf@jester.gateway.pace.com> <7cf7cab7-4593-48e7-a088-218458d61003@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: mx02.eternal-september.org; posting-host="2aed369a7b4699bde3e169ff4d831123"; logging-data="28485"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18ZsqnLbqx8eOKmyN/AYyOc" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (gnu/linux) Cancel-Lock: sha1:XS/bUAluOs9KJ3B5GWSijqrDIJw= sha1:ajVae4C4YeQ7qoCwaSKzaiaz8Mc= Xref: csiph.com comp.lang.forth:51360 tabcomputing@gmail.com writes: > Thanks, that helps. So it still goes word by word. But isn't that > going to be rather slow? Every word has to run thru 1 to N functions > to find a match, usually N. Usually 1. The first thing is look up the word in the dictionary. If not, see if it's an integer literal, etc. That's what the text interpreter does now. > And the what does it do when it finds a match? It runs a user-supplied function. You could read the spec. Disclosure: I've looked at the spec but not really studied it yet, so I don't understand all of it. See: http://amforth.sourceforge.net/Recognizers.html