base on k/simple is a bare minimum k interpreter for learning purposes by arthur whitney # k/simple a tiny k interpreter for educational purposes by arthur whitney ## target audience the contents of this repository assume readership who have read and understood [k&r](https://en.wikipedia.org/wiki/The_C_Programming_Language) at some point in their careers. any experience with using interpreters of vector languages is beneficial but not necessary. any experience with implementing language interpreters would definitely be of help. ## background in early january 2024, a group of motivated individuals asked [arthur whitney](https://en.wikipedia.org/wiki/Arthur_Whitney_(computer_scientist)) to demonstrate the fundamentals of the design, organization and style of his method of writing interpreters in c in the most succinct and approachable way. about a day later, arthur offered a tiny interpreter of a toy vector language, implemented in about 25 lines of c with a small header file. his code is published in this repository under [/ref](/ref). a few days later, the regents of kparc were invited to share their impressions on this codebase, and optionally provide some additional commentary. our commentary is offered in form of two files `a.[ch]` in the root of this repository, which serve a number of purposes: 1. both files can be seen as two chapters of a small "essay", header file [a.h](/a.h) being the first chapter, [`a.c`](/a.c) source file being the second. not only the text seeks to explain the code in reasonable detail, which is strictly line by line, but also takes a few liberties and diversions in a bid to elucidate the "bigger picture" behind this tiny piece of code. 3. for the ease of comprehension, the narrative has been made **completely linear**, and hopefully makes for an easy, entertaining and useful read. to make this possible, the original code had seen some very minor restructuring and regrouping; however, no refactoring, no changes to logic or naming conventions have taken place, except for a handful cosmetic enhancements which have been discussed with atw and are seen as beneficial to the cause. a number of less trivial one-line functions (e.g. `e()`) are presented in "exploded view" to simplify discussion of their control flow and role of individual components. although the c code of `k/simple` is formatted to fit on mobile phone screens in portrait mode, for a more comfortable reading experience we recommend using professional equipment. 5. with help of the included [makefile](/makefile), kparc's "essay" can be built to any available architecture, e.g. riscv, arm, wasm32, xtensa or even x86. default make target assumes presence of a recent gcc, clang or tinyc compiler. ## quick start ``` $ cd && git clone https://github.com/kparc/ksimple $ cd ksimple && make $ ./a k/simple (c) 2024 atw/kpc 2+2 4 x:!9 y:2+x x-y -2 -2 -2 -2 -2 -2 -2 -2 -2 z:x,y #z 18 x+!3 Add:59 length \w 36 x:y:z:0 \w 0 ^C $ vi k.c ``` ## language specification / disclaimer *caveat emptor*, manage your expectations. this interpreter is useless for any practical purpose except the stated one, which is education. the language is as follows: * although k/simple is a computer language, its grammar is defined in terms we normally use to denote parts of human speech. that is, k expression is composed of **nouns**, **verbs** and **adverbs**. * the definition of **verb** is something in between definitions of **operation** in mathematics and **operator** in computer science. to make things simple, we define *verb* as an instruction to the interpreter to do something with exactly one or exactly two operands, or **nouns**. a verb that takes one noun to operate on is called monadic, and verb that takes two nouns is called dyadic. consider the following two sentences: * *shuffle this deck of cards* * *take three random cards from this deck* in linguistics, the structure of the first sentence is known as verb-only predicate, while the second is a verb-plus-direct-object predicate. in k, we recognize the verb "shuffle" in the first sentence to be monadic, while the second is a dyadic verb "take". the semantics of an action of a verb is defined by the number of operands given to it, also called "rank" or "valence". this means that monadic `+x` and dyadic `x+y` have two entirely different meanings. * a **noun** in k/simple can be either an **atom** (aka scalar value) or a **vector** (aka ordered list of atoms). * the one and only type of **atom** formally supported by k/simple is a signed 8-bit integer `-128..127`. * a vector of atoms is limited in length to unsigned 8-bit integer, that is no more than 255 items. * k/simple supports 6 verbs, `+`, `-`, `!`, `#`, `,` `@` and `|`, all of which have different meanings depending on their *rank*. these meanings are very well documented in [a.c](/a.c) where they are also declared and defined. * in fact, k/simple goes an extra mile to implement a number of additional dyadic ops, namely `=`, `~`, `&`, `|` and `*`, which are implemented all at once in one motion by exploring and then generalizing the implementation of `+` verb. the authors hope for the reader will find the accompanying prose particularly useful. * an **adverb** is a higher-order function: it takes a verb and modifies its action in some desirable way. k/simple implements one adverb `over`, also known as `fold` and `reduce` in functional speak. that is, `over` folds a given vector of values and reduces it into a scalar using a given verb. for example, `+/` reads as "plus over" and computes a sum elements of a given vector: ``` +/1,2,3,4,5,6 21 ``` * once `over` is implemented, k/simple can't stand the temptation to show how to implement another staple k adverb, which is `scan`: ``` /vector of factorials from 1 to 5 *\1+!5 1 2 6 24 120 ``` * k expressions are evaluated in a way you're probably not familiar with, which is *right to left*, or, in math speak, *left of right*. this only sounds nonsensical until you get lit: ``` 3+2+1 /take 1, add 2, add 3 6 3*2+1 /take 1, add 2, multiply by 3 9 ``` * This also means that there is only one operator precedence rule to be learned in k/simple: there are no precedence rules to be learned in k/simple. all operators have the same binding strength, including arithmetic. for example, multiplication doesn't bind stronger than addition, and doesn't get computed first. the lack of precedence is not what we've all learned very early in our careers, but it actually works pretty well. * k/simple is simple enough to get away without tokenizer and parser. instead, it accepts user input as a string of up to 99 tokens, and evaluates it token by token strictly left of right (see above). a token in k/simple is a single character, which can be either a verb `+-!#,@`, a noun `0..9` or a name of a global variable `abc..xyz` which are also treated as nouns. * assignment of a value to a global variable is not a verb, and it is not `=`. instead, it is a special case and is `:`. for example: ``` x:4 x:x+1 x 5 ``` * global namespace `a..z` is very useful, and has an unusual feature: you can assign a value to a global in a traditional way `x:2`, or do it *inline*, as in `x:1+y:2`, which is the same as `y:2` followed by `x:1+y`. one expression, two assignments. * k/simple implements simple memory management by refcounting. two handy system commands are implemented, which are useful for refcount debugging: * `\w` print current workspace size * `\v` print global namespace: varname, refcount, length * `\\` exits the process. * k/simple can run in two modes: interactive or batch. batch mode expects a filename of a k script, e.g.: ``` $ ./a t.k -1 0 0 -1 1 2 3 4 5 6 7 8 9 2 0 2 4 6 8 10 12 14 16 0 -1 -2 -3 -4 -5 -6 -7 -8 ... ``` ## remarks on style * once the basic principles of the presented coding style become apparent, which takes little time for an experienced C programmer (and often even less for an inexperienced one), things like general tendency to avoid explicit `return`, total absence of `switch/case` construct in favour of of ternary cascades and the `$()` macro is likely to raise some eyebrows. however, these decisions are intentional, because k/simple is considered simple enough to be implemented in simpler C. contrary to popular belief, C isn't always so [simple](https://wordsandbuttons.online/so_you_think_you_know_c.html). * no less intentional is the hardline policy of keeping vector operands strictly immutable unless they are ready to be disposed of, which is most always the responsibility of a _callee_. indeed, _immutability_ is often seen as a very alien concept by those who are trained to talk to modern computers in imperative mood, even more so to modern compilers. but although it is a valid observation that k/simple sometimes operates on arrays in a less efficient way than it could have, it deliberately omits such optimizations to better emphasize the fact that immutability is an elegant, efficient, and mighty fool-proof idea in a lot of practical scenarios. * on related note, `x:y:!9` creates two identical objects in memory, which is not the best idea in real life. a much less naive implementation would be `copy-on-write`, which basically means that `x` and `y` would be referring to the same physical object in memory until one of them gets modified _in place_. this optimization is not implemented since the language provides no means to mutate vectors. * it goes without saying that excessive use of C preprocessor amounts to its abuse and results in unportable, "write-only" code ridden with deadly bugs. that said, k/simple also agrees that disciplined and consistent use of `cpp` results in safer, simpler and more idiomatic code compared to a mound of equivalent vanilla C. * **"less code less bug"**. this means that a possible knee-jerk reaction to fork this repository and refactor it in the key of `N() -> NEW()` is hardly *new* and is considered by many to be highly counterproductive: indeed, three strokes are definitely *worse* than one under small condition that `N()` always means exactly the same thing, is simpler to memorize, and harder to typo. At the same time, we also acknowledge the fact that tastes differ, and accept the reality in which the excess stroking has become an acquired taste for the vast majority of keyboard operators, which is now inherited and perpetuated by various automated stroke generators. ## suggested exercise the authors hope that this material enables and inspires further experimentation on reader's own, which can be a very rewarding and fun pastime. for example, one might consider the following toy problems of various degrees of difficulty: **i'm too young to die:** * inspect verb implementations provided by atw for edge cases, and add checks (which are intentionally omitted) * implement a few more simple verbs, e.g. dyadic `divide f%x`. **hurt me plenty:** * extend maximum vector length to `MAX_UINT` * find and fix at least three segfaults **ultraviolence:** * change base type from 8bit integer to `long` * fix tokenizer to support integer numerals greater than 9 and less than 0 * fix tokenizer to support efficient direct vector input (e.g. `42 57 120` instead of `1,2,3,4`) * ~implement adverb `scan`~ **nightmare:** * implement a simple parser (e.g. to support quoted strings and parens) * implement nested vectors, and monadic verb `flip` aka `transpose` * make vector arithmetic penetrating * implement copy-on-write * implement floating point type * implement functions and local scope * implement a test suite for your `k` progress takes sacrifice. `//:~` ", Assign "at most 3 tags" to the expected json: {"id":"7061","tags":[]} "only from the tags list I provide: [{"id":77,"name":"3d"},{"id":89,"name":"agent"},{"id":17,"name":"ai"},{"id":54,"name":"algorithm"},{"id":24,"name":"api"},{"id":44,"name":"authentication"},{"id":3,"name":"aws"},{"id":27,"name":"backend"},{"id":60,"name":"benchmark"},{"id":72,"name":"best-practices"},{"id":39,"name":"bitcoin"},{"id":37,"name":"blockchain"},{"id":1,"name":"blog"},{"id":45,"name":"bundler"},{"id":58,"name":"cache"},{"id":21,"name":"chat"},{"id":49,"name":"cicd"},{"id":4,"name":"cli"},{"id":64,"name":"cloud-native"},{"id":48,"name":"cms"},{"id":61,"name":"compiler"},{"id":68,"name":"containerization"},{"id":92,"name":"crm"},{"id":34,"name":"data"},{"id":47,"name":"database"},{"id":8,"name":"declarative-gui "},{"id":9,"name":"deploy-tool"},{"id":53,"name":"desktop-app"},{"id":6,"name":"dev-exp-lib"},{"id":59,"name":"dev-tool"},{"id":13,"name":"ecommerce"},{"id":26,"name":"editor"},{"id":66,"name":"emulator"},{"id":62,"name":"filesystem"},{"id":80,"name":"finance"},{"id":15,"name":"firmware"},{"id":73,"name":"for-fun"},{"id":2,"name":"framework"},{"id":11,"name":"frontend"},{"id":22,"name":"game"},{"id":81,"name":"game-engine "},{"id":23,"name":"graphql"},{"id":84,"name":"gui"},{"id":91,"name":"http"},{"id":5,"name":"http-client"},{"id":51,"name":"iac"},{"id":30,"name":"ide"},{"id":78,"name":"iot"},{"id":40,"name":"json"},{"id":83,"name":"julian"},{"id":38,"name":"k8s"},{"id":31,"name":"language"},{"id":10,"name":"learning-resource"},{"id":33,"name":"lib"},{"id":41,"name":"linter"},{"id":28,"name":"lms"},{"id":16,"name":"logging"},{"id":76,"name":"low-code"},{"id":90,"name":"message-queue"},{"id":42,"name":"mobile-app"},{"id":18,"name":"monitoring"},{"id":36,"name":"networking"},{"id":7,"name":"node-version"},{"id":55,"name":"nosql"},{"id":57,"name":"observability"},{"id":46,"name":"orm"},{"id":52,"name":"os"},{"id":14,"name":"parser"},{"id":74,"name":"react"},{"id":82,"name":"real-time"},{"id":56,"name":"robot"},{"id":65,"name":"runtime"},{"id":32,"name":"sdk"},{"id":71,"name":"search"},{"id":63,"name":"secrets"},{"id":25,"name":"security"},{"id":85,"name":"server"},{"id":86,"name":"serverless"},{"id":70,"name":"storage"},{"id":75,"name":"system-design"},{"id":79,"name":"terminal"},{"id":29,"name":"testing"},{"id":12,"name":"ui"},{"id":50,"name":"ux"},{"id":88,"name":"video"},{"id":20,"name":"web-app"},{"id":35,"name":"web-server"},{"id":43,"name":"webassembly"},{"id":69,"name":"workflow"},{"id":87,"name":"yaml"}]" returns me the "expected json"