Demos of Attendee Programs and Open Mic
summary
Live demos show five independent implementations that parse given start/end states, build transition graphs or bi-gram matrices, and enumerate sentences by recursion with an accumulator. One implementation uses a Scala/Lobster-portable iterator-based Ren library with a built-in state monad; another builds integerized tokens and a symbol table to form a 14×14 transition matrix and compute Markov bi-grams. Claimed throughput when generation is measured (ignoring printing) is 1.4 million/sec.
AI-written summary · about