Let the Grammar be G = ({S}, Σ, P, S), where Σ = {⟨,⟩,[,]} and
P: S → ⟨S⟩, [S], SS, ε
[⟨ → ⟨[
Can I still use the CYK-Algorithm and if yes then how would I do it for a word like ⟨[]⟩ ?
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this communityLet the Grammar be G = ({S}, Σ, P, S), where Σ = {⟨,⟩,[,]} and
P: S → ⟨S⟩, [S], SS, ε
[⟨ → ⟨[
Can I still use the CYK-Algorithm and if yes then how would I do it for a word like ⟨[]⟩ ?
the Grammar is not context-free and thus the CYK -Algorithm wont work