home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.forth
- Path: sparky!uunet!think.com!spool.mu.edu!torn!nott!uotcsi2!news
- From: cbbrowne@csi.uottawa.ca (Christopher Browne)
- Subject: Re: Forth stack checker
- Message-ID: <1993Jan24.220010.7090@csi.uottawa.ca>
- Sender: news@csi.uottawa.ca
- Nntp-Posting-Host: prgf
- Organization: Dept. of Computer Science, University of Ottawa
- References: <1jv25pINNobc@usenet.INS.CWRU.Edu>
- Date: Sun, 24 Jan 93 22:00:10 GMT
- Lines: 28
-
- In article <1jv25pINNobc@usenet.INS.CWRU.Edu> bs764@cleveland.Freenet.Edu (Fred H Olson) writes:
- >My approach is to build a special purpose interpreter/compiler and hence
- >the source code becomes it's "input data" and it's hard to anticipate
- >all possible data permutations that get thrown at it.
-
- There's the unfortunate part - Forth contains some features that are
- by their nature almost uncheckable.
-
- You can create a special purpose "interpreter" that will understand
- SOME Forth code, but not enough to make it a general tool.
- CREATE/DOES is going to be some of the words that would make such an
- interpreter "throw its hands up in despair."
-
- >As a consequence I have dispaired of try to get it used more widely,
- >an am content to have a neat tool that I do use.
-
- The nice thing about FORTH is that it's not TOO hard to put some of
- the type checking into words themselves. It means that it may be
- possible to do both compile and run time checking.
-
- In effect, we've got the "best" of both worlds; there is the choice of
- doing type checking any time we want.
-
- --
- Christopher Browne | PGP 2.0 key available
- cbbrowne@csi.uottawa.ca |======================================
- University of Ottawa | Genius may have its limitations, but
- Master of System Science Program | stupidity is not thus handicapped.
-