Kamil Kiełczewski

@hazzik ok - but I think such information should be included in documentation (because lack of that I was deluded and loose a lot of time on try to solve...

optimization: @hazzik I see that you like optimizastions some time a go I give proposition #70 (2 years ago) to introduce simple "compression" (actually conversion) - and finnaly I do...

@aemkei Interesting idea - In free time I will check this and compare with base4. However currently I don't understand how abort(1) is coded inside `eval('\141\154\145\162\164\50\61\51')` :P Update: Ok now...

@aemkei I analyse and test you proposition [details here](https://github.com/kamil-kielczewski/small-jsfuck/issues/4) (base4 is better) and I propose more promising modification which (in details) I analyse in near future

@hazzik This trick is non-trivial and allows to get RegExp without using any deprecated or semi-deprecated method (like `escape`) ```js Function("return"+(NaN+""["matchAll"]("")).slice(10,17))()("pattern") ``` after partial expansion: ```js []["flat"]["constructor"]("return"+[10]["concat"](17)["reduce"](""["slice"]["bind"]((NaN+""["matchAll"]("")))))()("pattern") ``` but may...

Yep so we have ```js []["flat"]["constructor"]("return "+([]+("")["matchAll"]())["split"](" ")[1])()("pattern") ```

@subzey I think JSF is mainly to show that you can write executable cody using only 6 chars (which is actually not trivial and surprising). However here https://github.com/aemkei/jsfuck/issues/70 was my...

@hazzik Finally I add info about optimization trick which is very clever

@baboures what are advantages of using `

@baboures new exotic way is ok. However - can you show here how to produce letter `C` using `([+