Compiling high level languages to assembly is a deterministic procedure. You write a program using a small well defined language (relative to natural language every programming language is tiny and extremely well defined). The same input to the same compiler will get you the same output every time. LLMs are nothing like a compiler.
Except for COBOL, which is famously not a turing-complete language. So certain guesses have to be made.
If we ignore optimizing compilers and UB.
"Project the need 30 years out and imagine what might be possible in the context of the exponential curves"
-- Alan Kay