parser-combinators VS umbrella

Parser combinators [0] are great for quick parsing, usage from typescript is very neat. You can collapse tokenisation, parsing and some evaluation for simple grammars (they appear in production from time to time) into single parser combinator phase (there’s nothing else) where you get desired, typed result.

[0] https://github.com/appliedblockchain/parser-combinators

OP here. This project is implemented in Typescript and Svelte, with support from the thi.ng libraries.

This a is a really wide field. Basically its starts with one of the standard algorithms, like and l-system, a voronoi diagram, or simple combination of sin and cos to draw shapes. Have a look at thi-ng[1], just as example for a library that has implemented a lot of this kind of algorithms. The next step in my process is to think about how to destroy this forms as most of them are used a lot in this field and become boring. Using perlin noise as input to arguments of the algorithms is one way to do this. The other part is to make most all of the input variables easily changeable as most of the time the whole process is like writing the program and then spend a lot of time adapt the parameters until you get some interesting output. So in the end I have a small Svelte app, using Svelte only cause the data binding for the inputs so simple, which has tons of sliders that renders an SVG that can be saved in the end.

[1]https://github.com/thi-ng/umbrella

@thi.ng/ksuid https://github.com/thi-ng/umbrella/tree/develop/packages/ksu...