forth

When I try to compile Gforth 0.7.0, I get the following error: $ ./configure $ make #compiling… Undefined symbols: "_main", referenced from: start in crt1.10.6.o ld: symbol(s) not found collect2: ld returned 1 exit status make[3]: *** [gforth-ll] Error 1 ./preforth -p ".:~+:." -e 's" mach16b.fs"' ./kernel/main.fs -e "save-cross kernl16b.fi- /usr/local/bin/gforth-0.7.0 bye" You need to configure with a gforth in $PATH to build this part make[3]: *** [kernl16b.fi-] Error 1 make[2]: *** [gforth-ll] Error 2 make[1]: *** [optgforth] Error 2 make: *** [gforth] Error 2 [22:16:01] gforth-0.7.0$ I get

Often, when learning a language I'll write a server of some sort. Does gforth have the capability to use network sockets? I don't see anything about sockets in the manual . Though I don't see any documentation about it, there is a socket.fs which binds to libc. You can find some examples of FORTH that use sockets.fs on Rosetta Code , specifically the ECHO server example Provided under the GNU FDL, from Rossetta code by IanOsgood ( commit ) include unix/socket.fs 128 constant size : (echo) ( sock buf -- sock buf ) begin cr ." waiting..." 2dup 2dup size read-socket nip dup 0> while ." got: "

I'm writing a simple stack-based language in C and was wondering how I should go about implementing a loop structure of some kind, and/or lookahead symbols. Since the code is a bit long for this page (over 200 lines) I've put it in a GitHub repository . EDIT: The main program is in file stack.c . EDIT: The code just takes in input in words , kind of like FORTH. It uses scanf and works left to right. Then it uses a series of if s and strcmp s to decide what to do. That's really it. The Forth approach is to add a separate loop stack alongside the data stack. You then define operations that work

So I'm just learning Forth and was curious if anyone could help me understand how memory management generally works. At the moment I only have (some) experience with the C stack-vs-heap paradigm. From what I understand, one can allocate in the Dictionary, or on the heap. Is the Dictionary faster/preferred like the stack in C? But unlike in C, there aren't scopes and automatic stack reclamation, so I'm wondering if one only uses the dictionary for global data structures (if at all). As far as the heap goes, is it pretty much like C? Is heap management a standard ( ANS ) concept, or is it

I'm interested in implementing a Forth system, just so I can get some experience building a simple VM and runtime. When starting in Forth, one typically learns about the stack and its operators (DROP, DUP, SWAP, etc.) first, so it's natural to think of these as being among the primitive operators. But they're not. Each of them can be broken down into operators that directly manipulate memory and the stack pointers. Later one learns about store (!) and fetch (@) which can be used to implement DUP, SWAP, and so forth (ha!). So what are the primitive operators? Which ones must be implemented