Fortran internally transforms expressions to assembly using symbolic computation. a+0->a, a+b->b+a.

LLMs are very much supported by symbolic computation. These "arbitrary glyphs" are computed by symbolic computation. The output of LLMs is constrained by program language grammar in code generation tasks. LLMs are often run with beam search, which is symbolic computation.