That's the approach I plan to take, except I'd like to use Gerry
Jackson's lexgen and grace lexer and parser generators respectively. I
have written this compiler in OCaml, Haskell and Lisp before and I'm
new to Forth. I ported SwiftForth to the Mac (Leon, can I boast?) but
that doesn't count.

I'm struggling with things like 1) how to represent a mapping of
string keywords to numbers and 2) build an abstract syntax tree (AST)
in Forth. I used a hash table for #1 in my other compilers and I
figure I can allocate a bunch of structures on the heap for #2.
Suggestions are welcome!

    Thanks, Joel

On Fri, Jan 29, 2010 at 6:30 PM, Gene LeFave <gene_at_tekdata.com> wrote:
> An approach I've used is
>
> 1, =A0 Easylanguage* converted into forth using my version of the Brad
> Rodreguez BNF interpretter.
> 2.. Forth written iinto a separate file.
> 3. When needed =A0Forth interpretter activiated as cgi, and interprets fi=
le.
> 4. Output sent back is html.

--=20
http://es.linkedin.com/in/joelreymont
----------------------------------------------------------------------
sftalk_at_forth.com The SwiftForth programming discussion email list
To unsubscribe, send subject "unsubscribe" to sftalk-request_at_forth.com
For list command help, send subject "help" to sftalk-request_at_forth.com
Message archives are located at http://www.forth.com/archive/sftalk
----------------------------------------------------------------------
This list is a forum for SwiftForth users. For product support and
bug reports, please send email to support_at_forth.com
----------------------------------------------------------------------
Received on Fri Jan 29 2010 - 10:40:51 PST