| /** | |
| * LR-parsing. | |
| * | |
| * Canonical collection of LR(0) items. | |
| * | |
| * by Dmitry Soshnikov <dmitry.soshnikov@gmail.com> | |
| * MIT Style License (C) 2015 | |
| * | |
| * See this "rock-painting" to get the picture of what we're building here: | |
| * |
| /** | |
| * Building LL(1) parsing table from First and Follow sets. | |
| * | |
| * by Dmitry Soshnikov <dmitry.soshnikov@gmail.com> | |
| * MIT Style License | |
| * | |
| * This diff is a continuation of what we started in the previous two diffs: | |
| * | |
| * Dependencies: | |
| * |
| /** | |
| * = LL parser = | |
| * | |
| * by Dmitry Soshnikov <dmitry.soshnikov@gmail.com> | |
| * MIT Style license | |
| * | |
| * Often one can see manually written LL parsers implemented as | |
| * recursive descent. Approach in this diff is a classical parse table | |
| * state machine. | |
| * |
| /** | |
| * int16, and uint16 numbers in JS. | |
| * | |
| * by Dmitry Soshnikov <dmitry.soshnikov@gmail.com> | |
| */ | |
| const assert = require('assert'); | |
| /** | |
| * Converts a number to signed 16-bit integer. |
| /** | |
| * Automatic Reference Counting (ARC) Garbage Collection technique. | |
| * | |
| * This diff describes Reference counting GC technique. | |
| * See also previous lesson on Mark and Sweep GC: | |
| * https://gist.github.com/4391763 | |
| * | |
| * by Dmitry Soshnikov <dmitry.soshnikov@gmail.com> | |
| * MIT Style License | |
| */ |
| /** | |
| * Postfix notation math evaluator | |
| * See: http://en.wikipedia.org/wiki/Reverse_Polish_notation | |
| * | |
| * See also prefix notation example: | |
| * https://github.com/DmitrySoshnikov/Essentials-of-interpretation/blob/master/src/notes/note-1.js | |
| * | |
| * by Dmitry Soshnikov <dmitry.soshnikov@gmail.com> | |
| * MIT Style License | |
| */ |
| // agent-smith.js | |
| /** | |
| * Receive shared array buffer in this worker. | |
| */ | |
| onmessage = (message) => { | |
| // Worker's view of the shared data. | |
| let heapArray = new Int32Array(message.data); | |
| let indexToModify = 1; |
| /** | |
| * Educational Stack-based VM. | |
| * | |
| * See also: | |
| * - A simplified example without recursion: https://gist.github.com/DmitrySoshnikov/76e1cfb930df8d36145c | |
| * - Register-based VM example: https://gist.github.com/DmitrySoshnikov/6407781 | |
| * | |
| * by Dmitry Soshnikov <dmitry.soshnikov@gmail.com> | |
| * http://dmitrysoshnikov.com | |
| * MIT Stye License (C) 2015 |
Level: novices, n00bs
Rust is a statically typed language, which helps preventing runtime bugs, and ensures memory safety at compile time, that is with no runtime costs. However, sometimes one may need using dynamic values. Also, Rust doesn't support "out of the box" complex static structures, which still can be solved with some lazy initialization tricks.
Below are some notes on dynamic data types, and global static objects in Rust programming language.
Map.prototype.map ( callbackfn [ , thisArg ] )
The map method calls MapTransform abstract operation passing this value as M, callbackfn, thisArg as is, and false as updateKey.
The length property of the map method is 1.
Map.prototype.mapEntries ( callbackfn [ , thisArg ] )
The mapEntries method calls MapTransform abstract operation passing this value as M, callbackfn, thisArg as is, and true as updateKey.