Path: csiph.com!usenet.pasdenom.info!aioe.org!.POSTED!not-for-mail From: "Rod Pemberton" Newsgroups: comp.lang.forth Subject: Re: Don't be a bit-twiddling monkey Date: Wed, 28 Jan 2015 20:05:26 -0500 Organization: Aioe.org NNTP Server Lines: 21 Message-ID: References: <54c68667$0$6861$e4fe514c@dreader36.news.xs4all.nl> <2NGdnRAjzt6gLFvJnZ2dnUU7-Y0AAAAA@supernews.com> NNTP-Posting-Host: n4wpt9zq8xR26Ttf9mo2BA.user.speranza.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1; format=flowed; delsp=yes Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: Opera Mail/12.16 (Linux) X-Notice: Filtered by postfilter v. 0.8.2 Xref: csiph.com comp.lang.forth:36099 On Tue, 27 Jan 2015 05:47:36 -0500, empty-buffers wrote: > Yes - and exactly because of this I wasn't asking just about R> - but > about entire "words tree" - and whole "Forth system/kernel" - how this > can be built from ground up. > > Well I found some first clues in Brad's Rodriguez text. For interpreted Forth's, they can be built up from a small set of primitives (or low-level words according to Ms. Rather). You can build up a dictionary by storing definitions in the same dictionary format that interactively defining the words would store them into memory. You just need to decide on your dictionary format and have a way to store all the fields for each definition without using the inner and outer interpreter. You can do this using assembly, like Fig-Forth or Bradford Rodriquez's various Forths, or even in a high-level language like C as I and others have done. Rod Pemberton