Parsing schemata are not suitable for directly describing deterministic parsers, since they work at a high abstraction level where a set of operations are defined without imposing order constraints on them.
many deterministic parsers can be viewed as particular optimisations of more general, nondeterministic algorithms.