Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E2 , i.e., bounded intersection of halfplanes whose normal directions of edges belong to a
A novel formalism is presented for Earley-like parsers. It accommodates the simulation of non-deterministic pushdown automata. In particular, the theory is applied to non-determin...