| http://www.w3.org/ns/prov#value | - Yes, a Turing machine (or linear bound machine) can parse one, but I do not know if there is a general algorithm for turning a context-sensitive grammar into a program for a Turing machine, in the sense that an LR(1) generator makes parse tables for a pushdown machine.
|
