i~ii~ii!ii~i~ii~iiii!~iii~i!i~ii!i~!iiiii!!i~ii~i{~iii~iiii!iiiiiiiiiiiiii~!iiiiiiiiiii~i~iii!!i{iii~i!iiiiiiiiiii~iiiii~i~i~~~~{~1~~{~ ~{iii iii!iiiii~ i i[{l ! programs. It is intrinsically reentrant, recursive and extenChuck Moore sible. It multiplies programmer efficiency (Have I missed Computer Cowboys any buzzwords?) Howdy! I'm Chuck Moore. All languages claim much the same. But Forth really is Twenty years ago, I discovered simple. Different, but simple. It really does produce small, a computer language. fast programs at a minimum cost and time. It is really good Since then, the years I've at interfacing with hardware. I'll try to help you convince spent at Forth terminals have asyourself of this. sured me it's a really neat lanFor example, Forth words are separated by spaces. This guage. Enough other people makes parsing trivial. Forth evaluates postfix expressions. agree that George Shaw asked This makes precedence unnecessary. me to write this column. I'm not going to teach you Forth. Leo Brodie does an exSo howdy to old friends, who cellent job of that in Starting Forth. I presume you know will probably read what I've alForth, are learning it, as am I. But in addition to talking ready said many times. And about Forth (speak metaFORTH) I want to use it as a publihowdy to new friends,
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/forthought-yELUhqrBPG
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
FORTHought
Moore, Chuck
Follow ACM SIGFORTH Newsletter
, Volume 1 (1)
Association for Computing Machinery – Apr 1, 1989
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
