Going offtopic, but... >We have an optimizing compiler for spreadsheets What is even a compiler for spreadsheets? In spreadsheets you still have an AST, or is it a different structure? Is there any fundamental property…
Why are you using DCGs for turing_//2? Genuine question, because I implemented a TM interpreter in Prolog, using "normal" predicates, and I can't see where they help you in this case PS: I learnt how to use DCGs thanks…
Going offtopic, but... >We have an optimizing compiler for spreadsheets What is even a compiler for spreadsheets? In spreadsheets you still have an AST, or is it a different structure? Is there any fundamental property…
Why are you using DCGs for turing_//2? Genuine question, because I implemented a TM interpreter in Prolog, using "normal" predicates, and I can't see where they help you in this case PS: I learnt how to use DCGs thanks…