wycliffb

No such thing as a rookie exploit

Everything these days is Lightning Fast

Everything now is Lightning Fast

They are precious

GitHub.com/onchere

Not bad for that kind of money. Not bad...

What do think about it? How does it compare with, say PyTorch or TensorFlow? Thanks.

interviewing.io watch some of their videos on github

Here! wycliffb at Gmail dot com

Thanks for the distro. I use it for dev on my Windows machine. Can't wait for the update!

Personally, I don't do tests on my projects, it's a weak guarantee in my opinion. I prefer formal proofs... Working on a language for automatically managing the same.. Gothub.com/onchere/whack

Yes. An example is telco market leader Safaricom.co.ke that rolled out 'voice as password'. Keep in mind most Kenyan transactions these days are in mobile money.

Focus on the exact problem being solved, start small, refactor progressively as new requirements come in.

The closest to that is CSPA.io, but they don't confer degrees. It's billed as the SAT for software engineers.

maybe you could look into LLVM's Kaleidoscope tutorial..

Currently following up on comments 1 and 3. Very good suggestions.

Check: https://github.com/aalhour/awesome-compilers

Will definitely follow up on this. Maybe we could support DSLs while at it?

I haven't come across good material on the matter. If you do use C++ I do recommend you employ RAAI idiom in code generation for help with lexical scoping for your language.

Interesting suggestion! Will be sure to add that when I can.

Will remember to do so: will add an example for each language feature.

Just pushed LLVM.dll to snapshot folder.

> would recommend looking into writing a grammar, have that generate your AST, then do some transformations on the AST to generate code. you will save a lot of time.

I had this thought, so I used a parser combinator (mpc) to generate the AST from the grammar and source file, then extract useful elements from the AST for codegen.

You might find Types and programming languages - Benjamin C. Pierce to be particularly interesting. There's a GitHub repo with a list of materials, can't seem to find it. When I do, will remember to share!

Will commence working on a doc to explain some design choices, and what some non-obvious code fragments do; will update here when I commit. There's no subtyping being done currently. The 'match type' construct matches the type of an expression at compile time. I should also add that some design choices may be reviewed before the first release.

There's a sample file main.w in the snapshot folder, there's also a grammar file at the source root.

Will appreciate comments on the implementation/design choices.