Is the memory usage of total languages deterministic?
Because total programs cannot run forever they cannot use infinite memory. You can know maximum, and best case cost from looking at what algorithm is implemented. Checkout these wikipedia pages to see the relationship between different grammars, algorithms, and machines:


"https://en.wikipedia.org/wiki/Complexity_class"
"https://en.wikipedia.org/wiki/Computational_complexity_theory"
"https://en.wikipedia.org/wiki/Chomsky_hierarchy"