Basically, the statement is true: when we have a deterministic PDA for a language $L$, we can construct a non-ambiguous grammar for $L$. The notions of determinism and non-ambiguity are related, but we should be cautious. Determinism for PDA is a kind of 'local' property: In each configuration (state, input symbol, top of stack) the PDA has only a single ...


the Grammar is not context-free and thus the CYK -Algorithm wont work

Only top voted, non community-wiki answers of a minimum length are eligible