naigama VS mk_clib

A PEG parser library, in generations (parses its own grammar specification using the previous generation's parser): https://github.com/kjhermans/naigama

And, of course, I use it in my projects (always eat your own dogfood). For example, here: https://github.com/kjhermans/naigama/blob/master/src/gen3/include/naigama/naig_defines.h (not complete, as in this project this concept is spread out over multiple include files).

I have a project called naigama (it's here: https://github.com/kjhermans/naigama); it's the implementation of a PEG parser system in C, perl, java, rust. My purpose is to see if I can get to a definition of a regular expression that is comparably powerful to perl regex (which is indeed very powerful), but also parseable through a relatively secure, formal definition (my parsing system).

Hi Reddit, I implemented yet another on-line cryptographic hash functions calculator. It is written in C, compiled into WebAssembly and is running inside your web browser (nothing is sent to the server). The calculator: https://marekknapek.github.io/hash, web page source code: https://github.com/MarekKnapek/MarekKnapek.github.io, C source code: https://github.com/MarekKnapek/mk_clib.

Added readme to the mk_clib thing.

Current stuff we are talking about: https://github.com/MarekKnapek/mk_clib This supports unsigned integers only, size of the integer needs to be decided at compile time (by macros). If you want to explore this, I suggest you start by the factorial application, it is located in mkcfct.c file. All you have to do to run it is to compile it by your compiler. In case of GCC for example it is gcc -DNDEBUG mkcfct.c no need for build system, dependencies manager, no nothing. I'm Windows guy, so there is Visual Studio 2022 solution also. There are fuzz tests also. Beware, compile times are huuuge.