I would call any traditional decompiler deterministic, though these can rely on probabilistic models to infer how to undo these optimizations. A talk I did on

I would call any traditional decompiler deterministic, though these can rely on probabilistic models to infer how to undo these optimizations. A talk I did on this at Reverse Con (clipped to the important part): https://youtu.be/VP29biKLoSw?t=891 https://youtu.be/VP29biKLoSw?t=891 Many of these decompilers can infer what optimizations occurred by hints/patterns that are left behind. This can be fundamentally different at times from LLMs, which have shown a degradation on unique architectures. I still believe the best approach will be a mixed method. Get 80% of the way there with traditional methods, and take the last 20% (which is the hardest) home with LLMs.