Tiny stack-based language implementation (61 sloc, Python)
1–5 of 5 posts
Re: Tiny stack-based language implementation (61 sloc, Python)
#2The only examples are in the source.
[ dup * ] is square
[ dup 2 Re: Tiny stack-based language implementation (61 sloc, Python)
#3The only examples are in the source. [ dup * ] is square [ dup 2
If you are familiar with Forth, Postscript, or Joy you should have no problems with programming in Fortik :)
Still, the idea of Fortik is to encourage students to learn how simple interpreters work and to extend the language.
Re: Tiny stack-based language implementation (61 sloc, Python)
#4The only examples are in the source. [ dup * ] is square [ dup 2
If you are familiar with Forth, Postscript, or Joy you should have no problems with programming in Fortik :) Still, the idea of Fortik is to encourage students to learn how simple interpreters work and to extend the language.
Is the first assignment to reverse-engineer the language spec from the interpreter?
Re: Tiny stack-based language implementation (61 sloc, Python)
#5Earlier quoted context omitted.
If you are familiar with Forth, Postscript, or Joy you should have no problems with programming in Fortik :) Still, the idea of Fortik is to encourage students to learn how simple interpreters work and to extend the language.
Is the first assignment to reverse-engineer the language spec from the interpreter?
Basically, yes, so I tried to make a simple implementation as possible. And I'm taking into account that students are already familiar with postfix notation and stack data structure. Of course, I use additional sources (like the popular Crafting Interpreters book) in the teaching process.