pizlonator

This document explains how I would implement an SSA-based compiler if I was writing one today.

This document is intentionally opinionated. It just tells you how I would do it. This document is intended for anyone who has read about SSA and understands the concept, but is confused about how exactly to put it into practice. If you're that person, then I'm here to show you a way to do it that works well for me. If you're looking for a review of other ways to do it, I recommend this post.

My approach works well when implementing the compiler in any language that easily permits cyclic mutable data structures. I know from experience that it'll work great in C++, C#, or Java. The memory management of this approach is simple (and I'll explain it), so you won't have to stress about use after frees.

I like my approach because it leads to an ergonomic API by minimizing the amount of special cases you have to worry about. Most of the compiler is analyses and transformations ov

pizlonator

Here's a much more complete description of how I do SSA, beyond just how I do Phis.

This describes how I do SSA form, which avoids the need to have any coupling between CFG data structures and SSA data structures.

Let's first define a syntax for SSA and some terminology. Here's an example SSA node:

A = Add(B, C)

In reality, this will be a single object in your in-memory representation, and the names are really addresses of those objects. So, this node has an "implicit variable" called A; it's the variable that is implicitly assigned to when you execute the node. If you then do:

VictorTaelin

Fast Discrete Program Search 2

I am investigating how to use Bend (a parallel language) to accelerate Symbolic AI; in special, Discrete Program Search. Basically, think of it as an alternative to LLMs, GPTs, NNs, that is also capable of generating code, but by entirely different means. This kind of approach was never scaled with mass compute before - it wasn't possible! - but Bend changes this. So, my idea was to do it, and see where it goes.

Now, while I was implementing some candidate algorithms on Bend, I realized that, rather than mass parallelism, I could use an entirely different mechanism to speed things up: SUP Nodes. Basically, it is a feature that Bend inherited from its underlying model ("Interaction Combinators") that, in simple terms, allows us to combine multiple functions into a single superposed one, and apply them all to an argument "at the same time". In short, it allows us to call N functions at a fraction of the expected cost. Or, in simple terms: why parallelize when we can share?

A

dabeaz

# Author: David Beazley (https://www.dabeaz.com)
# Twitter: @dabeaz

from functools import reduce
run = lambda s: reduce(lambda *_:..., iter(lambda s=[s]:
                      (_:=s.pop()(),s.append(_))[0], None))

const   = lambda v,c   : lambda: c(v)
add     = lambda x,y,c : lambda: c(x+y)
mul     = lambda x,y,c : lambda: c(x*y)

raysan5

In the last years I've been asked multiple times about the comparison between raylib and SDL libraries. Unfortunately, my experience with SDL was quite limited so I couldn't provide a good comparison. In the last two years I've learned about SDL and used it to teach at University so I feel that now I can provide a good comparison between both.

Hope it helps future users to better understand this two libraries internals and functionality.

Table of Content

• Introduction
• Library Design Comparison

misode

⚠️ This guide has moved ⚠️

Updates for both 1.18.2 and newer versions can be found at https://minecraft.wiki/w/Tutorial:Custom_structures

Custom data pack structures in 1.18.2

This guide will showcase how to create a data pack that adds a custom structure to the world. There is also a data pack download of this complete example.

Always leave the world and rejoin to apply the new changes!

Pack.mcmeta

MichalGniadek

from beet import Context, Function
import time
import os
import shutil
import datetime


def beet_default(ctx: Context):
    if delete_from_link(ctx):
        time.sleep(0.2)

misode

⚡ = Advancement trigger
✨ = Enchantment effect
▶️ = Commands run

• MinecraftServer::tickServer
  • 🕑 Update /tick rate manager
  • ServerFunctionManager::tick
    • ▶️ Run #load function tag if a reload happened
    • ▶️ Run #tick function tag
  • ServerLevel::tick (per dimension)

williambl

tekin

# Stick this in your home directory and point your Global Git config at it by running:
#
#  $ git config --global core.attributesfile ~/.gitattributes
#
# See https://tekin.co.uk/2020/10/better-git-diff-output-for-ruby-python-elixir-and-more for more details

*.c     diff=cpp
*.h     diff=cpp
*.c++   diff=cpp
*.h++   diff=cpp