... features.^2.1

It should be noted as well that GPSG attempted to get along with a very simple grammar formalism as a matter of principle.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... that^2.2

refer to [110] for later results. Also note that the result applies to deterministic push-down automata. For general push-down automata no such upper-bound exists [108].

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... practice.^2.3

For instance, the technique is not even mentioned in [49].

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... utterances^2.4

The details of this evaluation are described in [10]

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.