winner
stoneknifeforth
winner | stoneknifeforth | |
---|---|---|
7 | 13 | |
482 | 405 | |
3.9% | - | |
4.4 | 0.0 | |
3 months ago | almost 4 years ago | |
HTML | Forth | |
Creative Commons Zero v1.0 Universal | Creative Commons Zero v1.0 Universal |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
winner
- Radiation-hardened Quine: A quine that works after any one character is deleted
-
concise code vs code longer than necessary.
Don't write code like the obfuscated C code contest. Don't spend too much time modifying working code to make it shorter, especially if there's no end-user perceivable speed increase.
-
Kilo Lisp: A Kilo Byte-Sized Lisp System
Just found one after replying to another comment on this story.
https://github.com/ioccc-src/winner/blob/master/1989/jar.2.c (accompanying explanation: https://github.com/ioccc-src/winner/blob/master/1989/jar.2.h... )
It apparently works somewhat after a few minor tweaks.
Another one that I've bookmarked some months earlier: https://github.com/rui314/minilisp
-
A horrifying single line neural network using NumPy
The first one is "a bit" obscure. If you give up (which means you've passed the human test... if you do not give up, report for alien termination) check out the description
-
An HTTP server in a single .c file
One of 2004 IOCCC winners (2004/hibachi [1]) was a CGI and vhost capable HTTP server. It is one of a few winning entries that ever came with its own ./configure, and violated so many guidelines but not a single rule, making judges pretty upset.
[1] https://github.com/ioccc-src/winner/blob/main/2004/hibachi.h...
stoneknifeforth
- Konilo: A personal computing system in Forth
-
Writing a Compiler is Surprisingly Easy (part 1)
a problem that a lot of these series run into is that the author runs out of steam before they finish writing them. crenshaw's otherwise excellent series suffers from this, for example
so far the author of this one has only written the first chapter
i've written a few didactic compilers that are complete enough to compile themselves, though nothing else
https://github.com/kragen/stoneknifeforth (from a forth-like language to an i386 linux elf executable)
https://github.com/kragen/peg-bootstrap/blob/master/peg.md (from a peg language description with semantic actions to javascript)
http://canonical.org/~kragen/sw/urscheme (from a subset of scheme to at&t-syntax i386 assembly)
-
MilliForth
Look at how much room you have for data! I wonder what we can fit in there.
More seriously, a metacircular example to draw from would be: https://github.com/kragen/stoneknifeforth
-
Lisp as the Maxwell’s Equations of Software
i wasn't able to get a runnable forth to less than a couple of pages written in itself https://github.com/kragen/stoneknifeforth but schönfinkel's ski-combinators are maybe the simplest practical basis
s f g x → f x (g x)
-
Stop Writing Dead Programs (Transcript)
I've done all these things (except designing the hardware) and I agree that it can be very painful. I did some of them in 02008, for example: https://github.com/kragen/stoneknifeforth
The thing is, though, you can also not do all those things. You can use variables, and they don't even have to be allocated on a stack (unless you're writing a recursive function, which you usually aren't), and all the NIP TUCK ROT goes away, and with it all the Memory Championship tricks. You can test each definition interactively as you write it, and then the fact that the language is absurdly error-prone hardly matters. You can use metaprogramming so that your code is as DRY as a nun's pochola. You can use the interactivity of Forth to quickly validate your hypotheses about not just your code but also the hardware in a way you can't do with C. You can do it with GDB, but Forth is a lot faster than GDBscript, but that's not saying much because even Bash is a lot faster than GDBscript.
But Yossi was just using Forth as a programming language, like a C without local variables or type checking, not an embedded operating system. And, as I said, that's really not Forth's strength. Bash and Tcl aren't good programming languages, either. If you try to use Tcl as a substitute for C you will also be very sad. But the way they're used, that isn't that important.
I explained a more limited version of this 12 years ago: https://yosefk.com/blog/my-history-with-forth-stack-machines...
So, I don't think Forth is only useful when you have the freedom to change the problem, though programs in any language do become an awful lot easier when you have that freedom.
- StoneKnifeForth
-
A complete compiler and VM in 150 lines of code
That's powerful enough to conveniently write, for example, a numerical root finding program for an arbitrary arithmetic expression.
But I think that within a complexity budget of 150 lines of code you can maybe be even more ambitious than that.
The example compiler in https://github.com/darius/parson/blob/master/eg_calc_compile... is a bit more stripped down than that, but in its 32 lines of code it compiles arithmetic assignment statements to a three-address RISC-like code (though using an unbounded number of registers). https://github.com/darius/parson/blob/master/eg_calc_to_rpn.... is a 16-line version that compiles the same language to a stack machine like your tutorial example.
In 66 lines of code in https://github.com/kragen/peg-bootstrap/blob/master/peg.md I wrote an example compiler which compiles a PEG grammar into a JavaScript parser for that grammar. Admittedly those 66 lines do not include an implementation of JavaScript to run the code on. It compiles the language it's written in.
In 132 lines of code in https://github.com/kragen/stoneknifeforth/blob/master/tinybo... I wrote an example compiler which compiles a crippled Forth dialect into i386 machine code, including an ELF header so you can run the result. It also compiles the language it's written in. It also doesn't include an i386 emulator to run it on.
In 83 lines of code in http://canonical.org/~kragen/sw/dev3/neelcompiler.ml Neel Krishnaswami wrote a compiler from the untyped λ-calculus to a simple assembly language for a register machine. It also doesn't include an implementation of the assembly language.
In 18 lines of code in http://canonical.org/~kragen/sw/dev3/meta5ix.m5, a simplification of META-II, I wrote a compiler from grammar descriptions to an assembly code for a parsing-oriented virtual machine. It compiles the language it's written in. A Python interpreter for the machine is in http://canonical.org/~kragen/sw/dev3/meta5ixrun.py (109 lines of code) and a precompiled version of the compiler-compiler for bootstrapping is in http://canonical.org/~kragen/sw/dev3/meta5ix.generated.m5asm.
A slightly incompatible variant of Meta5ix which instead compiles itself to C is in http://canonical.org/~kragen/sw/dev3/meta5ix2c.m5 (133 lines of code, depending on how you count). (No C compiler is included.) The precompiled C output for bootstrapping is in http://canonical.org/~kragen/sw/dev3/meta5ix2c.c.
Meta5ix is extremely weak and limited, really only enough for a compiler front-end; it can't, for example, do the kinds of RPN tricks we're talking about above.
-
Looking for a simple forth compiler (producing asm/executables, not compiling forth words) to learn from, preferably in C family language
Title effectively says it all. The only thing I have found is StoneKnife Forth (implementation is in tinyboot1.tbf1) but this file is implemented in the same dialect of forth it implements, which due to being minimal makes it difficult to read and comprehend efficiently (I also can't find the origin of some words such as 'byte' used in the code but not implemented by the interpreter). I would prefer something in the C family to look at but anything should do as long as it's clean enough that I could use it as a reference to reimplement the compiler without much difficulty. Thank you in advance for any help with what is seemingly quite a narrow request.
-
An HTTP server in a single .c file
I'm pretty sure Linux ELF has always allowed you to specify the initial load address. When I first wrote StoneKnifeForth https://github.com/kragen/stoneknifeforth its load address was 0x1000, but at some point Linux stopped allowing load addresses lower than 0x10000 by default (vm.mmap_min_addr). I originally wrote it in 02008, using the lower load address, and fixed it in 02017. It's still not using 0x804800 like normal executables but 0x20000. ASLR does not affect this.
Maybe you mean that before ELF support, Linux a.out executables had to be loaded at a fixed virtual address? That's possible—I started using Linux daily in 01995, at which point a.out was already only supported for backward compatibility.
- StoneKnifeForth (With a Metacircular Compiler)
What are some alternatives?
darkhttpd - When you need a web server in a hurry.
jonesforth - Mirror of JONESFORTH
publictext - TEXT://PROTOCOL SERVER
durexforth - Modern C64 Forth
uip - The historical uIP sources
factor - Factor programming language
uncroppable - Make your image uncroppable
r4 - :r4 concatenative programming language with ideas from ColorForth.
sectorlisp - Bootstrapping LISP in a Boot Sector
r3d4 - r3 programing language for 64 bits Windows/Linux/Mac/Rasberry Pi 4
cosmopolitan - build-once run-anywhere c library
http - A simple multi-threaded HTTP/1.0-ish file server. Single file, ~250 LOC.