Release v0.0.3 · bahmanm/bjforth
github.com
🎉 A good deal of words and primitives were introduced in this release along improving the user-friendliness of bjForth. ✔️ Some prominent changes include: Looping construct (WHILE, UNTIL, AGAIN) C...

I’m thrilled to announce the release of bjForth v0.0.3 🎉

There’s been a a heap of improvements and additions compared to the last release.

What’s best is that they are automatically tested every time a change is pushed 😎

I dare you to Grab the latest tarball and hack yourself some serious Forth 😄

    • bahmanmOP
      6·
      2 days ago

      Besides the fun of stretching your mental muscles to think in a different paradigm, Forth is usually used in the embedded devices domain (like that of the earlier Mars rover I forgot the name of).

      This project for me is mostly for the excitement and joy I get out of implementing a Forth (which is usually done in Assembler and C) on the JVM. While I managed to keep the semantics the same the underlying machinery is vastly different from, say, GForth. I find this quite a pleasing exercise.

      Last but not least, if you like concatenative but were unable to practice fun on the JVM, bjForth may be what you’re looking for.

      Hope this answers your question.

      • Azzu@lemm.ee
        1·
        1 day ago

        It looks to me to be the same paradigm as pure functional languages, is this false? The only difference to lisp seems syntactic.

        • bitcrafter@programming.dev
          1·
          1 day ago

          No. Roughly speaking, functional languages implicitly manage the stack for you, whereas Forth requires you to manage it explicitly.

          • Azzu@lemm.ee
            2·
            1 day ago

            Yeah that’s what I meant with syntactically. You could act as if in Lisp arguments to functions are pushing on the stack, and functions are removing them and pushing the result back.

            • bitcrafter@programming.dev
              1·
              24 hours ago

              In Forth, though, the number of results pushed to the stack after an execution of a word could be a function of the input rather than a single value or even a fixed number of values.

              Likewise, the number of arguments that a word pops from the stack could be a function of a value pushed earlier to the stack.

        • bahmanmOP
          1·
          1 day ago

          Not really I’m afraid. Effects can be anywhere and they are not wrapped at all.

          In technical terms it’s stack-oriented meaning the only way for functions (called “words”) to interact with each other is via a parameter stack.

          Here’s an example:

          : TIMES-10  ( x -- y )
  10 
  * 
;

12
TIMES-10
.S
120

          TIMES-10 is a word which pops one parameter from stack and pushes the result of its calculation onto stack. The ( x -- y) is a comment which conventionally documents the “stack effect” of the word.

          Now when you type 12 and press RETURN, the integer 12 is pushed onto stack. Then TIMES-10 is called which in turn pushes 10 onto stack and invokes * which pops two values from stack and multiplies them and pushes the result onto stack.

          That’s why when type .S to see the contents of the stack, you get 120 in response.

          Another example is

          5 10 20 - *
.S
50

          This simple example demonstrates the reverse Polish notation (RPN) Forth uses. The arithmetic expression is equal to 5 * (20 - 10) the result of which is pushed onto stack.

          PS: One of the strengths of Forth is the ability to build a vocabulary (of words) around a particular problem in bottom-to-top fashion, much like Lisp. PPS: If you’re ever interested to learn Forth, Starting Forth is a fantastic resource.

        • Kacarott@aussie.zone
          1·
          1 day ago

          Forth is fairly different AFAIK. If you want a “Forth style” language for general purpose, with more “batteries included”, try Factor! It’s a really nice language.